Dynamic peptide libraries for the discovery of supramolecular nanomaterials

NASA Astrophysics Data System (ADS)

Pappas, Charalampos G.; Shafi, Ramim; Sasselli, Ivan R.; Siccardi, Henry; Wang, Tong; Narang, Vishal; Abzalimov, Rinat; Wijerathne, Nadeesha; Ulijn, Rein V.

2016-11-01

Sequence-specific polymers, such as oligonucleotides and peptides, can be used as building blocks for functional supramolecular nanomaterials. The design and selection of suitable self-assembling sequences is, however, challenging because of the vast combinatorial space available. Here we report a methodology that allows the peptide sequence space to be searched for self-assembling structures. In this approach, unprotected homo- and heterodipeptides (including aromatic, aliphatic, polar and charged amino acids) are subjected to continuous enzymatic condensation, hydrolysis and sequence exchange to create a dynamic combinatorial peptide library. The free-energy change associated with the assembly process itself gives rise to selective amplification of self-assembling candidates. By changing the environmental conditions during the selection process, different sequences and consequent nanoscale morphologies are selected.

Dynamic peptide libraries for the discovery of supramolecular nanomaterials.

PubMed

Pappas, Charalampos G; Shafi, Ramim; Sasselli, Ivan R; Siccardi, Henry; Wang, Tong; Narang, Vishal; Abzalimov, Rinat; Wijerathne, Nadeesha; Ulijn, Rein V

2016-11-01

Sequence-specific polymers, such as oligonucleotides and peptides, can be used as building blocks for functional supramolecular nanomaterials. The design and selection of suitable self-assembling sequences is, however, challenging because of the vast combinatorial space available. Here we report a methodology that allows the peptide sequence space to be searched for self-assembling structures. In this approach, unprotected homo- and heterodipeptides (including aromatic, aliphatic, polar and charged amino acids) are subjected to continuous enzymatic condensation, hydrolysis and sequence exchange to create a dynamic combinatorial peptide library. The free-energy change associated with the assembly process itself gives rise to selective amplification of self-assembling candidates. By changing the environmental conditions during the selection process, different sequences and consequent nanoscale morphologies are selected.

Concept of combinatorial de novo design of drug-like molecules by particle swarm optimization.

PubMed

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.

Metaheuristics-Assisted Combinatorial Screening of Eu2+-Doped Ca-Sr-Ba-Li-Mg-Al-Si-Ge-N Compositional Space in Search of a Narrow-Band Green Emitting Phosphor and Density Functional Theory Calculations.

PubMed

Lee, Jin-Woong; Singh, Satendra Pal; Kim, Minseuk; Hong, Sung Un; Park, Woon Bae; Sohn, Kee-Sun

2017-08-21

A metaheuristics-based design would be of great help in relieving the enormous experimental burdens faced during the combinatorial screening of a huge, multidimensional search space, while providing the same effect as total enumeration. In order to tackle the high-throughput powder processing complications and to secure practical phosphors, metaheuristics, an elitism-reinforced nondominated sorting genetic algorithm (NSGA-II), was employed in this study. The NSGA-II iteration targeted two objective functions. The first was to search for a higher emission efficacy. The second was to search for narrow-band green color emissions. The NSGA-II iteration finally converged on BaLi 2 Al 2 Si 2 N 6 :Eu 2+ phosphors in the Eu 2+ -doped Ca-Sr-Ba-Li-Mg-Al-Si-Ge-N compositional search space. The BaLi 2 Al 2 Si 2 N 6 :Eu 2+ phosphor, which was synthesized with no human intervention via the assistance of NSGA-II, was a clear single phase and gave an acceptable luminescence. The BaLi 2 Al 2 Si 2 N 6 :Eu 2+ phosphor as well as all other phosphors that appeared during the NSGA-II iterations were examined in detail by employing powder X-ray diffraction-based Rietveld refinement, X-ray absorption near edge structure, density functional theory calculation, and time-resolved photoluminescence. The thermodynamic stability and the band structure plausibility were confirmed, and more importantly a novel approach to the energy transfer analysis was also introduced for BaLi 2 Al 2 Si 2 N 6 :Eu 2+ phosphors.

Pattern recognition with composite correlation filters designed with multi-object combinatorial optimization

DOE PAGES

Awwal, Abdul; Diaz-Ramirez, Victor H.; Cuevas, Andres; ...

2014-10-23

Composite correlation filters are used for solving a wide variety of pattern recognition problems. These filters are given by a combination of several training templates chosen by a designer in an ad hoc manner. In this work, we present a new approach for the design of composite filters based on multi-objective combinatorial optimization. Given a vast search space of training templates, an iterative algorithm is used to synthesize a filter with an optimized performance in terms of several competing criteria. Furthermore, by employing a suggested binary-search procedure a filter bank with a minimum number of filters can be constructed, formore » a prespecified trade-off of performance metrics. Computer simulation results obtained with the proposed method in recognizing geometrically distorted versions of a target in cluttered and noisy scenes are discussed and compared in terms of recognition performance and complexity with existing state-of-the-art filters.« less

Pattern recognition with composite correlation filters designed with multi-object combinatorial optimization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Awwal, Abdul; Diaz-Ramirez, Victor H.; Cuevas, Andres

Composite correlation filters are used for solving a wide variety of pattern recognition problems. These filters are given by a combination of several training templates chosen by a designer in an ad hoc manner. In this work, we present a new approach for the design of composite filters based on multi-objective combinatorial optimization. Given a vast search space of training templates, an iterative algorithm is used to synthesize a filter with an optimized performance in terms of several competing criteria. Furthermore, by employing a suggested binary-search procedure a filter bank with a minimum number of filters can be constructed, formore » a prespecified trade-off of performance metrics. Computer simulation results obtained with the proposed method in recognizing geometrically distorted versions of a target in cluttered and noisy scenes are discussed and compared in terms of recognition performance and complexity with existing state-of-the-art filters.« less

Combinatorial therapy discovery using mixed integer linear programming.

PubMed

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.

Ligand design by a combinatorial approach based on modeling and experiment: application to HLA-DR4

NASA Astrophysics Data System (ADS)

Evensen, Erik; Joseph-McCarthy, Diane; Weiss, Gregory A.; Schreiber, Stuart L.; Karplus, Martin

2007-07-01

Combinatorial synthesis and large scale screening methods are being used increasingly in drug discovery, particularly for finding novel lead compounds. Although these "random" methods sample larger areas of chemical space than traditional synthetic approaches, only a relatively small percentage of all possible compounds are practically accessible. It is therefore helpful to select regions of chemical space that have greater likelihood of yielding useful leads. When three-dimensional structural data are available for the target molecule this can be achieved by applying structure-based computational design methods to focus the combinatorial library. This is advantageous over the standard usage of computational methods to design a small number of specific novel ligands, because here computation is employed as part of the combinatorial design process and so is required only to determine a propensity for binding of certain chemical moieties in regions of the target molecule. This paper describes the application of the Multiple Copy Simultaneous Search (MCSS) method, an active site mapping and de novo structure-based design tool, to design a focused combinatorial library for the class II MHC protein HLA-DR4. Methods for the synthesizing and screening the computationally designed library are presented; evidence is provided to show that binding was achieved. Although the structure of the protein-ligand complex could not be determined, experimental results including cross-exclusion of a known HLA-DR4 peptide ligand (HA) by a compound from the library. Computational model building suggest that at least one of the ligands designed and identified by the methods described binds in a mode similar to that of native peptides.

Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space.

DTIC Science & Technology

1997-01-01

create a dependency tree containing an optimum set of n-1 first-order dependencies. To do this, first, we select an arbitrary bit Xroot to place at the...the root to an arbitrary bit Xroot -For all other bits Xi, set bestMatchingBitInTree[Xi] to Xroot . -While not all bits have been

Smooth Constrained Heuristic Optimization of a Combinatorial Chemical Space

DTIC Science & Technology

2015-05-01

ARL-TR-7294•MAY 2015 US Army Research Laboratory Smooth ConstrainedHeuristic Optimization of a Combinatorial Chemical Space by Berend Christopher...7294•MAY 2015 US Army Research Laboratory Smooth ConstrainedHeuristic Optimization of a Combinatorial Chemical Space by Berend Christopher...

Causal gene identification using combinatorial V-structure search.

PubMed

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.

Multiple-variable neighbourhood search for the single-machine total weighted tardiness problem

NASA Astrophysics Data System (ADS)

Chung, Tsui-Ping; Fu, Qunjie; Liao, Ching-Jong; Liu, Yi-Ting

2017-07-01

The single-machine total weighted tardiness (SMTWT) problem is a typical discrete combinatorial optimization problem in the scheduling literature. This problem has been proved to be NP hard and thus provides a challenging area for metaheuristics, especially the variable neighbourhood search algorithm. In this article, a multiple variable neighbourhood search (m-VNS) algorithm with multiple neighbourhood structures is proposed to solve the problem. Special mechanisms named matching and strengthening operations are employed in the algorithm, which has an auto-revising local search procedure to explore the solution space beyond local optimality. Two aspects, searching direction and searching depth, are considered, and neighbourhood structures are systematically exchanged. Experimental results show that the proposed m-VNS algorithm outperforms all the compared algorithms in solving the SMTWT problem.

Chemoinformatic Analysis of Combinatorial Libraries, Drugs, Natural Products and Molecular Libraries Small Molecule Repository

PubMed Central

Singh, Narender; Guha, Rajarshi; Giulianotti, Marc; Pinilla, Clemencia; Houghten, Richard; Medina-Franco, Jose L.

2009-01-01

A multiple criteria approach is presented, that is used to perform a comparative analysis of four recently developed combinatorial libraries to drugs, Molecular Libraries Small Molecule Repository (MLSMR) and natural products. The compound databases were assessed in terms of physicochemical properties, scaffolds and fingerprints. The approach enables the analysis of property space coverage, degree of overlap between collections, scaffold and structural diversity and overall structural novelty. The degree of overlap between combinatorial libraries and drugs was assessed using the R-NN curve methodology, which measures the density of chemical space around a query molecule embedded in the chemical space of a target collection. The combinatorial libraries studied in this work exhibit scaffolds that were not observed in the drug, MLSMR and natural products collections. The fingerprint-based comparisons indicate that these combinatorial libraries are structurally different to current drugs. The R-NN curve methodology revealed that a proportion of molecules in the combinatorial libraries are located within the property space of the drugs. However, the R-NN analysis also showed that there are a significant number of molecules in several combinatorial libraries that are located in sparse regions of the drug space. PMID:19301827

2D photonic crystal complete band gap search using a cyclic cellular automaton refination

NASA Astrophysics Data System (ADS)

González-García, R.; Castañón, G.; Hernández-Figueroa, H. E.

2014-11-01

We present a refination method based on a cyclic cellular automaton (CCA) that simulates a crystallization-like process, aided with a heuristic evolutionary method called differential evolution (DE) used to perform an ordered search of full photonic band gaps (FPBGs) in a 2D photonic crystal (PC). The solution is proposed as a combinatorial optimization of the elements in a binary array. These elements represent the existence or absence of a dielectric material surrounded by air, thus representing a general geometry whose search space is defined by the number of elements in such array. A block-iterative frequency-domain method was used to compute the FPBGs on a PC, when present. DE has proved to be useful in combinatorial problems and we also present an implementation feature that takes advantage of the periodic nature of PCs to enhance the convergence of this algorithm. Finally, we used this methodology to find a PC structure with a 19% bandgap-to-midgap ratio without requiring previous information of suboptimal configurations and we made a statistical study of how it is affected by disorder in the borders of the structure compared with a previous work that uses a genetic algorithm.

Discovery of gigantic molecular nanostructures using a flow reaction array as a search engine.

PubMed

Zang, Hong-Ying; de la Oliva, Andreu Ruiz; Miras, Haralampos N; Long, De-Liang; McBurney, Roy T; Cronin, Leroy

2014-04-28

The discovery of gigantic molecular nanostructures like coordination and polyoxometalate clusters is extremely time-consuming since a vast combinatorial space needs to be searched, and even a systematic and exhaustive exploration of the available synthetic parameters relies on a great deal of serendipity. Here we present a synthetic methodology that combines a flow reaction array and algorithmic control to give a chemical 'real-space' search engine leading to the discovery and isolation of a range of new molecular nanoclusters based on [Mo(2)O(2)S(2)](2+)-based building blocks with either fourfold (C4) or fivefold (C5) symmetry templates and linkers. This engine leads us to isolate six new nanoscale cluster compounds: 1, {Mo(10)(C5)}; 2, {Mo(14)(C4)4(C5)2}; 3, {Mo(60)(C4)10}; 4, {Mo(48)(C4)6}; 5, {Mo(34)(C4)4}; 6, {Mo(18)(C4)9}; in only 200 automated experiments from a parameter space spanning ~5 million possible combinations.

Accelerated search for materials with targeted properties by adaptive design

PubMed Central

Xue, Dezhen; Balachandran, Prasanna V.; Hogden, John; Theiler, James; Xue, Deqing; Lookman, Turab

2016-01-01

Finding new materials with targeted properties has traditionally been guided by intuition, and trial and error. With increasing chemical complexity, the combinatorial possibilities are too large for an Edisonian approach to be practical. Here we show how an adaptive design strategy, tightly coupled with experiments, can accelerate the discovery process by sequentially identifying the next experiments or calculations, to effectively navigate the complex search space. Our strategy uses inference and global optimization to balance the trade-off between exploitation and exploration of the search space. We demonstrate this by finding very low thermal hysteresis (ΔT) NiTi-based shape memory alloys, with Ti50.0Ni46.7Cu0.8Fe2.3Pd0.2 possessing the smallest ΔT (1.84 K). We synthesize and characterize 36 predicted compositions (9 feedback loops) from a potential space of ∼800,000 compositions. Of these, 14 had smaller ΔT than any of the 22 in the original data set. PMID:27079901

Homology groups for particles on one-connected graphs

NASA Astrophysics Data System (ADS)

MaciÄ Żek, Tomasz; Sawicki, Adam

2017-06-01

We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our approach is based on some fundamental combinatorial properties of the configuration spaces, Mayer-Vietoris sequences for different parts of configuration spaces, and some limited use of discrete Morse theory. As one of the results, we derive the closed-form formulae for ranks of the homology groups for indistinguishable particles on tree graphs. We also give a detailed discussion of the second homology group of the configuration space of both distinguishable and indistinguishable particles. Our motivation is the search for new kinds of quantum statistics.

A gradient system solution to Potts mean field equations and its electronic implementation.

PubMed

Urahama, K; Ueno, S

1993-03-01

A gradient system solution method is presented for solving Potts mean field equations for combinatorial optimization problems subject to winner-take-all constraints. In the proposed solution method the optimum solution is searched by using gradient descent differential equations whose trajectory is confined within the feasible solution space of optimization problems. This gradient system is proven theoretically to always produce a legal local optimum solution of combinatorial optimization problems. An elementary analog electronic circuit implementing the presented method is designed on the basis of current-mode subthreshold MOS technologies. The core constituent of the circuit is the winner-take-all circuit developed by Lazzaro et al. Correct functioning of the presented circuit is exemplified with simulations of the circuits implementing the scheme for solving the shortest path problems.

Signal dimensionality and the emergence of combinatorial structure.

PubMed

Little, Hannah; Eryılmaz, Kerem; de Boer, Bart

2017-11-01

In language, a small number of meaningless building blocks can be combined into an unlimited set of meaningful utterances. This is known as combinatorial structure. One hypothesis for the initial emergence of combinatorial structure in language is that recombining elements of signals solves the problem of overcrowding in a signal space. Another hypothesis is that iconicity may impede the emergence of combinatorial structure. However, how these two hypotheses relate to each other is not often discussed. In this paper, we explore how signal space dimensionality relates to both overcrowding in the signal space and iconicity. We use an artificial signalling experiment to test whether a signal space and a meaning space having similar topologies will generate an iconic system and whether, when the topologies differ, the emergence of combinatorially structured signals is facilitated. In our experiments, signals are created from participants' hand movements, which are measured using an infrared sensor. We found that participants take advantage of iconic signal-meaning mappings where possible. Further, we use trajectory predictability, measures of variance, and Hidden Markov Models to measure the use of structure within the signals produced and found that when topologies do not match, then there is more evidence of combinatorial structure. The results from these experiments are interpreted in the context of the differences between the emergence of combinatorial structure in different linguistic modalities (speech and sign). Copyright © 2017 Elsevier B.V. All rights reserved.

Scientific discovery as a combinatorial optimisation problem: How best to navigate the landscape of possible experiments?

PubMed Central

Kell, Douglas B

2012-01-01

A considerable number of areas of bioscience, including gene and drug discovery, metabolic engineering for the biotechnological improvement of organisms, and the processes of natural and directed evolution, are best viewed in terms of a ‘landscape’ representing a large search space of possible solutions or experiments populated by a considerably smaller number of actual solutions that then emerge. This is what makes these problems ‘hard’, but as such these are to be seen as combinatorial optimisation problems that are best attacked by heuristic methods known from that field. Such landscapes, which may also represent or include multiple objectives, are effectively modelled in silico, with modern active learning algorithms such as those based on Darwinian evolution providing guidance, using existing knowledge, as to what is the ‘best’ experiment to do next. An awareness, and the application, of these methods can thereby enhance the scientific discovery process considerably. This analysis fits comfortably with an emerging epistemology that sees scientific reasoning, the search for solutions, and scientific discovery as Bayesian processes. PMID:22252984

Scientific discovery as a combinatorial optimisation problem: how best to navigate the landscape of possible experiments?

PubMed

Kell, Douglas B

2012-03-01

A considerable number of areas of bioscience, including gene and drug discovery, metabolic engineering for the biotechnological improvement of organisms, and the processes of natural and directed evolution, are best viewed in terms of a 'landscape' representing a large search space of possible solutions or experiments populated by a considerably smaller number of actual solutions that then emerge. This is what makes these problems 'hard', but as such these are to be seen as combinatorial optimisation problems that are best attacked by heuristic methods known from that field. Such landscapes, which may also represent or include multiple objectives, are effectively modelled in silico, with modern active learning algorithms such as those based on Darwinian evolution providing guidance, using existing knowledge, as to what is the 'best' experiment to do next. An awareness, and the application, of these methods can thereby enhance the scientific discovery process considerably. This analysis fits comfortably with an emerging epistemology that sees scientific reasoning, the search for solutions, and scientific discovery as Bayesian processes. Copyright © 2012 WILEY Periodicals, Inc.

Breeding novel solutions in the brain: a model of Darwinian neurodynamics.

PubMed

Szilágyi, András; Zachar, István; Fedor, Anna; de Vladar, Harold P; Szathmáry, Eörs

2016-01-01

Background : The fact that surplus connections and neurons are pruned during development is well established. We complement this selectionist picture by a proof-of-principle model of evolutionary search in the brain, that accounts for new variations in theory space. We present a model for Darwinian evolutionary search for candidate solutions in the brain. Methods : We combine known components of the brain - recurrent neural networks (acting as attractors), the action selection loop and implicit working memory - to provide the appropriate Darwinian architecture. We employ a population of attractor networks with palimpsest memory. The action selection loop is employed with winners-share-all dynamics to select for candidate solutions that are transiently stored in implicit working memory. Results : We document two processes: selection of stored solutions and evolutionary search for novel solutions. During the replication of candidate solutions attractor networks occasionally produce recombinant patterns, increasing variation on which selection can act. Combinatorial search acts on multiplying units (activity patterns) with hereditary variation and novel variants appear due to (i) noisy recall of patterns from the attractor networks, (ii) noise during transmission of candidate solutions as messages between networks, and, (iii) spontaneously generated, untrained patterns in spurious attractors. Conclusions : Attractor dynamics of recurrent neural networks can be used to model Darwinian search. The proposed architecture can be used for fast search among stored solutions (by selection) and for evolutionary search when novel candidate solutions are generated in successive iterations. Since all the suggested components are present in advanced nervous systems, we hypothesize that the brain could implement a truly evolutionary combinatorial search system, capable of generating novel variants.

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA Technical Reports Server (NTRS)

Rash, James L.

2010-01-01

NASA's space data-communications infrastructure, the Space Network and the Ground Network, provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft via orbiting relay satellites and ground stations. An implementation of the methods and algorithms disclosed herein will be a system that produces globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary search, a class of probabilistic strategies for searching large solution spaces, constitutes the essential technology in this disclosure. Also disclosed are methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithm itself. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally, with applicability to a very broad class of combinatorial optimization problems.

Very large virtual compound spaces: construction, storage and utility in drug discovery.

PubMed

Peng, Zhengwei

2013-09-01

Recent activities in the construction, storage and exploration of very large virtual compound spaces are reviewed by this report. As expected, the systematic exploration of compound spaces at the highest resolution (individual atoms and bonds) is intrinsically intractable. By contrast, by staying within a finite number of reactions and a finite number of reactants or fragments, several virtual compound spaces have been constructed in a combinatorial fashion with sizes ranging from 10(11)11 to 10(20)20 compounds. Multiple search methods have been developed to perform searches (e.g. similarity, exact and substructure) into those compound spaces without the need for full enumeration. The up-front investment spent on synthetic feasibility during the construction of some of those virtual compound spaces enables a wider adoption by medicinal chemists to design and synthesize important compounds for drug discovery. Recent activities in the area of exploring virtual compound spaces via the evolutionary approach based on Genetic Algorithm also suggests a positive shift of focus from method development to workflow, integration and ease of use, all of which are required for this approach to be widely adopted by medicinal chemists.

Experimental design for estimating unknown groundwater pumping using genetic algorithm and reduced order model

NASA Astrophysics Data System (ADS)

Ushijima, Timothy T.; Yeh, William W.-G.

2013-10-01

An optimal experimental design algorithm is developed to select locations for a network of observation wells that provide maximum information about unknown groundwater pumping in a confined, anisotropic aquifer. The design uses a maximal information criterion that chooses, among competing designs, the design that maximizes the sum of squared sensitivities while conforming to specified design constraints. The formulated optimization problem is non-convex and contains integer variables necessitating a combinatorial search. Given a realistic large-scale model, the size of the combinatorial search required can make the problem difficult, if not impossible, to solve using traditional mathematical programming techniques. Genetic algorithms (GAs) can be used to perform the global search; however, because a GA requires a large number of calls to a groundwater model, the formulated optimization problem still may be infeasible to solve. As a result, proper orthogonal decomposition (POD) is applied to the groundwater model to reduce its dimensionality. Then, the information matrix in the full model space can be searched without solving the full model. Results from a small-scale test case show identical optimal solutions among the GA, integer programming, and exhaustive search methods. This demonstrates the GA's ability to determine the optimal solution. In addition, the results show that a GA with POD model reduction is several orders of magnitude faster in finding the optimal solution than a GA using the full model. The proposed experimental design algorithm is applied to a realistic, two-dimensional, large-scale groundwater problem. The GA converged to a solution for this large-scale problem.

Anatomy of the Attraction Basins: Breaking with the Intuition.

PubMed

Hernando, Leticia; Mendiburu, Alexander; Lozano, Jose A

2018-05-22

Solving combinatorial optimization problems efficiently requires the development of algorithms that consider the specific properties of the problems. In this sense, local search algorithms are designed over a neighborhood structure that partially accounts for these properties. Considering a neighborhood, the space is usually interpreted as a natural landscape, with valleys and mountains. Under this perception, it is commonly believed that, if maximizing, the solutions located in the slopes of the same mountain belong to the same attraction basin, with the peaks of the mountains being the local optima. Unfortunately, this is a widespread erroneous visualization of a combinatorial landscape. Thus, our aim is to clarify this aspect, providing a detailed analysis of, first, the existence of plateaus where the local optima are involved, and second, the properties that define the topology of the attraction basins, picturing a reliable visualization of the landscapes. Some of the features explored in this paper have never been examined before. Hence, new findings about the structure of the attraction basins are shown. The study is focused on instances of permutation-based combinatorial optimization problems considering the 2-exchange and the insert neighborhoods. As a consequence of this work, we break away from the extended belief about the anatomy of attraction basins.

Space pruning monotonic search for the non-unique probe selection problem.

PubMed

Pappalardo, Elisa; Ozkok, Beyza Ahlatcioglu; Pardalos, Panos M

2014-01-01

Identification of targets, generally viruses or bacteria, in a biological sample is a relevant problem in medicine. Biologists can use hybridisation experiments to determine whether a specific DNA fragment, that represents the virus, is presented in a DNA solution. A probe is a segment of DNA or RNA, labelled with a radioactive isotope, dye or enzyme, used to find a specific target sequence on a DNA molecule by hybridisation. Selecting unique probes through hybridisation experiments is a difficult task, especially when targets have a high degree of similarity, for instance in a case of closely related viruses. After preliminary experiments, performed by a canonical Monte Carlo method with Heuristic Reduction (MCHR), a new combinatorial optimisation approach, the Space Pruning Monotonic Search (SPMS) method, is introduced. The experiments show that SPMS provides high quality solutions and outperforms the current state-of-the-art algorithms.

Solving optimization problems by the public goods game

NASA Astrophysics Data System (ADS)

Javarone, Marco Alberto

2017-09-01

We introduce a method based on the Public Goods Game for solving optimization tasks. In particular, we focus on the Traveling Salesman Problem, i.e. a NP-hard problem whose search space exponentially grows increasing the number of cities. The proposed method considers a population whose agents are provided with a random solution to the given problem. In doing so, agents interact by playing the Public Goods Game using the fitness of their solution as currency of the game. Notably, agents with better solutions provide higher contributions, while those with lower ones tend to imitate the solution of richer agents for increasing their fitness. Numerical simulations show that the proposed method allows to compute exact solutions, and suboptimal ones, in the considered search spaces. As result, beyond to propose a new heuristic for combinatorial optimization problems, our work aims to highlight the potentiality of evolutionary game theory beyond its current horizons.

Two combinatorial optimization problems for SNP discovery using base-specific cleavage and mass spectrometry.

PubMed

Chen, Xin; Wu, Qiong; Sun, Ruimin; Zhang, Louxin

2012-01-01

The discovery of single-nucleotide polymorphisms (SNPs) has important implications in a variety of genetic studies on human diseases and biological functions. One valuable approach proposed for SNP discovery is based on base-specific cleavage and mass spectrometry. However, it is still very challenging to achieve the full potential of this SNP discovery approach. In this study, we formulate two new combinatorial optimization problems. While both problems are aimed at reconstructing the sample sequence that would attain the minimum number of SNPs, they search over different candidate sequence spaces. The first problem, denoted as SNP - MSP, limits its search to sequences whose in silico predicted mass spectra have all their signals contained in the measured mass spectra. In contrast, the second problem, denoted as SNP - MSQ, limits its search to sequences whose in silico predicted mass spectra instead contain all the signals of the measured mass spectra. We present an exact dynamic programming algorithm for solving the SNP - MSP problem and also show that the SNP - MSQ problem is NP-hard by a reduction from a restricted variation of the 3-partition problem. We believe that an efficient solution to either problem above could offer a seamless integration of information in four complementary base-specific cleavage reactions, thereby improving the capability of the underlying biotechnology for sensitive and accurate SNP discovery.

Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.

PubMed

Nallaperuma, Samadhi; Neumann, Frank; Sudholt, Dirk

2017-01-01

Randomized search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to our theoretical understanding. Recently, randomized search heuristics have been examined regarding their achievable progress within a fixed-time budget. We follow this approach and present a fixed-budget analysis for an NP-hard combinatorial optimization problem. We consider the well-known Traveling Salesperson Problem (TSP) and analyze the fitness increase that randomized search heuristics are able to achieve within a given fixed-time budget. In particular, we analyze Manhattan and Euclidean TSP instances and Randomized Local Search (RLS), (1+1) EA and (1+[Formula: see text]) EA algorithms for the TSP in a smoothed complexity setting, and derive the lower bounds of the expected fitness gain for a specified number of generations.

Cooperative quantum-behaved particle swarm optimization with dynamic varying search areas and Lévy flight disturbance.

PubMed

Li, Desheng

2014-01-01

This paper proposes a novel variant of cooperative quantum-behaved particle swarm optimization (CQPSO) algorithm with two mechanisms to reduce the search space and avoid the stagnation, called CQPSO-DVSA-LFD. One mechanism is called Dynamic Varying Search Area (DVSA), which takes charge of limiting the ranges of particles' activity into a reduced area. On the other hand, in order to escape the local optima, Lévy flights are used to generate the stochastic disturbance in the movement of particles. To test the performance of CQPSO-DVSA-LFD, numerical experiments are conducted to compare the proposed algorithm with different variants of PSO. According to the experimental results, the proposed method performs better than other variants of PSO on both benchmark test functions and the combinatorial optimization issue, that is, the job-shop scheduling problem.

Combinatorial approach to the representation of the Schur-Weyl duality in one-dimensional spin systems

NASA Astrophysics Data System (ADS)

Jakubczyk, Dorota; Jakubczyk, Paweł

2018-02-01

We propose combinatorial approach to the representation of Schur-Weyl duality in physical systems on the example of one-dimensional spin chains. Exploiting the Robinson-Schensted-Knuth algorithm, we perform decomposition of the dual group representations into irreducible representations in a fully combinatorial way. As representation space, we choose the Hilbert space of the spin chains, but this approach can be easily generalized to an arbitrary physical system where the Schur-Weyl duality works.

An Adaptive Niching Genetic Algorithm using a niche size equalization mechanism

NASA Astrophysics Data System (ADS)

Nagata, Yuichi

Niching GAs have been widely investigated to apply genetic algorithms (GAs) to multimodal function optimization problems. In this paper, we suggest a new niching GA that attempts to form niches, each consisting of an equal number of individuals. The proposed GA can be applied also to combinatorial optimization problems by defining a distance metric in the search space. We apply the proposed GA to the job-shop scheduling problem (JSP) and demonstrate that the proposed niching method enhances the ability to maintain niches and improve the performance of GAs.

The quest for solvable multistate Landau-Zener models

DOE PAGES

Sinitsyn, Nikolai A.; Chernyak, Vladimir Y.

2017-05-24

Recently, integrability conditions (ICs) in mutistate Landau-Zener (MLZ) theory were proposed. They describe common properties of all known solved systems with linearly time-dependent Hamiltonians. Here we show that ICs enable efficient computer assisted search for new solvable MLZ models that span complexity range from several interacting states to mesoscopic systems with many-body dynamics and combinatorially large phase space. This diversity suggests that nontrivial solvable MLZ models are numerous. Additionally, we refine the formulation of ICs and extend the class of solvable systems to models with points of multiple diabatic level crossing.

Discovery of gigantic molecular nanostructures using a flow reaction array as a search engine

PubMed Central

Zang, Hong-Ying; de la Oliva, Andreu Ruiz; Miras, Haralampos N.; Long, De-Liang; McBurney, Roy T.; Cronin, Leroy

2014-01-01

The discovery of gigantic molecular nanostructures like coordination and polyoxometalate clusters is extremely time-consuming since a vast combinatorial space needs to be searched, and even a systematic and exhaustive exploration of the available synthetic parameters relies on a great deal of serendipity. Here we present a synthetic methodology that combines a flow reaction array and algorithmic control to give a chemical ‘real-space’ search engine leading to the discovery and isolation of a range of new molecular nanoclusters based on [Mo2O2S2]2+-based building blocks with either fourfold (C4) or fivefold (C5) symmetry templates and linkers. This engine leads us to isolate six new nanoscale cluster compounds: 1, {Mo10(C5)}; 2, {Mo14(C4)4(C5)2}; 3, {Mo60(C4)10}; 4, {Mo48(C4)6}; 5, {Mo34(C4)4}; 6, {Mo18(C4)9}; in only 200 automated experiments from a parameter space spanning ~5 million possible combinations. PMID:24770632

Learning Parsimonious Classification Rules from Gene Expression Data Using Bayesian Networks with Local Structure.

PubMed

Lustgarten, Jonathan Lyle; Balasubramanian, Jeya Balaji; Visweswaran, Shyam; Gopalakrishnan, Vanathi

2017-03-01

The comprehensibility of good predictive models learned from high-dimensional gene expression data is attractive because it can lead to biomarker discovery. Several good classifiers provide comparable predictive performance but differ in their abilities to summarize the observed data. We extend a Bayesian Rule Learning (BRL-GSS) algorithm, previously shown to be a significantly better predictor than other classical approaches in this domain. It searches a space of Bayesian networks using a decision tree representation of its parameters with global constraints, and infers a set of IF-THEN rules. The number of parameters and therefore the number of rules are combinatorial to the number of predictor variables in the model. We relax these global constraints to a more generalizable local structure (BRL-LSS). BRL-LSS entails more parsimonious set of rules because it does not have to generate all combinatorial rules. The search space of local structures is much richer than the space of global structures. We design the BRL-LSS with the same worst-case time-complexity as BRL-GSS while exploring a richer and more complex model space. We measure predictive performance using Area Under the ROC curve (AUC) and Accuracy. We measure model parsimony performance by noting the average number of rules and variables needed to describe the observed data. We evaluate the predictive and parsimony performance of BRL-GSS, BRL-LSS and the state-of-the-art C4.5 decision tree algorithm, across 10-fold cross-validation using ten microarray gene-expression diagnostic datasets. In these experiments, we observe that BRL-LSS is similar to BRL-GSS in terms of predictive performance, while generating a much more parsimonious set of rules to explain the same observed data. BRL-LSS also needs fewer variables than C4.5 to explain the data with similar predictive performance. We also conduct a feasibility study to demonstrate the general applicability of our BRL methods on the newer RNA sequencing gene-expression data.

A surrogate-based metaheuristic global search method for beam angle selection in radiation treatment planning

PubMed Central

Zhang, H H; Gao, S; Chen, W; Shi, L; D’Souza, W D; Meyer, R R

2013-01-01

An important element of radiation treatment planning for cancer therapy is the selection of beam angles (out of all possible coplanar and non-coplanar angles in relation to the patient) in order to maximize the delivery of radiation to the tumor site and minimize radiation damage to nearby organs-at-risk. This category of combinatorial optimization problem is particularly difficult because direct evaluation of the quality of treatment corresponding to any proposed selection of beams requires the solution of a large-scale dose optimization problem involving many thousands of variables that represent doses delivered to volume elements (voxels) in the patient. However, if the quality of angle sets can be accurately estimated without expensive computation, a large number of angle sets can be considered, increasing the likelihood of identifying a very high quality set. Using a computationally efficient surrogate beam set evaluation procedure based on single-beam data extracted from plans employing equally-spaced beams (eplans), we have developed a global search metaheuristic process based on the Nested Partitions framework for this combinatorial optimization problem. The surrogate scoring mechanism allows us to assess thousands of beam set samples within a clinically acceptable time frame. Tests on difficult clinical cases demonstrate that the beam sets obtained via our method are superior quality. PMID:23459411

Space communications scheduler: A rule-based approach to adaptive deadline scheduling

NASA Technical Reports Server (NTRS)

Straguzzi, Nicholas

1990-01-01

Job scheduling is a deceptively complex subfield of computer science. The highly combinatorial nature of the problem, which is NP-complete in nearly all cases, requires a scheduling program to intelligently transverse an immense search tree to create the best possible schedule in a minimal amount of time. In addition, the program must continually make adjustments to the initial schedule when faced with last-minute user requests, cancellations, unexpected device failures, quests, cancellations, unexpected device failures, etc. A good scheduler must be quick, flexible, and efficient, even at the expense of generating slightly less-than-optimal schedules. The Space Communication Scheduler (SCS) is an intelligent rule-based scheduling system. SCS is an adaptive deadline scheduler which allocates modular communications resources to meet an ordered set of user-specified job requests on board the NASA Space Station. SCS uses pattern matching techniques to detect potential conflicts through algorithmic and heuristic means. As a result, the system generates and maintains high density schedules without relying heavily on backtracking or blind search techniques. SCS is suitable for many common real-world applications.

Cooperative Quantum-Behaved Particle Swarm Optimization with Dynamic Varying Search Areas and Lévy Flight Disturbance

PubMed Central

Li, Desheng

2014-01-01

This paper proposes a novel variant of cooperative quantum-behaved particle swarm optimization (CQPSO) algorithm with two mechanisms to reduce the search space and avoid the stagnation, called CQPSO-DVSA-LFD. One mechanism is called Dynamic Varying Search Area (DVSA), which takes charge of limiting the ranges of particles' activity into a reduced area. On the other hand, in order to escape the local optima, Lévy flights are used to generate the stochastic disturbance in the movement of particles. To test the performance of CQPSO-DVSA-LFD, numerical experiments are conducted to compare the proposed algorithm with different variants of PSO. According to the experimental results, the proposed method performs better than other variants of PSO on both benchmark test functions and the combinatorial optimization issue, that is, the job-shop scheduling problem. PMID:24851085

Methodologies for optimal resource allocation to the national space program and new space utilizations. Volume 1: Technical description

NASA Technical Reports Server (NTRS)

1971-01-01

The optimal allocation of resources to the national space program over an extended time period requires the solution of a large combinatorial problem in which the program elements are interdependent. The computer model uses an accelerated search technique to solve this problem. The model contains a large number of options selectable by the user to provide flexible input and a broad range of output for use in sensitivity analyses of all entering elements. Examples of these options are budget smoothing under varied appropriation levels, entry of inflation and discount effects, and probabilistic output which provides quantified degrees of certainty that program costs will remain within planned budget. Criteria and related analytic procedures were established for identifying potential new space program directions. Used in combination with the optimal resource allocation model, new space applications can be analyzed in realistic perspective, including the advantage gain from existing space program plant and on-going programs such as the space transportation system.

Computational efficiency of parallel combinatorial OR-tree searches

NASA Technical Reports Server (NTRS)

Li, Guo-Jie; Wah, Benjamin W.

1990-01-01

The performance of parallel combinatorial OR-tree searches is analytically evaluated. This performance depends on the complexity of the problem to be solved, the error allowance function, the dominance relation, and the search strategies. The exact performance may be difficult to predict due to the nondeterminism and anomalies of parallelism. The authors derive the performance bounds of parallel OR-tree searches with respect to the best-first, depth-first, and breadth-first strategies, and verify these bounds by simulation. They show that a near-linear speedup can be achieved with respect to a large number of processors for parallel OR-tree searches. Using the bounds developed, the authors derive sufficient conditions for assuring that parallelism will not degrade performance and necessary conditions for allowing parallelism to have a speedup greater than the ratio of the numbers of processors. These bounds and conditions provide the theoretical foundation for determining the number of processors required to assure a near-linear speedup.

AI techniques for a space application scheduling problem

NASA Technical Reports Server (NTRS)

Thalman, N.; Sparn, T.; Jaffres, L.; Gablehouse, D.; Judd, D.; Russell, C.

1991-01-01

Scheduling is a very complex optimization problem which can be categorized as an NP-complete problem. NP-complete problems are quite diverse, as are the algorithms used in searching for an optimal solution. In most cases, the best solutions that can be derived for these combinatorial explosive problems are near-optimal solutions. Due to the complexity of the scheduling problem, artificial intelligence (AI) can aid in solving these types of problems. Some of the factors are examined which make space application scheduling problems difficult and presents a fairly new AI-based technique called tabu search as applied to a real scheduling application. the specific problem is concerned with scheduling application. The specific problem is concerned with scheduling solar and stellar observations for the SOLar-STellar Irradiance Comparison Experiment (SOLSTICE) instrument in a constrained environment which produces minimum impact on the other instruments and maximizes target observation times. The SOLSTICE instrument will gly on-board the Upper Atmosphere Research Satellite (UARS) in 1991, and a similar instrument will fly on the earth observing system (Eos).

The Shape of Things to Come: The Computational Pictograph as a Bridge from Combinatorial Space to Outcome Distribution

ERIC Educational Resources Information Center

Abrahamson, Dor

2006-01-01

This snapshot introduces a computer-based representation and activity that enables students to simultaneously "see" the combinatorial space of a stochastic device (e.g., dice, spinner, coins) and its outcome distribution. The author argues that the "ambiguous" representation fosters student insight into probability. [Snapshots are subject to peer…

London University Search Instrument: a combinatorial robot for high-throughput methods in ceramic science.

PubMed

Wang, Jian; Evans, Julian R G

2005-01-01

This paper describes the design, construction, and operation of the London University Search Instrument (LUSI) which was recently commissioned to create and test combinatorial libraries of ceramic compositions. The instrument uses commercially available powders, milled as necessary to create thick-film libraries by ink-jet printing. Multicomponent mixtures are prepared by well plate reformatting of ceramic inks. The library tiles are robotically loaded into a flatbed furnace and, when fired, transferred to a 2-axis high-resolution measurement table fitted with a hot plate where measurements of, for example, optical or electrical properties can be made. Data are transferred to a dedicated high-performance computer. The possibilities for remote interrogation and search steering are discussed.

Improved Monkey-King Genetic Algorithm for Solving Large Winner Determination in Combinatorial Auction

NASA Astrophysics Data System (ADS)

Li, Yuzhong

Using GA solve the winner determination problem (WDP) with large bids and items, run under different distribution, because the search space is large, constraint complex and it may easy to produce infeasible solution, would affect the efficiency and quality of algorithm. This paper present improved MKGA, including three operator: preprocessing, insert bid and exchange recombination, and use Monkey-king elite preservation strategy. Experimental results show that improved MKGA is better than SGA in population size and computation. The problem that traditional branch and bound algorithm hard to solve, improved MKGA can solve and achieve better effect.

Human olfactory receptor responses to odorants

PubMed Central

Mainland, Joel D; Li, Yun R; Zhou, Ting; Liu, Wen Ling L; Matsunami, Hiroaki

2015-01-01

Although the human olfactory system is capable of discriminating a vast number of odors, we do not currently understand what chemical features are encoded by olfactory receptors. In large part this is due to a paucity of data in a search space covering the interactions of hundreds of receptors with billions of odorous molecules. Of the approximately 400 intact human odorant receptors, only 10% have a published ligand. Here we used a heterologous luciferase assay to screen 73 odorants against a clone library of 511 human olfactory receptors. This dataset will allow other researchers to interrogate the combinatorial nature of olfactory coding. PMID:25977809

The damper placement problem for large flexible space structures

NASA Technical Reports Server (NTRS)

Kincaid, Rex K.

1992-01-01

The damper placement problem for large flexible space truss structures is formulated as a combinatorial optimization problem. The objective is to determine the p truss members of the structure to replace with active (or passive) dampers so that the modal damping ratio is as large as possible for all significant modes of vibration. Equivalently, given a strain energy matrix with rows indexed on the modes and the columns indexed on the truss members, we seek to find the set of p columns such that the smallest row sum, over the p columns, is maximized. We develop a tabu search heuristic for the damper placement problems on the Controls Structures Interaction (CSI) Phase 1 Evolutionary Model (10 modes and 1507 truss members). The resulting solutions are shown to be of high quality.

cOSPREY: A Cloud-Based Distributed Algorithm for Large-Scale Computational Protein Design

PubMed Central

Pan, Yuchao; Dong, Yuxi; Zhou, Jingtian; Hallen, Mark; Donald, Bruce R.; Xu, Wei

2016-01-01

Abstract Finding the global minimum energy conformation (GMEC) of a huge combinatorial search space is the key challenge in computational protein design (CPD) problems. Traditional algorithms lack a scalable and efficient distributed design scheme, preventing researchers from taking full advantage of current cloud infrastructures. We design cloud OSPREY (cOSPREY), an extension to a widely used protein design software OSPREY, to allow the original design framework to scale to the commercial cloud infrastructures. We propose several novel designs to integrate both algorithm and system optimizations, such as GMEC-specific pruning, state search partitioning, asynchronous algorithm state sharing, and fault tolerance. We evaluate cOSPREY on three different cloud platforms using different technologies and show that it can solve a number of large-scale protein design problems that have not been possible with previous approaches. PMID:27154509

Linking search space structure, run-time dynamics, and problem difficulty : a step toward demystifying tabu search.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Whitley, L. Darrell; Howe, Adele E.; Watson, Jean-Paul

2004-09-01

Tabu search is one of the most effective heuristics for locating high-quality solutions to a diverse array of NP-hard combinatorial optimization problems. Despite the widespread success of tabu search, researchers have a poor understanding of many key theoretical aspects of this algorithm, including models of the high-level run-time dynamics and identification of those search space features that influence problem difficulty. We consider these questions in the context of the job-shop scheduling problem (JSP), a domain where tabu search algorithms have been shown to be remarkably effective. Previously, we demonstrated that the mean distance between random local optima and the nearestmore » optimal solution is highly correlated with problem difficulty for a well-known tabu search algorithm for the JSP introduced by Taillard. In this paper, we discuss various shortcomings of this measure and develop a new model of problem difficulty that corrects these deficiencies. We show that Taillard's algorithm can be modeled with high fidelity as a simple variant of a straightforward random walk. The random walk model accounts for nearly all of the variability in the cost required to locate both optimal and sub-optimal solutions to random JSPs, and provides an explanation for differences in the difficulty of random versus structured JSPs. Finally, we discuss and empirically substantiate two novel predictions regarding tabu search algorithm behavior. First, the method for constructing the initial solution is highly unlikely to impact the performance of tabu search. Second, tabu tenure should be selected to be as small as possible while simultaneously avoiding search stagnation; values larger than necessary lead to significant degradations in performance.« less

An evolutionary strategy based on partial imitation for solving optimization problems

NASA Astrophysics Data System (ADS)

Javarone, Marco Alberto

2016-12-01

In this work we introduce an evolutionary strategy to solve combinatorial optimization tasks, i.e. problems characterized by a discrete search space. In particular, we focus on the Traveling Salesman Problem (TSP), i.e. a famous problem whose search space grows exponentially, increasing the number of cities, up to becoming NP-hard. The solutions of the TSP can be codified by arrays of cities, and can be evaluated by fitness, computed according to a cost function (e.g. the length of a path). Our method is based on the evolution of an agent population by means of an imitative mechanism, we define 'partial imitation'. In particular, agents receive a random solution and then, interacting among themselves, may imitate the solutions of agents with a higher fitness. Since the imitation mechanism is only partial, agents copy only one entry (randomly chosen) of another array (i.e. solution). In doing so, the population converges towards a shared solution, behaving like a spin system undergoing a cooling process, i.e. driven towards an ordered phase. We highlight that the adopted 'partial imitation' mechanism allows the population to generate solutions over time, before reaching the final equilibrium. Results of numerical simulations show that our method is able to find, in a finite time, both optimal and suboptimal solutions, depending on the size of the considered search space.

Experimental Design for Estimating Unknown Hydraulic Conductivity in a Confined Aquifer using a Genetic Algorithm and a Reduced Order Model

NASA Astrophysics Data System (ADS)

Ushijima, T.; Yeh, W.

2013-12-01

An optimal experimental design algorithm is developed to select locations for a network of observation wells that provides the maximum information about unknown hydraulic conductivity in a confined, anisotropic aquifer. The design employs a maximal information criterion that chooses, among competing designs, the design that maximizes the sum of squared sensitivities while conforming to specified design constraints. Because that the formulated problem is non-convex and contains integer variables (necessitating a combinatorial search), for a realistically-scaled model, the problem may be difficult, if not impossible, to solve through traditional mathematical programming techniques. Genetic Algorithms (GAs) are designed to search out the global optimum; however because a GA requires a large number of calls to a groundwater model, the formulated optimization problem may still be infeasible to solve. To overcome this, Proper Orthogonal Decomposition (POD) is applied to the groundwater model to reduce its dimension. The information matrix in the full model space can then be searched without solving the full model.

Conformational analysis of oligosaccharides and polysaccharides using molecular dynamics simulations.

PubMed

Frank, Martin

2015-01-01

Complex carbohydrates usually have a large number of rotatable bonds and consequently a large number of theoretically possible conformations can be generated (combinatorial explosion). The application of systematic search methods for conformational analysis of carbohydrates is therefore limited to disaccharides and trisaccharides in a routine analysis. An alternative approach is to use Monte-Carlo methods or (high-temperature) molecular dynamics (MD) simulations to explore the conformational space of complex carbohydrates. This chapter describes how to use MD simulation data to perform a conformational analysis (conformational maps, hydrogen bonds) of oligosaccharides and how to build realistic 3D structures of large polysaccharides using Conformational Analysis Tools (CAT).

Turbocharged molecular discovery of OLED emitters: from high-throughput quantum simulation to highly efficient TADF devices

NASA Astrophysics Data System (ADS)

Gómez-Bombarelli, Rafael; Aguilera-Iparraguirre, Jorge; Hirzel, Timothy D.; Ha, Dong-Gwang; Einzinger, Markus; Wu, Tony; Baldo, Marc A.; Aspuru-Guzik, Alán.

2016-09-01

Discovering new OLED emitters requires many experiments to synthesize candidates and test performance in devices. Large scale computer simulation can greatly speed this search process but the problem remains challenging enough that brute force application of massive computing power is not enough to successfully identify novel structures. We report a successful High Throughput Virtual Screening study that leveraged a range of methods to optimize the search process. The generation of candidate structures was constrained to contain combinatorial explosion. Simulations were tuned to the specific problem and calibrated with experimental results. Experimentalists and theorists actively collaborated such that experimental feedback was regularly utilized to update and shape the computational search. Supervised machine learning methods prioritized candidate structures prior to quantum chemistry simulation to prevent wasting compute on likely poor performers. With this combination of techniques, each multiplying the strength of the search, this effort managed to navigate an area of molecular space and identify hundreds of promising OLED candidate structures. An experimentally validated selection of this set shows emitters with external quantum efficiencies as high as 22%.

Combinatorial Fusion Analysis for Meta Search Information Retrieval

NASA Astrophysics Data System (ADS)

Hsu, D. Frank; Taksa, Isak

Leading commercial search engines are built as single event systems. In response to a particular search query, the search engine returns a single list of ranked search results. To find more relevant results the user must frequently try several other search engines. A meta search engine was developed to enhance the process of multi-engine querying. The meta search engine queries several engines at the same time and fuses individual engine results into a single search results list. The fusion of multiple search results has been shown (mostly experimentally) to be highly effective. However, the question of why and how the fusion should be done still remains largely unanswered. In this chapter, we utilize the combinatorial fusion analysis proposed by Hsu et al. to analyze combination and fusion of multiple sources of information. A rank/score function is used in the design and analysis of our framework. The framework provides a better understanding of the fusion phenomenon in information retrieval. For example, to improve the performance of the combined multiple scoring systems, it is necessary that each of the individual scoring systems has relatively high performance and the individual scoring systems are diverse. Additionally, we illustrate various applications of the framework using two examples from the information retrieval domain.

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

PubMed

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.

Searching Remotely Sensed Images for Meaningful Nested Gestalten

NASA Astrophysics Data System (ADS)

Michaelsen, E.; Muench, D.; Arens, M.

2016-06-01

Even non-expert human observers sometimes still outperform automatic extraction of man-made objects from remotely sensed data. We conjecture that some of this remarkable capability can be explained by Gestalt mechanisms. Gestalt algebra gives a mathematical structure capturing such part-aggregate relations and the laws to form an aggregate called Gestalt. Primitive Gestalten are obtained from an input image and the space of all possible Gestalt algebra terms is searched for well-assessed instances. This can be a very challenging combinatorial effort. The contribution at hand gives some tools and structures unfolding a finite and comparably small subset of the possible combinations. Yet, the intended Gestalten still are contained and found with high probability and moderate efforts. Experiments are made with images obtained from a virtual globe system, and use the SIFT method for extraction of the primitive Gestalten. Comparison is made with manually extracted ground-truth Gestalten salient to human observers.

Assembler: Efficient Discovery of Spatial Co-evolving Patterns in Massive Geo-sensory Data.

PubMed

Zhang, Chao; Zheng, Yu; Ma, Xiuli; Han, Jiawei

2015-08-01

Recent years have witnessed the wide proliferation of geo-sensory applications wherein a bundle of sensors are deployed at different locations to cooperatively monitor the target condition. Given massive geo-sensory data, we study the problem of mining spatial co-evolving patterns (SCPs), i.e ., groups of sensors that are spatially correlated and co-evolve frequently in their readings. SCP mining is of great importance to various real-world applications, yet it is challenging because (1) the truly interesting evolutions are often flooded by numerous trivial fluctuations in the geo-sensory time series; and (2) the pattern search space is extremely large due to the spatiotemporal combinatorial nature of SCP. In this paper, we propose a two-stage method called Assembler. In the first stage, Assembler filters trivial fluctuations using wavelet transform and detects frequent evolutions for individual sensors via a segment-and-group approach. In the second stage, Assembler generates SCPs by assembling the frequent evolutions of individual sensors. Leveraging the spatial constraint, it conceptually organizes all the SCPs into a novel structure called the SCP search tree, which facilitates the effective pruning of the search space to generate SCPs efficiently. Our experiments on both real and synthetic data sets show that Assembler is effective, efficient, and scalable.

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem.

PubMed

Pourhassan, Mojgan; Neumann, Frank

2018-06-22

The generalized travelling salesperson problem is an important NP-hard combinatorial optimization problem for which meta-heuristics, such as local search and evolutionary algorithms, have been used very successfully. Two hierarchical approaches with different neighbourhood structures, namely a Cluster-Based approach and a Node-Based approach, have been proposed by Hu and Raidl (2008) for solving this problem. In this paper, local search algorithms and simple evolutionary algorithms based on these approaches are investigated from a theoretical perspective. For local search algorithms, we point out the complementary abilities of the two approaches by presenting instances where they mutually outperform each other. Afterwards, we introduce an instance which is hard for both approaches when initialized on a particular point of the search space, but where a variable neighbourhood search combining them finds the optimal solution in polynomial time. Then we turn our attention to analysing the behaviour of simple evolutionary algorithms that use these approaches. We show that the Node-Based approach solves the hard instance of the Cluster-Based approach presented in Corus et al. (2016) in polynomial time. Furthermore, we prove an exponential lower bound on the optimization time of the Node-Based approach for a class of Euclidean instances.

Statistical mechanics of budget-constrained auctions

NASA Astrophysics Data System (ADS)

Altarelli, F.; Braunstein, A.; Realpe-Gomez, J.; Zecchina, R.

2009-07-01

Finding the optimal assignment in budget-constrained auctions is a combinatorial optimization problem with many important applications, a notable example being in the sale of advertisement space by search engines (in this context the problem is often referred to as the off-line AdWords problem). On the basis of the cavity method of statistical mechanics, we introduce a message-passing algorithm that is capable of solving efficiently random instances of the problem extracted from a natural distribution, and we derive from its properties the phase diagram of the problem. As the control parameter (average value of the budgets) is varied, we find two phase transitions delimiting a region in which long-range correlations arise.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Heredia-Langner, Alejandro; Amidan, Brett G.; Matzner, Shari

We present results from the optimization of a re-identification process using two sets of biometric data obtained from the Civilian American and European Surface Anthropometry Resource Project (CAESAR) database. The datasets contain real measurements of features for 2378 individuals in a standing (43 features) and seated (16 features) position. A genetic algorithm (GA) was used to search a large combinatorial space where different features are available between the probe (seated) and gallery (standing) datasets. Results show that optimized model predictions obtained using less than half of the 43 gallery features and data from roughly 16% of the individuals available producemore » better re-identification rates than two other approaches that use all the information available.« less

Aerospace applications of integer and combinatorial optimization

NASA Technical Reports Server (NTRS)

Padula, S. L.; Kincaid, R. K.

1995-01-01

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in solving combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem, for example, seeks the optimal locations for vibration-damping devices on a large space structure and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Feature selection methods for big data bioinformatics: A survey from the search perspective.

PubMed

Wang, Lipo; Wang, Yaoli; Chang, Qing

2016-12-01

This paper surveys main principles of feature selection and their recent applications in big data bioinformatics. Instead of the commonly used categorization into filter, wrapper, and embedded approaches to feature selection, we formulate feature selection as a combinatorial optimization or search problem and categorize feature selection methods into exhaustive search, heuristic search, and hybrid methods, where heuristic search methods may further be categorized into those with or without data-distilled feature ranking measures. Copyright © 2016 Elsevier Inc. All rights reserved.

Using Grid Cells for Navigation

PubMed Central

Bush, Daniel; Barry, Caswell; Manson, Daniel; Burgess, Neil

2015-01-01

Summary Mammals are able to navigate to hidden goal locations by direct routes that may traverse previously unvisited terrain. Empirical evidence suggests that this “vector navigation” relies on an internal representation of space provided by the hippocampal formation. The periodic spatial firing patterns of grid cells in the hippocampal formation offer a compact combinatorial code for location within large-scale space. Here, we consider the computational problem of how to determine the vector between start and goal locations encoded by the firing of grid cells when this vector may be much longer than the largest grid scale. First, we present an algorithmic solution to the problem, inspired by the Fourier shift theorem. Second, we describe several potential neural network implementations of this solution that combine efficiency of search and biological plausibility. Finally, we discuss the empirical predictions of these implementations and their relationship to the anatomy and electrophysiology of the hippocampal formation. PMID:26247860

Combining local search with co-evolution in a remarkably simple way

DOE Office of Scientific and Technical Information (OSTI.GOV)

Boettcher, S.; Percus, A.

2000-05-01

The authors explore a new general-purpose heuristic for finding high-quality solutions to hard optimization problem. The method, called extremal optimization, is inspired by self-organized criticality, a concept introduced to describe emergent complexity in physical systems. In contrast to genetic algorithms, which operate on an entire gene-pool of possible solutions, extremal optimization successively replaces extremely undesirable elements of a single sub-optimal solution with new, random ones. Large fluctuations, or avalanches, ensue that efficiently explore many local optima. Drawing upon models used to simulate far-from-equilibrium dynamics, extremal optimization complements heuristics inspired by equilibrium statistical physics, such as simulated annealing. With only onemore » adjustable parameter, its performance has proved competitive with more elaborate methods, especially near phase transitions. Phase transitions are found in many combinatorial optimization problems, and have been conjectured to occur in the region of parameter space containing the hardest instances. We demonstrate how extremal optimization can be implemented for a variety of hard optimization problems. We believe that this will be a useful tool in the investigation of phase transitions in combinatorial optimization, thereby helping to elucidate the origin of computational complexity.« less

Mapping protein-protein interactions with phage-displayed combinatorial peptide libraries.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kay, B. K.; Castagnoli, L.; Biosciences Division

This unit describes the process and analysis of affinity selecting bacteriophage M13 from libraries displaying combinatorial peptides fused to either a minor or major capsid protein. Direct affinity selection uses target protein bound to a microtiter plate followed by purification of selected phage by ELISA. Alternatively, there is a bead-based affinity selection method. These methods allow one to readily isolate peptide ligands that bind to a protein target of interest and use the consensus sequence to search proteomic databases for putative interacting proteins.

Unitals and ovals of symmetric block designs in LDPC and space-time coding

NASA Astrophysics Data System (ADS)

Andriamanalimanana, Bruno R.

2004-08-01

An approach to the design of LDPC (low density parity check) error-correction and space-time modulation codes involves starting with known mathematical and combinatorial structures, and deriving code properties from structure properties. This paper reports on an investigation of unital and oval configurations within generic symmetric combinatorial designs, not just classical projective planes, as the underlying structure for classes of space-time LDPC outer codes. Of particular interest are the encoding and iterative (sum-product) decoding gains that these codes may provide. Various small-length cases have been numerically implemented in Java and Matlab for a number of channel models.

Combinatorial quantisation of the Euclidean torus universe

NASA Astrophysics Data System (ADS)

Meusburger, C.; Noui, K.

2010-12-01

We quantise the Euclidean torus universe via a combinatorial quantisation formalism based on its formulation as a Chern-Simons gauge theory and on the representation theory of the Drinfel'd double DSU(2). The resulting quantum algebra of observables is given by two commuting copies of the Heisenberg algebra, and the associated Hilbert space can be identified with the space of square integrable functions on the torus. We show that this Hilbert space carries a unitary representation of the modular group and discuss the role of modular invariance in the theory. We derive the classical limit of the theory and relate the quantum observables to the geometry of the torus universe.

Inference of combinatorial Boolean rules of synergistic gene sets from cancer microarray datasets.

PubMed

Park, Inho; Lee, Kwang H; Lee, Doheon

2010-06-15

Gene set analysis has become an important tool for the functional interpretation of high-throughput gene expression datasets. Moreover, pattern analyses based on inferred gene set activities of individual samples have shown the ability to identify more robust disease signatures than individual gene-based pattern analyses. Although a number of approaches have been proposed for gene set-based pattern analysis, the combinatorial influence of deregulated gene sets on disease phenotype classification has not been studied sufficiently. We propose a new approach for inferring combinatorial Boolean rules of gene sets for a better understanding of cancer transcriptome and cancer classification. To reduce the search space of the possible Boolean rules, we identify small groups of gene sets that synergistically contribute to the classification of samples into their corresponding phenotypic groups (such as normal and cancer). We then measure the significance of the candidate Boolean rules derived from each group of gene sets; the level of significance is based on the class entropy of the samples selected in accordance with the rules. By applying the present approach to publicly available prostate cancer datasets, we identified 72 significant Boolean rules. Finally, we discuss several identified Boolean rules, such as the rule of glutathione metabolism (down) and prostaglandin synthesis regulation (down), which are consistent with known prostate cancer biology. Scripts written in Python and R are available at http://biosoft.kaist.ac.kr/~ihpark/. The refined gene sets and the full list of the identified Boolean rules are provided in the Supplementary Material. Supplementary data are available at Bioinformatics online.

Structure-based design of combinatorial mutagenesis libraries

PubMed Central

Verma, Deeptak; Grigoryan, Gevorg; Bailey-Kellogg, Chris

2015-01-01

The development of protein variants with improved properties (thermostability, binding affinity, catalytic activity, etc.) has greatly benefited from the application of high-throughput screens evaluating large, diverse combinatorial libraries. At the same time, since only a very limited portion of sequence space can be experimentally constructed and tested, an attractive possibility is to use computational protein design to focus libraries on a productive portion of the space. We present a general-purpose method, called “Structure-based Optimization of Combinatorial Mutagenesis” (SOCoM), which can optimize arbitrarily large combinatorial mutagenesis libraries directly based on structural energies of their constituents. SOCoM chooses both positions and substitutions, employing a combinatorial optimization framework based on library-averaged energy potentials in order to avoid explicitly modeling every variant in every possible library. In case study applications to green fluorescent protein, β-lactamase, and lipase A, SOCoM optimizes relatively small, focused libraries whose variants achieve energies comparable to or better than previous library design efforts, as well as larger libraries (previously not designable by structure-based methods) whose variants cover greater diversity while still maintaining substantially better energies than would be achieved by representative random library approaches. By allowing the creation of large-scale combinatorial libraries based on structural calculations, SOCoM promises to increase the scope of applicability of computational protein design and improve the hit rate of discovering beneficial variants. While designs presented here focus on variant stability (predicted by total energy), SOCoM can readily incorporate other structure-based assessments, such as the energy gap between alternative conformational or bound states. PMID:25611189

Structure-based design of combinatorial mutagenesis libraries.

PubMed

Verma, Deeptak; Grigoryan, Gevorg; Bailey-Kellogg, Chris

2015-05-01

The development of protein variants with improved properties (thermostability, binding affinity, catalytic activity, etc.) has greatly benefited from the application of high-throughput screens evaluating large, diverse combinatorial libraries. At the same time, since only a very limited portion of sequence space can be experimentally constructed and tested, an attractive possibility is to use computational protein design to focus libraries on a productive portion of the space. We present a general-purpose method, called "Structure-based Optimization of Combinatorial Mutagenesis" (SOCoM), which can optimize arbitrarily large combinatorial mutagenesis libraries directly based on structural energies of their constituents. SOCoM chooses both positions and substitutions, employing a combinatorial optimization framework based on library-averaged energy potentials in order to avoid explicitly modeling every variant in every possible library. In case study applications to green fluorescent protein, β-lactamase, and lipase A, SOCoM optimizes relatively small, focused libraries whose variants achieve energies comparable to or better than previous library design efforts, as well as larger libraries (previously not designable by structure-based methods) whose variants cover greater diversity while still maintaining substantially better energies than would be achieved by representative random library approaches. By allowing the creation of large-scale combinatorial libraries based on structural calculations, SOCoM promises to increase the scope of applicability of computational protein design and improve the hit rate of discovering beneficial variants. While designs presented here focus on variant stability (predicted by total energy), SOCoM can readily incorporate other structure-based assessments, such as the energy gap between alternative conformational or bound states. © 2015 The Protein Society.

Library fingerprints: a novel approach to the screening of virtual libraries.

PubMed

Klon, Anthony E; Diller, David J

2007-01-01

We propose a novel method to prioritize libraries for combinatorial synthesis and high-throughput screening that assesses the viability of a particular library on the basis of the aggregate physical-chemical properties of the compounds using a naïve Bayesian classifier. This approach prioritizes collections of related compounds according to the aggregate values of their physical-chemical parameters in contrast to single-compound screening. The method is also shown to be useful in screening existing noncombinatorial libraries when the compounds in these libraries have been previously clustered according to their molecular graphs. We show that the method used here is comparable or superior to the single-compound virtual screening of combinatorial libraries and noncombinatorial libraries and is superior to the pairwise Tanimoto similarity searching of a collection of combinatorial libraries.

Combinatorial Methods for Exploring Complex Materials

NASA Astrophysics Data System (ADS)

Amis, Eric J.

2004-03-01

Combinatorial and high-throughput methods have changed the paradigm of pharmaceutical synthesis and have begun to have a similar impact on materials science research. Already there are examples of combinatorial methods used for inorganic materials, catalysts, and polymer synthesis. For many investigations the primary goal has been discovery of new material compositions that optimize properties such as phosphorescence or catalytic activity. In the midst of the excitement generated to "make things", another opportunity arises for materials science to "understand things" by using the efficiency of combinatorial methods. We have shown that combinatorial methods hold potential for rapid and systematic generation of experimental data over the multi-parameter space typical of investigations in polymer physics. We have applied the combinatorial approach to studies of polymer thin films, biomaterials, polymer blends, filled polymers, and semicrystalline polymers. By combining library fabrication, high-throughput measurements, informatics, and modeling we can demonstrate validation of the methodology, new observations, and developments toward predictive models. This talk will present some of our latest work with applications to coating stability, multi-component formulations, and nanostructure assembly.

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

PubMed

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.

Recursive Branching Simulated Annealing Algorithm

NASA Technical Reports Server (NTRS)

Bolcar, Matthew; Smith, J. Scott; Aronstein, David

2012-01-01

This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.

Combinatorial optimization in foundry practice

NASA Astrophysics Data System (ADS)

Antamoshkin, A. N.; Masich, I. S.

2016-04-01

The multicriteria mathematical model of foundry production capacity planning is suggested in the paper. The model is produced in terms of pseudo-Boolean optimization theory. Different search optimization methods were used to solve the obtained problem.

Exploring the combinatorial space of complete pathways to chemicals.

PubMed

Wang, Lin; Ng, Chiam Yu; Dash, Satyakam; Maranas, Costas D

2018-04-06

Computational pathway design tools often face the challenges of balancing the stoichiometry of co-metabolites and cofactors, and dealing with reaction rule utilization in a single workflow. To this end, we provide an overview of two complementary stoichiometry-based pathway design tools optStoic and novoStoic developed in our group to tackle these challenges. optStoic is designed to determine the stoichiometry of overall conversion first which optimizes a performance criterion (e.g. high carbon/energy efficiency) and ensures a comprehensive search of co-metabolites and cofactors. The procedure then identifies the minimum number of intervening reactions to connect the source and sink metabolites. We also further the pathway design procedure by expanding the search space to include both known and hypothetical reactions, represented by reaction rules, in a new tool termed novoStoic. Reaction rules are derived based on a mixed-integer linear programming (MILP) compatible reaction operator, which allow us to explore natural promiscuous enzymes, engineer candidate enzymes that are not already promiscuous as well as design de novo enzymes. The identified biochemical reaction rules then guide novoStoic to design routes that expand the currently known biotransformation space using a single MILP modeling procedure. We demonstrate the use of the two computational tools in pathway elucidation by designing novel synthetic routes for isobutanol. © 2018 The Author(s). Published by Portland Press Limited on behalf of the Biochemical Society.

A Hybrid Symbiotic Organisms Search Algorithm with Variable Neighbourhood Search for Solving Symmetric and Asymmetric Traveling Salesman Problem

NASA Astrophysics Data System (ADS)

Umam, M. I. H.; Santosa, B.

2018-04-01

Combinatorial optimization has been frequently used to solve both problems in science, engineering, and commercial applications. One combinatorial problems in the field of transportation is to find a shortest travel route that can be taken from the initial point of departure to point of destination, as well as minimizing travel costs and travel time. When the distance from one (initial) node to another (destination) node is the same with the distance to travel back from destination to initial, this problems known to the Traveling Salesman Problem (TSP), otherwise it call as an Asymmetric Traveling Salesman Problem (ATSP). The most recent optimization techniques is Symbiotic Organisms Search (SOS). This paper discuss how to hybrid the SOS algorithm with variable neighborhoods search (SOS-VNS) that can be applied to solve the ATSP problem. The proposed mechanism to add the variable neighborhoods search as a local search is to generate the better initial solution and then we modify the phase of parasites with adapting mechanism of mutation. After modification, the performance of the algorithm SOS-VNS is evaluated with several data sets and then the results is compared with the best known solution and some algorithm such PSO algorithm and SOS original algorithm. The SOS-VNS algorithm shows better results based on convergence, divergence and computing time.

Combinatorial construction of tilings by barycentric simplex orbits (D symbols) and their realizations in Euclidean and other homogeneous spaces.

PubMed

Molnár, Emil

2005-11-01

A new method, developed in previous works by the author (partly with co-authors), is presented which decides algorithmically, in principle by computer, whether a combinatorial space tiling (Tau, Gamma) is realizable in the d-dimensional Euclidean space E(d) (think of d = 2, 3, 4) or in other homogeneous spaces, e.g. in Thurston's 3-geometries: E(3), S(3), H(3), S(2) x R, H(2) x R, SL(2)R, Nil, Sol. Then our group Gamma will be an isometry group of a projective metric 3-sphere PiS(3) (R, < , >), acting discontinuously on its above tiling Tau. The method is illustrated by a plane example and by the well known rhombohedron tiling (Tau, Gamma), where Gamma = R3m is the Euclidean space group No. 166 in International Tables for Crystallography.

Demonstrating the suitability of genetic algorithms for driving microbial ecosystems in desirable directions.

PubMed

Vandecasteele, Frederik P J; Hess, Thomas F; Crawford, Ronald L

2007-07-01

The functioning of natural microbial ecosystems is determined by biotic interactions, which are in turn influenced by abiotic environmental conditions. Direct experimental manipulation of such conditions can be used to purposefully drive ecosystems toward exhibiting desirable functions. When a set of environmental conditions can be manipulated to be present at a discrete number of levels, finding the right combination of conditions to obtain the optimal desired effect becomes a typical combinatorial optimisation problem. Genetic algorithms are a class of robust and flexible search and optimisation techniques from the field of computer science that may be very suitable for such a task. To verify this idea, datasets containing growth levels of the total microbial community of four different natural microbial ecosystems in response to all possible combinations of a set of five chemical supplements were obtained. Subsequently, the ability of a genetic algorithm to search this parameter space for combinations of supplements driving the microbial communities to high levels of growth was compared to that of a random search, a local search, and a hill-climbing algorithm, three intuitive alternative optimisation approaches. The results indicate that a genetic algorithm is very suitable for driving microbial ecosystems in desirable directions, which opens opportunities for both fundamental ecological research and industrial applications.

Attractors in Sequence Space: Agent-Based Exploration of MHC I Binding Peptides.

PubMed

Jäger, Natalie; Wisniewska, Joanna M; Hiss, Jan A; Freier, Anja; Losch, Florian O; Walden, Peter; Wrede, Paul; Schneider, Gisbert

2010-01-12

Ant Colony Optimization (ACO) is a meta-heuristic that utilizes a computational analogue of ant trail pheromones to solve combinatorial optimization problems. The size of the ant colony and the representation of the ants' pheromone trails is unique referring to the given optimization problem. In the present study, we employed ACO to generate novel peptides that stabilize MHC I protein on the plasma membrane of a murine lymphoma cell line. A jury of feedforward neural network classifiers served as fitness function for peptide design by ACO. Bioactive murine MHC I H-2K(b) stabilizing as well as nonstabilizing octapeptides were designed, synthesized and tested. These peptides reveal residue motifs that are relevant for MHC I receptor binding. We demonstrate how the performance of the implemented ACO algorithm depends on the colony size and the size of the search space. The actual peptide design process by ACO constitutes a search path in sequence space that can be visualized as trajectories on a self-organizing map (SOM). By projecting the sequence space on a SOM we visualize the convergence of the different solutions that emerge during the optimization process in sequence space. The SOM representation reveals attractors in sequence space for MHC I binding peptides. The combination of ACO and SOM enables systematic peptide optimization. This technique allows for the rational design of various types of bioactive peptides with minimal experimental effort. Here, we demonstrate its successful application to the design of MHC-I binding and nonbinding peptides which exhibit substantial bioactivity in a cell-based assay. Copyright © 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

GALAXY: A new hybrid MOEA for the optimal design of Water Distribution Systems

NASA Astrophysics Data System (ADS)

Wang, Q.; Savić, D. A.; Kapelan, Z.

2017-03-01

A new hybrid optimizer, called genetically adaptive leaping algorithm for approximation and diversity (GALAXY), is proposed for dealing with the discrete, combinatorial, multiobjective design of Water Distribution Systems (WDSs), which is NP-hard and computationally intensive. The merit of GALAXY is its ability to alleviate to a great extent the parameterization issue and the high computational overhead. It follows the generational framework of Multiobjective Evolutionary Algorithms (MOEAs) and includes six search operators and several important strategies. These operators are selected based on their leaping ability in the objective space from the global and local search perspectives. These strategies steer the optimization and balance the exploration and exploitation aspects simultaneously. A highlighted feature of GALAXY lies in the fact that it eliminates majority of parameters, thus being robust and easy-to-use. The comparative studies between GALAXY and three representative MOEAs on five benchmark WDS design problems confirm its competitiveness. GALAXY can identify better converged and distributed boundary solutions efficiently and consistently, indicating a much more balanced capability between the global and local search. Moreover, its advantages over other MOEAs become more substantial as the complexity of the design problem increases.

Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

NASA Astrophysics Data System (ADS)

Vatutin, Eduard

2017-12-01

The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

Combinatorial Reductions for the Stanley Depth of I and S/I

DOE Office of Scientific and Technical Information (OSTI.GOV)

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.

Using Grid Cells for Navigation.

PubMed

Bush, Daniel; Barry, Caswell; Manson, Daniel; Burgess, Neil

2015-08-05

Mammals are able to navigate to hidden goal locations by direct routes that may traverse previously unvisited terrain. Empirical evidence suggests that this "vector navigation" relies on an internal representation of space provided by the hippocampal formation. The periodic spatial firing patterns of grid cells in the hippocampal formation offer a compact combinatorial code for location within large-scale space. Here, we consider the computational problem of how to determine the vector between start and goal locations encoded by the firing of grid cells when this vector may be much longer than the largest grid scale. First, we present an algorithmic solution to the problem, inspired by the Fourier shift theorem. Second, we describe several potential neural network implementations of this solution that combine efficiency of search and biological plausibility. Finally, we discuss the empirical predictions of these implementations and their relationship to the anatomy and electrophysiology of the hippocampal formation. Copyright © 2015 The Authors. Published by Elsevier Inc. All rights reserved.

Engineering in complex systems.

PubMed

Bujara, Matthias; Panke, Sven

2010-10-01

The implementation of the engineering design cycle of measure, model, manipulate would drastically enhance the success rate of biotechnological designs. Recent progress for the three elements suggests that the scope of the traditional engineering paradigm in biotechnology is expanding. Substantial advances were made in dynamic in vivo analysis of metabolism, which is essential for the accurate prediction of metabolic pathway behavior. Novel methods that require variable degrees of system knowledge facilitate metabolic system manipulation. The combinatorial testing of pre-characterized parts is particularly promising, because it can profit from automation and limits the search space. Finally, conceptual advances in orthogonalizing cells should enhance the reliability of engineering designs in the future. Coupled to improved in silico models of metabolism, these advances should allow a more rational design of metabolic systems. Copyright © 2010 Elsevier Ltd. All rights reserved.

Combinatorial selection of molecular conformations and supramolecular synthons in quercetin cocrystal landscapes: a route to ternary solids

PubMed Central

Dubey, Ritesh; Desiraju, Gautam R.

2015-01-01

The crystallization of 28 binary and ternary cocrystals of quercetin with dibasic coformers is analyzed in terms of a combinatorial selection from a solution of preferred molecular conformations and supramolecular synthons. The crystal structures are characterized by distinctive O—H⋯N and O—H⋯O based synthons and are classified as nonporous, porous and helical. Variability in molecular conformation and synthon structure led to an increase in the energetic and structural space around the crystallization event. This space is the crystal structure landscape of the compound and is explored by fine-tuning the experimental conditions of crystallization. In the landscape context, we develop a strategy for the isolation of ternary cocrystals with the use of auxiliary template molecules to reduce the molecular and supramolecular ‘confusion’ that is inherent in a molecule like quercetin. The absence of concomitant polymorphism in this study highlights the selectivity in conformation and synthon choice from the virtual combinatorial library in solution. PMID:26175900

A Key Pre-Distribution Scheme Based on µ-PBIBD for Enhancing Resilience in Wireless Sensor Networks.

PubMed

Yuan, Qi; Ma, Chunguang; Yu, Haitao; Bian, Xuefen

2018-05-12

Many key pre-distribution (KPD) schemes based on combinatorial design were proposed for secure communication of wireless sensor networks (WSNs). Due to complexity of constructing the combinatorial design, it is infeasible to generate key rings using the corresponding combinatorial design in large scale deployment of WSNs. In this paper, we present a definition of new combinatorial design, termed “µ-partially balanced incomplete block design (µ-PBIBD)”, which is a refinement of partially balanced incomplete block design (PBIBD), and then describe a 2-D construction of µ-PBIBD which is mapped to KPD in WSNs. Our approach is of simple construction which provides a strong key connectivity and a poor network resilience. To improve the network resilience of KPD based on 2-D µ-PBIBD, we propose a KPD scheme based on 3-D Ex-µ-PBIBD which is a construction of µ-PBIBD from 2-D space to 3-D space. Ex-µ-PBIBD KPD scheme improves network scalability and resilience while has better key connectivity. Theoretical analysis and comparison with the related schemes show that key pre-distribution scheme based on Ex-µ-PBIBD provides high network resilience and better key scalability, while it achieves a trade-off between network resilience and network connectivity.

A Key Pre-Distribution Scheme Based on µ-PBIBD for Enhancing Resilience in Wireless Sensor Networks

PubMed Central

Yuan, Qi; Ma, Chunguang; Yu, Haitao; Bian, Xuefen

2018-01-01

Many key pre-distribution (KPD) schemes based on combinatorial design were proposed for secure communication of wireless sensor networks (WSNs). Due to complexity of constructing the combinatorial design, it is infeasible to generate key rings using the corresponding combinatorial design in large scale deployment of WSNs. In this paper, we present a definition of new combinatorial design, termed “µ-partially balanced incomplete block design (µ-PBIBD)”, which is a refinement of partially balanced incomplete block design (PBIBD), and then describe a 2-D construction of µ-PBIBD which is mapped to KPD in WSNs. Our approach is of simple construction which provides a strong key connectivity and a poor network resilience. To improve the network resilience of KPD based on 2-D µ-PBIBD, we propose a KPD scheme based on 3-D Ex-µ-PBIBD which is a construction of µ-PBIBD from 2-D space to 3-D space. Ex-µ-PBIBD KPD scheme improves network scalability and resilience while has better key connectivity. Theoretical analysis and comparison with the related schemes show that key pre-distribution scheme based on Ex-µ-PBIBD provides high network resilience and better key scalability, while it achieves a trade-off between network resilience and network connectivity. PMID:29757244

Exploiting Quantum Resonance to Solve Combinatorial Problems

NASA Technical Reports Server (NTRS)

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.

Combinatorial studies of (1-x)Na0.5Bi0.5TiO3-xBaTiO3 thin-film chips

NASA Astrophysics Data System (ADS)

Cheng, Hong-Wei; Zhang, Xue-Jin; Zhang, Shan-Tao; Feng, Yan; Chen, Yan-Feng; Liu, Zhi-Guo; Cheng, Guang-Xi

2004-09-01

Applying a combinatorial methodology, (1-x)Na0.5Bi0.5TiO3-xBaTiO3 (NBT-BT) thin-film chips were fabricated on (001)-LaAlO3 substrates by pulsed laser deposition with a few quaternary masks. A series of NBT-BT library with the composition of BT ranged from 0 to 44% was obtained with uniform composition and well crystallinity. The relation between the concentration of NBT-BT and their structural and dielectric properties were investigated by x-ray diffraction (XRD), evanescent microwave probe, atomic force microscopy, and Raman spectroscopy. An obvious morphotropic phase boundary (MPB) was established to be about 9% BT by XRD, Raman frequency shift, and dielectric anomaly, different from the well-known MPB of the materials. The result shows the high efficiency of combinatorial method in searching new relaxor ferroelectrics.

A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealing.

PubMed

Wang, Lipo; Li, Sa; Tian, Fuyu; Fu, Xiuju

2004-10-01

Recently Chen and Aihara have demonstrated both experimentally and mathematically that their chaotic simulated annealing (CSA) has better search ability for solving combinatorial optimization problems compared to both the Hopfield-Tank approach and stochastic simulated annealing (SSA). However, CSA may not find a globally optimal solution no matter how slowly annealing is carried out, because the chaotic dynamics are completely deterministic. In contrast, SSA tends to settle down to a global optimum if the temperature is reduced sufficiently slowly. Here we combine the best features of both SSA and CSA, thereby proposing a new approach for solving optimization problems, i.e., stochastic chaotic simulated annealing, by using a noisy chaotic neural network. We show the effectiveness of this new approach with two difficult combinatorial optimization problems, i.e., a traveling salesman problem and a channel assignment problem for cellular mobile communications.

Balancing focused combinatorial libraries based on multiple GPCR ligands

NASA Astrophysics Data System (ADS)

Soltanshahi, Farhad; Mansley, Tamsin E.; Choi, Sun; Clark, Robert D.

2006-08-01

G-Protein coupled receptors (GPCRs) are important targets for drug discovery, and combinatorial chemistry is an important tool for pharmaceutical development. The absence of detailed structural information, however, limits the kinds of combinatorial design techniques that can be applied to GPCR targets. This is particularly problematic given the current emphasis on focused combinatorial libraries. By linking an incremental construction method (OptDesign) to the very fast shape-matching capability of ChemSpace, we have created an efficient method for designing targeted sublibraries that are topomerically similar to known actives. Multi-objective scoring allows consideration of multiple queries (actives) simultaneously. This can lead to a distribution of products skewed towards one particular query structure, however, particularly when the ligands of interest are quite dissimilar to one another. A novel pivoting technique is described which makes it possible to generate promising designs even under those circumstances. The approach is illustrated by application to some serotonergic agonists and chemokine antagonists.

Combinatorial Color Space Models for Skin Detection in Sub-continental Human Images

NASA Astrophysics Data System (ADS)

Khaled, Shah Mostafa; Saiful Islam, Md.; Rabbani, Md. Golam; Tabassum, Mirza Rehenuma; Gias, Alim Ul; Kamal, Md. Mostafa; Muctadir, Hossain Muhammad; Shakir, Asif Khan; Imran, Asif; Islam, Saiful

Among different color models HSV, HLS, YIQ, YCbCr, YUV, etc. have been most popular for skin detection. Most of the research done in the field of skin detection has been trained and tested on human images of African, Mongolian and Anglo-Saxon ethnic origins, skin colors of Indian sub-continentals have not been focused separately. Combinatorial algorithms, without affecting asymptotic complexity can be developed using the skin detection concepts of these color models for boosting detection performance. In this paper a comparative study of different combinatorial skin detection algorithms have been made. For training and testing 200 images (skin and non skin) containing pictures of sub-continental male and females have been used to measure the performance of the combinatorial approaches, and considerable development in success rate with True Positive of 99.5% and True Negative of 93.3% have been observed.

The Evolution of DNA-Templated Synthesis as a Tool for Materials Discovery.

PubMed

O'Reilly, Rachel K; Turberfield, Andrew J; Wilks, Thomas R

2017-10-17

Precise control over reactivity and molecular structure is a fundamental goal of the chemical sciences. Billions of years of evolution by natural selection have resulted in chemical systems capable of information storage, self-replication, catalysis, capture and production of light, and even cognition. In all these cases, control over molecular structure is required to achieve a particular function: without structural control, function may be impaired, unpredictable, or impossible. The search for molecules with a desired function is often achieved by synthesizing a combinatorial library, which contains many or all possible combinations of a set of chemical building blocks (BBs), and then screening this library to identify "successful" structures. The largest libraries made by conventional synthesis are currently of the order of 10 8 distinct molecules. To put this in context, there are 10 13 ways of arranging the 21 proteinogenic amino acids in chains up to 10 units long. Given that we know that a number of these compounds have potent biological activity, it would be highly desirable to be able to search them all to identify leads for new drug molecules. Large libraries of oligonucleotides can be synthesized combinatorially and translated into peptides using systems based on biological replication such as mRNA display, with selected molecules identified by DNA sequencing; but these methods are limited to BBs that are compatible with cellular machinery. In order to search the vast tracts of chemical space beyond nucleic acids and natural peptides, an alternative approach is required. DNA-templated synthesis (DTS) could enable us to meet this challenge. DTS controls chemical product formation by using the specificity of DNA hybridization to bring selected reactants into close proximity, and is capable of the programmed synthesis of many distinct products in the same reaction vessel. By making use of dynamic, programmable DNA processes, it is possible to engineer a system that can translate instructions coded as a sequence of DNA bases into a chemical structure-a process analogous to the action of the ribosome in living organisms but with the potential to create a much more chemically diverse set of products. It is also possible to ensure that each product molecule is tagged with its identifying DNA sequence. Compound libraries synthesized in this way can be exposed to selection against suitable targets, enriching successful molecules. The encoding DNA can then be amplified using the polymerase chain reaction and decoded by DNA sequencing. More importantly, the DNA instruction sequences can be mutated and reused during multiple rounds of amplification, translation, and selection. In other words, DTS could be used as the foundation for a system of synthetic molecular evolution, which could allow us to efficiently search a vast chemical space. This has huge potential to revolutionize materials discovery-imagine being able to evolve molecules for light harvesting, or catalysts for CO 2 fixation. The field of DTS has developed to the point where a wide variety of reactions can be performed on a DNA template. Complex architectures and autonomous "DNA robots" have been implemented for the controlled assembly of BBs, and these mechanisms have in turn enabled the one-pot synthesis of large combinatorial libraries. Indeed, DTS libraries are being exploited by pharmaceutical companies and have already found their way into drug lead discovery programs. This Account explores the processes involved in DTS and highlights the challenges that remain in creating a general system for molecular discovery by evolution.

The Evolution of DNA-Templated Synthesis as a Tool for Materials Discovery

PubMed Central

2017-01-01

Conspectus Precise control over reactivity and molecular structure is a fundamental goal of the chemical sciences. Billions of years of evolution by natural selection have resulted in chemical systems capable of information storage, self-replication, catalysis, capture and production of light, and even cognition. In all these cases, control over molecular structure is required to achieve a particular function: without structural control, function may be impaired, unpredictable, or impossible. The search for molecules with a desired function is often achieved by synthesizing a combinatorial library, which contains many or all possible combinations of a set of chemical building blocks (BBs), and then screening this library to identify “successful” structures. The largest libraries made by conventional synthesis are currently of the order of 108 distinct molecules. To put this in context, there are 1013 ways of arranging the 21 proteinogenic amino acids in chains up to 10 units long. Given that we know that a number of these compounds have potent biological activity, it would be highly desirable to be able to search them all to identify leads for new drug molecules. Large libraries of oligonucleotides can be synthesized combinatorially and translated into peptides using systems based on biological replication such as mRNA display, with selected molecules identified by DNA sequencing; but these methods are limited to BBs that are compatible with cellular machinery. In order to search the vast tracts of chemical space beyond nucleic acids and natural peptides, an alternative approach is required. DNA-templated synthesis (DTS) could enable us to meet this challenge. DTS controls chemical product formation by using the specificity of DNA hybridization to bring selected reactants into close proximity, and is capable of the programmed synthesis of many distinct products in the same reaction vessel. By making use of dynamic, programmable DNA processes, it is possible to engineer a system that can translate instructions coded as a sequence of DNA bases into a chemical structure—a process analogous to the action of the ribosome in living organisms but with the potential to create a much more chemically diverse set of products. It is also possible to ensure that each product molecule is tagged with its identifying DNA sequence. Compound libraries synthesized in this way can be exposed to selection against suitable targets, enriching successful molecules. The encoding DNA can then be amplified using the polymerase chain reaction and decoded by DNA sequencing. More importantly, the DNA instruction sequences can be mutated and reused during multiple rounds of amplification, translation, and selection. In other words, DTS could be used as the foundation for a system of synthetic molecular evolution, which could allow us to efficiently search a vast chemical space. This has huge potential to revolutionize materials discovery—imagine being able to evolve molecules for light harvesting, or catalysts for CO2 fixation. The field of DTS has developed to the point where a wide variety of reactions can be performed on a DNA template. Complex architectures and autonomous “DNA robots” have been implemented for the controlled assembly of BBs, and these mechanisms have in turn enabled the one-pot synthesis of large combinatorial libraries. Indeed, DTS libraries are being exploited by pharmaceutical companies and have already found their way into drug lead discovery programs. This Account explores the processes involved in DTS and highlights the challenges that remain in creating a general system for molecular discovery by evolution. PMID:28915003

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

NASA Astrophysics Data System (ADS)

Gaifullin, A. A.

2008-10-01

To every oriented closed combinatorial manifold we assign the set (with repetitions) of isomorphism classes of links of its vertices. The resulting transformation \\mathcal{L} is the main object of study in this paper. We pose an inversion problem for \\mathcal{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 \\mathcal{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 \\mathcal{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 \\xi of a space X, this construction enables us to find explicitly a combinatorial manifold M and a map \\varphi\\colon M\\to X such that \\varphi_* \\lbrack M \\rbrack =r[\\xi] for some positive integer r. The construction is based on resolving singularities of \\xi. 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.

Hybridization of decomposition and local search for multiobjective optimization.

PubMed

Ke, Liangjun; Zhang, Qingfu; Battiti, Roberto

2014-10-01

Combining ideas from evolutionary algorithms, decomposition approaches, and Pareto local search, this paper suggests a simple yet efficient memetic algorithm for combinatorial multiobjective optimization problems: memetic algorithm based on decomposition (MOMAD). It decomposes a combinatorial multiobjective problem into a number of single objective optimization problems using an aggregation method. MOMAD evolves three populations: 1) population P(L) for recording the current solution to each subproblem; 2) population P(P) for storing starting solutions for Pareto local search; and 3) an external population P(E) for maintaining all the nondominated solutions found so far during the search. A problem-specific single objective heuristic can be applied to these subproblems to initialize the three populations. At each generation, a Pareto local search method is first applied to search a neighborhood of each solution in P(P) to update P(L) and P(E). Then a single objective local search is applied to each perturbed solution in P(L) for improving P(L) and P(E), and reinitializing P(P). The procedure is repeated until a stopping condition is met. MOMAD provides a generic hybrid multiobjective algorithmic framework in which problem specific knowledge, well developed single objective local search and heuristics and Pareto local search methods can be hybridized. It is a population based iterative method and thus an anytime algorithm. Extensive experiments have been conducted in this paper to study MOMAD and compare it with some other state-of-the-art algorithms on the multiobjective traveling salesman problem and the multiobjective knapsack problem. The experimental results show that our proposed algorithm outperforms or performs similarly to the best so far heuristics on these two problems.

Fast protein tertiary structure retrieval based on global surface shape similarity.

PubMed

Sael, Lee; Li, Bin; La, David; Fang, Yi; Ramani, Karthik; Rustamov, Raif; Kihara, Daisuke

2008-09-01

Characterization and identification of similar tertiary structure of proteins provides rich information for investigating function and evolution. The importance of structure similarity searches is increasing as structure databases continue to expand, partly due to the structural genomics projects. A crucial drawback of conventional protein structure comparison methods, which compare structures by their main-chain orientation or the spatial arrangement of secondary structure, is that a database search is too slow to be done in real-time. Here we introduce a global surface shape representation by three-dimensional (3D) Zernike descriptors, which represent a protein structure compactly as a series expansion of 3D functions. With this simplified representation, the search speed against a few thousand structures takes less than a minute. To investigate the agreement between surface representation defined by 3D Zernike descriptor and conventional main-chain based representation, a benchmark was performed against a protein classification generated by the combinatorial extension algorithm. Despite the different representation, 3D Zernike descriptor retrieved proteins of the same conformation defined by combinatorial extension in 89.6% of the cases within the top five closest structures. The real-time protein structure search by 3D Zernike descriptor will open up new possibility of large-scale global and local protein surface shape comparison. 2008 Wiley-Liss, Inc.

The Application of Computer-Aided Discovery to Spacecraft Site Selection

NASA Astrophysics Data System (ADS)

Pankratius, V.; Blair, D. M.; Gowanlock, M.; Herring, T.

2015-12-01

The selection of landing and exploration sites for interplanetary robotic or human missions is a complex task. Historically it has been labor-intensive, with large groups of scientists manually interpreting a planetary surface across a variety of datasets to identify potential sites based on science and engineering constraints. This search process can be lengthy, and excellent sites may get overlooked when the aggregate value of site selection criteria is non-obvious or non-intuitive. As planetary data collection leads to Big Data repositories and a growing set of selection criteria, scientists will face a combinatorial search space explosion that requires scalable, automated assistance. We are currently exploring more general computer-aided discovery techniques in the context of planetary surface deformation phenomena that can lend themselves to application in the landing site search problem. In particular, we are developing a general software framework that addresses key difficulties: characterizing a given phenomenon or site based on data gathered from multiple instruments (e.g. radar interferometry, gravity, thermal maps, or GPS time series), and examining a variety of possible workflows whose individual configurations are optimized to isolate different features. The framework allows algorithmic pipelines and hypothesized models to be perturbed or permuted automatically within well-defined bounds established by the scientist. For example, even simple choices for outlier and noise handling or data interpolation can drastically affect the detectability of certain features. These techniques aim to automate repetitive tasks that scientists routinely perform in exploratory analysis, and make them more efficient and scalable by executing them in parallel in the cloud. We also explore ways in which machine learning can be combined with human feedback to prune the search space and converge to desirable results. Acknowledgements: We acknowledge support from NASA AIST NNX15AG84G (PI V. Pankratius)

Closed-loop control of cellular functions using combinatory drugs guided by a stochastic search algorithm

PubMed Central

Wong, Pak Kin; Yu, Fuqu; Shahangian, Arash; Cheng, Genhong; Sun, Ren; Ho, Chih-Ming

2008-01-01

A mixture of drugs is often more effective than using a single effector. However, it is extremely challenging to identify potent drug combinations by trial and error because of the large number of possible combinations and the inherent complexity of the underlying biological network. With a closed-loop optimization modality, we experimentally demonstrate effective searching for potent drug combinations for controlling cellular functions through a large parametric space. Only tens of iterations out of one hundred thousand possible trials were needed to determine a potent combination of drugs for inhibiting vesicular stomatitis virus infection of NIH 3T3 fibroblasts. In addition, the drug combination reduced the required dosage by ≈10-fold compared with individual drugs. In another example, a potent mixture was identified in thirty iterations out of a possible million combinations of six cytokines that regulate the activity of nuclear factor kappa B in 293T cells. The closed-loop optimization approach possesses the potential of being an effective approach for manipulating a wide class of biological systems. PMID:18356295

Predictive Array Design. A method for sampling combinatorial chemistry library space.

PubMed

Lipkin, M J; Rose, V S; Wood, J

2002-01-01

A method, Predictive Array Design, is presented for sampling combinatorial chemistry space and selecting a subarray for synthesis based on the experimental design method of Latin Squares. The method is appropriate for libraries with three sites of variation. Libraries with four sites of variation can be designed using the Graeco-Latin Square. Simulated annealing is used to optimise the physicochemical property profile of the sub-array. The sub-array can be used to make predictions of the activity of compounds in the all combinations array if we assume each monomer has a relatively constant contribution to activity and that the activity of a compound is composed of the sum of the activities of its constitutive monomers.

A novel computational model to probe visual search deficits during motor performance

PubMed Central

Singh, Tarkeshwar; Fridriksson, Julius; Perry, Christopher M.; Tryon, Sarah C.; Ross, Angela; Fritz, Stacy

2016-01-01

Successful execution of many motor skills relies on well-organized visual search (voluntary eye movements that actively scan the environment for task-relevant information). Although impairments of visual search that result from brain injuries are linked to diminished motor performance, the neural processes that guide visual search within this context remain largely unknown. The first objective of this study was to examine how visual search in healthy adults and stroke survivors is used to guide hand movements during the Trail Making Test (TMT), a neuropsychological task that is a strong predictor of visuomotor and cognitive deficits. Our second objective was to develop a novel computational model to investigate combinatorial interactions between three underlying processes of visual search (spatial planning, working memory, and peripheral visual processing). We predicted that stroke survivors would exhibit deficits in integrating the three underlying processes, resulting in deteriorated overall task performance. We found that normal TMT performance is associated with patterns of visual search that primarily rely on spatial planning and/or working memory (but not peripheral visual processing). Our computational model suggested that abnormal TMT performance following stroke is associated with impairments of visual search that are characterized by deficits integrating spatial planning and working memory. This innovative methodology provides a novel framework for studying how the neural processes underlying visual search interact combinatorially to guide motor performance. NEW & NOTEWORTHY Visual search has traditionally been studied in cognitive and perceptual paradigms, but little is known about how it contributes to visuomotor performance. We have developed a novel computational model to examine how three underlying processes of visual search (spatial planning, working memory, and peripheral visual processing) contribute to visual search during a visuomotor task. We show that deficits integrating spatial planning and working memory underlie abnormal performance in stroke survivors with frontoparietal damage. PMID:27733596

Set-Based Discrete Particle Swarm Optimization Based on Decomposition for Permutation-Based Multiobjective Combinatorial Optimization Problems.

PubMed

Yu, Xue; Chen, Wei-Neng; Gu, Tianlong; Zhang, Huaxiang; Yuan, Huaqiang; Kwong, Sam; Zhang, Jun

2018-07-01

This paper studies a specific class of multiobjective combinatorial optimization problems (MOCOPs), namely the permutation-based MOCOPs. Many commonly seen MOCOPs, e.g., multiobjective traveling salesman problem (MOTSP), multiobjective project scheduling problem (MOPSP), belong to this problem class and they can be very different. However, as the permutation-based MOCOPs share the inherent similarity that the structure of their search space is usually in the shape of a permutation tree, this paper proposes a generic multiobjective set-based particle swarm optimization methodology based on decomposition, termed MS-PSO/D. In order to coordinate with the property of permutation-based MOCOPs, MS-PSO/D utilizes an element-based representation and a constructive approach. Through this, feasible solutions under constraints can be generated step by step following the permutation-tree-shaped structure. And problem-related heuristic information is introduced in the constructive approach for efficiency. In order to address the multiobjective optimization issues, the decomposition strategy is employed, in which the problem is converted into multiple single-objective subproblems according to a set of weight vectors. Besides, a flexible mechanism for diversity control is provided in MS-PSO/D. Extensive experiments have been conducted to study MS-PSO/D on two permutation-based MOCOPs, namely the MOTSP and the MOPSP. Experimental results validate that the proposed methodology is promising.

Proteomic analysis of sweet algerian apricot kernels (Prunus armeniaca L.) by combinatorial peptide ligand libraries and LC-MS/MS.

PubMed

Ghorab, Hamida; Lammi, Carmen; Arnoldi, Anna; Kabouche, Zahia; Aiello, Gilda

2018-01-15

An investigation on the proteome of the sweet kernel of apricot, based on equalisation with combinatorial peptide ligand libraries (CPLLs), SDS-PAGE, nLC-ESI-MS/MS, and database search, permitted identifying 175 proteins. Gene ontology analysis indicated that their main molecular functions are in nucleotide binding (20.9%), hydrolase activities (10.6%), kinase activities (7%), and catalytic activity (5.6%). A protein-protein association network analysis using STRING software permitted to build an interactomic map of all detected proteins, characterised by 34 interactions. In order to forecast the potential health benefits deriving from the consumption of these proteins, the two most abundant, i.e. Prunin 1 and 2, were enzymatically digested in silico predicting 10 and 14 peptides, respectively. Searching their sequences in the database BIOPEP, it was possible to suggest a variety of bioactivities, including dipeptidyl peptidase-IV (DPP-IV) and angiotensin converting enzyme I (ACE) inhibition, glucose uptake stimulation and antioxidant properties. Copyright © 2017 Elsevier Ltd. All rights reserved.

Combinatorial invariants and covariants as tools for conical intersections.

PubMed

Ryb, Itai; Baer, Roi

2004-12-01

The combinatorial invariant and covariant are introduced as practical tools for analysis of conical intersections in molecules. The combinatorial invariant is a quantity depending on adiabatic electronic states taken at discrete nuclear configuration points. It is invariant to the phase choice (gauge) of these states. In the limit that the points trace a loop in nuclear configuration space, the value of the invariant approaches the corresponding Berry phase factor. The Berry phase indicates the presence of an odd or even number of conical intersections on surfaces bounded by these loops. Based on the combinatorial invariant, we develop a computationally simple and efficient method for locating conical intersections. The method is robust due to its use of gauge invariant nature. It does not rely on the landscape of intersecting potential energy surfaces nor does it require the computation of nonadiabatic couplings. We generalize the concept to open paths and combinatorial covariants for higher dimensions obtaining a technique for the construction of the gauge-covariant adiabatic-diabatic transformation matrix. This too does not make use of nonadiabatic couplings. The importance of using gauge-covariant expressions is underlined throughout. These techniques can be readily implemented by standard quantum chemistry codes. (c) 2004 American Institute of Physics.

Geometric analysis characterizes molecular rigidity in generic and non-generic protein configurations

PubMed Central

Budday, Dominik; Leyendecker, Sigrid; van den Bedem, Henry

2015-01-01

Proteins operate and interact with partners by dynamically exchanging between functional substates of a conformational ensemble on a rugged free energy landscape. Understanding how these substates are linked by coordinated, collective motions requires exploring a high-dimensional space, which remains a tremendous challenge. While molecular dynamics simulations can provide atomically detailed insight into the dynamics, computational demands to adequately sample conformational ensembles of large biomolecules and their complexes often require tremendous resources. Kinematic models can provide high-level insights into conformational ensembles and molecular rigidity beyond the reach of molecular dynamics by reducing the dimensionality of the search space. Here, we model a protein as a kinematic linkage and present a new geometric method to characterize molecular rigidity from the constraint manifold Q and its tangent space Q at the current configuration q. In contrast to methods based on combinatorial constraint counting, our method is valid for both generic and non-generic, e.g., singular configurations. Importantly, our geometric approach provides an explicit basis for collective motions along floppy modes, resulting in an efficient procedure to probe conformational space. An atomically detailed structural characterization of coordinated, collective motions would allow us to engineer or allosterically modulate biomolecules by selectively stabilizing conformations that enhance or inhibit function with broad implications for human health. PMID:26213417

Geometric analysis characterizes molecular rigidity in generic and non-generic protein configurations

NASA Astrophysics Data System (ADS)

Budday, Dominik; Leyendecker, Sigrid; van den Bedem, Henry

2015-10-01

Proteins operate and interact with partners by dynamically exchanging between functional substates of a conformational ensemble on a rugged free energy landscape. Understanding how these substates are linked by coordinated, collective motions requires exploring a high-dimensional space, which remains a tremendous challenge. While molecular dynamics simulations can provide atomically detailed insight into the dynamics, computational demands to adequately sample conformational ensembles of large biomolecules and their complexes often require tremendous resources. Kinematic models can provide high-level insights into conformational ensembles and molecular rigidity beyond the reach of molecular dynamics by reducing the dimensionality of the search space. Here, we model a protein as a kinematic linkage and present a new geometric method to characterize molecular rigidity from the constraint manifold Q and its tangent space Tq Q at the current configuration q. In contrast to methods based on combinatorial constraint counting, our method is valid for both generic and non-generic, e.g., singular configurations. Importantly, our geometric approach provides an explicit basis for collective motions along floppy modes, resulting in an efficient procedure to probe conformational space. An atomically detailed structural characterization of coordinated, collective motions would allow us to engineer or allosterically modulate biomolecules by selectively stabilizing conformations that enhance or inhibit function with broad implications for human health.

Combinatorial FSK modulation for power-efficient high-rate communications

NASA Technical Reports Server (NTRS)

Wagner, Paul K.; Budinger, James M.; Vanderaar, Mark J.

1991-01-01

Deep-space and satellite communications systems must be capable of conveying high-rate data accurately with low transmitter power, often through dispersive channels. A class of noncoherent Combinatorial Frequency Shift Keying (CFSK) modulation schemes is investigated which address these needs. The bit error rate performance of this class of modulation formats is analyzed and compared to the more traditional modulation types. Candidate modulator, demodulator, and digital signal processing (DSP) hardware structures are examined in detail. System-level issues are also discussed.

Statistical Mechanics of Combinatorial Auctions

NASA Astrophysics Data System (ADS)

Galla, Tobias; Leone, Michele; Marsili, Matteo; Sellitto, Mauro; Weigt, Martin; Zecchina, Riccardo

2006-09-01

Combinatorial auctions are formulated as frustrated lattice gases on sparse random graphs, allowing the determination of the optimal revenue by methods of statistical physics. Transitions between computationally easy and hard regimes are found and interpreted in terms of the geometric structure of the space of solutions. We introduce an iterative algorithm to solve intermediate and large instances, and discuss competing states of optimal revenue and maximal number of satisfied bidders. The algorithm can be generalized to the hard phase and to more sophisticated auction protocols.

Natural products and combinatorial chemistry: back to the future.

PubMed

Ortholand, Jean-Yves; Ganesan, A

2004-06-01

The introduction of high-throughput synthesis and combinatorial chemistry has precipitated a global decline in the screening of natural products by the pharmaceutical industry. Some companies terminated their natural products program, despite the unproven success of the new technologies. This was a premature decision, as natural products have a long history of providing important medicinal agents. Furthermore, they occupy a complementary region of chemical space compared with the typical synthetic compound library. For these reasons, the interest in natural products has been rekindled. Various approaches have evolved that combine the power of natural products and organic chemistry, ranging from the combinatorial total synthesis of analogues to the exploration of natural product scaffolds and the design of completely unnatural molecules that resemble natural products in their molecular characteristics.

AFLOW: An Automatic Framework for High-throughput Materials Discovery

DTIC Science & Technology

2011-11-14

computational ma- terials HT applications include combinatorial discov- ery of superconductors [1], Pareto-optimal search for alloys and catalysts [14, 15...Ducastelle, D. Gratias, Physica A 128 (1984) 334–350. [37] D. de Fontaine, Cluster Approach to Order- disorder Transfor- mations in Alloys, volume 47 of

Creating the New from the Old: Combinatorial Libraries Generation with Machine-Learning-Based Compound Structure Optimization.

PubMed

Podlewska, Sabina; Czarnecki, Wojciech M; Kafel, Rafał; Bojarski, Andrzej J

2017-02-27

The growing computational abilities of various tools that are applied in the broadly understood field of computer-aided drug design have led to the extreme popularity of virtual screening in the search for new biologically active compounds. Most often, the source of such molecules consists of commercially available compound databases, but they can also be searched for within the libraries of structures generated in silico from existing ligands. Various computational combinatorial approaches are based solely on the chemical structure of compounds, using different types of substitutions for new molecules formation. In this study, the starting point for combinatorial library generation was the fingerprint referring to the optimal substructural composition in terms of the activity toward a considered target, which was obtained using a machine learning-based optimization procedure. The systematic enumeration of all possible connections between preferred substructures resulted in the formation of target-focused libraries of new potential ligands. The compounds were initially assessed by machine learning methods using a hashed fingerprint to represent molecules; the distribution of their physicochemical properties was also investigated, as well as their synthetic accessibility. The examination of various fingerprints and machine learning algorithms indicated that the Klekota-Roth fingerprint and support vector machine were an optimal combination for such experiments. This study was performed for 8 protein targets, and the obtained compound sets and their characterization are publically available at http://skandal.if-pan.krakow.pl/comb_lib/ .

A Rapid Python-Based Methodology for Target-Focused Combinatorial Library Design.

PubMed

Li, Shiliang; Song, Yuwei; Liu, Xiaofeng; Li, Honglin

2016-01-01

The chemical space is so vast that only a small portion of it has been examined. As a complementary approach to systematically probe the chemical space, virtual combinatorial library design has extended enormous impacts on generating novel and diverse structures for drug discovery. Despite the favorable contributions, high attrition rates in drug development that mainly resulted from lack of efficacy and side effects make it increasingly challenging to discover good chemical starting points. In most cases, focused libraries, which are restricted to particular regions of the chemical space, are deftly exploited to maximize hit rate and improve efficiency at the beginning of the drug discovery and drug development pipeline. This paper presented a valid methodology for fast target-focused combinatorial library design in both reaction-based and production-based ways with the library creating rates of approximately 70,000 molecules per second. Simple, quick and convenient operating procedures are the specific features of the method. SHAFTS, a hybrid 3D similarity calculation software, was embedded to help refine the size of the libraries and improve hit rates. Two target-focused (p38-focused and COX2-focused) libraries were constructed efficiently in this study. This rapid library enumeration method is portable and applicable to any other targets for good chemical starting points identification collaborated with either structure-based or ligand-based virtual screening.

On the Integration of Logic Programming and Functional Programming.

DTIC Science & Technology

1985-06-01

be performed with simple handtools and devices. However, if the problem is more complex, say involving the cylinders, camshaft , or drive train, then...f(x,x) with f(y, g(y)), and would bind x to g(x) (Ref. 7]. The problem, of course, is that the attempt to prune the search tree allows circularity...combinatorial-explosion, since the search trees generated can grow very unpredictably (Re£. 19: p. 2293. Somewhat akin to the halting problem, it means that a

Bridging the Gap Between Theory and Practice: Structure and Randomization in Large Scale Combinatorial Search

DTIC Science & Technology

2012-01-17

PROJECT NUMBER 5e. TASK NUMBER 5f. WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) 8. PERFORMING ORGANIZATION...world problems. Our work brings together techniques from constraint programming, mathematical programming, and satisfiability in a symbiotic way to...power-­‐law  search  tree  model  for  complete  or  exact  methods     (See [9] for a detailed description of this work and

Uncertainty management by relaxation of conflicting constraints in production process scheduling

NASA Technical Reports Server (NTRS)

Dorn, Juergen; Slany, Wolfgang; Stary, Christian

1992-01-01

Mathematical-analytical methods as used in Operations Research approaches are often insufficient for scheduling problems. This is due to three reasons: the combinatorial complexity of the search space, conflicting objectives for production optimization, and the uncertainty in the production process. Knowledge-based techniques, especially approximate reasoning and constraint relaxation, are promising ways to overcome these problems. A case study from an industrial CIM environment, namely high-grade steel production, is presented to demonstrate how knowledge-based scheduling with the desired capabilities could work. By using fuzzy set theory, the applied knowledge representation technique covers the uncertainty inherent in the problem domain. Based on this knowledge representation, a classification of jobs according to their importance is defined which is then used for the straightforward generation of a schedule. A control strategy which comprises organizational, spatial, temporal, and chemical constraints is introduced. The strategy supports the dynamic relaxation of conflicting constraints in order to improve tentative schedules.

MDTS: automatic complex materials design using Monte Carlo tree search.

PubMed

M Dieb, Thaer; Ju, Shenghong; Yoshizoe, Kazuki; Hou, Zhufeng; Shiomi, Junichiro; Tsuda, Koji

2017-01-01

Complex materials design is often represented as a black-box combinatorial optimization problem. In this paper, we present a novel python library called MDTS (Materials Design using Tree Search). Our algorithm employs a Monte Carlo tree search approach, which has shown exceptional performance in computer Go game. Unlike evolutionary algorithms that require user intervention to set parameters appropriately, MDTS has no tuning parameters and works autonomously in various problems. In comparison to a Bayesian optimization package, our algorithm showed competitive search efficiency and superior scalability. We succeeded in designing large Silicon-Germanium (Si-Ge) alloy structures that Bayesian optimization could not deal with due to excessive computational cost. MDTS is available at https://github.com/tsudalab/MDTS.

MDTS: automatic complex materials design using Monte Carlo tree search

NASA Astrophysics Data System (ADS)

Dieb, Thaer M.; Ju, Shenghong; Yoshizoe, Kazuki; Hou, Zhufeng; Shiomi, Junichiro; Tsuda, Koji

2017-12-01

Complex materials design is often represented as a black-box combinatorial optimization problem. In this paper, we present a novel python library called MDTS (Materials Design using Tree Search). Our algorithm employs a Monte Carlo tree search approach, which has shown exceptional performance in computer Go game. Unlike evolutionary algorithms that require user intervention to set parameters appropriately, MDTS has no tuning parameters and works autonomously in various problems. In comparison to a Bayesian optimization package, our algorithm showed competitive search efficiency and superior scalability. We succeeded in designing large Silicon-Germanium (Si-Ge) alloy structures that Bayesian optimization could not deal with due to excessive computational cost. MDTS is available at https://github.com/tsudalab/MDTS.

Advanced fitness landscape analysis and the performance of memetic algorithms.

PubMed

Merz, Peter

2004-01-01

Memetic algorithms (MAs) have demonstrated very effective in combinatorial optimization. This paper offers explanations as to why this is so by investigating the performance of MAs in terms of efficiency and effectiveness. A special class of MAs is used to discuss efficiency and effectiveness for local search and evolutionary meta-search. It is shown that the efficiency of MAs can be increased drastically with the use of domain knowledge. However, effectiveness highly depends on the structure of the problem. As is well-known, identifying this structure is made easier with the notion of fitness landscapes: the local properties of the fitness landscape strongly influence the effectiveness of the local search while the global properties strongly influence the effectiveness of the evolutionary meta-search. This paper also introduces new techniques for analyzing the fitness landscapes of combinatorial problems; these techniques focus on the investigation of random walks in the fitness landscape starting at locally optimal solutions as well as on the escape from the basins of attractions of current local optima. It is shown for NK-landscapes and landscapes of the unconstrained binary quadratic programming problem (BQP) that a random walk to another local optimum can be used to explain the efficiency of recombination in comparison to mutation. Moreover, the paper shows that other aspects like the size of the basins of attractions of local optima are important for the efficiency of MAs and a local search escape analysis is proposed. These simple analysis techniques have several advantages over previously proposed statistical measures and provide valuable insight into the behaviour of MAs on different kinds of landscapes.

Toward a characterization of landscapes of combinatorial optimization problems, with special attention to the phylogeny problem.

PubMed

Charleston, M A

1995-01-01

This article introduces a coherent language base for describing and working with characteristics of combinatorial optimization problems, which is at once general enough to be used in all such problems and precise enough to allow subtle concepts in this field to be discussed unambiguously. An example is provided of how this nomenclature is applied to an instance of the phylogeny problem. Also noted is the beneficial effect, on the landscape of the solution space, of transforming the observed data to account for multiple changes of character state.

Aerospace Applications of Integer and Combinatorial Optimization

NASA Technical Reports Server (NTRS)

Padula, S. L.; Kincaid, R. K.

1995-01-01

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in formulating and solving integer and combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem, for example, seeks the optimal locations for vibration-damping devices on an orbiting platform and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Aerospace applications on integer and combinatorial optimization

NASA Technical Reports Server (NTRS)

Padula, S. L.; Kincaid, R. K.

1995-01-01

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in formulating and solving integer and combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem. for example, seeks the optimal locations for vibration-damping devices on an orbiting platform and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Towards a theory of automated elliptic mesh generation

NASA Technical Reports Server (NTRS)

Cordova, J. Q.

1992-01-01

The theory of elliptic mesh generation is reviewed and the fundamental problem of constructing computational space is discussed. It is argued that the construction of computational space is an NP-Complete problem and therefore requires a nonstandard approach for its solution. This leads to the development of graph-theoretic, combinatorial optimization and integer programming algorithms. Methods for the construction of two dimensional computational space are presented.

Advances in metaheuristics for gene selection and classification of microarray data.

PubMed

Duval, Béatrice; Hao, Jin-Kao

2010-01-01

Gene selection aims at identifying a (small) subset of informative genes from the initial data in order to obtain high predictive accuracy for classification. Gene selection can be considered as a combinatorial search problem and thus be conveniently handled with optimization methods. In this article, we summarize some recent developments of using metaheuristic-based methods within an embedded approach for gene selection. In particular, we put forward the importance and usefulness of integrating problem-specific knowledge into the search operators of such a method. To illustrate the point, we explain how ranking coefficients of a linear classifier such as support vector machine (SVM) can be profitably used to reinforce the search efficiency of Local Search and Evolutionary Search metaheuristic algorithms for gene selection and classification.

Virtual screening of selective multitarget kinase inhibitors by combinatorial support vector machines.

PubMed

Ma, X H; Wang, R; Tan, C Y; Jiang, Y Y; Lu, T; Rao, H B; Li, X Y; Go, M L; Low, B C; Chen, Y Z

2010-10-04

Multitarget agents have been increasingly explored for enhancing efficacy and reducing countertarget activities and toxicities. Efficient virtual screening (VS) tools for searching selective multitarget agents are desired. Combinatorial support vector machines (C-SVM) were tested as VS tools for searching dual-inhibitors of 11 combinations of 9 anticancer kinase targets (EGFR, VEGFR, PDGFR, Src, FGFR, Lck, CDK1, CDK2, GSK3). C-SVM trained on 233-1,316 non-dual-inhibitors correctly identified 26.8%-57.3% (majority >36%) of the 56-230 intra-kinase-group dual-inhibitors (equivalent to the 50-70% yields of two independent individual target VS tools), and 12.2% of the 41 inter-kinase-group dual-inhibitors. C-SVM were fairly selective in misidentifying as dual-inhibitors 3.7%-48.1% (majority <20%) of the 233-1,316 non-dual-inhibitors of the same kinase pairs and 0.98%-4.77% of the 3,971-5,180 inhibitors of other kinases. C-SVM produced low false-hit rates in misidentifying as dual-inhibitors 1,746-4,817 (0.013%-0.036%) of the 13.56 M PubChem compounds, 12-175 (0.007%-0.104%) of the 168 K MDDR compounds, and 0-84 (0.0%-2.9%) of the 19,495-38,483 MDDR compounds similar to the known dual-inhibitors. C-SVM was compared to other VS methods Surflex-Dock, DOCK Blaster, kNN and PNN against the same sets of kinase inhibitors and the full set or subset of the 1.02 M Zinc clean-leads data set. C-SVM produced comparable dual-inhibitor yields, slightly better false-hit rates for kinase inhibitors, and significantly lower false-hit rates for the Zinc clean-leads data set. Combinatorial SVM showed promising potential for searching selective multitarget agents against intra-kinase-group kinases without explicit knowledge of multitarget agents.

Searching the Force Field Electrostatic Multipole Parameter Space.

PubMed

Jakobsen, Sofie; Jensen, Frank

2016-04-12

We show by tensor decomposition analyses that the molecular electrostatic potential for amino acid peptide models has an effective rank less than twice the number of atoms. This rank indicates the number of parameters that can be derived from the electrostatic potential in a statistically significant way. Using this as a guideline, we investigate different strategies for deriving a reduced set of atomic charges, dipoles, and quadrupoles capable of reproducing the reference electrostatic potential with a low error. A full combinatorial search of selected parameter subspaces for N-methylacetamide and a cysteine peptide model indicates that there are many different parameter sets capable of providing errors close to that of the global minimum. Among the different reduced multipole parameter sets that have low errors, there is consensus that atoms involved in π-bonding require higher order multipole moments. The possible correlation between multipole parameters is investigated by exhaustive searches of combinations of up to four parameters distributed in all possible ways on all possible atomic sites. These analyses show that there is no advantage in considering combinations of multipoles compared to a simple approach where the importance of each multipole moment is evaluated sequentially. When combined with possible weighting factors related to the computational efficiency of each type of multipole moment, this may provide a systematic strategy for determining a computational efficient representation of the electrostatic component in force field calculations.

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

PubMed Central

Zhou, Nannan; Xu, Yuan; Liu, Xian; Wang, Yulan; Peng, Jianlong; Luo, Xiaomin; Zheng, Mingyue; Chen, Kaixian; Jiang, Hualiang

2015-01-01

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. PMID:26110383

The Building Game: From Enumerative Combinatorics to Conformational Diffusion

NASA Astrophysics Data System (ADS)

Johnson-Chyzhykov, Daniel; Menon, Govind

2016-08-01

We study a discrete attachment model for the self-assembly of polyhedra called the building game. We investigate two distinct aspects of the model: (i) enumerative combinatorics of the intermediate states and (ii) a notion of Brownian motion for the polyhedral linkage defined by each intermediate that we term conformational diffusion. The combinatorial configuration space of the model is computed for the Platonic, Archimedean, and Catalan solids of up to 30 faces, and several novel enumerative results are generated. These represent the most exhaustive computations of this nature to date. We further extend the building game to include geometric information. The combinatorial structure of each intermediate yields a systems of constraints specifying a polyhedral linkage and its moduli space. We use a random walk to simulate a reflected Brownian motion in each moduli space. Empirical statistics of the random walk may be used to define the rates of transition for a Markov process modeling the process of self-assembly.

Mapping of Drug-like Chemical Universe with Reduced Complexity Molecular Frameworks.

PubMed

Kontijevskis, Aleksejs

2017-04-24

The emergence of the DNA-encoded chemical libraries (DEL) field in the past decade has attracted the attention of the pharmaceutical industry as a powerful mechanism for the discovery of novel drug-like hits for various biological targets. Nuevolution Chemetics technology enables DNA-encoded synthesis of billions of chemically diverse drug-like small molecule compounds, and the efficient screening and optimization of these, facilitating effective identification of drug candidates at an unprecedented speed and scale. Although many approaches have been developed by the cheminformatics community for the analysis and visualization of drug-like chemical space, most of them are restricted to the analysis of a maximum of a few millions of compounds and cannot handle collections of 10 8 -10 12 compounds typical for DELs. To address this big chemical data challenge, we developed the Reduced Complexity Molecular Frameworks (RCMF) methodology as an abstract and very general way of representing chemical structures. By further introducing RCMF descriptors, we constructed a global framework map of drug-like chemical space and demonstrated how chemical space occupied by multi-million-member drug-like Chemetics DNA-encoded libraries and virtual combinatorial libraries with >10 12 members could be analyzed and mapped without a need for library enumeration. We further validate the approach by performing RCMF-based searches in a drug-like chemical universe and mapping Chemetics library selection outputs for LSD1 targets on a global framework chemical space map.

A Matter of Timing: Identifying Significant Multi-Dose Radiotherapy Improvements by Numerical Simulation and Genetic Algorithm Search

PubMed Central

Angus, Simon D.; Piotrowska, Monika Joanna

2014-01-01

Multi-dose radiotherapy protocols (fraction dose and timing) currently used in the clinic are the product of human selection based on habit, received wisdom, physician experience and intra-day patient timetabling. However, due to combinatorial considerations, the potential treatment protocol space for a given total dose or treatment length is enormous, even for relatively coarse search; well beyond the capacity of traditional in-vitro methods. In constrast, high fidelity numerical simulation of tumor development is well suited to the challenge. Building on our previous single-dose numerical simulation model of EMT6/Ro spheroids, a multi-dose irradiation response module is added and calibrated to the effective dose arising from 18 independent multi-dose treatment programs available in the experimental literature. With the developed model a constrained, non-linear, search for better performing cadidate protocols is conducted within the vicinity of two benchmarks by genetic algorithm (GA) techniques. After evaluating less than 0.01% of the potential benchmark protocol space, candidate protocols were identified by the GA which conferred an average of 9.4% (max benefit 16.5%) and 7.1% (13.3%) improvement (reduction) on tumour cell count compared to the two benchmarks, respectively. Noticing that a convergent phenomenon of the top performing protocols was their temporal synchronicity, a further series of numerical experiments was conducted with periodic time-gap protocols (10 h to 23 h), leading to the discovery that the performance of the GA search candidates could be replicated by 17–18 h periodic candidates. Further dynamic irradiation-response cell-phase analysis revealed that such periodicity cohered with latent EMT6/Ro cell-phase temporal patterning. Taken together, this study provides powerful evidence towards the hypothesis that even simple inter-fraction timing variations for a given fractional dose program may present a facile, and highly cost-effecitive means of significantly improving clinical efficacy. PMID:25460164

A matter of timing: identifying significant multi-dose radiotherapy improvements by numerical simulation and genetic algorithm search.

PubMed

Angus, Simon D; Piotrowska, Monika Joanna

2014-01-01

Multi-dose radiotherapy protocols (fraction dose and timing) currently used in the clinic are the product of human selection based on habit, received wisdom, physician experience and intra-day patient timetabling. However, due to combinatorial considerations, the potential treatment protocol space for a given total dose or treatment length is enormous, even for relatively coarse search; well beyond the capacity of traditional in-vitro methods. In constrast, high fidelity numerical simulation of tumor development is well suited to the challenge. Building on our previous single-dose numerical simulation model of EMT6/Ro spheroids, a multi-dose irradiation response module is added and calibrated to the effective dose arising from 18 independent multi-dose treatment programs available in the experimental literature. With the developed model a constrained, non-linear, search for better performing cadidate protocols is conducted within the vicinity of two benchmarks by genetic algorithm (GA) techniques. After evaluating less than 0.01% of the potential benchmark protocol space, candidate protocols were identified by the GA which conferred an average of 9.4% (max benefit 16.5%) and 7.1% (13.3%) improvement (reduction) on tumour cell count compared to the two benchmarks, respectively. Noticing that a convergent phenomenon of the top performing protocols was their temporal synchronicity, a further series of numerical experiments was conducted with periodic time-gap protocols (10 h to 23 h), leading to the discovery that the performance of the GA search candidates could be replicated by 17-18 h periodic candidates. Further dynamic irradiation-response cell-phase analysis revealed that such periodicity cohered with latent EMT6/Ro cell-phase temporal patterning. Taken together, this study provides powerful evidence towards the hypothesis that even simple inter-fraction timing variations for a given fractional dose program may present a facile, and highly cost-effecitive means of significantly improving clinical efficacy.

Experimental Design for Combinatorial and High Throughput Materials Development

NASA Astrophysics Data System (ADS)

Cawse, James N.

2002-12-01

In the past decade, combinatorial and high throughput experimental methods have revolutionized the pharmaceutical industry, allowing researchers to conduct more experiments in a week than was previously possible in a year. Now high throughput experimentation is rapidly spreading from its origins in the pharmaceutical world to larger industrial research establishments such as GE and DuPont, and even to smaller companies and universities. Consequently, researchers need to know the kinds of problems, desired outcomes, and appropriate patterns for these new strategies. Editor James Cawse's far-reaching study identifies and applies, with specific examples, these important new principles and techniques. Experimental Design for Combinatorial and High Throughput Materials Development progresses from methods that are now standard, such as gradient arrays, to mathematical developments that are breaking new ground. The former will be particularly useful to researchers entering the field, while the latter should inspire and challenge advanced practitioners. The book's contents are contributed by leading researchers in their respective fields. Chapters include: -High Throughput Synthetic Approaches for the Investigation of Inorganic Phase Space -Combinatorial Mapping of Polymer Blends Phase Behavior -Split-Plot Designs -Artificial Neural Networks in Catalyst Development -The Monte Carlo Approach to Library Design and Redesign This book also contains over 200 useful charts and drawings. Industrial chemists, chemical engineers, materials scientists, and physicists working in combinatorial and high throughput chemistry will find James Cawse's study to be an invaluable resource.

Combinatorial pulse position modulation for power-efficient free-space laser communications

NASA Technical Reports Server (NTRS)

Budinger, James M.; Vanderaar, M.; Wagner, P.; Bibyk, Steven

1993-01-01

A new modulation technique called combinatorial pulse position modulation (CPPM) is presented as a power-efficient alternative to quaternary pulse position modulation (QPPM) for direct-detection, free-space laser communications. The special case of 16C4PPM is compared to QPPM in terms of data throughput and bit error rate (BER) performance for similar laser power and pulse duty cycle requirements. The increased throughput from CPPM enables the use of forward error corrective (FEC) encoding for a net decrease in the amount of laser power required for a given data throughput compared to uncoded QPPM. A specific, practical case of coded CPPM is shown to reduce the amount of power required to transmit and receive a given data sequence by at least 4.7 dB. Hardware techniques for maximum likelihood detection and symbol timing recovery are presented.

Combinatorial study of Ni-Ti-Pt ternary metal gate electrodes on HfO{sub 2} for the advanced gate stack

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chang, K.-S.; Green, M. L.; Suehle, J.

2006-10-02

The authors have fabricated combinatorial Ni-Ti-Pt ternary metal gate thin film libraries on HfO{sub 2} using magnetron co-sputtering to investigate flatband voltage shift ({delta}V{sub fb}), work function ({phi}{sub m}), and leakage current density (J{sub L}) variations. A more negative {delta}V{sub fb} is observed close to the Ti-rich corner than at the Ni- and Pt-rich corners, implying smaller {phi}{sub m} near the Ti-rich corners and higher {phi}{sub m} near the Ni- and Pt-rich corners. In addition, measured J{sub L} values can be explained consistently with the observed {phi}{sub m} variations. Combinatorial methodologies prove to be useful in surveying the large compositionalmore » space of ternary alloy metal gate electrode systems.« less

Learning to Predict Combinatorial Structures

NASA Astrophysics Data System (ADS)

Vembu, Shankar

2009-12-01

The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make different assumptions to ensure efficient, polynomial time estimation of model parameters. For several combinatorial structures, including cycles, partially ordered sets, permutations and other graph classes, these assumptions do not hold. In this thesis, we address the problem of designing learning algorithms for predicting combinatorial structures by introducing two new assumptions: (i) The first assumption is that a particular counting problem can be solved efficiently. The consequence is a generalisation of the classical ridge regression for structured prediction. (ii) The second assumption is that a particular sampling problem can be solved efficiently. The consequence is a new technique for designing and analysing probabilistic structured prediction models. These results can be applied to solve several complex learning problems including but not limited to multi-label classification, multi-category hierarchical classification, and label ranking.

Application of combinatorial biocatalysis for a unique ring expansion of dihydroxymethylzearalenone.

PubMed

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.

Energy Landscapes for the Self-Assembly of Supramolecular Polyhedra

NASA Astrophysics Data System (ADS)

Russell, Emily R.; Menon, Govind

2016-06-01

We develop a mathematical model for the energy landscape of polyhedral supramolecular cages recently synthesized by self-assembly (Sun et al. in Science 328:1144-1147, 2010). Our model includes two essential features of the experiment: (1) geometry of the organic ligands and metallic ions; and (2) combinatorics. The molecular geometry is used to introduce an energy that favors square-planar vertices (modeling {Pd}^{2+} ions) and bent edges with one of two preferred opening angles (modeling boomerang-shaped ligands of two types). The combinatorics of the model involve two-colorings of edges of polyhedra with four-valent vertices. The set of such two-colorings, quotiented by the octahedral symmetry group, has a natural graph structure and is called the combinatorial configuration space. The energy landscape of our model is the energy of each state in the combinatorial configuration space. The challenge in the computation of the energy landscape is a combinatorial explosion in the number of two-colorings of edges. We describe sampling methods based on the symmetries of the configurations and connectivity of the configuration graph. When the two preferred opening angles encompass the geometrically ideal angle, the energy landscape exhibits a very low-energy minimum for the most symmetric configuration at equal mixing of the two angles, even when the average opening angle does not match the ideal angle.

A Combinatorial Grassmannian Representation of the Magic Three-Qubit Veldkamp Line

NASA Astrophysics Data System (ADS)

Saniga, Metod

2017-10-01

It is demonstrated that the magic three-qubit Veldkamp line occurs naturally within the Veldkamp space of combinatorial Grassmannian of type $G_2(7)$, $\\mathcal{V}(G_2(7))$. The lines of the ambient symplectic polar space are those lines of $\\mathcal{V}(G_2(7))$ whose cores feature an odd number of points of $G_2(7)$. After introducing basic properties of three different types of points and six distinct types of lines of $\\mathcal{V}(G_2(7))$, we explicitly show the combinatorial Grassmannian composition of the magic Veldkamp line; we first give representatives of points and lines of its core generalized quadrangle GQ$(2,2)$, and then additional points and lines of a specific elliptic quadric $\\mathcal{Q}^{-}$(5,2), a hyperbolic quadric $\\mathcal{Q}^{+}$(5,2) and a quadratic cone $\\widehat{\\mathcal{Q}}$(4,2) that are centered on the GQ$(2,2)$. In particular, each point of $\\mathcal{Q}^{+}$(5,2) is represented by a Pasch configuration and its complementary line, the (Schl\\"afli) double-six of points in $\\mathcal{Q}^{-}$(5,2) comprise six Cayley-Salmon configurations and six Desargues configurations with their complementary points, and the remaining Cayley-Salmon configuration stands for the vertex of $\\widehat{\\mathcal{Q}}$(4,2).

An improved harmony search algorithm for emergency inspection scheduling

NASA Astrophysics Data System (ADS)

Kallioras, Nikos A.; Lagaros, Nikos D.; Karlaftis, Matthew G.

2014-11-01

The ability of nature-inspired search algorithms to efficiently handle combinatorial problems, and their successful implementation in many fields of engineering and applied sciences, have led to the development of new, improved algorithms. In this work, an improved harmony search (IHS) algorithm is presented, while a holistic approach for solving the problem of post-disaster infrastructure management is also proposed. The efficiency of IHS is compared with that of the algorithms of particle swarm optimization, differential evolution, basic harmony search and the pure random search procedure, when solving the districting problem that is the first part of post-disaster infrastructure management. The ant colony optimization algorithm is employed for solving the associated routing problem that constitutes the second part. The comparison is based on the quality of the results obtained, the computational demands and the sensitivity on the algorithmic parameters.

Modified Parameters of Harmony Search Algorithm for Better Searching

NASA Astrophysics Data System (ADS)

Farraliza Mansor, Nur; Abal Abas, Zuraida; Samad Shibghatullah, Abdul; Rahman, Ahmad Fadzli Nizam Abdul

2017-08-01

The scheduling and rostering problems are deliberated as integrated due to they depend on each other whereby the input of rostering problems is a scheduling problems. In this research, the integrated scheduling and rostering bus driver problems are defined as maximising the balance of the assignment of tasks in term of distribution of shifts and routes. It is essential to achieve is fairer among driver because this can bring to increase in driver levels of satisfaction. The latest approaches still unable to address the fairness problem that has emerged, thus this research proposes a strategy to adopt an amendment of a harmony search algorithm in order to address the fairness issue and thus the level of fairness will be escalate. The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems. In this respect, the three main operators in HS, namely the Harmony Memory Consideration Rate (HMCR), Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration. These parameters influence the overall performance of the HS algorithm, and therefore it is crucial to fine-tune them. The contributions to this research are the HMCR parameter using step function while the fret spacing concept on guitars that is associated with mathematical formulae is also applied in the BW parameter. The model of constant step function is introduced in the alteration of HMCR parameter. The experimental results revealed that our proposed approach is superior than parameter adaptive harmony search algorithm. In conclusion, this proposed approach managed to generate a fairer roster and was thus capable of maximising the balancing distribution of shifts and routes among drivers, which contributed to the lowering of illness, incidents, absenteeism and accidents.

Medial-based deformable models in nonconvex shape-spaces for medical image segmentation.

PubMed

McIntosh, Chris; Hamarneh, Ghassan

2012-01-01

We explore the application of genetic algorithms (GA) to deformable models through the proposition of a novel method for medical image segmentation that combines GA with nonconvex, localized, medial-based shape statistics. We replace the more typical gradient descent optimizer used in deformable models with GA, and the convex, implicit, global shape statistics with nonconvex, explicit, localized ones. Specifically, we propose GA to reduce typical deformable model weaknesses pertaining to model initialization, pose estimation and local minima, through the simultaneous evolution of a large number of models. Furthermore, we constrain the evolution, and thus reduce the size of the search-space, by using statistically-based deformable models whose deformations are intuitive (stretch, bulge, bend) and are driven in terms of localized principal modes of variation, instead of modes of variation across the entire shape that often fail to capture localized shape changes. Although GA are not guaranteed to achieve the global optima, our method compares favorably to the prevalent optimization techniques, convex/nonconvex gradient-based optimizers and to globally optimal graph-theoretic combinatorial optimization techniques, when applied to the task of corpus callosum segmentation in 50 mid-sagittal brain magnetic resonance images.

Projective Ponzano-Regge spin networks and their symmetries

NASA Astrophysics Data System (ADS)

Aquilanti, Vincenzo; Marzuoli, Annalisa

2018-02-01

We present a novel hierarchical construction of projective spin networks of the Ponzano-Regge type from an assembling of five quadrangles up to the combinatorial 4-simplex compatible with a geometrical realization in Euclidean 4-space. The key ingredients are the projective Desargues configuration and the incidence structure given by its space-dual, on the one hand, and the Biedenharn-Elliott identity for the 6j symbol of SU(2), on the other. The interplay between projective-combinatorial and algebraic features relies on the recoupling theory of angular momenta, an approach to discrete quantum gravity models carried out successfully over the last few decades. The role of Regge symmetry-an intriguing discrete symmetry of the 6j which goes beyond the standard tetrahedral symmetry of this symbol-will be also discussed in brief to highlight its role in providing a natural regularization of projective spin networks that somehow mimics the standard regularization through a q-deformation of SU(2).

Hybrid Nested Partitions and Math Programming Framework for Large-scale Combinatorial Optimization

DTIC Science & Technology

2010-03-31

optimization problems: 1) exact algorithms and 2) metaheuristic algorithms . This project will integrate concepts from these two technologies to develop...optimal solutions within an acceptable amount of computation time, and 2) metaheuristic algorithms such as genetic algorithms , tabu search, and the...integer programming decomposition approaches, such as Dantzig Wolfe decomposition and Lagrangian relaxation, and metaheuristics such as the Nested

Control Coordination of Multiple Agents Through Decision Theoretic and Economic Methods

DTIC Science & Technology

2003-02-01

instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing this collection of information...investigated the design of test data for benchmarking such optimization algorithms. Our other research on combinatorial auctions included I...average combination rule. We exemplified these theoretical results with experiments on stock market data , demonstrating how ensembles of classifiers can

Patent review.

PubMed

Roy, Anuradha

2011-05-01

The section on patent review will be focused in the areas of interest to the readers of CCHTS. The search was conducted using the following key words: combinatorial chemistry, high throughput screening, drug repurposing, chemical library, high content screening, drug discovery and natural products. All patents highlighted here are identified by the patent number issued either by the World Intellectual Property Organization or by a regional patent office.

Patent review.

PubMed

Roy, Anuradha; McGee, James E

2011-08-01

The section on patent review will be focused in the areas of interest to the readers of CCHTS. The search was conducted using the following key words: combinatorial chemistry, high throughput screening, drug repurposing, chemical library, high content screening, drug discovery and natural products. All patents highlighted here are identified by the patent number issued either by the World Intellectual Property Organization or by a regional patent office.

Synthesis and characterization of catalysts and electrocatalysts using combinatorial methods

NASA Astrophysics Data System (ADS)

Ramanathan, Ramnarayanan

This thesis documents attempts at solving three problems. Bead-based parallel synthetic and screening methods based on matrix algorithms were developed. The method was applied to search for new heterogeneous catalysts for dehydrogenation of methylcyclohexane. The most powerful use of the method to date was to optimize metal adsorption and evaluate catalysts as a function of incident energy, likely to be important in the future, should availability of energy be an optimization parameter. This work also highlighted the importance of order of addition of metal salts on catalytic activity and a portion of this work resulted in a patent with UOP LLC, Desplaines, Illinois. Combinatorial methods were also investigated as a tool to search for carbon-monoxide tolerant anode electrocatalysts and methanol tolerant cathode electrocatalysts, resulting in discovery of no new electrocatalysts. A physically intuitive scaling criterion was developed to analyze all experiments on electrocatalysts, providing insight for future experiments. We attempted to solve the CO poisoning problem in polymer electrolyte fuel cells using carbon molecular sieves as a separator. This approach was unsuccessful in solving the CO poisoning problem, possibly due to the tendency of the carbon molecular sieves to concentrate CO and CO 2 in pore walls.

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA Technical Reports Server (NTRS)

Rash, James

2014-01-01

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

Combinatorial quantization of the Hamiltonian Chern-Simons theory II

NASA Astrophysics Data System (ADS)

Alekseev, Anton Yu.; Grosse, Harald; Schomerus, Volker

1996-01-01

This paper further develops the combinatorial approach to quantization of the Hamiltonian Chern Simons theory advertised in [1]. Using the theory of quantum Wilson lines, we show how the Verlinde algebra appears within the context of quantum group gauge theory. This allows to discuss flatness of quantum connections so that we can give a mathematically rigorous definition of the algebra of observables A CS of the Chern Simons model. It is a *-algebra of “functions on the quantum moduli space of flat connections” and comes equipped with a positive functional ω (“integration”). We prove that this data does not depend on the particular choices which have been made in the construction. Following ideas of Fock and Rosly [2], the algebra A CS provides a deformation quantization of the algebra of functions on the moduli space along the natural Poisson bracket induced by the Chern Simons action. We evaluate a volume of the quantized moduli space and prove that it coincides with the Verlinde number. This answer is also interpreted as a partition partition function of the lattice Yang-Mills theory corresponding to a quantum gauge group.

Monkey search algorithm for ECE components partitioning

NASA Astrophysics Data System (ADS)

Kuliev, Elmar; Kureichik, Vladimir; Kureichik, Vladimir, Jr.

2018-05-01

The paper considers one of the important design problems – a partitioning of electronic computer equipment (ECE) components (blocks). It belongs to the NP-hard class of problems and has a combinatorial and logic nature. In the paper, a partitioning problem formulation can be found as a partition of graph into parts. To solve the given problem, the authors suggest using a bioinspired approach based on a monkey search algorithm. Based on the developed software, computational experiments were carried out that show the algorithm efficiency, as well as its recommended settings for obtaining more effective solutions in comparison with a genetic algorithm.

Automated adaptive inference of phenomenological dynamical models

NASA Astrophysics Data System (ADS)

Daniels, Bryan

Understanding the dynamics of biochemical systems can seem impossibly complicated at the microscopic level: detailed properties of every molecular species, including those that have not yet been discovered, could be important for producing macroscopic behavior. The profusion of data in this area has raised the hope that microscopic dynamics might be recovered in an automated search over possible models, yet the combinatorial growth of this space has limited these techniques to systems that contain only a few interacting species. We take a different approach inspired by coarse-grained, phenomenological models in physics. Akin to a Taylor series producing Hooke's Law, forgoing microscopic accuracy allows us to constrain the search over dynamical models to a single dimension. This makes it feasible to infer dynamics with very limited data, including cases in which important dynamical variables are unobserved. We name our method Sir Isaac after its ability to infer the dynamical structure of the law of gravitation given simulated planetary motion data. Applying the method to output from a microscopically complicated but macroscopically simple biological signaling model, it is able to adapt the level of detail to the amount of available data. Finally, using nematode behavioral time series data, the method discovers an effective switch between behavioral attractors after the application of a painful stimulus.

Anharmonic and Quantum Fluctuations in Molecular Crystals: A First-Principles Study of the Stability of Paracetamol

NASA Astrophysics Data System (ADS)

Rossi, Mariana; Gasparotto, Piero; Ceriotti, Michele

2016-09-01

Molecular crystals often exist in multiple competing polymorphs, showing significantly different physicochemical properties. Computational crystal structure prediction is key to interpret and guide the search for the most stable or useful form, a real challenge due to the combinatorial search space, and the complex interplay of subtle effects that work together to determine the relative stability of different structures. Here we take a comprehensive approach based on different flavors of thermodynamic integration in order to estimate all contributions to the free energies of these systems with density-functional theory, including the oft-neglected anharmonic contributions and nuclear quantum effects. We take the two main stable forms of paracetamol as a paradigmatic example. We find that anharmonic contributions, different descriptions of van der Waals interactions, and nuclear quantum effects all matter to quantitatively determine the stability of different phases. Our analysis highlights the many challenges inherent in the development of a quantitative and predictive framework to model molecular crystals. However, it also indicates which of the components of the free energy can benefit from a cancellation of errors that can redeem the predictive power of approximate models, and suggests simple steps that could be taken to improve the reliability of ab initio crystal structure prediction.

Designing a multiroute synthesis scheme in combinatorial chemistry.

PubMed

Akavia, Adi; Senderowitz, Hanoch; Lerner, Alon; Shamir, Ron

2004-01-01

Solid-phase mix-and-split combinatorial synthesis is often used to produce large arrays of compounds to be tested during the various stages of the drug development process. This method can be represented by a synthesis graph in which nodes correspond to grow operations and arcs to beads transferred among the different reaction vessels. In this work, we address the problem of designing such a graph which maximizes the number of produced target compounds (namely, compounds out of an input library of desired molecules), given constraints on the number of beads used for library synthesis and on the number of reaction vessels available for concurrent grow steps. We present a heuristic based on a discrete search for solving this problem, test our solution on several data sets, explore its behavior, and show that it achieves good performance.

Virtual Exploration of the Ring Systems Chemical Universe.

PubMed

Visini, Ricardo; Arús-Pous, Josep; Awale, Mahendra; Reymond, Jean-Louis

2017-11-27

Here, we explore the chemical space of all virtually possible organic molecules focusing on ring systems, which represent the cyclic cores of organic molecules obtained by removing all acyclic bonds and converting all remaining atoms to carbon. This approach circumvents the combinatorial explosion encountered when enumerating the molecules themselves. We report the chemical universe database GDB4c containing 916 130 ring systems up to four saturated or aromatic rings and maximum ring size of 14 atoms and GDB4c3D containing the corresponding 6 555 929 stereoisomers. Almost all (98.6%) of these ring systems are unknown and represent chiral 3D-shaped macrocycles containing small rings and quaternary centers reminiscent of polycyclic natural products. We envision that GDB4c can serve to select new ring systems from which to design analogs of such natural products. The database is available for download at www.gdb.unibe.ch together with interactive visualization and search tools as a resource for molecular design.

On-the-fly machine-learning for high-throughput experiments: search for rare-earth-free permanent magnets

PubMed Central

Kusne, Aaron Gilad; Gao, Tieren; Mehta, Apurva; Ke, Liqin; Nguyen, Manh Cuong; Ho, Kai-Ming; Antropov, Vladimir; Wang, Cai-Zhuang; Kramer, Matthew J.; Long, Christian; Takeuchi, Ichiro

2014-01-01

Advanced materials characterization techniques with ever-growing data acquisition speed and storage capabilities represent a challenge in modern materials science, and new procedures to quickly assess and analyze the data are needed. Machine learning approaches are effective in reducing the complexity of data and rapidly homing in on the underlying trend in multi-dimensional data. Here, we show that by employing an algorithm called the mean shift theory to a large amount of diffraction data in high-throughput experimentation, one can streamline the process of delineating the structural evolution across compositional variations mapped on combinatorial libraries with minimal computational cost. Data collected at a synchrotron beamline are analyzed on the fly, and by integrating experimental data with the inorganic crystal structure database (ICSD), we can substantially enhance the accuracy in classifying the structural phases across ternary phase spaces. We have used this approach to identify a novel magnetic phase with enhanced magnetic anisotropy which is a candidate for rare-earth free permanent magnet. PMID:25220062

Automated sequence-specific protein NMR assignment using the memetic algorithm MATCH.

PubMed

Volk, Jochen; Herrmann, Torsten; Wüthrich, Kurt

2008-07-01

MATCH (Memetic Algorithm and Combinatorial Optimization Heuristics) is a new memetic algorithm for automated sequence-specific polypeptide backbone NMR assignment of proteins. MATCH employs local optimization for tracing partial sequence-specific assignments within a global, population-based search environment, where the simultaneous application of local and global optimization heuristics guarantees high efficiency and robustness. MATCH thus makes combined use of the two predominant concepts in use for automated NMR assignment of proteins. Dynamic transition and inherent mutation are new techniques that enable automatic adaptation to variable quality of the experimental input data. The concept of dynamic transition is incorporated in all major building blocks of the algorithm, where it enables switching between local and global optimization heuristics at any time during the assignment process. Inherent mutation restricts the intrinsically required randomness of the evolutionary algorithm to those regions of the conformation space that are compatible with the experimental input data. Using intact and artificially deteriorated APSY-NMR input data of proteins, MATCH performed sequence-specific resonance assignment with high efficiency and robustness.

Anharmonic and Quantum Fluctuations in Molecular Crystals from Ab Initio Simulations

NASA Astrophysics Data System (ADS)

Rossi, Mariana; Gasparotto, Piero; Ceriotti, Michele

Molecular crystals often exist in multiple competing polymorphs which are challenging to be predicted computationally, but show significantly different physicochemical properties. This challenge is not due only to the combinatorial search space, but also to the complex interplay of subtle effects determine the relative stability of different structures. Here we estimate all contributions to the free energies of these systems with density-functional theory, including the oft-neglected anharmonic contributions and nuclear quantum effects, by using a series of different flavors of thermodynamic integration. As an example, for the two most stable forms of paracetamol we find that anharmonic contributions, different descriptions of van der Waals interactions, and nuclear quantum effects all matter to quantitatively determine the stability of different phases. Our studies indicate that anharmonic free energies could play an important role for molecular crystals composed by large molecules and opens the way for a systematic inclusion of these effects in order to obtain a predictive screening of structures.

Combinatorial Reactive Sputtering of In2S3 as an Alternative Contact Layer for Thin Film Solar Cells.

PubMed

Siol, Sebastian; Dhakal, Tara P; Gudavalli, Ganesh S; Rajbhandari, Pravakar P; DeHart, Clay; Baranowski, Lauryn L; Zakutayev, Andriy

2016-06-08

High-throughput computational and experimental techniques have been used in the past to accelerate the discovery of new promising solar cell materials. An important part of the development of novel thin film solar cell technologies, that is still considered a bottleneck for both theory and experiment, is the search for alternative interfacial contact (buffer) layers. The research and development of contact materials is difficult due to the inherent complexity that arises from its interactions at the interface with the absorber. A promising alternative to the commonly used CdS buffer layer in thin film solar cells that contain absorbers with lower electron affinity can be found in β-In2S3. However, the synthesis conditions for the sputter deposition of this material are not well-established. Here, In2S3 is investigated as a solar cell contact material utilizing a high-throughput combinatorial screening of the temperature-flux parameter space, followed by a number of spatially resolved characterization techniques. It is demonstrated that, by tuning the sulfur partial pressure, phase pure β-In2S3 could be deposited using a broad range of substrate temperatures between 500 °C and ambient temperature. Combinatorial photovoltaic device libraries with Al/ZnO/In2S3/Cu2ZnSnS4/Mo/SiO2 structure were built at optimal processing conditions to investigate the feasibility of the sputtered In2S3 buffer layers and of an accelerated optimization of the device structure. The performance of the resulting In2S3/Cu2ZnSnS4 photovoltaic devices is on par with CdS/Cu2ZnSnS4 reference solar cells with similar values for short circuit currents and open circuit voltages, despite the overall quite low efficiency of the devices (∼2%). Overall, these results demonstrate how a high-throughput experimental approach can be used to accelerate the development of contact materials and facilitate the optimization of thin film solar cell devices.

A stochastic algorithm for global optimization and for best populations: A test case of side chains in proteins

PubMed Central

Glick, Meir; Rayan, Anwar; Goldblum, Amiram

2002-01-01

The problem of global optimization is pivotal in a variety of scientific fields. Here, we present a robust stochastic search method that is able to find the global minimum for a given cost function, as well as, in most cases, any number of best solutions for very large combinatorial “explosive” systems. The algorithm iteratively eliminates variable values that contribute consistently to the highest end of a cost function's spectrum of values for the full system. Values that have not been eliminated are retained for a full, exhaustive search, allowing the creation of an ordered population of best solutions, which includes the global minimum. We demonstrate the ability of the algorithm to explore the conformational space of side chains in eight proteins, with 54 to 263 residues, to reproduce a population of their low energy conformations. The 1,000 lowest energy solutions are identical in the stochastic (with two different seed numbers) and full, exhaustive searches for six of eight proteins. The others retain the lowest 141 and 213 (of 1,000) conformations, depending on the seed number, and the maximal difference between stochastic and exhaustive is only about 0.15 Kcal/mol. The energy gap between the lowest and highest of the 1,000 low-energy conformers in eight proteins is between 0.55 and 3.64 Kcal/mol. This algorithm offers real opportunities for solving problems of high complexity in structural biology and in other fields of science and technology. PMID:11792838

Swellix: a computational tool to explore RNA conformational space.

PubMed

Sloat, Nathan; Liu, Jui-Wen; Schroeder, Susan J

2017-11-21

The sequence of nucleotides in an RNA determines the possible base pairs for an RNA fold and thus also determines the overall shape and function of an RNA. The Swellix program presented here combines a helix abstraction with a combinatorial approach to the RNA folding problem in order to compute all possible non-pseudoknotted RNA structures for RNA sequences. The Swellix program builds on the Crumple program and can include experimental constraints on global RNA structures such as the minimum number and lengths of helices from crystallography, cryoelectron microscopy, or in vivo crosslinking and chemical probing methods. The conceptual advance in Swellix is to count helices and generate all possible combinations of helices rather than counting and combining base pairs. Swellix bundles similar helices and includes improvements in memory use and efficient parallelization. Biological applications of Swellix are demonstrated by computing the reduction in conformational space and entropy due to naturally modified nucleotides in tRNA sequences and by motif searches in Human Endogenous Retroviral (HERV) RNA sequences. The Swellix motif search reveals occurrences of protein and drug binding motifs in the HERV RNA ensemble that do not occur in minimum free energy or centroid predicted structures. Swellix presents significant improvements over Crumple in terms of efficiency and memory use. The efficient parallelization of Swellix enables the computation of sequences as long as 418 nucleotides with sufficient experimental constraints. Thus, Swellix provides a practical alternative to free energy minimization tools when multiple structures, kinetically determined structures, or complex RNA-RNA and RNA-protein interactions are present in an RNA folding problem.

Combinatorial Strategies for the Development of Bulk Metallic Glasses

NASA Astrophysics Data System (ADS)

Ding, Shiyan

The systematic identification of multi-component alloys out of the vast composition space is still a daunting task, especially in the development of bulk metallic glasses that are typically based on three or more elements. In order to address this challenge, combinatorial approaches have been proposed. However, previous attempts have not successfully coupled the synthesis of combinatorial libraries with high-throughput characterization methods. The goal of my dissertation is to develop efficient high-throughput characterization methods, optimized to identify glass formers systematically. Here, two innovative approaches have been invented. One is to measure the nucleation temperature in parallel for up-to 800 compositions. The composition with the lowest nucleation temperature has a reasonable agreement with the best-known glass forming composition. In addition, the thermoplastic formability of a metallic glass forming system is determined through blow molding a compositional library. Our results reveal that the composition with the largest thermoplastic deformation correlates well with the best-known formability composition. I have demonstrated both methods as powerful tools to develop new bulk metallic glasses.

Hopf-algebraic structure of combinatorial objects and differential operators

NASA Technical Reports Server (NTRS)

Grossman, Robert; Larson, Richard G.

1989-01-01

A Hopf-algebraic structure on a vector space which has as basis a family of trees is described. Some applications of this structure to combinatorics and to differential operators are surveyed. Some possible future directions for this work are indicated.

Observables of QCD diffraction

NASA Astrophysics Data System (ADS)

Mieskolainen, Mikael; Orava, Risto

2017-03-01

A new combinatorial vector space measurement model is introduced for soft QCD diffraction. The model independent mathematical construction resolves experimental complications; the theoretical framework of the approach includes the Good-Walker view of diffraction, Regge phenomenology together with AGK cutting rules and random fluctuations.

A hybrid Q-learning sine-cosine-based strategy for addressing the combinatorial test suite minimization problem

PubMed Central

Zamli, Kamal Z.; Din, Fakhrud; Bures, Miroslav

2018-01-01

The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In addition to exploiting sine and cosine functions to perform local and global searches (hence the name sine-cosine), the SCA introduces several random and adaptive parameters to facilitate the search process. Although it shows promising results, the search process of the SCA is vulnerable to local minima/maxima due to the adoption of a fixed switch probability and the bounded magnitude of the sine and cosine functions (from -1 to 1). In this paper, we propose a new hybrid Q-learning sine-cosine- based strategy, called the Q-learning sine-cosine algorithm (QLSCA). Within the QLSCA, we eliminate the switching probability. Instead, we rely on the Q-learning algorithm (based on the penalty and reward mechanism) to dynamically identify the best operation during runtime. Additionally, we integrate two new operations (Lévy flight motion and crossover) into the QLSCA to facilitate jumping out of local minima/maxima and enhance the solution diversity. To assess its performance, we adopt the QLSCA for the combinatorial test suite minimization problem. Experimental results reveal that the QLSCA is statistically superior with regard to test suite size reduction compared to recent state-of-the-art strategies, including the original SCA, the particle swarm test generator (PSTG), adaptive particle swarm optimization (APSO) and the cuckoo search strategy (CS) at the 95% confidence level. However, concerning the comparison with discrete particle swarm optimization (DPSO), there is no significant difference in performance at the 95% confidence level. On a positive note, the QLSCA statistically outperforms the DPSO in certain configurations at the 90% confidence level. PMID:29771918

A hybrid Q-learning sine-cosine-based strategy for addressing the combinatorial test suite minimization problem.

PubMed

Zamli, Kamal Z; Din, Fakhrud; Ahmed, Bestoun S; Bures, Miroslav

2018-01-01

The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In addition to exploiting sine and cosine functions to perform local and global searches (hence the name sine-cosine), the SCA introduces several random and adaptive parameters to facilitate the search process. Although it shows promising results, the search process of the SCA is vulnerable to local minima/maxima due to the adoption of a fixed switch probability and the bounded magnitude of the sine and cosine functions (from -1 to 1). In this paper, we propose a new hybrid Q-learning sine-cosine- based strategy, called the Q-learning sine-cosine algorithm (QLSCA). Within the QLSCA, we eliminate the switching probability. Instead, we rely on the Q-learning algorithm (based on the penalty and reward mechanism) to dynamically identify the best operation during runtime. Additionally, we integrate two new operations (Lévy flight motion and crossover) into the QLSCA to facilitate jumping out of local minima/maxima and enhance the solution diversity. To assess its performance, we adopt the QLSCA for the combinatorial test suite minimization problem. Experimental results reveal that the QLSCA is statistically superior with regard to test suite size reduction compared to recent state-of-the-art strategies, including the original SCA, the particle swarm test generator (PSTG), adaptive particle swarm optimization (APSO) and the cuckoo search strategy (CS) at the 95% confidence level. However, concerning the comparison with discrete particle swarm optimization (DPSO), there is no significant difference in performance at the 95% confidence level. On a positive note, the QLSCA statistically outperforms the DPSO in certain configurations at the 90% confidence level.

Combinatorial-topological framework for the analysis of global dynamics.

PubMed

Bush, Justin; Gameiro, Marcio; Harker, Shaun; Kokubu, Hiroshi; Mischaikow, Konstantin; Obayashi, Ippei; Pilarczyk, Paweł

2012-12-01

We discuss an algorithmic framework based on efficient graph algorithms and algebraic-topological computational tools. The framework is aimed at automatic computation of a database of global dynamics of a given m-parameter semidynamical system with discrete time on a bounded subset of the n-dimensional phase space. We introduce the mathematical background, which is based upon Conley's topological approach to dynamics, describe the algorithms for the analysis of the dynamics using rectangular grids both in phase space and parameter space, and show two sample applications.

Combinatorial-topological framework for the analysis of global dynamics

NASA Astrophysics Data System (ADS)

Bush, Justin; Gameiro, Marcio; Harker, Shaun; Kokubu, Hiroshi; Mischaikow, Konstantin; Obayashi, Ippei; Pilarczyk, Paweł

2012-12-01

We discuss an algorithmic framework based on efficient graph algorithms and algebraic-topological computational tools. The framework is aimed at automatic computation of a database of global dynamics of a given m-parameter semidynamical system with discrete time on a bounded subset of the n-dimensional phase space. We introduce the mathematical background, which is based upon Conley's topological approach to dynamics, describe the algorithms for the analysis of the dynamics using rectangular grids both in phase space and parameter space, and show two sample applications.

Combinatorial search for green and blue phosphors of high thermal stabilities under UV excitation based on the K(Sr1-x-y)PO4:Tb3+ xEu2+y system.

PubMed

Chan, Ting-Shan; Liu, Yao-Min; Liu, Ru-Shi

2008-01-01

The present investigation aims at the synthesis of KSr 1-x-y PO 4:Tb(3+) x Eu(2+) y phosphors using the combinatorial chemistry method. We have developed square-type arrays consisting of 121 compositions to investigate the optimum composition and luminescence properties of KSrPO 4 host matrix under 365 nm ultraviolet (UV) light. The optimized compositions of phosphors were found to be KSr 0.93PO 4:Tb(3+) 0.07 (green) and KSr 0.995PO 4:Eu(2+) 0.005 (blue). These phosphors showed good thermal luminescence stability better than commercially available YAG:Ce at temperature above 200 degrees C. The result indicates that the KSr 1-x-y PO 4:Tb(3+) x Eu (2+)y can be potentially useful as a UV radiation-converting phosphor for light-emitting diodes.

Combinatorial Investigation of ZrO2-Based Dielectric Materials for Dynamic Random-Access Memory Capacitors

NASA Astrophysics Data System (ADS)

Kiyota, Yuji; Itaka, Kenji; Iwashita, Yuta; Adachi, Tetsuya; Chikyow, Toyohiro; Ogura, Atsushi

2011-06-01

We investigated zirconia (ZrO2)-based material libraries in search of new dielectric materials for dynamic random-access memory (DRAM) by combinatorial-pulsed laser deposition (combi-PLD). We found that the substitution of yttrium (Y) to Zr sites in the ZrO2 system suppressed the leakage current effectively. The metal-insulator-metal (MIM) capacitor property of this system showed a leakage current density of less than 5×10-7 A/cm2 and the dielectric constant was 20. Moreover, the addition of titanium (Ti) or tantalum (Ta) to this system caused the dielectric constant to increase to ˜25 within the allowed leakage level of 5×10-7 A/cm2. Therefore, Zr-Y-Ti-O and Zr-Y-Ta-O systems have good potentials for use as new materials with high dielectric constants of DRAM capacitors instead of silicon dioxides (SiO2).

Combinatorial Methodology for Screening Selectivity in Polymeric Pervaporation Membranes.

PubMed

Godbole, Rutvik V; Ma, Lan; Doerfert, Michael D; Williams, Porsche; Hedden, Ronald C

2015-11-09

Combinatorial methodology is described for rapid screening of selectivity in polymeric pervaporation membrane materials for alcohol-water separations. The screening technique is demonstrated for ethanol-water separation using a model polyacrylate system. The materials studied are cross-linked random copolymers of a hydrophobic comonomer (n-butyl acrylate, B) and a hydrophilic comonomer (2-hydroxyethyl acrylate, H). A matrix of materials is prepared that has orthogonal variations in two key variables, H:B ratio and cross-linker concentration. For mixtures of ethanol and water, equilibrium selectivities and distribution coefficients are obtained by combining swelling measurements with high-throughput HPLC analysis. Based on the screening results, two copolymers are selected for further study as pervaporation membranes to quantify permeability selectivity and the flux of ethanol. The screening methodology described has good potential to accelerate the search for new membrane materials, as it is adaptable to a broad range of polymer chemistries.

Statistical molecular design of building blocks for combinatorial chemistry.

PubMed

Linusson, A; Gottfries, J; Lindgren, F; Wold, S

2000-04-06

The reduction of the size of a combinatorial library can be made in two ways, either base the selection on the building blocks (BB's) or base it on the full set of virtually constructed products. In this paper we have investigated the effects of applying statistical designs to BB sets compared to selections based on the final products. The two sets of BB's and the virtually constructed library were described by structural parameters, and the correlation between the two characterizations was investigated. Three different selection approaches were used both for the BB sets and for the products. In the first two the selection algorithms were applied directly to the data sets (D-optimal design and space-filling design), while for the third a cluster analysis preceded the selection (cluster-based design). The selections were compared using visual inspection, the Tanimoto coefficient, the Euclidean distance, the condition number, and the determinant of the resulting data matrix. No difference in efficiency was found between selections made in the BB space and in the product space. However, it is of critical importance to investigate the BB space carefully and to select an appropriate number of BB's to result in an adequate diversity. An example from the pharmaceutical industry is then presented, where selection via BB's was made using a cluster-based design.

Optimizing Sensor and Actuator Arrays for ASAC Noise Control

NASA Technical Reports Server (NTRS)

Palumbo, Dan; Cabell, Ran

2000-01-01

This paper summarizes the development of an approach to optimizing the locations for arrays of sensors and actuators in active noise control systems. A type of directed combinatorial search, called Tabu Search, is used to select an optimal configuration from a much larger set of candidate locations. The benefit of using an optimized set is demonstrated. The importance of limiting actuator forces to realistic levels when evaluating the cost function is discussed. Results of flight testing an optimized system are presented. Although the technique has been applied primarily to Active Structural Acoustic Control systems, it can be adapted for use in other active noise control implementations.

Learning dominance relations in combinatorial search problems

NASA Technical Reports Server (NTRS)

Yu, Chee-Fen; Wah, Benjamin W.

1988-01-01

Dominance relations commonly are used to prune unnecessary nodes in search graphs, but they are problem-dependent and cannot be derived by a general procedure. The authors identify machine learning of dominance relations and the applicable learning mechanisms. A study of learning dominance relations using learning by experimentation is described. This system has been able to learn dominance relations for the 0/1-knapsack problem, an inventory problem, the reliability-by-replication problem, the two-machine flow shop problem, a number of single-machine scheduling problems, and a two-machine scheduling problem. It is considered that the same methodology can be extended to learn dominance relations in general.

Materials on the brink: unprecedented transforming materials

DTIC Science & Technology

2013-09-10

2013 56.00 Shenqiang Ren\\, Manfred Wuttig. Spinodal synthesis of PZT /NFO magnetoelectric, Applied Physics Letters, (08 2007): 83501. doi: 02/06/2013... PZT . This material was discovered through a combinatorial search. Rabe et al. have used first principles methods to show that this morphotropic...temperature. James et al. have suggested a new strategy for energy recovery from waste heat using this alloy. • Discovery of a new fatigue -free shape

A surrogate-based metaheuristic global search method for beam angle selection in radiation treatment planning.

PubMed

Zhang, H H; Gao, S; Chen, W; Shi, L; D'Souza, W D; Meyer, R R

2013-03-21

An important element of radiation treatment planning for cancer therapy is the selection of beam angles (out of all possible coplanar and non-coplanar angles in relation to the patient) in order to maximize the delivery of radiation to the tumor site and minimize radiation damage to nearby organs-at-risk. This category of combinatorial optimization problem is particularly difficult because direct evaluation of the quality of treatment corresponding to any proposed selection of beams requires the solution of a large-scale dose optimization problem involving many thousands of variables that represent doses delivered to volume elements (voxels) in the patient. However, if the quality of angle sets can be accurately estimated without expensive computation, a large number of angle sets can be considered, increasing the likelihood of identifying a very high quality set. Using a computationally efficient surrogate beam set evaluation procedure based on single-beam data extracted from plans employing equallyspaced beams (eplans), we have developed a global search metaheuristic process based on the nested partitions framework for this combinatorial optimization problem. The surrogate scoring mechanism allows us to assess thousands of beam set samples within a clinically acceptable time frame. Tests on difficult clinical cases demonstrate that the beam sets obtained via our method are of superior quality.

Annealing Ant Colony Optimization with Mutation Operator for Solving TSP.

PubMed

Mohsen, Abdulqader M

2016-01-01

Ant Colony Optimization (ACO) has been successfully applied to solve a wide range of combinatorial optimization problems such as minimum spanning tree, traveling salesman problem, and quadratic assignment problem. Basic ACO has drawbacks of trapping into local minimum and low convergence rate. Simulated annealing (SA) and mutation operator have the jumping ability and global convergence; and local search has the ability to speed up the convergence. Therefore, this paper proposed a hybrid ACO algorithm integrating the advantages of ACO, SA, mutation operator, and local search procedure to solve the traveling salesman problem. The core of algorithm is based on the ACO. SA and mutation operator were used to increase the ants population diversity from time to time and the local search was used to exploit the current search area efficiently. The comparative experiments, using 24 TSP instances from TSPLIB, show that the proposed algorithm outperformed some well-known algorithms in the literature in terms of solution quality.

Integrated microfluidic devices for combinatorial cell-based assays.

PubMed

Yu, Zeta Tak For; Kamei, Ken-ichiro; Takahashi, Hiroko; Shu, Chengyi Jenny; Wang, Xiaopu; He, George Wenfu; Silverman, Robert; Radu, Caius G; Witte, Owen N; Lee, Ki-Bum; Tseng, Hsian-Rong

2009-06-01

The development of miniaturized cell culture platforms for performing parallel cultures and combinatorial assays is important in cell biology from the single-cell level to the system level. In this paper we developed an integrated microfluidic cell-culture platform, Cell-microChip (Cell-microChip), for parallel analyses of the effects of microenvironmental cues (i.e., culture scaffolds) on different mammalian cells and their cellular responses to external stimuli. As a model study, we demonstrated the ability of culturing and assaying several mammalian cells, such as NIH 3T3 fibroblast, B16 melanoma and HeLa cell lines, in a parallel way. For functional assays, first we tested drug-induced apoptotic responses from different cell lines. As a second functional assay, we performed "on-chip" transfection of a reporter gene encoding an enhanced green fluorescent protein (EGFP) followed by live-cell imaging of transcriptional activation of cyclooxygenase 2 (Cox-2) expression. Collectively, our Cell-microChip approach demonstrated the capability to carry out parallel operations and the potential to further integrate advanced functions and applications in the broader space of combinatorial chemistry and biology.

Integrated microfluidic devices for combinatorial cell-based assays

PubMed Central

Yu, Zeta Tak For; Kamei, Ken-ichiro; Takahashi, Hiroko; Shu, Chengyi Jenny; Wang, Xiaopu; He, George Wenfu; Silverman, Robert

2010-01-01

The development of miniaturized cell culture platforms for performing parallel cultures and combinatorial assays is important in cell biology from the single-cell level to the system level. In this paper we developed an integrated microfluidic cell-culture platform, Cell-microChip (Cell-μChip), for parallel analyses of the effects of microenvir-onmental cues (i.e., culture scaffolds) on different mammalian cells and their cellular responses to external stimuli. As a model study, we demonstrated the ability of culturing and assaying several mammalian cells, such as NIH 3T3 fibro-blast, B16 melanoma and HeLa cell lines, in a parallel way. For functional assays, first we tested drug-induced apoptotic responses from different cell lines. As a second functional assay, we performed "on-chip" transfection of a reporter gene encoding an enhanced green fluorescent protein (EGFP) followed by live-cell imaging of transcriptional activation of cyclooxygenase 2 (Cox-2) expression. Collectively, our Cell-μChip approach demonstrated the capability to carry out parallel operations and the potential to further integrate advanced functions and applications in the broader space of combinatorial chemistry and biology. PMID:19130244

Increased Diversity of Libraries from Libraries: Chemoinformatic Analysis of Bis-Diazacyclic Libraries

PubMed Central

López-Vallejo, Fabian; Nefzi, Adel; Bender, Andreas; Owen, John R.; Nabney, Ian T.; Houghten, Richard A.; Medina-Franco, Jose L.

2011-01-01

Combinatorial libraries continue to play a key role in drug discovery. To increase structural diversity, several experimental methods have been developed. However, limited efforts have been performed so far to quantify the diversity of the broadly used diversity-oriented synthetic (DOS) libraries. Herein we report a comprehensive characterization of 15 bis-diazacyclic combinatorial libraries obtained through libraries from libraries, which is a DOS approach. Using MACCS keys, radial and different pharmacophoric fingerprints as well as six molecular properties, it was demonstrated the increased structural and property diversity of the libraries from libraries over the individual libraries. Comparison of the libraries to existing drugs, NCI Diversity and the Molecular Libraries Small Molecule Repository revealed the structural uniqueness of the combinatorial libraries (mean similarity < 0.5 for any fingerprint representation). In particular, bis-cyclic thiourea libraries were the most structurally dissimilar to drugs retaining drug-like character in property space. This study represents the first comprehensive quantification of the diversity of libraries from libraries providing a solid quantitative approach to compare and contrast the diversity of DOS libraries with existing drugs or any other compound collection. PMID:21294850

Adaptiveness in monotone pseudo-Boolean optimization and stochastic neural computation.

PubMed

Grossi, Giuliano

2009-08-01

Hopfield neural network (HNN) is a nonlinear computational model successfully applied in finding near-optimal solutions of several difficult combinatorial problems. In many cases, the network energy function is obtained through a learning procedure so that its minima are states falling into a proper subspace (feasible region) of the search space. However, because of the network nonlinearity, a number of undesirable local energy minima emerge from the learning procedure, significantly effecting the network performance. In the neural model analyzed here, we combine both a penalty and a stochastic process in order to enhance the performance of a binary HNN. The penalty strategy allows us to gradually lead the search towards states representing feasible solutions, so avoiding oscillatory behaviors or asymptotically instable convergence. Presence of stochastic dynamics potentially prevents the network to fall into shallow local minima of the energy function, i.e., quite far from global optimum. Hence, for a given fixed network topology, the desired final distribution on the states can be reached by carefully modulating such process. The model uses pseudo-Boolean functions both to express problem constraints and cost function; a combination of these two functions is then interpreted as energy of the neural network. A wide variety of NP-hard problems fall in the class of problems that can be solved by the model at hand, particularly those having a monotonic quadratic pseudo-Boolean function as constraint function. That is, functions easily derived by closed algebraic expressions representing the constraint structure and easy (polynomial time) to maximize. We show the asymptotic convergence properties of this model characterizing its state space distribution at thermal equilibrium in terms of Markov chain and give evidence of its ability to find high quality solutions on benchmarks and randomly generated instances of two specific problems taken from the computational graph theory.

The Quantum Approximation Optimization Algorithm for MaxCut: A Fermionic View

NASA Technical Reports Server (NTRS)

Wang, Zhihui; Hadfield, Stuart; Jiang, Zhang; Rieffel, Eleanor G.

2017-01-01

Farhi et al. recently proposed a class of quantum algorithms, the Quantum Approximate Optimization Algorithm (QAOA), for approximately solving combinatorial optimization problems. A level-p QAOA circuit consists of steps in which a classical Hamiltonian, derived from the cost function, is applied followed by a mixing Hamiltonian. The 2p times for which these two Hamiltonians are applied are the parameters of the algorithm. As p increases, however, the parameter search space grows quickly. The success of the QAOA approach will depend, in part, on finding effective parameter-setting strategies. Here, we analytically and numerically study parameter setting for QAOA applied to MAXCUT. For level-1 QAOA, we derive an analytical expression for a general graph. In principle, expressions for higher p could be derived, but the number of terms quickly becomes prohibitive. For a special case of MAXCUT, the Ring of Disagrees, or the 1D antiferromagnetic ring, we provide an analysis for arbitrarily high level. Using a Fermionic representation, the evolution of the system under QAOA translates into quantum optimal control of an ensemble of independent spins. This treatment enables us to obtain analytical expressions for the performance of QAOA for any p. It also greatly simplifies numerical search for the optimal values of the parameters. By exploring symmetries, we identify a lower-dimensional sub-manifold of interest; the search effort can be accordingly reduced. This analysis also explains an observed symmetry in the optimal parameter values. Further, we numerically investigate the parameter landscape and show that it is a simple one in the sense of having no local optima.

When Gravity Fails: Local Search Topology

NASA Technical Reports Server (NTRS)

Frank, Jeremy; Cheeseman, Peter; Stutz, John; Lau, Sonie (Technical Monitor)

1997-01-01

Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called {\\em plateau moves), dominate the time spent in local search. We analyze and characterize {\\em plateaus) for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e. global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.

Universal dynamical properties preclude standard clustering in a large class of biochemical data.

PubMed

Gomez, Florian; Stoop, Ralph L; Stoop, Ruedi

2014-09-01

Clustering of chemical and biochemical data based on observed features is a central cognitive step in the analysis of chemical substances, in particular in combinatorial chemistry, or of complex biochemical reaction networks. Often, for reasons unknown to the researcher, this step produces disappointing results. Once the sources of the problem are known, improved clustering methods might revitalize the statistical approach of compound and reaction search and analysis. Here, we present a generic mechanism that may be at the origin of many clustering difficulties. The variety of dynamical behaviors that can be exhibited by complex biochemical reactions on variation of the system parameters are fundamental system fingerprints. In parameter space, shrimp-like or swallow-tail structures separate parameter sets that lead to stable periodic dynamical behavior from those leading to irregular behavior. We work out the genericity of this phenomenon and demonstrate novel examples for their occurrence in realistic models of biophysics. Although we elucidate the phenomenon by considering the emergence of periodicity in dependence on system parameters in a low-dimensional parameter space, the conclusions from our simple setting are shown to continue to be valid for features in a higher-dimensional feature space, as long as the feature-generating mechanism is not too extreme and the dimension of this space is not too high compared with the amount of available data. For online versions of super-paramagnetic clustering see http://stoop.ini.uzh.ch/research/clustering. Supplementary data are available at Bioinformatics online. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Multiobjective evolutionary algorithm with many tables for purely ab initio protein structure prediction.

PubMed

Brasil, Christiane Regina Soares; Delbem, Alexandre Claudio Botazzo; da Silva, Fernando Luís Barroso

2013-07-30

This article focuses on the development of an approach for ab initio protein structure prediction (PSP) without using any earlier knowledge from similar protein structures, as fragment-based statistics or inference of secondary structures. Such an approach is called purely ab initio prediction. The article shows that well-designed multiobjective evolutionary algorithms can predict relevant protein structures in a purely ab initio way. One challenge for purely ab initio PSP is the prediction of structures with β-sheets. To work with such proteins, this research has also developed procedures to efficiently estimate hydrogen bond and solvation contribution energies. Considering van der Waals, electrostatic, hydrogen bond, and solvation contribution energies, the PSP is a problem with four energetic terms to be minimized. Each interaction energy term can be considered an objective of an optimization method. Combinatorial problems with four objectives have been considered too complex for the available multiobjective optimization (MOO) methods. The proposed approach, called "Multiobjective evolutionary algorithms with many tables" (MEAMT), can efficiently deal with four objectives through the combination thereof, performing a more adequate sampling of the objective space. Therefore, this method can better map the promising regions in this space, predicting structures in a purely ab initio way. In other words, MEAMT is an efficient optimization method for MOO, which explores simultaneously the search space as well as the objective space. MEAMT can predict structures with one or two domains with RMSDs comparable to values obtained by recently developed ab initio methods (GAPFCG , I-PAES, and Quark) that use different levels of earlier knowledge. Copyright © 2013 Wiley Periodicals, Inc.

Quantum-Mechanical Combinatorial Design of Solids having Target Properties

NASA Astrophysics Data System (ADS)

Zunger, Alex

2007-03-01

(1) One of the most striking aspects of solid state physics is the diversity of structural forms in which crystals appear in Nature. Not only are there many distinct crystal-types, but combinations of two or more crystalline materials (alloys) give rise to various local geometric atomic patters. The already rich repertoire of such forms has recently been significantly enhanced by the advent of artificial crystal growth techniques (MBE, STM- atom positioning, etc.) that can create desired structural forms, such as superlattices and impurity clusters even in defiance of the rules of equilibrium thermodynamics. (2) At the same time, the fields of chemistry of nanostructures and physics of structural phase-transitions have long revealed that different atomic configurations generally lead to different physical properties even without altering the chemical makeup. While the most widely - known illustration of such ``form controls function'' rule is the dramatically different color, conductivity and hardness of the allotropical forms of pure carbon (diamond,graphite, C60), the physics of semiconductor superstructures and nanostructures is full of striking examples of how optical, magnetic and transport properties depend sensitively on atomic configuration. (3) Yet, the history of material research has generally occurred via accidental discoveries of material structures having interesting physical property (semiconductivity, ferromagnetism; superconductivity etc.). This begs the question: can this discovery process be inverted, i.e. can we first articulate a desired target physical property, then search (within a class) for the configuration that has this property? (4) The number of potentially interesting atomic configurations exhibits a combinatorial explosion, so even fast synthesis or fast computations can not survey all. (5) This talk describes the recent steps made by solid state theory + computational physics to address this ``Inverse Design'' (Franceschetti & Zunger, Nature, 402, 60 (1999) problem. I will show how Genetic Algorithms, in combination with efficient (``Order N'') solutions to the Pseudopotential Schrodinger equation allow us to investigate astronomical spaces of atomic configurations in search of the structure with a target physical property. Only a small fraction of all (˜ 10**14 in our case) configurations need to be examined. Physical properties are either calculated on-the-fly (if it's easy), or first ``Cluster-Expanded'' (if the theory is difficult). I will illustrate this Inverse Band Structure approach for (a) Design of required band-gaps in semiconductor superlattices; (b) architecture of impurity --clusters with desired optical properties (PRL 97, 046401, 2006) (c) search for configuration of magnetic ions in semiconductors that maximize the ferromagnetic Curie temperature (PRL, 97, 047202, 2006).

Constructing Sample Space with Combinatorial Reasoning: A Mixed Methods Study

ERIC Educational Resources Information Center

McGalliard, William A., III.

2012-01-01

Recent curricular developments suggest that students at all levels need to be statistically literate and able to efficiently and accurately make probabilistic decisions. Furthermore, statistical literacy is a requirement to being a well-informed citizen of society. Research also recognizes that the ability to reason probabilistically is supported…

Automated Scenario Generation: Toward Tailored and Optimized Military Training in Virtual Environments

DTIC Science & Technology

2012-01-01

us.army.mil ABSTRACT Scenario-based training exemplifies the learning-by-doing approach to human performance improvement. In this paper , we enumerate...through a narrative, mission, quest, or scenario. In this paper we argue for a combinatorial optimization search approach to selecting and ordering...the role of an expert for the purposes of practicing skills and knowledge in realistic situations in a learning-by-doing approach to performance

Intermediate grouping on remotely sensed data using Gestalt algebra

NASA Astrophysics Data System (ADS)

Michaelsen, Eckart

2014-10-01

Human observers often achieve striking recognition performance on remotely sensed data unmatched by machine vision algorithms. This holds even for thermal images (IR) or synthetic aperture radar (SAR). Psychologists refer to these capabilities as Gestalt perceptive skills. Gestalt Algebra is a mathematical structure recently proposed for such laws of perceptual grouping. It gives operations for mirror symmetry, continuation in rows and rotational symmetric patterns. Each of these operations forms an aggregate-Gestalt of a tuple of part-Gestalten. Each Gestalt is attributed with a position, an orientation, a rotational frequency, a scale, and an assessment respectively. Any Gestalt can be combined with any other Gestalt using any of the three operations. Most often the assessment of the new aggregate-Gestalt will be close to zero. Only if the part-Gestalten perfectly fit into the desired pattern the new aggregate-Gestalt will be assessed with value one. The algebra is suitable in both directions: It may render an organized symmetric mandala using random numbers. Or it may recognize deep hidden visual relationships between meaningful parts of a picture. For the latter primitives must be obtained from the image by some key-point detector and a threshold. Intelligent search strategies are required for this search in the combinatorial space of possible Gestalt Algebra terms. Exemplarily, maximal assessed Gestalten found in selected aerial images as well as in IR and SAR images are presented.

Utilization of the Discrete Differential Evolution for Optimization in Multidimensional Point Clouds.

PubMed

Uher, Vojtěch; Gajdoš, Petr; Radecký, Michal; Snášel, Václav

2016-01-01

The Differential Evolution (DE) is a widely used bioinspired optimization algorithm developed by Storn and Price. It is popular for its simplicity and robustness. This algorithm was primarily designed for real-valued problems and continuous functions, but several modified versions optimizing both integer and discrete-valued problems have been developed. The discrete-coded DE has been mostly used for combinatorial problems in a set of enumerative variants. However, the DE has a great potential in the spatial data analysis and pattern recognition. This paper formulates the problem as a search of a combination of distinct vertices which meet the specified conditions. It proposes a novel approach called the Multidimensional Discrete Differential Evolution (MDDE) applying the principle of the discrete-coded DE in discrete point clouds (PCs). The paper examines the local searching abilities of the MDDE and its convergence to the global optimum in the PCs. The multidimensional discrete vertices cannot be simply ordered to get a convenient course of the discrete data, which is crucial for good convergence of a population. A novel mutation operator utilizing linear ordering of spatial data based on the space filling curves is introduced. The algorithm is tested on several spatial datasets and optimization problems. The experiments show that the MDDE is an efficient and fast method for discrete optimizations in the multidimensional point clouds.

Utilization of the Discrete Differential Evolution for Optimization in Multidimensional Point Clouds

PubMed Central

Radecký, Michal; Snášel, Václav

2016-01-01

The Differential Evolution (DE) is a widely used bioinspired optimization algorithm developed by Storn and Price. It is popular for its simplicity and robustness. This algorithm was primarily designed for real-valued problems and continuous functions, but several modified versions optimizing both integer and discrete-valued problems have been developed. The discrete-coded DE has been mostly used for combinatorial problems in a set of enumerative variants. However, the DE has a great potential in the spatial data analysis and pattern recognition. This paper formulates the problem as a search of a combination of distinct vertices which meet the specified conditions. It proposes a novel approach called the Multidimensional Discrete Differential Evolution (MDDE) applying the principle of the discrete-coded DE in discrete point clouds (PCs). The paper examines the local searching abilities of the MDDE and its convergence to the global optimum in the PCs. The multidimensional discrete vertices cannot be simply ordered to get a convenient course of the discrete data, which is crucial for good convergence of a population. A novel mutation operator utilizing linear ordering of spatial data based on the space filling curves is introduced. The algorithm is tested on several spatial datasets and optimization problems. The experiments show that the MDDE is an efficient and fast method for discrete optimizations in the multidimensional point clouds. PMID:27974884

Effect of the Implicit Combinatorial Model on Combinatorial Reasoning in Secondary School Pupils.

ERIC Educational Resources Information Center

Batanero, Carmen; And Others

1997-01-01

Elementary combinatorial problems may be classified into three different combinatorial models: (1) selection; (2) partition; and (3) distribution. The main goal of this research was to determine the effect of the implicit combinatorial model on pupils' combinatorial reasoning before and after instruction. Gives an analysis of variance of the…

Search for the decay modes B ±→h ±τl

DOE PAGES

Lees, J. P.; Poireau, V.; Tisserand, V.; ...

2012-07-16

We present a search for the lepton flavor violating decay modes B ±→h ±τl (h=K, π; l=e, μ) using the BABAR data sample, which corresponds to 472×10⁶ BB¯¯¯ pairs. The search uses events where one B meson is fully reconstructed in one of several hadronic final states. Using the momenta of the reconstructed B, h, and l candidates, we are able to fully determine the τ four-momentum. The resulting τ candidate mass is our main discriminant against combinatorial background. We see no evidence for B ±→h ±τl decays and set a 90% confidence level upper limit on each branching fractionmore » at the level of a few times 10⁻⁵.« less

Selecting a Classification Ensemble and Detecting Process Drift in an Evolving Data Stream

DOE Office of Scientific and Technical Information (OSTI.GOV)

Heredia-Langner, Alejandro; Rodriguez, Luke R.; Lin, Andy

2015-09-30

We characterize the commercial behavior of a group of companies in a common line of business using a small ensemble of classifiers on a stream of records containing commercial activity information. This approach is able to effectively find a subset of classifiers that can be used to predict company labels with reasonable accuracy. Performance of the ensemble, its error rate under stable conditions, can be characterized using an exponentially weighted moving average (EWMA) statistic. The behavior of the EWMA statistic can be used to monitor a record stream from the commercial network and determine when significant changes have occurred. Resultsmore » indicate that larger classification ensembles may not necessarily be optimal, pointing to the need to search the combinatorial classifier space in a systematic way. Results also show that current and past performance of an ensemble can be used to detect when statistically significant changes in the activity of the network have occurred. The dataset used in this work contains tens of thousands of high level commercial activity records with continuous and categorical variables and hundreds of labels, making classification challenging.« less

XY vs X Mixer in Quantum Alternating Operator Ansatz for Optimization Problems with Constraints

NASA Technical Reports Server (NTRS)

Wang, Zhihui; Rubin, Nicholas; Rieffel, Eleanor G.

2018-01-01

Quantum Approximate Optimization Algorithm, further generalized as Quantum Alternating Operator Ansatz (QAOA), is a family of algorithms for combinatorial optimization problems. It is a leading candidate to run on emerging universal quantum computers to gain insight into quantum heuristics. In constrained optimization, penalties are often introduced so that the ground state of the cost Hamiltonian encodes the solution (a standard practice in quantum annealing). An alternative is to choose a mixing Hamiltonian such that the constraint corresponds to a constant of motion and the quantum evolution stays in the feasible subspace. Better performance of the algorithm is speculated due to a much smaller search space. We consider problems with a constant Hamming weight as the constraint. We also compare different methods of generating the generalized W-state, which serves as a natural initial state for the Hamming-weight constraint. Using graph-coloring as an example, we compare the performance of using XY model as a mixer that preserves the Hamming weight with the performance of adding a penalty term in the cost Hamiltonian.

Solubility limits in quaternary SnTe-based alloys [Metastability and solubility limits in quaternary SnTe-based alloys guided by combinatorial sputtering

DOE PAGES

Siol, Sebastian; Holder, Aaron; Ortiz, Brenden R.; ...

2017-05-09

Here, the controlled decomposition of metastable alloys is an attractive route to form nanostructured thermoelectric materials with reduced thermal conductivity. The ternary SnTe–MnTe and SnTe–SnSe heterostructural alloys have been demonstrated as promising materials for thermoelectric applications. In this work, the quaternary Sn 1–yMnyTe 1–xSe x phase space serves as a relevant model system to explore how a combination of computational and combinatorial-growth methods can be used to study equilibrium and non-equilibrium solubility limits. Results from first principle calculations indicate low equilibrium solubility for x,y < 0.05 that are in good agreement with results obtained from bulk equilibrium synthesis experiments andmore » predict significantly higher spinodal limits. An experimental screening using sputtered combinatorial thin film sample libraries showed a remarkable increase in non-equilibrium solubility for x,y > 0.2. These theoretical and experimental results were used to guide the bulk synthesis of metastable alloys. The ability to reproduce the non-equilibrium solubility levels in bulk materials indicates that such theoretical calculations and combinatorial growth can inform bulk synthetic routes. Further, the large difference between equilibrium and non-equilibrium solubility limits in Sn 1–yMn yTe 1–xSe x indicates these metastable alloys are attractive in terms of nano-precipitate formation for potential thermoelectric applications.« less

Seeking Global Minima

NASA Astrophysics Data System (ADS)

Tajuddin, Wan Ahmad

1994-02-01

Ease in finding the configuration at the global energy minimum in a symmetric neural network is important for combinatorial optimization problems. We carry out a comprehensive survey of available strategies for seeking global minima by comparing their performances in the binary representation problem. We recall our previous comparison of steepest descent with analog dynamics, genetic hill-climbing, simulated diffusion, simulated annealing, threshold accepting and simulated tunneling. To this, we add comparisons to other strategies including taboo search and one with field-ordered updating.

Applications of Evolutionary Technology to Manufacturing and Logistics Systems : State-of-the Art Survey

NASA Astrophysics Data System (ADS)

Gen, Mitsuo; Lin, Lin

Many combinatorial optimization problems from industrial engineering and operations research in real-world are very complex in nature and quite hard to solve them by conventional techniques. Since the 1960s, there has been an increasing interest in imitating living beings to solve such kinds of hard combinatorial optimization problems. Simulating the natural evolutionary process of human beings results in stochastic optimization techniques called evolutionary algorithms (EAs), which can often outperform conventional optimization methods when applied to difficult real-world problems. In this survey paper, we provide a comprehensive survey of the current state-of-the-art in the use of EA in manufacturing and logistics systems. In order to demonstrate the EAs which are powerful and broadly applicable stochastic search and optimization techniques, we deal with the following engineering design problems: transportation planning models, layout design models and two-stage logistics models in logistics systems; job-shop scheduling, resource constrained project scheduling in manufacturing system.

Manipulating Tabu List to Handle Machine Breakdowns in Job Shop Scheduling Problems

NASA Astrophysics Data System (ADS)

Nababan, Erna Budhiarti; SalimSitompul, Opim

2011-06-01

Machine breakdowns in a production schedule may occur on a random basis that make the well-known hard combinatorial problem of Job Shop Scheduling Problems (JSSP) becomes more complex. One of popular techniques used to solve the combinatorial problems is Tabu Search. In this technique, moves that will be not allowed to be revisited are retained in a tabu list in order to avoid in gaining solutions that have been obtained previously. In this paper, we propose an algorithm to employ a second tabu list to keep broken machines, in addition to the tabu list that keeps the moves. The period of how long the broken machines will be kept on the list is categorized using fuzzy membership function. Our technique are tested to the benchmark data of JSSP available on the OR library. From the experiment, we found that our algorithm is promising to help a decision maker to face the event of machine breakdowns.

Statistical theory of combinatorial libraries of folding proteins: energetic discrimination of a target structure.

PubMed

Zou, J; Saven, J G

2000-02-11

A self-consistent theory is presented that can be used to estimate the number and composition of sequences satisfying a predetermined set of constraints. The theory is formulated so as to examine the features of sequences having a particular value of Delta=E(f)-(u), where E(f) is the energy of sequences when in a target structure and (u) is an average energy of non-target structures. The theory yields the probabilities w(i)(alpha) that each position i in the sequence is occupied by a particular monomer type alpha. The theory is applied to a simple lattice model of proteins. Excellent agreement is observed between the theory and the results of exact enumerations. The theory provides a quantitative framework for the design and interpretation of combinatorial experiments involving proteins, where a library of amino acid sequences is searched for sequences that fold to a desired structure. Copyright 2000 Academic Press.

Microscopic description of pair transfer between two superfluid Fermi systems: Combining phase-space averaging and combinatorial techniques

NASA Astrophysics Data System (ADS)

Regnier, David; Lacroix, Denis; Scamps, Guillaume; Hashimoto, Yukio

2018-03-01

In a mean-field description of superfluidity, particle number and gauge angle are treated as quasiclassical conjugated variables. This level of description was recently used to describe nuclear reactions around the Coulomb barrier. Important effects of the relative gauge angle between two identical superfluid nuclei (symmetric collisions) on transfer probabilities and fusion barrier have been uncovered. A theory making contact with experiments should at least average over different initial relative gauge-angles. In the present work, we propose a new approach to obtain the multiple pair transfer probabilities between superfluid systems. This method, called phase-space combinatorial (PSC) technique, relies both on phase-space averaging and combinatorial arguments to infer the full pair transfer probability distribution at the cost of multiple mean-field calculations only. After benchmarking this approach in a schematic model, we apply it to the collision 20O+20O at various energies below the Coulomb barrier. The predictions for one pair transfer are similar to results obtained with an approximated projection method, whereas significant differences are found for two pairs transfer. Finally, we investigated the applicability of the PSC method to the contact between nonidentical superfluid systems. A generalization of the method is proposed and applied to the schematic model showing that the pair transfer probabilities are reasonably reproduced. The applicability of the PSC method to asymmetric nuclear collisions is investigated for the 14O+20O collision and it turns out that unrealistically small single- and multiple pair transfer probabilities are obtained. This is explained by the fact that relative gauge angle play in this case a minor role in the particle transfer process compared to other mechanisms, such as equilibration of the charge/mass ratio. We conclude that the best ground for probing gauge-angle effects in nuclear reaction and/or for applying the proposed PSC approach on pair transfer is the collisions of identical open-shell spherical nuclei.

Annealing Ant Colony Optimization with Mutation Operator for Solving TSP

PubMed Central

2016-01-01

Ant Colony Optimization (ACO) has been successfully applied to solve a wide range of combinatorial optimization problems such as minimum spanning tree, traveling salesman problem, and quadratic assignment problem. Basic ACO has drawbacks of trapping into local minimum and low convergence rate. Simulated annealing (SA) and mutation operator have the jumping ability and global convergence; and local search has the ability to speed up the convergence. Therefore, this paper proposed a hybrid ACO algorithm integrating the advantages of ACO, SA, mutation operator, and local search procedure to solve the traveling salesman problem. The core of algorithm is based on the ACO. SA and mutation operator were used to increase the ants population diversity from time to time and the local search was used to exploit the current search area efficiently. The comparative experiments, using 24 TSP instances from TSPLIB, show that the proposed algorithm outperformed some well-known algorithms in the literature in terms of solution quality. PMID:27999590

Hybrid water flow-like algorithm with Tabu search for traveling salesman problem

NASA Astrophysics Data System (ADS)

Bostamam, Jasmin M.; Othman, Zulaiha

2016-08-01

This paper presents a hybrid Water Flow-like Algorithm with Tabu Search for solving travelling salesman problem (WFA-TS-TSP).WFA has been proven its outstanding performances in solving TSP meanwhile TS is a conventional algorithm which has been used since decades to solve various combinatorial optimization problem including TSP. Hybridization between WFA with TS provides a better balance of exploration and exploitation criteria which are the key elements in determining the performance of one metaheuristic. TS use two different local search namely, 2opt and 3opt separately. The proposed WFA-TS-TSP is tested on 23 sets on the well-known benchmarked symmetric TSP instances. The result shows that the proposed WFA-TS-TSP has significant better quality solutions compared to WFA. The result also shows that the WFA-TS-TSP with 3-opt obtained the best quality solution. With the result obtained, it could be concluded that WFA has potential to be further improved by using hybrid technique or using better local search technique.

The disadvantage of combinatorial communication.

PubMed Central

Lachmann, Michael; Bergstrom, Carl T.

2004-01-01

Combinatorial communication allows rapid and efficient transfer of detailed information, yet combinatorial communication is used by few, if any, non-human species. To complement recent studies illustrating the advantages of combinatorial communication, we highlight a critical disadvantage. We use the concept of information value to show that deception poses a greater and qualitatively different threat to combinatorial signalling than to non-combinatorial systems. This additional potential for deception may represent a strategic barrier that has prevented widespread evolution of combinatorial communication. Our approach has the additional benefit of drawing clear distinctions among several types of deception that can occur in communication systems. PMID:15556886

The disadvantage of combinatorial communication.

PubMed

Lachmann, Michael; Bergstrom, Carl T

2004-11-22

Combinatorial communication allows rapid and efficient transfer of detailed information, yet combinatorial communication is used by few, if any, non-human species. To complement recent studies illustrating the advantages of combinatorial communication, we highlight a critical disadvantage. We use the concept of information value to show that deception poses a greater and qualitatively different threat to combinatorial signalling than to non-combinatorial systems. This additional potential for deception may represent a strategic barrier that has prevented widespread evolution of combinatorial communication. Our approach has the additional benefit of drawing clear distinctions among several types of deception that can occur in communication systems.

Boolean logic tree of graphene-based chemical system for molecular computation and intelligent molecular search query.

PubMed

Huang, Wei Tao; Luo, Hong Qun; Li, Nian Bing

2014-05-06

The most serious, and yet unsolved, problem of constructing molecular computing devices consists in connecting all of these molecular events into a usable device. This report demonstrates the use of Boolean logic tree for analyzing the chemical event network based on graphene, organic dye, thrombin aptamer, and Fenton reaction, organizing and connecting these basic chemical events. And this chemical event network can be utilized to implement fluorescent combinatorial logic (including basic logic gates and complex integrated logic circuits) and fuzzy logic computing. On the basis of the Boolean logic tree analysis and logic computing, these basic chemical events can be considered as programmable "words" and chemical interactions as "syntax" logic rules to construct molecular search engine for performing intelligent molecular search query. Our approach is helpful in developing the advanced logic program based on molecules for application in biosensing, nanotechnology, and drug delivery.

Cut set-based risk and reliability analysis for arbitrarily interconnected networks

DOEpatents

Wyss, Gregory D.

2000-01-01

Method for computing all-terminal reliability for arbitrarily interconnected networks such as the United States public switched telephone network. The method includes an efficient search algorithm to generate minimal cut sets for nonhierarchical networks directly from the network connectivity diagram. Efficiency of the search algorithm stems in part from its basis on only link failures. The method also includes a novel quantification scheme that likewise reduces computational effort associated with assessing network reliability based on traditional risk importance measures. Vast reductions in computational effort are realized since combinatorial expansion and subsequent Boolean reduction steps are eliminated through analysis of network segmentations using a technique of assuming node failures to occur on only one side of a break in the network, and repeating the technique for all minimal cut sets generated with the search algorithm. The method functions equally well for planar and non-planar networks.

A Combinatorial Platform for the Optimization of Peptidomimetic Methyl-Lysine Reader Antagonists

NASA Astrophysics Data System (ADS)

Barnash, Kimberly D.

Post-translational modification of histone N-terminal tails mediates chromatin compaction and, consequently, DNA replication, transcription, and repair. While numerous post-translational modifications decorate histone tails, lysine methylation is an abundant mark important for both gene activation and repression. Methyl-lysine (Kme) readers function through binding mono-, di-, or trimethyl-lysine. Chemical intervention of Kme readers faces numerous challenges due to the broad surface-groove interactions between readers and their cognate histone peptides; yet, the increasing interest in understanding chromatin-modifying complexes suggests tractable lead compounds for Kme readers are critical for elucidating the mechanisms of chromatin dysregulation in disease states and validating the druggability of these domains and complexes. The successful discovery of a peptide-derived chemical probe, UNC3866, for the Polycomb repressive complex 1 (PRC1) chromodomain Kme readers has proven the potential for selective peptidomimetic inhibition of reader function. Unfortunately, the systematic modification of peptides-to-peptidomimetics is a costly and inefficient strategy for target-class hit discovery against Kme readers. Through the exploration of biased chemical space via combinatorial on-bead libraries, we have developed two concurrent methodologies for Kme reader chemical probe discovery. We employ biased peptide combinatorial libraries as a hit discovery strategy with subsequent optimization via iterative targeted libraries. Peptide-to-peptidomimetic optimization through targeted library design was applied based on structure-guided library design around the interaction of the endogenous peptide ligand with three target Kme readers. Efforts targeting the WD40 reader EED led to the discovery of the 3-mer peptidomimetic ligand UNC5115 while combinatorial repurposing of UNC3866 for off-target chromodomains resulted in the discovery of UNC4991, a CDYL/2-selective ligand, and UNC4848, a MPP8 and CDYL/2 ligand. Ultimately, our efforts demonstrate the generalizability of a peptidomimetic combinatorial platform for the optimization of Kme reader ligands in a target class manner.

Two projects in theoretical neuroscience: A convolution-based metric for neural membrane potentials and a combinatorial connectionist semantic network method

NASA Astrophysics Data System (ADS)

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 neurons.

LSI logic for phase-control rectifiers

NASA Technical Reports Server (NTRS)

Dolland, C.

1980-01-01

Signals for controlling phase-controlled rectifier circuit are generated by combinatorial logic than can be implemented in large-scale integration (LSI). LSI circuit saves space, weight, and assembly time compared to previous controls that employ one-shot multivibrators, latches, and capacitors. LSI logic functions by sensing three phases of ac power source and by comparing actual currents with intended currents.

Why is combinatorial communication rare in the natural world, and why is language an exception to this trend?

PubMed

Scott-Phillips, Thomas C; Blythe, Richard A

2013-11-06

In a combinatorial communication system, some signals consist of the combinations of other signals. Such systems are more efficient than equivalent, non-combinatorial systems, yet despite this they are rare in nature. Why? Previous explanations have focused on the adaptive limits of combinatorial communication, or on its purported cognitive difficulties, but neither of these explains the full distribution of combinatorial communication in the natural world. Here, we present a nonlinear dynamical model of the emergence of combinatorial communication that, unlike previous models, considers how initially non-communicative behaviour evolves to take on a communicative function. We derive three basic principles about the emergence of combinatorial communication. We hence show that the interdependence of signals and responses places significant constraints on the historical pathways by which combinatorial signals might emerge, to the extent that anything other than the most simple form of combinatorial communication is extremely unlikely. We also argue that these constraints can be bypassed if individuals have the socio-cognitive capacity to engage in ostensive communication. Humans, but probably no other species, have this ability. This may explain why language, which is massively combinatorial, is such an extreme exception to nature's general trend for non-combinatorial communication.

CAMELOT: Computational-Analytical Multi-fidElity Low-thrust Optimisation Toolbox

NASA Astrophysics Data System (ADS)

Di Carlo, Marilena; Romero Martin, Juan Manuel; Vasile, Massimiliano

2018-03-01

Computational-Analytical Multi-fidElity Low-thrust Optimisation Toolbox (CAMELOT) is a toolbox for the fast preliminary design and optimisation of low-thrust trajectories. It solves highly complex combinatorial problems to plan multi-target missions characterised by long spirals including different perturbations. To do so, CAMELOT implements a novel multi-fidelity approach combining analytical surrogate modelling and accurate computational estimations of the mission cost. Decisions are then made using two optimisation engines included in the toolbox, a single-objective global optimiser, and a combinatorial optimisation algorithm. CAMELOT has been applied to a variety of case studies: from the design of interplanetary trajectories to the optimal de-orbiting of space debris and from the deployment of constellations to on-orbit servicing. In this paper, the main elements of CAMELOT are described and two examples, solved using the toolbox, are presented.

A three-dimensional color space from the 13th century

PubMed Central

Smithson, Hannah E.; Dinkova-Bruun, Greti; Gasper, Giles E. M.; Huxtable, Mike; McLeish, Tom C. B.; Panti, Cecilia

2012-01-01

We present a new commentary on Robert Grosseteste’s De colore, a short treatise that dates from the early 13th century, in which Grosseteste constructs a linguistic combinatorial account of color. In contrast to other commentaries (e.g., Kuehni & Schwarz, Color Ordered: A Survey of Color Order Systems from Antiquity to the Present, 2007, p. 36), we argue that the color space described by Grosseteste is explicitly three-dimensional. We seek the appropriate translation of Grosseteste’s key terms, making reference both to Grosseteste’s other works and the broader intellectual context of the 13th century, and to modern color spaces. PMID:22330399

Stochastic dynamics and combinatorial optimization

NASA Astrophysics Data System (ADS)

Ovchinnikov, Igor V.; Wang, Kang L.

2017-11-01

Natural dynamics is often dominated by sudden nonlinear processes such as neuroavalanches, gamma-ray bursts, solar flares, etc., that exhibit scale-free statistics much in the spirit of the logarithmic Ritcher scale for earthquake magnitudes. On phase diagrams, stochastic dynamical systems (DSs) exhibiting this type of dynamics belong to the finite-width phase (N-phase for brevity) that precedes ordinary chaotic behavior and that is known under such names as noise-induced chaos, self-organized criticality, dynamical complexity, etc. Within the recently proposed supersymmetric theory of stochastic dynamics, the N-phase can be roughly interpreted as the noise-induced “overlap” between integrable and chaotic deterministic dynamics. As a result, the N-phase dynamics inherits the properties of the both. Here, we analyze this unique set of properties and conclude that the N-phase DSs must naturally be the most efficient optimizers: on one hand, N-phase DSs have integrable flows with well-defined attractors that can be associated with candidate solutions and, on the other hand, the noise-induced attractor-to-attractor dynamics in the N-phase is effectively chaotic or aperiodic so that a DS must avoid revisiting solutions/attractors thus accelerating the search for the best solution. Based on this understanding, we propose a method for stochastic dynamical optimization using the N-phase DSs. This method can be viewed as a hybrid of the simulated and chaotic annealing methods. Our proposition can result in a new generation of hardware devices for efficient solution of various search and/or combinatorial optimization problems.

Synthesis of Chemiluminescent Esters: A Combinatorial Synthesis Experiment for Organic Chemistry Students

ERIC Educational Resources Information Center

Duarte, Robert; Nielson, Janne T.; Dragojlovic, Veljko

2004-01-01

A group of techniques aimed at synthesizing a large number of structurally diverse compounds is called combinatorial synthesis. Synthesis of chemiluminescence esters using parallel combinatorial synthesis and mix-and-split combinatorial synthesis is experimented.

A ripple-spreading genetic algorithm for the aircraft sequencing problem.

PubMed

Hu, Xiao-Bing; Di Paolo, Ezequiel A

2011-01-01

When genetic algorithms (GAs) are applied to combinatorial problems, permutation representations are usually adopted. As a result, such GAs are often confronted with feasibility and memory-efficiency problems. With the aircraft sequencing problem (ASP) as a study case, this paper reports on a novel binary-representation-based GA scheme for combinatorial problems. Unlike existing GAs for the ASP, which typically use permutation representations based on aircraft landing order, the new GA introduces a novel ripple-spreading model which transforms the original landing-order-based ASP solutions into value-based ones. In the new scheme, arriving aircraft are projected as points into an artificial space. A deterministic method inspired by the natural phenomenon of ripple-spreading on liquid surfaces is developed, which uses a few parameters as input to connect points on this space to form a landing sequence. A traditional GA, free of feasibility and memory-efficiency problems, can then be used to evolve the ripple-spreading related parameters in order to find an optimal sequence. Since the ripple-spreading model is the centerpiece of the new algorithm, it is called the ripple-spreading GA (RSGA). The advantages of the proposed RSGA are illustrated by extensive comparative studies for the case of the ASP.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Siol, Sebastian; Holder, Aaron; Ortiz, Brenden R.

Here, the controlled decomposition of metastable alloys is an attractive route to form nanostructured thermoelectric materials with reduced thermal conductivity. The ternary SnTe–MnTe and SnTe–SnSe heterostructural alloys have been demonstrated as promising materials for thermoelectric applications. In this work, the quaternary Sn 1–yMnyTe 1–xSe x phase space serves as a relevant model system to explore how a combination of computational and combinatorial-growth methods can be used to study equilibrium and non-equilibrium solubility limits. Results from first principle calculations indicate low equilibrium solubility for x,y < 0.05 that are in good agreement with results obtained from bulk equilibrium synthesis experiments andmore » predict significantly higher spinodal limits. An experimental screening using sputtered combinatorial thin film sample libraries showed a remarkable increase in non-equilibrium solubility for x,y > 0.2. These theoretical and experimental results were used to guide the bulk synthesis of metastable alloys. The ability to reproduce the non-equilibrium solubility levels in bulk materials indicates that such theoretical calculations and combinatorial growth can inform bulk synthetic routes. Further, the large difference between equilibrium and non-equilibrium solubility limits in Sn 1–yMn yTe 1–xSe x indicates these metastable alloys are attractive in terms of nano-precipitate formation for potential thermoelectric applications.« less

DOE Office of Scientific and Technical Information (OSTI.GOV)

Siol, Sebastian; Dhakal, Tara P.; Gudavalli, Ganesh S.

High-throughput computational and experimental techniques have been used in the past to accelerate the discovery of new promising solar cell materials. An important part of the development of novel thin film solar cell technologies, that is still considered a bottleneck for both theory and experiment, is the search for alternative interfacial contact (buffer) layers. The research and development of contact materials is difficult due to the inherent complexity that arises from its interactions at the interface with the absorber. A promising alternative to the commonly used CdS buffer layer in thin film solar cells that contain absorbers with lower electronmore » affinity can be found in ..beta..-In2S3. However, the synthesis conditions for the sputter deposition of this material are not well-established. Here, In2S3 is investigated as a solar cell contact material utilizing a high-throughput combinatorial screening of the temperature-flux parameter space, followed by a number of spatially resolved characterization techniques. It is demonstrated that, by tuning the sulfur partial pressure, phase pure ..beta..-In2S3 could be deposited using a broad range of substrate temperatures between 500 degrees C and ambient temperature. Combinatorial photovoltaic device libraries with Al/ZnO/In2S3/Cu2ZnSnS4/Mo/SiO2 structure were built at optimal processing conditions to investigate the feasibility of the sputtered In2S3 buffer layers and of an accelerated optimization of the device structure. The performance of the resulting In2S3/Cu2ZnSnS4 photovoltaic devices is on par with CdS/Cu2ZnSnS4 reference solar cells with similar values for short circuit currents and open circuit voltages, despite the overall quite low efficiency of the devices (-2%). Overall, these results demonstrate how a high-throughput experimental approach can be used to accelerate the development of contact materials and facilitate the optimization of thin film solar cell devices.« less

Asessing for Structural Understanding in Childrens' Combinatorial Problem Solving.

ERIC Educational Resources Information Center

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…

Tabu Search enhances network robustness under targeted attacks

NASA Astrophysics Data System (ADS)

Sun, Shi-wen; Ma, Yi-lin; Li, Rui-qi; Wang, Li; Xia, Cheng-yi

2016-03-01

We focus on the optimization of network robustness with respect to intentional attacks on high-degree nodes. Given an existing network, this problem can be considered as a typical single-objective combinatorial optimization problem. Based on the heuristic Tabu Search optimization algorithm, a link-rewiring method is applied to reconstruct the network while keeping the degree of every node unchanged. Through numerical simulations, BA scale-free network and two real-world networks are investigated to verify the effectiveness of the proposed optimization method. Meanwhile, we analyze how the optimization affects other topological properties of the networks, including natural connectivity, clustering coefficient and degree-degree correlation. The current results can help to improve the robustness of existing complex real-world systems, as well as to provide some insights into the design of robust networks.

Complexity: an internet resource for analysis of DNA sequence complexity

PubMed Central

Orlov, Y. L.; Potapov, V. N.

2004-01-01

The search for DNA regions with low complexity is one of the pivotal tasks of modern structural analysis of complete genomes. The low complexity may be preconditioned by strong inequality in nucleotide content (biased composition), by tandem or dispersed repeats or by palindrome-hairpin structures, as well as by a combination of all these factors. Several numerical measures of textual complexity, including combinatorial and linguistic ones, together with complexity estimation using a modified Lempel–Ziv algorithm, have been implemented in a software tool called ‘Complexity’ (http://wwwmgs.bionet.nsc.ru/mgs/programs/low_complexity/). The software enables a user to search for low-complexity regions in long sequences, e.g. complete bacterial genomes or eukaryotic chromosomes. In addition, it estimates the complexity of groups of aligned sequences. PMID:15215465

High performance genetic algorithm for VLSI circuit partitioning

NASA Astrophysics Data System (ADS)

Dinu, Simona

2016-12-01

Partitioning is one of the biggest challenges in computer-aided design for VLSI circuits (very large-scale integrated circuits). This work address the min-cut balanced circuit partitioning problem- dividing the graph that models the circuit into almost equal sized k sub-graphs while minimizing the number of edges cut i.e. minimizing the number of edges connecting the sub-graphs. The problem may be formulated as a combinatorial optimization problem. Experimental studies in the literature have shown the problem to be NP-hard and thus it is important to design an efficient heuristic algorithm to solve it. The approach proposed in this study is a parallel implementation of a genetic algorithm, namely an island model. The information exchange between the evolving subpopulations is modeled using a fuzzy controller, which determines an optimal balance between exploration and exploitation of the solution space. The results of simulations show that the proposed algorithm outperforms the standard sequential genetic algorithm both in terms of solution quality and convergence speed. As a direction for future study, this research can be further extended to incorporate local search operators which should include problem-specific knowledge. In addition, the adaptive configuration of mutation and crossover rates is another guidance for future research.

A preliminary study to metaheuristic approach in multilayer radiation shielding optimization

NASA Astrophysics Data System (ADS)

Arif Sazali, Muhammad; Rashid, Nahrul Khair Alang Md; Hamzah, Khaidzir

2018-01-01

Metaheuristics are high-level algorithmic concepts that can be used to develop heuristic optimization algorithms. One of their applications is to find optimal or near optimal solutions to combinatorial optimization problems (COPs) such as scheduling, vehicle routing, and timetabling. Combinatorial optimization deals with finding optimal combinations or permutations in a given set of problem components when exhaustive search is not feasible. A radiation shield made of several layers of different materials can be regarded as a COP. The time taken to optimize the shield may be too high when several parameters are involved such as the number of materials, the thickness of layers, and the arrangement of materials. Metaheuristics can be applied to reduce the optimization time, trading guaranteed optimal solutions for near-optimal solutions in comparably short amount of time. The application of metaheuristics for radiation shield optimization is lacking. In this paper, we present a review on the suitability of using metaheuristics in multilayer shielding design, specifically the genetic algorithm and ant colony optimization algorithm (ACO). We would also like to propose an optimization model based on the ACO method.

Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication

ERIC Educational Resources Information Center

Wolf, Michael Maclean

2009-01-01

Combinatorial scientific computing plays an important enabling role in computational science, particularly in high performance scientific computing. In this thesis, we will describe our work on optimizing matrix-vector multiplication using combinatorial techniques. Our research has focused on two different problems in combinatorial scientific…

Reducing codon redundancy and screening effort of combinatorial protein libraries created by saturation mutagenesis.

PubMed

Kille, Sabrina; Acevedo-Rocha, Carlos G; Parra, Loreto P; Zhang, Zhi-Gang; Opperman, Diederik J; Reetz, Manfred T; Acevedo, Juan Pablo

2013-02-15

Saturation mutagenesis probes define sections of the vast protein sequence space. However, even if randomization is limited this way, the combinatorial numbers problem is severe. Because diversity is created at the codon level, codon redundancy is a crucial factor determining the necessary effort for library screening. Additionally, due to the probabilistic nature of the sampling process, oversampling is required to ensure library completeness as well as a high probability to encounter all unique variants. Our trick employs a special mixture of three primers, creating a degeneracy of 22 unique codons coding for the 20 canonical amino acids. Therefore, codon redundancy and subsequent screening effort is significantly reduced, and a balanced distribution of codon per amino acid is achieved, as demonstrated exemplarily for a library of cyclohexanone monooxygenase. We show that this strategy is suitable for any saturation mutagenesis methodology to generate less-redundant libraries.

Partial differential equations constrained combinatorial optimization on an adiabatic quantum computer

NASA Astrophysics Data System (ADS)

Chandra, Rishabh

Partial differential equation-constrained combinatorial optimization (PDECCO) problems are a mixture of continuous and discrete optimization problems. PDECCO problems have discrete controls, but since the partial differential equations (PDE) are continuous, the optimization space is continuous as well. Such problems have several applications, such as gas/water network optimization, traffic optimization, micro-chip cooling optimization, etc. Currently, no efficient classical algorithm which guarantees a global minimum for PDECCO problems exists. A new mapping has been developed that transforms PDECCO problem, which only have linear PDEs as constraints, into quadratic unconstrained binary optimization (QUBO) problems that can be solved using an adiabatic quantum optimizer (AQO). The mapping is efficient, it scales polynomially with the size of the PDECCO problem, requires only one PDE solve to form the QUBO problem, and if the QUBO problem is solved correctly and efficiently on an AQO, guarantees a global optimal solution for the original PDECCO problem.

Combinatorial structures to modeling simple games and applications

NASA Astrophysics Data System (ADS)

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.

Cloud4Psi: cloud computing for 3D protein structure similarity searching.

PubMed

Mrozek, Dariusz; Małysiak-Mrozek, Bożena; Kłapciński, Artur

2014-10-01

Popular methods for 3D protein structure similarity searching, especially those that generate high-quality alignments such as Combinatorial Extension (CE) and Flexible structure Alignment by Chaining Aligned fragment pairs allowing Twists (FATCAT) are still time consuming. As a consequence, performing similarity searching against large repositories of structural data requires increased computational resources that are not always available. Cloud computing provides huge amounts of computational power that can be provisioned on a pay-as-you-go basis. We have developed the cloud-based system that allows scaling of the similarity searching process vertically and horizontally. Cloud4Psi (Cloud for Protein Similarity) was tested in the Microsoft Azure cloud environment and provided good, almost linearly proportional acceleration when scaled out onto many computational units. Cloud4Psi is available as Software as a Service for testing purposes at: http://cloud4psi.cloudapp.net/. For source code and software availability, please visit the Cloud4Psi project home page at http://zti.polsl.pl/dmrozek/science/cloud4psi.htm. © The Author 2014. Published by Oxford University Press.

Cloud4Psi: cloud computing for 3D protein structure similarity searching

PubMed Central

Mrozek, Dariusz; Małysiak-Mrozek, Bożena; Kłapciński, Artur

2014-01-01

Summary: Popular methods for 3D protein structure similarity searching, especially those that generate high-quality alignments such as Combinatorial Extension (CE) and Flexible structure Alignment by Chaining Aligned fragment pairs allowing Twists (FATCAT) are still time consuming. As a consequence, performing similarity searching against large repositories of structural data requires increased computational resources that are not always available. Cloud computing provides huge amounts of computational power that can be provisioned on a pay-as-you-go basis. We have developed the cloud-based system that allows scaling of the similarity searching process vertically and horizontally. Cloud4Psi (Cloud for Protein Similarity) was tested in the Microsoft Azure cloud environment and provided good, almost linearly proportional acceleration when scaled out onto many computational units. Availability and implementation: Cloud4Psi is available as Software as a Service for testing purposes at: http://cloud4psi.cloudapp.net/. For source code and software availability, please visit the Cloud4Psi project home page at http://zti.polsl.pl/dmrozek/science/cloud4psi.htm. Contact: dariusz.mrozek@polsl.pl PMID:24930141

Applications of SHAPES screening in drug discovery.

PubMed

Lepre, Christopher A; Peng, Jeffrey; Fejzo, Jasna; Abdul-Manan, Norzehan; Pocas, Jennifer; Jacobs, Marc; Xie, Xiaoling; Moore, Jonathan M

2002-12-01

The SHAPES strategy combines nuclear magnetic resonance (NMR) screening of a library of small drug-like molecules with a variety of complementary methods, such as virtual screening, high throughput enzymatic assays, combinatorial chemistry, X-ray crystallography, and molecular modeling, in a directed search for new medicinal chemistry leads. In the past few years, the SHAPES strategy has found widespread utility in pharmaceutical research. To illustrate a variety of different implementations of the method, we will focus in this review on recent applications of the SHAPES strategy in several drug discovery programs at Vertex Pharmaceuticals.

Real-time inverse planning for Gamma Knife radiosurgery.

PubMed

Wu, Q Jackie; Chankong, Vira; Jitprapaikulsarn, Suradet; Wessels, Barry W; Einstein, Douglas B; Mathayomchan, Boonyanit; Kinsella, Timothy J

2003-11-01

The challenges of real-time Gamma Knife inverse planning are the large number of variables involved and the unknown search space a priori. With limited collimator sizes, shots have to be heavily overlapped to form a smooth prescription isodose line that conforms to the irregular target shape. Such overlaps greatly influence the total number of shots per plan, making pre-determination of the total number of shots impractical. However, this total number of shots usually defines the search space, a pre-requisite for most of the optimization methods. Since each shot only covers part of the target, a collection of shots in different locations and various collimator sizes selected makes up the global dose distribution that conforms to the target. Hence, planning or placing these shots is a combinatorial optimization process that is computationally expensive by nature. We have previously developed a theory of shot placement and optimization based on skeletonization. The real-time inverse planning process, reported in this paper, is an expansion and the clinical implementation of this theory. The complete planning process consists of two steps. The first step is to determine an optimal number of shots including locations and sizes and to assign initial collimator size to each of the shots. The second step is to fine-tune the weights using a linear-programming technique. The objective function is to minimize the total dose to the target boundary (i.e., maximize the dose conformity). Results of an ellipsoid test target and ten clinical cases are presented. The clinical cases are also compared with physician's manual plans. The target coverage is more than 99% for manual plans and 97% for all the inverse plans. The RTOG PITV conformity indices for the manual plans are between 1.16 and 3.46, compared to 1.36 to 2.4 for the inverse plans. All the inverse plans are generated in less than 2 min, making real-time inverse planning a reality.

Scattering forms and the positive geometry of kinematics, color and the worldsheet

NASA Astrophysics Data System (ADS)

Arkani-Hamed, Nima; Bai, Yuntao; He, Song; Yan, Gongwang

2018-05-01

The search for a theory of the S-Matrix over the past five decades has revealed surprising geometric structures underlying scattering amplitudes ranging from the string worldsheet to the amplituhedron, but these are all geometries in auxiliary spaces as opposed to the kinematical space where amplitudes actually live. Motivated by recent advances providing a reformulation of the amplituhedron and planar N = 4 SYM amplitudes directly in kinematic space, we propose a novel geometric understanding of amplitudes in more general theories. The key idea is to think of amplitudes not as functions, but rather as differential forms on kinematic space. We explore the resulting picture for a wide range of massless theories in general spacetime dimensions. For the bi-adjoint ϕ 3 scalar theory, we establish a direct connection between its "scattering form" and a classic polytope — the associahedron — known to mathematicians since the 1960's. We find an associahedron living naturally in kinematic space, and the tree level amplitude is simply the "canonical form" associated with this "positive geometry". Fundamental physical properties such as locality and unitarity, as well as novel "soft" limits, are fully determined by the combinatorial geometry of this polytope. Furthermore, the moduli space for the open string worldsheet has also long been recognized as an associahedron. We show that the scattering equations act as a diffeomorphism between the interior of this old "worldsheet associahedron" and the new "kinematic associahedron", providing a geometric interpretation and simple conceptual derivation of the bi-adjoint CHY formula. We also find "scattering forms" on kinematic space for Yang-Mills theory and the Non-linear Sigma Model, which are dual to the fully color-dressed amplitudes despite having no explicit color factors. This is possible due to a remarkable fact—"Color is Kinematics"— whereby kinematic wedge products in the scattering forms satisfy the same Jacobi relations as color factors. Finally, all our scattering forms are well-defined on the projectivized kinematic space, a property which can be seen to provide a geometric origin for color-kinematics duality.

There Once Was a 9-Block ...--A Middle-School Design for Probability and Statistics

ERIC Educational Resources Information Center

Abrahamson, Dor; Janusz, Ruth M.; Wilensky, Uri

2006-01-01

ProbLab is a probability-and-statistics unit developed at the Center for Connected Learning and Computer-Based Modeling, Northwestern University. Students analyze the combinatorial space of the 9-block, a 3-by-3 grid of squares, in which each square can be either green or blue. All 512 possible 9-blocks are constructed and assembled in a "bar…

Generalised Spin Dynamics and Induced Bounds of Automorphic [A]nX, [AX]n NMR Systems via Dual Tensorial Sets: An Invariant Cardinality Role for CFP

NASA Astrophysics Data System (ADS)

Temme, Francis P.

For uniform spins and their indistinguishable point sets of tensorial bases defining automorphic group-based Liouvillian NMR spin dynamics, the role of recursively-derived coefficients of fractional parentage (CFP) bijections and Schur duality-defined CFP(0)(n) ≡ ¦GI¦(n) group invariant cardinality is central both to understanding the impact of time-reversal invariance(TRI) spin physics, and to analysis as density-matrix formalisms over democratic recoupled (DR) dual tensorial sets, {T{ṽ}k(11.1)(SU2 × ln)}. Over abstract spin space, these tensorial sets are (ṽ) invariant-theoretic forms which lie beyond the Liouvillian graph recoupling and Racah-forms envisaged by Sanctuary [1]. This is a direct consequence of the dominance of the ln group. It leads to new views on the value of projective group actions as mappings over specialised Liouvillian carrier spaces, and on the need for the replacement of Racah-Wigner (R-W) orthogonality for distinct point sets, by criteria based on explicit properties of invariants [J. Phys.: Math. & Theor. A 41, 015210 (2008)] for multiple invariant systems. Ũ × P group actions over disjoint (L) carrier subspaces, leading to exclusively combinatorial views of the nature of quantal completeness for indistinguishable point-based tensorial sets. Such generalised invariant-theoretic approaches lie beyond the range of Lévi-Civitá generator views, or of Lévy-Leblond and Lévy-Nahas [9] with its additional cyclic-commutators defining mono-invariant DR forms. Comparison of the latter with generalised multiple-invariant techniques provides an answer to the question of precisely why [A]n≥4(X) and [AX]n≥4 NMR system spin dynamics are not ameniable to conventional R-W analysis of recoupled discrete-point tensorial systems. Our work augments earlier Hilbert space views, both of Louck and Biedenharn [21] on boson pattern projective mapping, and of Corio [19]. The roles of recent ln group action and (λ ⊢ n)-Schur combinatorial concepts, as well as of polyhedral-combinatorial modelling over invariance algebras, contribute significantly to our understanding of invariant-based techniques of Liouville dual tensorial sets for automorphic NMR spin physics.1

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

DOEpatents

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.

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

PubMed Central

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

A New Approach for Proving or Generating Combinatorial Identities

ERIC Educational Resources Information Center

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…

Amoeba-inspired nanoarchitectonic computing implemented using electrical Brownian ratchets.

PubMed

Aono, M; Kasai, S; Kim, S-J; Wakabayashi, M; Miwa, H; Naruse, M

2015-06-12

In this study, we extracted the essential spatiotemporal dynamics that allow an amoeboid organism to solve a computationally demanding problem and adapt to its environment, thereby proposing a nature-inspired nanoarchitectonic computing system, which we implemented using a network of nanowire devices called 'electrical Brownian ratchets (EBRs)'. By utilizing the fluctuations generated from thermal energy in nanowire devices, we used our system to solve the satisfiability problem, which is a highly complex combinatorial problem related to a wide variety of practical applications. We evaluated the dependency of the solution search speed on its exploration parameter, which characterizes the fluctuation intensity of EBRs, using a simulation model of our system called 'AmoebaSAT-Brownian'. We found that AmoebaSAT-Brownian enhanced the solution searching speed dramatically when we imposed some constraints on the fluctuations in its time series and it outperformed a well-known stochastic local search method. These results suggest a new computing paradigm, which may allow high-speed problem solving to be implemented by interacting nanoscale devices with low power consumption.

A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles

PubMed Central

Crawford, Broderick; Paredes, Fernando; Norero, Enrique

2015-01-01

The Sudoku problem is a well-known logic-based puzzle of combinatorial number-placement. It consists in filling a n 2 × n 2 grid, composed of n columns, n rows, and n subgrids, each one containing distinct integers from 1 to n 2. Such a puzzle belongs to the NP-complete collection of problems, to which there exist diverse exact and approximate methods able to solve it. In this paper, we propose a new hybrid algorithm that smartly combines a classic tabu search procedure with the alldifferent global constraint from the constraint programming world. The alldifferent constraint is known to be efficient for domain filtering in the presence of constraints that must be pairwise different, which are exactly the kind of constraints that Sudokus own. This ability clearly alleviates the work of the tabu search, resulting in a faster and more robust approach for solving Sudokus. We illustrate interesting experimental results where our proposed algorithm outperforms the best results previously reported by hybrids and approximate methods. PMID:26078751

A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles.

PubMed

Soto, Ricardo; Crawford, Broderick; Galleguillos, Cristian; Paredes, Fernando; Norero, Enrique

2015-01-01

The Sudoku problem is a well-known logic-based puzzle of combinatorial number-placement. It consists in filling a n(2) × n(2) grid, composed of n columns, n rows, and n subgrids, each one containing distinct integers from 1 to n(2). Such a puzzle belongs to the NP-complete collection of problems, to which there exist diverse exact and approximate methods able to solve it. In this paper, we propose a new hybrid algorithm that smartly combines a classic tabu search procedure with the alldifferent global constraint from the constraint programming world. The alldifferent constraint is known to be efficient for domain filtering in the presence of constraints that must be pairwise different, which are exactly the kind of constraints that Sudokus own. This ability clearly alleviates the work of the tabu search, resulting in a faster and more robust approach for solving Sudokus. We illustrate interesting experimental results where our proposed algorithm outperforms the best results previously reported by hybrids and approximate methods.

Combinatorial techniques to efficiently investigate and optimize organic thin film processing and properties.

PubMed

Wieberger, Florian; Kolb, Tristan; Neuber, Christian; Ober, Christopher K; Schmidt, Hans-Werner

2013-04-08

In this article we present several developed and improved combinatorial techniques to optimize processing conditions and material properties of organic thin films. The combinatorial approach allows investigations of multi-variable dependencies and is the perfect tool to investigate organic thin films regarding their high performance purposes. In this context we develop and establish the reliable preparation of gradients of material composition, temperature, exposure, and immersion time. Furthermore we demonstrate the smart application of combinations of composition and processing gradients to create combinatorial libraries. First a binary combinatorial library is created by applying two gradients perpendicular to each other. A third gradient is carried out in very small areas and arranged matrix-like over the entire binary combinatorial library resulting in a ternary combinatorial library. Ternary combinatorial libraries allow identifying precise trends for the optimization of multi-variable dependent processes which is demonstrated on the lithographic patterning process. Here we verify conclusively the strong interaction and thus the interdependency of variables in the preparation and properties of complex organic thin film systems. The established gradient preparation techniques are not limited to lithographic patterning. It is possible to utilize and transfer the reported combinatorial techniques to other multi-variable dependent processes and to investigate and optimize thin film layers and devices for optical, electro-optical, and electronic applications.

Dynamic combinatorial libraries: new opportunities in systems chemistry.

PubMed

Hunt, Rosemary A R; Otto, Sijbren

2011-01-21

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 these molecular networks at systems level is essential for their use as a selection tool and creates exciting new opportunities in systems chemistry. In this feature article we discuss selected examples and considerations related to the advanced exploitation of dynamic combinatorial libraries for their originally conceived purpose of identifying strong binding interactions. Also reviewed are examples illustrating a trend towards increasing complexity in terms of network behaviour and reversible chemistry. Finally, new applications of dynamic combinatorial chemistry in self-assembly, transport and self-replication are discussed.

Structure-guided fragment-based in silico drug design of dengue protease inhibitors.

PubMed

Knehans, Tim; Schüller, Andreas; Doan, Danny N; Nacro, Kassoum; Hill, Jeffrey; Güntert, Peter; Madhusudhan, M S; Weil, Tanja; Vasudevan, Subhash G

2011-03-01

An in silico fragment-based drug design approach was devised and applied towards the identification of small molecule inhibitors of the dengue virus (DENV) NS2B-NS3 protease. Currently, no DENV protease co-crystal structure with bound inhibitor and fully formed substrate binding site is available. Therefore a homology model of DENV NS2B-NS3 protease was generated employing a multiple template spatial restraints method and used for structure-based design. A library of molecular fragments was derived from the ZINC screening database with help of the retrosynthetic combinatorial analysis procedure (RECAP). 150,000 molecular fragments were docked to the DENV protease homology model and the docking poses were rescored using a target-specific scoring function. High scoring fragments were assembled to small molecule candidates by an implicit linking cascade. The cascade included substructure searching and structural filters focusing on interactions with the S1 and S2 pockets of the protease. The chemical space adjacent to the promising candidates was further explored by neighborhood searching. A total of 23 compounds were tested experimentally and two compounds were discovered to inhibit dengue protease (IC(50) = 7.7 μM and 37.9 μM, respectively) and the related West Nile virus protease (IC(50) = 6.3 μM and 39.0 μM, respectively). This study demonstrates the successful application of a structure-guided fragment-based in silico drug design approach for dengue protease inhibitors providing straightforward hit generation using a combination of homology modeling, fragment docking, chemical similarity and structural filters.

Structure-guided fragment-based in silico drug design of dengue protease inhibitors

NASA Astrophysics Data System (ADS)

Knehans, Tim; Schüller, Andreas; Doan, Danny N.; Nacro, Kassoum; Hill, Jeffrey; Güntert, Peter; Madhusudhan, M. S.; Weil, Tanja; Vasudevan, Subhash G.

2011-03-01

An in silico fragment-based drug design approach was devised and applied towards the identification of small molecule inhibitors of the dengue virus (DENV) NS2B-NS3 protease. Currently, no DENV protease co-crystal structure with bound inhibitor and fully formed substrate binding site is available. Therefore a homology model of DENV NS2B-NS3 protease was generated employing a multiple template spatial restraints method and used for structure-based design. A library of molecular fragments was derived from the ZINC screening database with help of the retrosynthetic combinatorial analysis procedure (RECAP). 150,000 molecular fragments were docked to the DENV protease homology model and the docking poses were rescored using a target-specific scoring function. High scoring fragments were assembled to small molecule candidates by an implicit linking cascade. The cascade included substructure searching and structural filters focusing on interactions with the S1 and S2 pockets of the protease. The chemical space adjacent to the promising candidates was further explored by neighborhood searching. A total of 23 compounds were tested experimentally and two compounds were discovered to inhibit dengue protease (IC50 = 7.7 μM and 37.9 μM, respectively) and the related West Nile virus protease (IC50 = 6.3 μM and 39.0 μM, respectively). This study demonstrates the successful application of a structure-guided fragment-based in silico drug design approach for dengue protease inhibitors providing straightforward hit generation using a combination of homology modeling, fragment docking, chemical similarity and structural filters.

World Wide Web-based system for the calculation of substituent parameters and substituent similarity searches.

PubMed

Ertl, P

1998-02-01

Easy to use, interactive, and platform-independent WWW-based tools are ideal for development of chemical applications. By using the newly emerging Web technologies such as Java applets and sophisticated scripting, it is possible to deliver powerful molecular processing capabilities directly to the desk of synthetic organic chemists. In Novartis Crop Protection in Basel, a Web-based molecular modelling system has been in use since 1995. In this article two new modules of this system are presented: a program for interactive calculation of important hydrophobic, electronic, and steric properties of organic substituents, and a module for substituent similarity searches enabling the identification of bioisosteric functional groups. Various possible applications of calculated substituent parameters are also discussed, including automatic design of molecules with the desired properties and creation of targeted virtual combinatorial libraries.

CRAVE: a database, middleware and visualization system for phenotype ontologies.

PubMed

Gkoutos, Georgios V; Green, Eain C J; Greenaway, Simon; Blake, Andrew; Mallon, Ann-Marie; Hancock, John M

2005-04-01

A major challenge in modern biology is to link genome sequence information to organismal function. In many organisms this is being done by characterizing phenotypes resulting from mutations. Efficiently expressing phenotypic information requires combinatorial use of ontologies. However tools are not currently available to visualize combinations of ontologies. Here we describe CRAVE (Concept Relation Assay Value Explorer), a package allowing storage, active updating and visualization of multiple ontologies. CRAVE is a web-accessible JAVA application that accesses an underlying MySQL database of ontologies via a JAVA persistent middleware layer (Chameleon). This maps the database tables into discrete JAVA classes and creates memory resident, interlinked objects corresponding to the ontology data. These JAVA objects are accessed via calls through the middleware's application programming interface. CRAVE allows simultaneous display and linking of multiple ontologies and searching using Boolean and advanced searches.

cDREM: inferring dynamic combinatorial gene regulation.

PubMed

Wise, Aaron; Bar-Joseph, Ziv

2015-04-01

Genes are often combinatorially regulated by multiple transcription factors (TFs). Such combinatorial regulation plays an important role in development and facilitates the ability of cells to respond to different stresses. While a number of approaches have utilized sequence and ChIP-based datasets to study combinational regulation, these have often ignored the combinational logic and the dynamics associated with such regulation. Here we present cDREM, a new method for reconstructing dynamic models of combinatorial regulation. cDREM integrates time series gene expression data with (static) protein interaction data. The method is based on a hidden Markov model and utilizes the sparse group Lasso to identify small subsets of combinatorially active TFs, their time of activation, and the logical function they implement. We tested cDREM on yeast and human data sets. Using yeast we show that the predicted combinatorial sets agree with other high throughput genomic datasets and improve upon prior methods developed to infer combinatorial regulation. Applying cDREM to study human response to flu, we were able to identify several combinatorial TF sets, some of which were known to regulate immune response while others represent novel combinations of important TFs.

Aspects of job scheduling

NASA Technical Reports Server (NTRS)

Phillips, K.

1976-01-01

A mathematical model for job scheduling in a specified context is presented. The model uses both linear programming and combinatorial methods. While designed with a view toward optimization of scheduling of facility and plant operations at the Deep Space Communications Complex, the context is sufficiently general to be widely applicable. The general scheduling problem including options for scheduling objectives is discussed and fundamental parameters identified. Mathematical algorithms for partitioning problems germane to scheduling are presented.

Biomolecular Recognition of Semiconductors and Magnetic Materials to Assemble Nanoparticle Heterostructures

DTIC Science & Technology

2002-01-01

shown that engineered viruses can recognize specific semiconductor surfaces through the selection by combinatorial phage display method. These specific... phage display libraries. The screening method selected for binding affinity of a population of random peptides displayed as part of the pIII minor coat...shorter spacing than expected distance ( M13 phage length: 880 nm) corresponds to the length scale imposed by the phage which formed the tilted

Combinatorial Market Processing for Multilateral Coordination

DTIC Science & Technology

2005-09-01

8 In the classical auction theory literature, most of the attention is focused on one-sided, single-item auctions [86]. There is now a growing body of...Programming in Infinite-dimensional Spaces: Theory and Applications, Wiley, 1987. [3] K. J. Arrow, “An extension of the basic theorems of classical ...Commodities, Princeton University Press, 1969. [43] D. Friedman and J. Rust, The Double Auction Market: Institutions, Theories, and Evidence, Addison

Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions.

PubMed

Ceberio, Josu; Calvo, Borja; Mendiburu, Alexander; Lozano, Jose A

2018-02-15

In the last decade, many works in combinatorial optimisation have shown that, due to the advances in multi-objective optimisation, the algorithms from this field could be used for solving single-objective problems as well. In this sense, a number of papers have proposed multi-objectivising single-objective problems in order to use multi-objective algorithms in their optimisation. In this article, we follow up this idea by presenting a methodology for multi-objectivising combinatorial optimisation problems based on elementary landscape decompositions of their objective function. Under this framework, each of the elementary landscapes obtained from the decomposition is considered as an independent objective function to optimise. In order to illustrate this general methodology, we consider four problems from different domains: the quadratic assignment problem and the linear ordering problem (permutation domain), the 0-1 unconstrained quadratic optimisation problem (binary domain), and the frequency assignment problem (integer domain). We implemented two widely known multi-objective algorithms, NSGA-II and SPEA2, and compared their performance with that of a single-objective GA. The experiments conducted on a large benchmark of instances of the four problems show that the multi-objective algorithms clearly outperform the single-objective approaches. Furthermore, a discussion on the results suggests that the multi-objective space generated by this decomposition enhances the exploration ability, thus permitting NSGA-II and SPEA2 to obtain better results in the majority of the tested instances.

Decorated Heegaard Diagrams and Combinatorial Heegaard Floer Homology

NASA Astrophysics Data System (ADS)

Hammarsten, Carl

Heegaard Floer homology is a collection of invariants for closed oriented three-manifolds, introduced by Ozsvath and Szabo in 2001. The simplest version is defined as the homology of a chain complex coming from a Heegaard diagram of the three manifold. In the original definition, the differentials count the number of points in certain moduli spaces of holomorphic disks, which are hard to compute in general. More recently, Sarkar and Wang (2006) and Ozsvath, Stipsicz and Szabo, (2009) have determined combinatorial methods for computing this homology with Z2 coefficients. Both methods rely on the construction of very specific Heegaard diagrams for the manifold, which are generally very complicated. Given a decorated Heegaard diagram H for a closed oriented 3-manifold Y, that is a Heegaard diagram together with a collection of embedded paths satisfying certain criteria, we describe a combinatorial recipe for a chain complex CF'[special character omitted]( H). If H satisfies some technical constraints we show that this chain complex is homotopically equivalent to the Heegaard Floer chain complex CF[special character omitted](H) and hence has the Heegaard Floer homology HF[special character omitted](Y) as its homology groups. Using branched spines we give an algorithm to construct a decorated Heegaard diagram which satisfies the necessary technical constraints for every closed oriented Y. We present this diagram graphically in the form of a strip diagram.

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

PubMed

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.

A Combined Computational and Genetic Approach Uncovers Network Interactions of the Cyanobacterial Circadian Clock.

PubMed

Boyd, Joseph S; Cheng, Ryan R; Paddock, Mark L; Sancar, Cigdem; Morcos, Faruck; Golden, Susan S

2016-09-15

Two-component systems (TCS) that employ histidine kinases (HK) and response regulators (RR) are critical mediators of cellular signaling in bacteria. In the model cyanobacterium Synechococcus elongatus PCC 7942, TCSs control global rhythms of transcription that reflect an integration of time information from the circadian clock with a variety of cellular and environmental inputs. The HK CikA and the SasA/RpaA TCS transduce time information from the circadian oscillator to modulate downstream cellular processes. Despite immense progress in understanding of the circadian clock itself, many of the connections between the clock and other cellular signaling systems have remained enigmatic. To narrow the search for additional TCS components that connect to the clock, we utilized direct-coupling analysis (DCA), a statistical analysis of covariant residues among related amino acid sequences, to infer coevolution of new and known clock TCS components. DCA revealed a high degree of interaction specificity between SasA and CikA with RpaA, as expected, but also with the phosphate-responsive response regulator SphR. Coevolutionary analysis also predicted strong specificity between RpaA and a previously undescribed kinase, HK0480 (herein CikB). A knockout of the gene for CikB (cikB) in a sasA cikA null background eliminated the RpaA phosphorylation and RpaA-controlled transcription that is otherwise present in that background and suppressed cell elongation, supporting the notion that CikB is an interactor with RpaA and the clock network. This study demonstrates the power of DCA to identify subnetworks and key interactions in signaling pathways and of combinatorial mutagenesis to explore the phenotypic consequences. Such a combined strategy is broadly applicable to other prokaryotic systems. Signaling networks are complex and extensive, comprising multiple integrated pathways that respond to cellular and environmental cues. A TCS interaction model, based on DCA, independently confirmed known interactions and revealed a core set of subnetworks within the larger HK-RR set. We validated high-scoring candidate proteins via combinatorial genetics, demonstrating that DCA can be utilized to reduce the search space of complex protein networks and to infer undiscovered specific interactions for signaling proteins in vivo Significantly, new interactions that link circadian response to cell division and fitness in a light/dark cycle were uncovered. The combined analysis also uncovered a more basic core clock, illustrating the synergy and applicability of a combined computational and genetic approach for investigating prokaryotic signaling networks. Copyright © 2016, American Society for Microbiology. All Rights Reserved.

Use of combinatorial chemistry to speed drug discovery.

PubMed

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.

Microbatteries for Combinatorial Studies of Conventional Lithium-Ion Batteries

NASA Technical Reports Server (NTRS)

West, William; Whitacre, Jay; Bugga, Ratnakumar

2003-01-01

Integrated arrays of microscopic solid-state batteries have been demonstrated in a continuing effort to develop microscopic sources of power and of voltage reference circuits to be incorporated into low-power integrated circuits. Perhaps even more importantly, arrays of microscopic batteries can be fabricated and tested in combinatorial experiments directed toward optimization and discovery of battery materials. The value of the combinatorial approach to optimization and discovery has been proven in the optoelectronic, pharmaceutical, and bioengineering industries. Depending on the specific application, the combinatorial approach can involve the investigation of hundreds or even thousands of different combinations; hence, it is time-consuming and expensive to attempt to implement the combinatorial approach by building and testing full-size, discrete cells and batteries. The conception of microbattery arrays makes it practical to bring the advantages of the combinatorial approach to the development of batteries.

Cooperative combinatorial optimization: evolutionary computation case study.

PubMed

Burgin, Mark; Eberbach, Eugene

2008-01-01

This paper presents a formalization of the notion of cooperation and competition of multiple systems that work toward a common optimization goal of the population using evolutionary computation techniques. It is proved that evolutionary algorithms are more expressive than conventional recursive algorithms, such as Turing machines. Three classes of evolutionary computations are introduced and studied: bounded finite, unbounded finite, and infinite computations. Universal evolutionary algorithms are constructed. Such properties of evolutionary algorithms as completeness, optimality, and search decidability are examined. A natural extension of evolutionary Turing machine (ETM) model is proposed to properly reflect phenomena of cooperation and competition in the whole population.

Combinatorial Optimization by Amoeba-Based Neurocomputer with Chaotic Dynamics

NASA Astrophysics Data System (ADS)

Aono, Masashi; Hirata, Yoshito; Hara, Masahiko; Aihara, Kazuyuki

We demonstrate a computing system based on an amoeba of a true slime mold Physarum capable of producing rich spatiotemporal oscillatory behavior. Our system operates as a neurocomputer because an optical feedback control in accordance with a recurrent neural network algorithm leads the amoeba's photosensitive branches to search for a stable configuration concurrently. We show our system's capability of solving the traveling salesman problem. Furthermore, we apply various types of nonlinear time series analysis to the amoeba's oscillatory behavior in the problem-solving process. The results suggest that an individual amoeba might be characterized as a set of coupled chaotic oscillators.

MIFT: GIFT Combinatorial Geometry Input to VCS Code

DTIC Science & Technology

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

Neural Meta-Memes Framework for Combinatorial Optimization

NASA Astrophysics Data System (ADS)

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).

Evolutionary combinatorial chemistry, a novel tool for SAR studies on peptide transport across the blood-brain barrier. Part 2. Design, synthesis and evaluation of a first generation of peptides.

PubMed

Teixidó, Meritxell; Belda, Ignasi; Zurita, Esther; Llorà, Xavier; Fabre, Myriam; Vilaró, Senén; Albericio, Fernando; Giralt, Ernest

2005-12-01

The use of high-throughput methods in drug discovery allows the generation and testing of a large number of compounds, but at the price of providing redundant information. Evolutionary combinatorial chemistry combines the selection and synthesis of biologically active compounds with artificial intelligence optimization methods, such as genetic algorithms (GA). Drug candidates for the treatment of central nervous system (CNS) disorders must overcome the blood-brain barrier (BBB). This paper reports a new genetic algorithm that searches for the optimal physicochemical properties for peptide transport across the blood-brain barrier. A first generation of peptides has been generated and synthesized. Due to the high content of N-methyl amino acids present in most of these peptides, their syntheses were especially challenging due to over-incorporations, deletions and DKP formations. Distinct fragmentation patterns during peptide cleavage have been identified. The first generation of peptides has been studied by evaluation techniques such as immobilized artificial membrane chromatography (IAMC), a cell-based assay, log Poctanol/water calculations, etc. Finally, a second generation has been proposed. (c) 2005 European Peptide Society and John Wiley & Sons, Ltd.

A Novel Hybrid Clonal Selection Algorithm with Combinatorial Recombination and Modified Hypermutation Operators for Global Optimization

PubMed Central

Lin, Jingjing; Jing, Honglei

2016-01-01

Artificial immune system is one of the most recently introduced intelligence methods which was inspired by biological immune system. Most immune system inspired algorithms are based on the clonal selection principle, known as clonal selection algorithms (CSAs). When coping with complex optimization problems with the characteristics of multimodality, high dimension, rotation, and composition, the traditional CSAs often suffer from the premature convergence and unsatisfied accuracy. To address these concerning issues, a recombination operator inspired by the biological combinatorial recombination is proposed at first. The recombination operator could generate the promising candidate solution to enhance search ability of the CSA by fusing the information from random chosen parents. Furthermore, a modified hypermutation operator is introduced to construct more promising and efficient candidate solutions. A set of 16 common used benchmark functions are adopted to test the effectiveness and efficiency of the recombination and hypermutation operators. The comparisons with classic CSA, CSA with recombination operator (RCSA), and CSA with recombination and modified hypermutation operator (RHCSA) demonstrate that the proposed algorithm significantly improves the performance of classic CSA. Moreover, comparison with the state-of-the-art algorithms shows that the proposed algorithm is quite competitive. PMID:27698662

In-depth proteomic analysis of banana (Musa spp.) fruit with combinatorial peptide ligand libraries.

PubMed

Esteve, Clara; D'Amato, Alfonsina; Marina, María Luisa; García, María Concepción; Righetti, Pier Giorgio

2013-01-01

Musa ssp. is among the world's leading fruit crops. Although a strong interest on banana biochemistry exists in the scientific community, focused on metabolite composition, proteins have been scarcely investigated even if they play an important role in food allergy and stability, are a source of biologically active peptides, and can provide information about nutritional aspects of this fruit. In this work we have employed the combinatorial peptide ligand libraries after different types of protein extractions, for searching the very low-abundance proteins in banana. The use of advanced MS techniques and Musa ssp. mRNAs database in combination with the Uniprot_viridiplantae database allowed us to identify 1131 proteins. Among this huge amount of proteins we found several already known allergens such as Mus a 1, pectinesterase, superoxide dismutase, and potentially new allergens. Additionally several enzymes involved in degradation of starch granules and strictly correlated to ripening stage were identified. This is the first in-depth exploration of the banana fruit proteome and one of the largest descriptions of the proteome of any vegetable system. © 2012 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

PNA-COMBO-FISH: From combinatorial probe design in silico to vitality compatible, specific labelling of gene targets in cell nuclei.

PubMed

Müller, Patrick; Rößler, Jens; Schwarz-Finsterle, Jutta; Schmitt, Eberhard; Hausmann, Michael

2016-07-01

Recently, advantages concerning targeting specificity of PCR constructed oligonucleotide FISH probes in contrast to established FISH probes, e.g. BAC clones, have been demonstrated. These techniques, however, are still using labelling protocols with DNA denaturing steps applying harsh heat treatment with or without further denaturing chemical agents. COMBO-FISH (COMBinatorial Oligonucleotide FISH) allows the design of specific oligonucleotide probe combinations in silico. Thus, being independent from primer libraries or PCR laboratory conditions, the probe sequences extracted by computer sequence data base search can also be synthesized as single stranded PNA-probes (Peptide Nucleic Acid probes) or TINA-DNA (Twisted Intercalating Nucleic Acids). Gene targets can be specifically labelled with at least about 20 probes obtaining visibly background free specimens. By using appropriately designed triplex forming oligonucleotides, the denaturing procedures can completely be omitted. These results reveal a significant step towards oligonucleotide-FISH maintaining the 3d-nanostructure and even the viability of the cell target. The method is demonstrated with the detection of Her2/neu and GRB7 genes, which are indicators in breast cancer diagnosis and therapy. Copyright © 2016. Published by Elsevier Inc.

Gaining knowledge from previously unexplained spectra-application of the PTM-Explorer software to detect PTM in HUPO BPP MS/MS data.

PubMed

Chamrad, Daniel C; Körting, Gerhard; Schäfer, Heike; Stephan, Christian; Thiele, Herbert; Apweiler, Rolf; Meyer, Helmut E; Marcus, Katrin; Blüggel, Martin

2006-09-01

A novel software tool named PTM-Explorer has been applied to LC-MS/MS datasets acquired within the Human Proteome Organisation (HUPO) Brain Proteome Project (BPP). PTM-Explorer enables automatic identification of peptide MS/MS spectra that were not explained in typical sequence database searches. The main focus was detection of PTMs, but PTM-Explorer detects also unspecific peptide cleavage, mass measurement errors, experimental modifications, amino acid substitutions, transpeptidation products and unknown mass shifts. To avoid a combinatorial problem the search is restricted to a set of selected protein sequences, which stem from previous protein identifications using a common sequence database search. Prior to application to the HUPO BPP data, PTM-Explorer was evaluated on excellently manually characterized and evaluated LC-MS/MS data sets from Alpha-A-Crystallin gel spots obtained from mouse eye lens. Besides various PTMs including phosphorylation, a wealth of experimental modifications and unspecific cleavage products were successfully detected, completing the primary structure information of the measured proteins. Our results indicate that a large amount of MS/MS spectra that currently remain unidentified in standard database searches contain valuable information that can only be elucidated using suitable software tools.

The role of Transposable Elements in shaping the combinatorial interaction of Transcription Factors

PubMed Central

2012-01-01

Background In the last few years several studies have shown that Transposable Elements (TEs) in the human genome are significantly associated with Transcription Factor Binding Sites (TFBSs) and that in several cases their expansion within the genome led to a substantial rewiring of the regulatory network. Another important feature of the regulatory network which has been thoroughly studied is the combinatorial organization of transcriptional regulation. In this paper we combine these two observations and suggest that TEs, besides rewiring the network, also played a central role in the evolution of particular patterns of combinatorial gene regulation. Results To address this issue we searched for TEs overlapping Estrogen Receptor α (ERα) binding peaks in two publicly available ChIP-seq datasets from the MCF7 cell line corresponding to different modalities of exposure to estrogen. We found a remarkable enrichment of a few specific classes of Transposons. Among these a prominent role was played by MIR (Mammalian Interspersed Repeats) transposons. These TEs underwent a dramatic expansion at the beginning of the mammalian radiation and then stabilized. We conjecture that the special affinity of ERα for the MIR class of TEs could be at the origin of the important role assumed by ERα in Mammalians. We then searched for TFBSs within the TEs overlapping ChIP-seq peaks. We found a strong enrichment of a few precise combinations of TFBS. In several cases the corresponding Transcription Factors (TFs) were known cofactors of ERα, thus supporting the idea of a co-regulatory role of TFBS within the same TE. Moreover, most of these correlations turned out to be strictly associated to specific classes of TEs thus suggesting the presence of a well-defined "transposon code" within the regulatory network. Conclusions In this work we tried to shed light into the role of Transposable Elements (TEs) in shaping the regulatory network of higher eukaryotes. To test this idea we focused on a particular transcription factor: the Estrogen Receptor α (ERα) and we found that ERα preferentially targets a well defined set of TEs and that these TEs host combinations of transcriptional regulators involving several of known co-regulators of ERα. Moreover, a significant number of these TEs turned out to be conserved between human and mouse and located in the vicinity (and thus candidate to be regulators) of important estrogen-related genes. PMID:22897927

Protein structural similarity search by Ramachandran codes

PubMed Central

Lo, Wei-Cheng; Huang, Po-Jung; Chang, Chih-Hung; Lyu, Ping-Chiang

2007-01-01

Background Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed, several methods have been designed to reduce three-dimensional protein structures to one-dimensional text strings that are then analyzed by traditional sequence alignment methods; however, the accuracy is usually sacrificed and the speed is still unable to match sequence similarity search tools. Here, we aimed to improve the linear encoding methodology and develop efficient search tools that can rapidly retrieve structural homologs from large protein databases. Results We propose a new linear encoding method, SARST (Structural similarity search Aided by Ramachandran Sequential Transformation). SARST transforms protein structures into text strings through a Ramachandran map organized by nearest-neighbor clustering and uses a regenerative approach to produce substitution matrices. Then, classical sequence similarity search methods can be applied to the structural similarity search. Its accuracy is similar to Combinatorial Extension (CE) and works over 243,000 times faster, searching 34,000 proteins in 0.34 sec with a 3.2-GHz CPU. SARST provides statistically meaningful expectation values to assess the retrieved information. It has been implemented into a web service and a stand-alone Java program that is able to run on many different platforms. Conclusion As a database search method, SARST can rapidly distinguish high from low similarities and efficiently retrieve homologous structures. It demonstrates that the easily accessible linear encoding methodology has the potential to serve as a foundation for efficient protein structural similarity search tools. These search tools are supposed applicable to automated and high-throughput functional annotations or predictions for the ever increasing number of published protein structures in this post-genomic era. PMID:17716377

Reliability and mass analysis of dynamic power conversion systems with parallel of standby redundancy

NASA Technical Reports Server (NTRS)

Juhasz, A. J.; Bloomfield, H. S.

1985-01-01

A combinatorial reliability approach is used to identify potential dynamic power conversion systems for space mission applications. A reliability and mass analysis is also performed, specifically for a 100 kWe nuclear Brayton power conversion system with parallel redundancy. Although this study is done for a reactor outlet temperature of 1100K, preliminary system mass estimates are also included for reactor outlet temperatures ranging up to 1500 K.

Experimental analysis of chaotic neural network models for combinatorial optimization under a unifying framework.

PubMed

Kwok, T; Smith, K A

2000-09-01

The aim of this paper is to study both the theoretical and experimental properties of chaotic neural network (CNN) models for solving combinatorial optimization problems. Previously we have proposed a unifying framework which encompasses the three main model types, namely, Chen and Aihara's chaotic simulated annealing (CSA) with decaying self-coupling, Wang and Smith's CSA with decaying timestep, and the Hopfield network with chaotic noise. Each of these models can be represented as a special case under the framework for certain conditions. This paper combines the framework with experimental results to provide new insights into the effect of the chaotic neurodynamics of each model. By solving the N-queen problem of various sizes with computer simulations, the CNN models are compared in different parameter spaces, with optimization performance measured in terms of feasibility, efficiency, robustness and scalability. Furthermore, characteristic chaotic neurodynamics crucial to effective optimization are identified, together with a guide to choosing the corresponding model parameters.

Exploiting Lipid Permutation Symmetry to Compute Membrane Remodeling Free Energies.

PubMed

Bubnis, Greg; Risselada, Herre Jelger; Grubmüller, Helmut

2016-10-28

A complete physical description of membrane remodeling processes, such as fusion or fission, requires knowledge of the underlying free energy landscapes, particularly in barrier regions involving collective shape changes, topological transitions, and high curvature, where Canham-Helfrich (CH) continuum descriptions may fail. To calculate these free energies using atomistic simulations, one must address not only the sampling problem due to high free energy barriers, but also an orthogonal sampling problem of combinatorial complexity stemming from the permutation symmetry of identical lipids. Here, we solve the combinatorial problem with a permutation reduction scheme to map a structural ensemble into a compact, nondegenerate subregion of configuration space, thereby permitting straightforward free energy calculations via umbrella sampling. We applied this approach, using a coarse-grained lipid model, to test the CH description of bending and found sharp increases in the bending modulus for curvature radii below 10 nm. These deviations suggest that an anharmonic bending term may be required for CH models to give quantitative energetics of highly curved states.

Unnatural amino acids increase sensitivity and provide for the design of highly selective caspase substrates

PubMed Central

Poreba, M; Kasperkiewicz, P; Snipas, S J; Fasci, D; Salvesen, G S; Drag, M

2014-01-01

Traditional combinatorial peptidyl substrate library approaches generally utilize natural amino acids, limiting the usefulness of this tool in generating selective substrates for proteases that share similar substrate specificity profiles. To address this limitation, we synthesized a Hybrid Combinatorial Substrate Library (HyCoSuL) with the general formula of Ac-P4-P3-P2-Asp-ACC, testing the approach on a family of closely related proteases – the human caspases. The power of this library for caspase discrimination extends far beyond traditional PS-SCL approach, as in addition to 19 natural amino acids we also used 110 diverse unnatural amino acids that can more extensively explore the chemical space represented by caspase-active sites. Using this approach we identified and employed peptide-based substrates that provided excellent discrimination between individual caspases, allowing us to simultaneously resolve the individual contribution of the apical caspase-9 and the executioner caspase-3 and caspase-7 in the development of cytochrome-c-dependent apoptosis for the first time. PMID:24832467

Extended Maptree: a Representation of Fine-Grained Topology and Spatial Hierarchy of Bim

NASA Astrophysics Data System (ADS)

Wu, Y.; Shang, J.; Hu, X.; Zhou, Z.

2017-09-01

Spatial queries play significant roles in exchanging Building Information Modeling (BIM) data and integrating BIM with indoor spatial information. However, topological operators implemented for BIM spatial queries are limited to qualitative relations (e.g. touching, intersecting). To overcome this limitation, we propose an extended maptree model to represent the fine-grained topology and spatial hierarchy of indoor spaces. The model is based on a maptree which consists of combinatorial maps and an adjacency tree. Topological relations (e.g., adjacency, incidence, and covering) derived from BIM are represented explicitly and formally by extended maptrees, which can facilitate the spatial queries of BIM. To construct an extended maptree, we first use a solid model represented by vertical extrusion and boundary representation to generate the isolated 3-cells of combinatorial maps. Then, the spatial relationships defined in IFC are used to sew them together. Furthermore, the incremental edges of extended maptrees are labeled as removed 2-cells. Based on this, we can merge adjacent 3-cells according to the spatial hierarchy of IFC.

Protein-protein docking with binding site patch prediction and network-based terms enhanced combinatorial scoring.

PubMed

Gong, Xinqi; Wang, Panwen; Yang, Feng; Chang, Shan; Liu, Bin; He, Hongqiu; Cao, Libin; Xu, Xianjin; Li, Chunhua; Chen, Weizu; Wang, Cunxin

2010-11-15

Protein-protein docking has made much progress in recent years, but challenges still exist. Here we present the application of our docking approach HoDock in CAPRI. In this approach, a binding site prediction is implemented to reduce docking sampling space and filter out unreasonable docked structures, and a network-based enhanced combinatorial scoring function HPNCscore is used to evaluate the decoys. The experimental information was combined with the predicted binding site to pick out the most likely key binding site residues. We applied the HoDock method in the recent rounds of the CAPRI experiments, and got good results as predictors on targets 39, 40, and 41. We also got good results as scorers on targets 35, 37, 40, and 41. This indicates that our docking approach can contribute to the progress of protein-protein docking methods and to the understanding of the mechanism of protein-protein interactions. © 2010 Wiley-Liss, Inc.

Design of ultrasensitive probes for human neutrophil elastase through hybrid combinatorial substrate library profiling

PubMed Central

Kasperkiewicz, Paulina; Poreba, Marcin; Snipas, Scott J.; Parker, Heather; Winterbourn, Christine C.; Salvesen, Guy S.; Drag, Marcin

2014-01-01

The exploration of protease substrate specificity is generally restricted to naturally occurring amino acids, limiting the degree of conformational space that can be surveyed. We substantially enhanced this by incorporating 102 unnatural amino acids to explore the S1–S4 pockets of human neutrophil elastase. This approach provides hybrid natural and unnatural amino acid sequences, and thus we termed it the Hybrid Combinatorial Substrate Library. Library results were validated by the synthesis of individual tetrapeptide substrates, with the optimal substrate demonstrating more than three orders of magnitude higher catalytic efficiency than commonly used substrates of elastase. This optimal substrate was converted to an activity-based probe that demonstrated high selectivity and revealed the specific presence of active elastase during the process of neutrophil extracellular trap formation. We propose that this approach can be successfully used for any type of endopeptidase to deliver high activity and selectivity in substrates and probes. PMID:24550277

FOREWORD: Focus on Combinatorial Materials Science Focus on Combinatorial Materials Science

NASA Astrophysics Data System (ADS)

Chikyo, Toyohiro

2011-10-01

About 15 years have passed since the introduction of modern combinatorial synthesis and high-throughput techniques for the development of novel inorganic materials; however, similar methods existed before. The most famous was reported in 1970 by Hanak who prepared composition-spread films of metal alloys by sputtering mixed-material targets. Although this method was innovative, it was rarely used because of the large amount of data to be processed. This problem is solved in the modern combinatorial material research, which is strongly related to computer data analysis and robotics. This field is still at the developing stage and may be enriched by new methods. Nevertheless, given the progress in measurement equipment and procedures, we believe the combinatorial approach will become a major and standard tool of materials screening and development. The first article of this journal, published in 2000, was titled 'Combinatorial solid state materials science and technology', and this focus issue aims to reintroduce this topic to the Science and Technology of Advanced Materials audience. It covers recent progress in combinatorial materials research describing new results in catalysis, phosphors, polymers and metal alloys for shape memory materials. Sophisticated high-throughput characterization schemes and innovative synthesis tools are also presented, such as spray deposition using nanoparticles or ion plating. On a technical note, data handling systems are introduced to familiarize researchers with the combinatorial methodology. We hope that through this focus issue a wide audience of materials scientists can learn about recent and future trends in combinatorial materials science and high-throughput experimentation.

An Integrated Method Based on PSO and EDA for the Max-Cut Problem.

PubMed

Lin, Geng; Guan, Jian

2016-01-01

The max-cut problem is NP-hard combinatorial optimization problem with many real world applications. In this paper, we propose an integrated method based on particle swarm optimization and estimation of distribution algorithm (PSO-EDA) for solving the max-cut problem. The integrated algorithm overcomes the shortcomings of particle swarm optimization and estimation of distribution algorithm. To enhance the performance of the PSO-EDA, a fast local search procedure is applied. In addition, a path relinking procedure is developed to intensify the search. To evaluate the performance of PSO-EDA, extensive experiments were carried out on two sets of benchmark instances with 800 to 20,000 vertices from the literature. Computational results and comparisons show that PSO-EDA significantly outperforms the existing PSO-based and EDA-based algorithms for the max-cut problem. Compared with other best performing algorithms, PSO-EDA is able to find very competitive results in terms of solution quality.

Searching for new symmetry species of CH5+ - From lines to states without a model

NASA Astrophysics Data System (ADS)

Brackertz, Stefan; Schlemmer, Stephan; Asvany, Oskar

2017-12-01

CH5+ is a prototype of an extremely flexible molecule for which the quantum states have eluded an analytical description so far. Therefore, the reconstruction of its quantum states relies on methods as e.g. the search for accumulations of combination differences of rovibrational transitions. Using the available high resolution data of the Cologne laboratories [1], this reconstruction has been improved by using the properties of kernel density estimators as well as new combinatorial approaches to evaluate the found accumulations. Two new symmetry sets have been discovered, and the known ones extended, with 1063 of the 2897 measured lines assigned, which is a significant improvement over the 65 assignments of the previous work. This allowed us not only to reconstruct more parts of the ground state levels, but also of the vibrationally excited states of CH5+.

SHOP: scaffold HOPping by GRID-based similarity searches.

PubMed

Bergmann, Rikke; Linusson, Anna; Zamora, Ismael

2007-05-31

A new GRID-based method for scaffold hopping (SHOP) is presented. In a fully automatic manner, scaffolds were identified in a database based on three types of 3D-descriptors. SHOP's ability to recover scaffolds was assessed and validated by searching a database spiked with fragments of known ligands of three different protein targets relevant for drug discovery using a rational approach based on statistical experimental design. Five out of eight and seven out of eight thrombin scaffolds and all seven HIV protease scaffolds were recovered within the top 10 and 31 out of 31 neuraminidase scaffolds were in the 31 top-ranked scaffolds. SHOP also identified new scaffolds with substantially different chemotypes from the queries. Docking analysis indicated that the new scaffolds would have similar binding modes to those of the respective query scaffolds observed in X-ray structures. The databases contained scaffolds from published combinatorial libraries to ensure that identified scaffolds could be feasibly synthesized.

Optimal Price Decision Problem for Simultaneous Multi-article Auction and Its Optimal Price Searching Method by Particle Swarm Optimization

NASA Astrophysics Data System (ADS)

Masuda, Kazuaki; Aiyoshi, Eitaro

We propose a method for solving optimal price decision problems for simultaneous multi-article auctions. An auction problem, originally formulated as a combinatorial problem, determines both every seller's whether or not to sell his/her article and every buyer's which article(s) to buy, so that the total utility of buyers and sellers will be maximized. Due to the duality theory, we transform it equivalently into a dual problem in which Lagrange multipliers are interpreted as articles' transaction price. As the dual problem is a continuous optimization problem with respect to the multipliers (i.e., the transaction prices), we propose a numerical method to solve it by applying heuristic global search methods. In this paper, Particle Swarm Optimization (PSO) is used to solve the dual problem, and experimental results are presented to show the validity of the proposed method.

Optimizing an Actuator Array for the Control of Multi-Frequency Noise in Aircraft Interiors

NASA Technical Reports Server (NTRS)

Palumbo, D. L.; Padula, S. L.

1997-01-01

Techniques developed for selecting an optimized actuator array for interior noise reduction at a single frequency are extended to the multi-frequency case. Transfer functions for 64 actuators were obtained at 5 frequencies from ground testing the rear section of a fully trimmed DC-9 fuselage. A single loudspeaker facing the left side of the aircraft was the primary source. A combinatorial search procedure (tabu search) was employed to find optimum actuator subsets of from 2 to 16 actuators. Noise reduction predictions derived from the transfer functions were used as a basis for evaluating actuator subsets during optimization. Results indicate that it is necessary to constrain actuator forces during optimization. Unconstrained optimizations selected actuators which require unrealistically large forces. Two methods of constraint are evaluated. It is shown that a fast, but approximate, method yields results equivalent to an accurate, but computationally expensive, method.

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

PubMed

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.

Combinatorial Nano-Bio Interfaces.

PubMed

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.

Combinatorial computational chemistry approach for materials design: applications in deNOx catalysis, Fischer-Tropsch synthesis, lanthanoid complex, and lithium ion secondary battery.

PubMed

Koyama, Michihisa; Tsuboi, Hideyuki; Endou, Akira; Takaba, Hiromitsu; Kubo, Momoji; Del Carpio, Carlos A; Miyamoto, Akira

2007-02-01

Computational chemistry can provide fundamental knowledge regarding various aspects of materials. While its impact in scientific research is greatly increasing, its contributions to industrially important issues are far from satisfactory. In order to realize industrial innovation by computational chemistry, a new concept "combinatorial computational chemistry" has been proposed by introducing the concept of combinatorial chemistry to computational chemistry. This combinatorial computational chemistry approach enables theoretical high-throughput screening for materials design. In this manuscript, we review the successful applications of combinatorial computational chemistry to deNO(x) catalysts, Fischer-Tropsch catalysts, lanthanoid complex catalysts, and cathodes of the lithium ion secondary battery.

Widespread evidence of cooperative DNA binding by transcription factors in Drosophila development

PubMed Central

Kazemian, Majid; Pham, Hannah; Wolfe, Scot A.; Brodsky, Michael H.; Sinha, Saurabh

2013-01-01

Regulation of eukaryotic gene transcription is often combinatorial in nature, with multiple transcription factors (TFs) regulating common target genes, often through direct or indirect mutual interactions. Many individual examples of cooperative binding by directly interacting TFs have been identified, but it remains unclear how pervasive this mechanism is during animal development. Cooperative TF binding should be manifest in genomic sequences as biased arrangements of TF-binding sites. Here, we explore the extent and diversity of such arrangements related to gene regulation during Drosophila embryogenesis. We used the DNA-binding specificities of 322 TFs along with chromatin accessibility information to identify enriched spacing and orientation patterns of TF-binding site pairs. We developed a new statistical approach for this task, specifically designed to accurately assess inter-site spacing biases while accounting for the phenomenon of homotypic site clustering commonly observed in developmental regulatory regions. We observed a large number of short-range distance preferences between TF-binding site pairs, including examples where the preference depends on the relative orientation of the binding sites. To test whether these binding site patterns reflect physical interactions between the corresponding TFs, we analyzed 27 TF pairs whose binding sites exhibited short distance preferences. In vitro protein–protein binding experiments revealed that >65% of these TF pairs can directly interact with each other. For five pairs, we further demonstrate that they bind cooperatively to DNA if both sites are present with the preferred spacing. This study demonstrates how DNA-binding motifs can be used to produce a comprehensive map of sequence signatures for different mechanisms of combinatorial TF action. PMID:23847101

Widespread evidence of cooperative DNA binding by transcription factors in Drosophila development.

PubMed

Kazemian, Majid; Pham, Hannah; Wolfe, Scot A; Brodsky, Michael H; Sinha, Saurabh

2013-09-01

Regulation of eukaryotic gene transcription is often combinatorial in nature, with multiple transcription factors (TFs) regulating common target genes, often through direct or indirect mutual interactions. Many individual examples of cooperative binding by directly interacting TFs have been identified, but it remains unclear how pervasive this mechanism is during animal development. Cooperative TF binding should be manifest in genomic sequences as biased arrangements of TF-binding sites. Here, we explore the extent and diversity of such arrangements related to gene regulation during Drosophila embryogenesis. We used the DNA-binding specificities of 322 TFs along with chromatin accessibility information to identify enriched spacing and orientation patterns of TF-binding site pairs. We developed a new statistical approach for this task, specifically designed to accurately assess inter-site spacing biases while accounting for the phenomenon of homotypic site clustering commonly observed in developmental regulatory regions. We observed a large number of short-range distance preferences between TF-binding site pairs, including examples where the preference depends on the relative orientation of the binding sites. To test whether these binding site patterns reflect physical interactions between the corresponding TFs, we analyzed 27 TF pairs whose binding sites exhibited short distance preferences. In vitro protein-protein binding experiments revealed that >65% of these TF pairs can directly interact with each other. For five pairs, we further demonstrate that they bind cooperatively to DNA if both sites are present with the preferred spacing. This study demonstrates how DNA-binding motifs can be used to produce a comprehensive map of sequence signatures for different mechanisms of combinatorial TF action.

Hit discovery of 4-amino-N-(4-(3-(trifluoromethyl)phenoxy)pyrimidin-5-yl)benzamide: A novel EGFR inhibitor from a designed small library.

PubMed

Elkamhawy, Ahmed; Paik, Sora; Hassan, Ahmed H E; Lee, Yong Sup; Roh, Eun Joo

2017-12-01

Searching for hit compounds within the huge chemical space resembles the attempt to find a needle in a haystack. Cheminformatics-guided selection of few representative molecules of a rationally designed virtual combinatorial library is a powerful tool to confront this challenge, speed up hit identification and cut off costs. Herein, this approach has been applied to identify hit compounds with novel scaffolds able to inhibit EGFR kinase. From a generated virtual library, six 4-aryloxy-5-aminopyrimidine scaffold-derived compounds were selected, synthesized and evaluated as hit EGFR inhibitors. 4-Aryloxy-5-benzamidopyrimidines inhibited EGFR with IC 50 1.05-5.37 μM. Cell-based assay of the most potent EGFR inhibitor hit (10ac) confirmed its cytotoxicity against different cancerous cells. In spite of no EGFR, HER2 or VEGFR1 inhibition was elicited by 4-aryloxy-5-(thio)ureidopyrimidine derivatives, cell-based evaluation suggested them as antiproliferative hits acting by other mechanism(s). Molecular docking study provided a plausible explanation of incapability of 4-aryloxy-5-(thio)ureidopyrimidines to inhibit EGFR and suggested a reasonable binding mode of 4-aryloxy-5-benzamidopyrimidines which provides a basis to develop more optimized ligands. Copyright © 2017 Elsevier Inc. All rights reserved.

An effective PSO-based memetic algorithm for flow shop scheduling.

PubMed

Liu, Bo; Wang, Ling; Jin, Yi-Hui

2007-02-01

This paper proposes an effective particle swarm optimization (PSO)-based memetic algorithm (MA) for the permutation flow shop scheduling problem (PFSSP) with the objective to minimize the maximum completion time, which is a typical non-deterministic polynomial-time (NP) hard combinatorial optimization problem. In the proposed PSO-based MA (PSOMA), both PSO-based searching operators and some special local searching operators are designed to balance the exploration and exploitation abilities. In particular, the PSOMA applies the evolutionary searching mechanism of PSO, which is characterized by individual improvement, population cooperation, and competition to effectively perform exploration. On the other hand, the PSOMA utilizes several adaptive local searches to perform exploitation. First, to make PSO suitable for solving PFSSP, a ranked-order value rule based on random key representation is presented to convert the continuous position values of particles to job permutations. Second, to generate an initial swarm with certain quality and diversity, the famous Nawaz-Enscore-Ham (NEH) heuristic is incorporated into the initialization of population. Third, to balance the exploration and exploitation abilities, after the standard PSO-based searching operation, a new local search technique named NEH_1 insertion is probabilistically applied to some good particles selected by using a roulette wheel mechanism with a specified probability. Fourth, to enrich the searching behaviors and to avoid premature convergence, a simulated annealing (SA)-based local search with multiple different neighborhoods is designed and incorporated into the PSOMA. Meanwhile, an effective adaptive meta-Lamarckian learning strategy is employed to decide which neighborhood to be used in SA-based local search. Finally, to further enhance the exploitation ability, a pairwise-based local search is applied after the SA-based search. Simulation results based on benchmarks demonstrate the effectiveness of the PSOMA. Additionally, the effects of some parameters on optimization performances are also discussed.

Exhaustive search system and method using space-filling curves

DOEpatents

Spires, Shannon V.

2003-10-21

A search system and method for one agent or for multiple agents using a space-filling curve provides a way to control one or more agents to cover an area of any space of any dimensionality using an exhaustive search pattern. An example of the space-filling curve is a Hilbert curve. The search area can be a physical geography, a cyberspace search area, or an area searchable by computing resources. The search agent can be one or more physical agents, such as a robot, and can be software agents for searching cyberspace.

Monotonicity of fitness landscapes and mutation rate control.

PubMed

Belavkin, Roman V; Channon, Alastair; Aston, Elizabeth; Aston, John; Krašovec, Rok; Knight, Christopher G

2016-12-01

A common view in evolutionary biology is that mutation rates are minimised. However, studies in combinatorial optimisation and search have shown a clear advantage of using variable mutation rates as a control parameter to optimise the performance of evolutionary algorithms. Much biological theory in this area is based on Ronald Fisher's work, who used Euclidean geometry to study the relation between mutation size and expected fitness of the offspring in infinite phenotypic spaces. Here we reconsider this theory based on the alternative geometry of discrete and finite spaces of DNA sequences. First, we consider the geometric case of fitness being isomorphic to distance from an optimum, and show how problems of optimal mutation rate control can be solved exactly or approximately depending on additional constraints of the problem. Then we consider the general case of fitness communicating only partial information about the distance. We define weak monotonicity of fitness landscapes and prove that this property holds in all landscapes that are continuous and open at the optimum. This theoretical result motivates our hypothesis that optimal mutation rate functions in such landscapes will increase when fitness decreases in some neighbourhood of an optimum, resembling the control functions derived in the geometric case. We test this hypothesis experimentally by analysing approximately optimal mutation rate control functions in 115 complete landscapes of binding scores between DNA sequences and transcription factors. Our findings support the hypothesis and find that the increase of mutation rate is more rapid in landscapes that are less monotonic (more rugged). We discuss the relevance of these findings to living organisms.

Combinatorial support vector machines approach for virtual screening of selective multi-target serotonin reuptake inhibitors from large compound libraries.

PubMed

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 <15.4%) of the individual target inhibitors of the same target pair and 0.58-7.1% of the other 6 targets outside the target pair. COMBI-SVMs showed low dual inhibitor false hit rates (0.006-0.056%, 0.042-0.21%, 0.2-4%) in screening 17 million PubChem compounds, 168,000 MDDR compounds, and 7-8181 MDDR compounds similar to the dual inhibitors. Compared with similarity searching, k-NN and PNN methods, COMBI-SVM produced comparable dual inhibitor yields, similar target selectivity, and lower false hit rate in screening 168,000 MDDR compounds. The annotated classes of many COMBI-SVMs identified MDDR 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.

Search and Discovery Strategies for Biotechnology: the Paradigm Shift

PubMed Central

Bull, Alan T.; Ward, Alan C.; Goodfellow, Michael

2000-01-01

Profound changes are occurring in the strategies that biotechnology-based industries are deploying in the search for exploitable biology and to discover new products and develop new or improved processes. The advances that have been made in the past decade in areas such as combinatorial chemistry, combinatorial biosynthesis, metabolic pathway engineering, gene shuffling, and directed evolution of proteins have caused some companies to consider withdrawing from natural product screening. In this review we examine the paradigm shift from traditional biology to bioinformatics that is revolutionizing exploitable biology. We conclude that the reinvigorated means of detecting novel organisms, novel chemical structures, and novel biocatalytic activities will ensure that natural products will continue to be a primary resource for biotechnology. The paradigm shift has been driven by a convergence of complementary technologies, exemplified by DNA sequencing and amplification, genome sequencing and annotation, proteome analysis, and phenotypic inventorying, resulting in the establishment of huge databases that can be mined in order to generate useful knowledge such as the identity and characterization of organisms and the identity of biotechnology targets. Concurrently there have been major advances in understanding the extent of microbial diversity, how uncultured organisms might be grown, and how expression of the metabolic potential of microorganisms can be maximized. The integration of information from complementary databases presents a significant challenge. Such integration should facilitate answers to complex questions involving sequence, biochemical, physiological, taxonomic, and ecological information of the sort posed in exploitable biology. The paradigm shift which we discuss is not absolute in the sense that it will replace established microbiology; rather, it reinforces our view that innovative microbiology is essential for releasing the potential of microbial diversity for biotechnology penetration throughout industry. Various of these issues are considered with reference to deep-sea microbiology and biotechnology. PMID:10974127

Clinical and pharmacogenomic data mining: 1. Generalized theory of expected information and application to the development of tools.

PubMed

Robson, Barry

2003-01-01

New scientific problems, arising from the human genome project, are challenging the classical means of using statistics. Yet quantified knowledge in the form of rules and rule strengths based on real relationships in data, as opposed to expert opinion, is urgently required for researcher and physician decision support. The problem is that with many parameters, the space to be analyzed is highly dimensional. That is, the combinations of data to examine are subject to a combinatorial explosion as the number of possible events (entries, items, sub-records) (a),(b),(c),... per record (a,b,c,..) increases, and hence much of the space is sparsely populated. These combinatorial considerations are particularly problematic for identifying those associations called "Unicorn Events" which occur significantly less than expected to the extent that they are never seen to be counted. To cope with the combinatorial explosion, a novel numerical "book keeping" approach is taken to generate information terms relating to the combinatorial subsets of events (a,b,c,..), and, most importantly, the zeta (Zeta) function is employed. The incomplete Zeta function zeta(s,n) with s = 1, in which frequencies of occurrence such as n = n(a,b,c,...) determine the range of summation n, is argued to be the natural choice of information function. It emerges from Bayesian integration, taken over the distribution of possible values of information measures for sparse and ample data alike. Expected mutual information l(a;b;c) in nats (i.e., natural units analogous to bits but based on the natural logarithm), such as is available to the observer, is measured as e.g., the difference zeta(s,o(a,b,c..)) - zeta(s,e(a,b,c..)) where o(a,b,c,..) and e(a,b,c,..) are, or relate to, the observed and expected frequencies of occurrence, respectively. For real values of s > 1 the qualitative impact of strongly (positively or negatively) ranked data is preserved despite several numerical approximations. As real s increases, and the output of the information functions converge into three values +1, 0, and -1 nats representing a trinary logic system. For quantitative data, a useful ad hoc method, to report sigma-normalized covariations in an analogous manner to mutual information for significance comparison purposes, is demonstrated. Finally, the potential ability to make use of mutual information in a complex biomedical study, and to include Bayesian prior information derived from statistical, tabular, anecdotal, and expert opinion is briefly illustrated.

Exhaustive Search for Sparse Variable Selection in Linear Regression

NASA Astrophysics Data System (ADS)

Igarashi, Yasuhiko; Takenaka, Hikaru; Nakanishi-Ohno, Yoshinori; Uemura, Makoto; Ikeda, Shiro; Okada, Masato

2018-04-01

We propose a K-sparse exhaustive search (ES-K) method and a K-sparse approximate exhaustive search method (AES-K) for selecting variables in linear regression. With these methods, K-sparse combinations of variables are tested exhaustively assuming that the optimal combination of explanatory variables is K-sparse. By collecting the results of exhaustively computing ES-K, various approximate methods for selecting sparse variables can be summarized as density of states. With this density of states, we can compare different methods for selecting sparse variables such as relaxation and sampling. For large problems where the combinatorial explosion of explanatory variables is crucial, the AES-K method enables density of states to be effectively reconstructed by using the replica-exchange Monte Carlo method and the multiple histogram method. Applying the ES-K and AES-K methods to type Ia supernova data, we confirmed the conventional understanding in astronomy when an appropriate K is given beforehand. However, we found the difficulty to determine K from the data. Using virtual measurement and analysis, we argue that this is caused by data shortage.

Preparation of cherry-picked combinatorial libraries by string synthesis.

PubMed

Furka, Arpád; Dibó, Gábor; Gombosuren, Naran

2005-03-01

String synthesis [1-3] is an efficient and cheap manual method for preparation of combinatorial libraries by using macroscopic solid support units. Sorting the units between two synthetic steps is an important operation of the procedure. The software developed to guide sorting can be used only when complete combinatorial libraries are prepared. Since very often only selected components of the full libraries are needed, new software was constructed that guides sorting in preparation of non-complete combinatorial libraries. Application of the software is described in details.

Hamiltonian Cycle Enumeration via Fermion-Zeon Convolution

NASA Astrophysics Data System (ADS)

Staples, G. Stacey

2017-12-01

Beginning with a simple graph having finite vertex set V, operators are induced on fermion and zeon algebras by the action of the graph's adjacency matrix and combinatorial Laplacian on the vector space spanned by the graph's vertices. When the graph is simple (undirected with no loops or multiple edges), the matrices are symmetric and the induced operators are self-adjoint. The goal of the current paper is to recover a number of known graph-theoretic results from quantum observables constructed as linear operators on fermion and zeon Fock spaces. By considering an "indeterminate" fermion/zeon Fock space, a fermion-zeon convolution operator is defined whose trace recovers the number of Hamiltonian cycles in the graph. This convolution operator is a quantum observable whose expectation reveals the number of Hamiltonian cycles in the graph.

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

ERIC Educational Resources Information Center

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)

A Review on Recent Patents and Applications of Inorganic Material Binding Peptides.

PubMed

Thota, Veeranjaneyulu; Perry, Carole C

2017-01-01

Although the popularity of using combinatorial display techniques for recognising unique peptides having high affinity for inorganic (nano) particles has grown rapidly, there are no systematic reviews showcasing current developments or patents on binding peptides specific to these materials. In this review, we summarize and discuss recent progress in patents on material binding peptides specifically exploring inorganic nano surfaces such as metals, metal oxides, minerals, carbonbased materials, polymer based materials, magnetic materials and semiconductors. We consider both the peptide display strategies used and the exploitation of the identified peptides in the generation of advanced nanomaterials. In order to get a clear picture on the number of patents and literature present to date relevant to inorganic material binding biomolecules and their applications, a thorough online search was conducted using national and worldwide databases. The literature search include standard bibliographic databases while patents included EPO Espacenet, WIPO patent scope, USPTO, Google patent search, Patent lens, etc. along with commercial databases such as Derwent and Patbase. Both English and American spellings were included in the searches. The initial number of patents found related to material binders were 981. After reading and excluding irrelevant patents such as organic binding peptides, works published before 2001, repeated patents, documents not in English etc., 51 highly relevant patents published from 2001 onwards were selected and analysed. These patents were further separated into six categories based on their target inorganic material and combinatorial library used. They include relevant patents on metal, metal oxide or combination binding peptides (19), magnetic and semiconductor binding peptides (8), carbon based (3), mineral (5), polymer (8) and other binders (9). Further, how these material specific binders have been used to synthesize simple to complex bio- or nano-materials, mediate the controlled biomineralization process, direct self-assembly and nanofabrication of ordered structures, facilitate the immobilization of functional biomolecules and construct inorganic-inorganic or organic-inorganic nano hybrids are concisely described. From analysis of recent literature and patents, we clearly show that biomimetic material binders are in the vanguard of new design approaches for novel nanomaterials with improved/ controlled physical and chemical properties that have no adverse effect on the structural or functional activities of the nanomaterials themselves. Copyright© Bentham Science Publishers; For any queries, please email at epub@benthamscience.org.

Bifurcation-based approach reveals synergism and optimal combinatorial perturbation.

PubMed

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.

Unwinding the amplituhedron in binary

NASA Astrophysics Data System (ADS)

Arkani-Hamed, Nima; Thomas, Hugh; Trnka, Jaroslav

2018-01-01

We present new, fundamentally combinatorial and topological characterizations of the amplituhedron. Upon projecting external data through the amplituhedron, the resulting configuration of points has a specified (and maximal) generalized "winding number". Equivalently, the amplituhedron can be fully described in binary: canonical projections of the geometry down to one dimension have a specified (and maximal) number of "sign flips" of the projected data. The locality and unitarity of scattering amplitudes are easily derived as elementary consequences of this binary code. Minimal winding defines a natural "dual" of the amplituhedron. This picture gives us an avatar of the amplituhedron purely in the configuration space of points in vector space (momentum-twistor space in the physics), a new interpretation of the canonical amplituhedron form, and a direct bosonic understanding of the scattering super-amplitude in planar N = 4 SYM as a differential form on the space of physical kinematical data.

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

USDA-ARS?s Scientific Manuscript database

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...

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

ERIC Educational Resources Information Center

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…

Guiding Conformation Space Search with an All-Atom Energy Potential

PubMed Central

Brunette, TJ; Brock, Oliver

2009-01-01

The most significant impediment for protein structure prediction is the inadequacy of conformation space search. Conformation space is too large and the energy landscape too rugged for existing search methods to consistently find near-optimal minima. To alleviate this problem, we present model-based search, a novel conformation space search method. Model-based search uses highly accurate information obtained during search to build an approximate, partial model of the energy landscape. Model-based search aggregates information in the model as it progresses, and in turn uses this information to guide exploration towards regions most likely to contain a near-optimal minimum. We validate our method by predicting the structure of 32 proteins, ranging in length from 49 to 213 amino acids. Our results demonstrate that model-based search is more effective at finding low-energy conformations in high-dimensional conformation spaces than existing search methods. The reduction in energy translates into structure predictions of increased accuracy. PMID:18536015

cGRNB: a web server for building combinatorial gene regulatory networks through integrated engineering of seed-matching sequence information and gene expression datasets.

PubMed

Xu, Huayong; Yu, Hui; Tu, Kang; Shi, Qianqian; Wei, Chaochun; Li, Yuan-Yuan; Li, Yi-Xue

2013-01-01

We are witnessing rapid progress in the development of methodologies for building the combinatorial gene regulatory networks involving both TFs (Transcription Factors) and miRNAs (microRNAs). There are a few tools available to do these jobs but most of them are not easy to use and not accessible online. A web server is especially needed in order to allow users to upload experimental expression datasets and build combinatorial regulatory networks corresponding to their particular contexts. In this work, we compiled putative TF-gene, miRNA-gene and TF-miRNA regulatory relationships from forward-engineering pipelines and curated them as built-in data libraries. We streamlined the R codes of our two separate forward-and-reverse engineering algorithms for combinatorial gene regulatory network construction and formalized them as two major functional modules. As a result, we released the cGRNB (combinatorial Gene Regulatory Networks Builder): a web server for constructing combinatorial gene regulatory networks through integrated engineering of seed-matching sequence information and gene expression datasets. The cGRNB enables two major network-building modules, one for MPGE (miRNA-perturbed gene expression) datasets and the other for parallel miRNA/mRNA expression datasets. A miRNA-centered two-layer combinatorial regulatory cascade is the output of the first module and a comprehensive genome-wide network involving all three types of combinatorial regulations (TF-gene, TF-miRNA, and miRNA-gene) are the output of the second module. In this article we propose cGRNB, a web server for building combinatorial gene regulatory networks through integrated engineering of seed-matching sequence information and gene expression datasets. Since parallel miRNA/mRNA expression datasets are rapidly accumulated by the advance of next-generation sequencing techniques, cGRNB will be very useful tool for researchers to build combinatorial gene regulatory networks based on expression datasets. The cGRNB web-server is free and available online at http://www.scbit.org/cgrnb.

Combinatorial effects on clumped isotopes and their significance in biogeochemistry

NASA Astrophysics Data System (ADS)

Yeung, Laurence Y.

2016-01-01

The arrangement of isotopes within a collection of molecules records their physical and chemical histories. Clumped-isotope analysis interrogates these arrangements, i.e., how often rare isotopes are bound together, which in many cases can be explained by equilibrium and/or kinetic isotope fractionation. However, purely combinatorial effects, rooted in the statistics of pairing atoms in a closed system, are also relevant, and not well understood. Here, I show that combinatorial isotope effects are most important when two identical atoms are neighbors on the same molecule (e.g., O2, N2, and D-D clumping in CH4). When the two halves of an atom pair are either assembled with different isotopic preferences or drawn from different reservoirs, combinatorial effects cause depletions in clumped-isotope abundance that are most likely between zero and -1‰, although they could potentially be -10‰ or larger for D-D pairs. These depletions are of similar magnitude, but of opposite sign, to low-temperature equilibrium clumped-isotope effects for many small molecules. Enzymatic isotope-pairing reactions, which can have site-specific isotopic fractionation factors and atom reservoirs, should express this class of combinatorial isotope effect, although it is not limited to biological reactions. Chemical-kinetic isotope effects, which are related to a bond-forming transition state, arise independently and express second-order combinatorial effects related to the abundance of the rare isotope. Heteronuclear moeties (e.g., Csbnd O and Csbnd H), are insensitive to direct combinatorial influences, but secondary combinatorial influences are evident. In general, both combinatorial and chemical-kinetic factors are important for calculating and interpreting clumped-isotope signatures of kinetically controlled reactions. I apply this analytical framework to isotope-pairing reactions relevant to geochemical oxygen, carbon, and nitrogen cycling that may be influenced by combinatorial clumped-isotope effects. These isotopic signatures, manifest as either directly bound isotope ;clumps; or as features of a molecule's isotopic anatomy, are linked to molecular mechanisms and may eventually provide additional information about biogeochemical cycling on environmentally relevant spatial scales.

Does Pharmacogenomic Testing Improve Clinical Outcomes for Major Depressive Disorder? A Systematic Review of Clinical Trials and Cost-Effectiveness Studies.

PubMed

Rosenblat, Joshua D; Lee, Yena; McIntyre, Roger S

2017-06-01

Pharmacogenomic testing has become scalable and available to the general public. Pharmacogenomics has shown promise for predicting antidepressant response and tolerability in the treatment of major depressive disorder (MDD). In theory, pharmacogenomics can improve clinical outcomes by guiding antidepressant selection and dosing. The current systematic review examines the extant literature to determine the impact of pharmacogenomic testing on clinical outcomes in MDD and assesses its cost-effectiveness. The MEDLINE/PubMed and Google Scholar databases were systematically searched for relevant articles published prior to October 2015. Search terms included various combinations of the following: major depressive disorder (MDD), depression, mental illness, mood disorder, antidepressant, response, remission, outcome, pharmacogenetic, pharmacogenomics, pharmacodynamics, pharmacokinetic, genetic testing, genome wide association study (GWAS), CYP450, personalized medicine, cost-effectiveness, and pharmacoeconomics. Of the 66 records identified from the initial search, relevant clinical studies, written in English, assessing the cost-effectiveness and/or efficacy of pharmacogenomic testing for MDD were included. Each publication was critically examined for relevant data. Two nonrandomized, open-label, 8-week, prospective studies reported overall greater improvement in depressive symptom severity in the group of MDD subjects receiving psychiatric care guided by results of combinatorial pharmacogenomic testing (GeneSight) when compared to the unguided group. One industry-sponsored, randomized, double-blind, 10-week prospective study reported a trend for improved outcomes for the GeneSight-guided group; however, the trend did not reach statistical significance. Another industry-sponsored, randomized, double-blind, 12-week prospective study reported a 2.5-fold increase in remission rates in the CNSDose-guided group (P < .0001). One naturalistic, unblinded, industry-sponsored study showed clinical improvement when pharmacogenomics testing guided prescribing; however, this study lacked a control group. A single cost-effectiveness study concluded that single gene testing was not cost-effective. Conversely, a separate study reported that combinatorial pharmacogenomic testing is cost-effective. A limited number of studies have shown promise for the clinical utility of pharmacogenomic testing; however, cost-effectiveness of pharmacogenomics, as well as demonstration of improved health outcomes, is not yet supported with replicated evidence. © Copyright 2017 Physicians Postgraduate Press, Inc.

Training and Transfer in Combinatorial Problem Solving: The Development of Formal Reasoning During Early Adolescence

ERIC Educational Resources Information Center

Barratt, Barnaby B.

1975-01-01

This study investigated the emergence of combinatorial competence in early adolescence and the effectiveness of a programmed discovery training procedure. Significant increases in combinatorial skill with age were shown; it was found that the expression of this skill was significantly facilitated if problems involved concrete material of low…

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

PubMed

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.

Matrix Models and A Proof of the Open Analog of Witten's Conjecture

NASA Astrophysics Data System (ADS)

Buryak, Alexandr; Tessler, Ran J.

2017-08-01

In a recent work, R. Pandharipande, J. P. Solomon and the second author have initiated a study of the intersection theory on the moduli space of Riemann surfaces with boundary. They conjectured that the generating series of the intersection numbers satisfies the open KdV equations. In this paper we prove this conjecture. Our proof goes through a matrix model and is based on a Kontsevich type combinatorial formula for the intersection numbers that was found by the second author.

Modulation and coding for throughput-efficient optical free-space links

NASA Technical Reports Server (NTRS)

Georghiades, Costas N.

1993-01-01

Optical direct-detection systems are currently being considered for some high-speed inter-satellite links, where data-rates of a few hundred megabits per second are evisioned under power and pulsewidth constraints. In this paper we investigate the capacity, cutoff-rate and error-probability performance of uncoded and trellis-coded systems for various modulation schemes and under various throughput and power constraints. Modulation schemes considered are on-off keying (OOK), pulse-position modulation (PPM), overlapping PPM (OPPM) and multi-pulse (combinatorial) PPM (MPPM).

Self-Avoiding Walks Over Adaptive Triangular Grids

NASA Technical Reports Server (NTRS)

Heber, Gerd; Biswas, Rupak; Gao, Guang R.; Saini, Subhash (Technical Monitor)

1999-01-01

Space-filling curves is a popular approach based on a geometric embedding for linearizing computational meshes. We present a new O(n log n) combinatorial algorithm for constructing a self avoiding walk through a two dimensional mesh containing n triangles. We show that for hierarchical adaptive meshes, the algorithm can be locally adapted and easily parallelized by taking advantage of the regularity of the refinement rules. The proposed approach should be very useful in the runtime partitioning and load balancing of adaptive unstructured grids.

Insight and search in Katona's five-square problem.

PubMed

Ollinger, Michael; Jones, Gary; Knoblich, Günther

2014-01-01

Insights are often productive outcomes of human thinking. We provide a cognitive model that explains insight problem solving by the interplay of problem space search and representational change, whereby the problem space is constrained or relaxed based on the problem representation. By introducing different experimental conditions that either constrained the initial search space or helped solvers to initiate a representational change, we investigated the interplay of problem space search and representational change in Katona's five-square problem. Testing 168 participants, we demonstrated that independent hints relating to the initial search space and to representational change had little effect on solution rates. However, providing both hints caused a significant increase in solution rates. Our results show the interplay between problem space search and representational change in insight problem solving: The initial problem space can be so large that people fail to encounter impasse, but even when representational change is achieved the resulting problem space can still provide a major obstacle to finding the solution.

Tumor-targeting peptides from combinatorial libraries*

PubMed Central

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

Identification of combinatorial drug regimens for treatment of Huntington's disease using Drosophila

NASA Astrophysics Data System (ADS)

Agrawal, Namita; Pallos, Judit; Slepko, Natalia; Apostol, Barbara L.; Bodai, Laszlo; Chang, Ling-Wen; Chiang, Ann-Shyn; Michels Thompson, Leslie; Marsh, J. Lawrence

2005-03-01

We explore the hypothesis that pathology of Huntington's disease involves multiple cellular mechanisms whose contributions to disease are incrementally additive or synergistic. We provide evidence that the photoreceptor neuron degeneration seen in flies expressing mutant human huntingtin correlates with widespread degenerative events in the Drosophila CNS. We use a Drosophila Huntington's disease model to establish dose regimens and protocols to assess the effectiveness of drug combinations used at low threshold concentrations. These proof of principle studies identify at least two potential combinatorial treatment options and illustrate a rapid and cost-effective paradigm for testing and optimizing combinatorial drug therapies while reducing side effects for patients with neurodegenerative disease. The potential for using prescreening in Drosophila to inform combinatorial therapies that are most likely to be effective for testing in mammals is discussed. combinatorial treatments | neurodegeneration

Nonparametric Combinatorial Sequence Models

NASA Astrophysics Data System (ADS)

Wauthier, Fabian L.; Jordan, Michael I.; Jojic, Nebojsa

This work considers biological sequences that exhibit combinatorial structures in their composition: groups of positions of the aligned sequences are "linked" and covary as one unit across sequences. If multiple such groups exist, complex interactions can emerge between them. Sequences of this kind arise frequently in biology but methodologies for analyzing them are still being developed. This paper presents a nonparametric prior on sequences which allows combinatorial structures to emerge and which induces a posterior distribution over factorized sequence representations. We carry out experiments on three sequence datasets which indicate that combinatorial structures are indeed present and that combinatorial sequence models can more succinctly describe them than simpler mixture models. We conclude with an application to MHC binding prediction which highlights the utility of the posterior distribution induced by the prior. By integrating out the posterior our method compares favorably to leading binding predictors.

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

PubMed

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.

Synergistic Effect of Combinatorial Treatment with Curcumin and Mitomycin C on the Induction of Apoptosis of Breast Cancer Cells: A cDNA Microarray Analysis

PubMed Central

Zhou, Qian-Mei; Chen, Qi-Long; Du, Jia; Wang, Xiu-Feng; Lu, Yi-Yu; Zhang, Hui; Su, Shi-Bing

2014-01-01

In order to explore the synergistic mechanisms of combinatorial treatment using curcumin and mitomycin C (MMC) for breast cancer, MCF-7 breast cancer xenografts were conducted to observe the synergistic effect of combinatorial treatment using curcumin and MMC at various dosages. The synergistic mechanisms of combinatorial treatment using curcumin and MMC on the inhibition of tumor growth were explored by differential gene expression profile, gene ontology (GO), ingenuity pathway analysis (IPA) and Signal–Net network analysis. The expression levels of selected genes identified by cDNA microarray expression profiling were validated by quantitative RT-PCR (qRT-PCR) and Western blot analysis. Effect of combinatorial treatment on the inhibition of cell growth was observed by MTT assay. Apoptosis was detected by flow cytometric analysis and Hoechst 33258 staining. The combinatorial treatment of 100 mg/kg curcumin and 1.5 mg/kg MMC revealed synergistic inhibition on tumor growth. Among 1501 differentially expressed genes, the expression of 25 genes exhibited an obvious change and a significant difference in 27 signal pathways was observed (p < 0.05). In addition, Mapk1 (ERK) and Mapk14 (MAPK p38) had more cross-interactions with other genes and revealed an increase in expression by 8.14- and 11.84-fold, respectively during the combinatorial treatment by curcumin and MMC when compared with the control. Moreover, curcumin can synergistically improve tumoricidal effect of MMC in another human breast cancer MDA-MB-231 cells. Apoptosis was significantly induced by the combinatorial treatment (p < 0.05) and significantly inhibited by ERK inhibitor (PD98059) in MCF-7 cells (p < 0.05). The synergistic effect of combinatorial treatment by curcumin and MMC on the induction of apoptosis in breast cancer cells may be via the ERK pathway. PMID:25226537

Improved Modeling of Side-Chain–Base Interactions and Plasticity in Protein–DNA Interface Design

PubMed Central

Thyme, Summer B.; Baker, David; Bradley, Philip

2012-01-01

Combinatorial sequence optimization for protein design requires libraries of discrete side-chain conformations. The discreteness of these libraries is problematic, particularly for long, polar side chains, since favorable interactions can be missed. Previously, an approach to loop remodeling where protein backbone movement is directed by side-chain rotamers predicted to form interactions previously observed in native complexes (termed “motifs”) was described. Here, we show how such motif libraries can be incorporated into combinatorial sequence optimization protocols and improve native complex recapitulation. Guided by the motif rotamer searches, we made improvements to the underlying energy function, increasing recapitulation of native interactions. To further test the methods, we carried out a comprehensive experimental scan of amino acid preferences in the I-AniI protein–DNA interface and found that many positions tolerated multiple amino acids. This sequence plasticity is not observed in the computational results because of the fixed-backbone approximation of the model. We improved modeling of this diversity by introducing DNA flexibility and reducing the convergence of the simulated annealing algorithm that drives the design process. In addition to serving as a benchmark, this extensive experimental data set provides insight into the types of interactions essential to maintain the function of this potential gene therapy reagent. PMID:22426128

Multiclassifier combinatorial proteomics of organelle shadows at the example of mitochondria in chromatin data.

PubMed

Kustatscher, Georg; Grabowski, Piotr; Rappsilber, Juri

2016-02-01

Subcellular localization is an important aspect of protein function, but the protein composition of many intracellular compartments is poorly characterized. For example, many nuclear bodies are challenging to isolate biochemically and thus remain inaccessible to proteomics. Here, we explore covariation in proteomics data as an alternative route to subcellular proteomes. Rather than targeting a structure of interest biochemically, we target it by machine learning. This becomes possible by taking data obtained for one organelle and searching it for traces of another organelle. As an extreme example and proof-of-concept we predict mitochondrial proteins based on their covariation in published interphase chromatin data. We detect about ⅓ of the known mitochondrial proteins in our chromatin data, presumably most as contaminants. However, these proteins are not present at random. We show covariation of mitochondrial proteins in chromatin proteomics data. We then exploit this covariation by multiclassifier combinatorial proteomics to define a list of mitochondrial proteins. This list agrees well with different databases on mitochondrial composition. This benchmark test raises the possibility that, in principle, covariation proteomics may also be applicable to structures for which no biochemical isolation procedures are available. © 2015 The Authors. Proteomics Published by WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Improved modeling of side-chain--base interactions and plasticity in protein--DNA interface design.

PubMed

Thyme, Summer B; Baker, David; Bradley, Philip

2012-06-08

Combinatorial sequence optimization for protein design requires libraries of discrete side-chain conformations. The discreteness of these libraries is problematic, particularly for long, polar side chains, since favorable interactions can be missed. Previously, an approach to loop remodeling where protein backbone movement is directed by side-chain rotamers predicted to form interactions previously observed in native complexes (termed "motifs") was described. Here, we show how such motif libraries can be incorporated into combinatorial sequence optimization protocols and improve native complex recapitulation. Guided by the motif rotamer searches, we made improvements to the underlying energy function, increasing recapitulation of native interactions. To further test the methods, we carried out a comprehensive experimental scan of amino acid preferences in the I-AniI protein-DNA interface and found that many positions tolerated multiple amino acids. This sequence plasticity is not observed in the computational results because of the fixed-backbone approximation of the model. We improved modeling of this diversity by introducing DNA flexibility and reducing the convergence of the simulated annealing algorithm that drives the design process. In addition to serving as a benchmark, this extensive experimental data set provides insight into the types of interactions essential to maintain the function of this potential gene therapy reagent. Published by Elsevier Ltd.

Combinatorial theory of Macdonald polynomials I: proof of Haglund's formula.

PubMed

Haglund, J; Haiman, M; Loehr, N

2005-02-22

Haglund recently proposed a combinatorial interpretation of the modified Macdonald polynomials H(mu). We give a combinatorial proof of this conjecture, which establishes the existence and integrality of H(mu). As corollaries, we obtain the cocharge formula of Lascoux and Schutzenberger for Hall-Littlewood polynomials, a formula of Sahi and Knop for Jack's symmetric functions, a generalization of this result to the integral Macdonald polynomials J(mu), a formula for H(mu) in terms of Lascoux-Leclerc-Thibon polynomials, and combinatorial expressions for the Kostka-Macdonald coefficients K(lambda,mu) when mu is a two-column shape.

To Think without Thinking: The Implications of Combinatory Play and the Creative Process for Neuroaesthetics

ERIC Educational Resources Information Center

Stevens, Victoria

2014-01-01

The author considers combinatory play as an intersection between creativity, play, and neuroaesthetics. She discusses combinatory play as vital to the creative process in art and science, particularly with regard to the incubation of new ideas. She reviews findings from current neurobiological research and outlines the way that the brain activates…

SCRaMbLE generates designed combinatorial stochastic diversity in synthetic chromosomes

PubMed Central

Shen, Yue; Stracquadanio, Giovanni; Wang, Yun; Yang, Kun; Mitchell, Leslie A.; Xue, Yaxin; Cai, Yizhi; Chen, Tai; Dymond, Jessica S.; Kang, Kang; Gong, Jianhui; Zeng, Xiaofan; Zhang, Yongfen; Li, Yingrui; Feng, Qiang; Xu, Xun; Wang, Jun; Wang, Jian; Yang, Huanming; Boeke, Jef D.; Bader, Joel S.

2016-01-01

Synthetic chromosome rearrangement and modification by loxP-mediated evolution (SCRaMbLE) generates combinatorial genomic diversity through rearrangements at designed recombinase sites. We applied SCRaMbLE to yeast synthetic chromosome arm synIXR (43 recombinase sites) and then used a computational pipeline to infer or unscramble the sequence of recombinations that created the observed genomes. Deep sequencing of 64 synIXR SCRaMbLE strains revealed 156 deletions, 89 inversions, 94 duplications, and 55 additional complex rearrangements; several duplications are consistent with a double rolling circle mechanism. Every SCRaMbLE strain was unique, validating the capability of SCRaMbLE to explore a diverse space of genomes. Rearrangements occurred exclusively at designed loxPsym sites, with no significant evidence for ectopic rearrangements or mutations involving synthetic regions, the 99% nonsynthetic nuclear genome, or the mitochondrial genome. Deletion frequencies identified genes required for viability or fast growth. Replacement of 3′ UTR by non-UTR sequence had surprisingly little effect on fitness. SCRaMbLE generates genome diversity in designated regions, reveals fitness constraints, and should scale to simultaneous evolution of multiple synthetic chromosomes. PMID:26566658

Combinatorial Strategies for Improving Multiple-Stress Resistance in Industrially Relevant Escherichia coli Strains

PubMed Central

Herrgård, Markus J.

2014-01-01

High-cell-density fermentation for industrial production of chemicals can impose numerous stresses on cells due to high substrate, product, and by-product concentrations; high osmolarity; reactive oxygen species; and elevated temperatures. There is a need to develop platform strains of industrial microorganisms that are more tolerant toward these typical processing conditions. In this study, the growth of six industrially relevant strains of Escherichia coli was characterized under eight stress conditions representative of fed-batch fermentation, and strains W and BL21(DE3) were selected as platforms for transposon (Tn) mutagenesis due to favorable resistance characteristics. Selection experiments, followed by either targeted or genome-wide next-generation-sequencing-based Tn insertion site determination, were performed to identify mutants with improved growth properties under a subset of three stress conditions and two combinations of individual stresses. A subset of the identified loss-of-function mutants were selected for a combinatorial approach, where strains with combinations of two and three gene deletions were systematically constructed and tested for single and multistress resistance. These approaches allowed identification of (i) strain-background-specific stress resistance phenotypes, (ii) novel gene deletion mutants in E. coli that confer single and multistress resistance in a strain-background-dependent manner, and (iii) synergistic effects of multiple gene deletions that confer improved resistance over single deletions. The results of this study underscore the suboptimality and strain-specific variability of the genetic network regulating growth under stressful conditions and suggest that further exploration of the combinatorial gene deletion space in multiple strain backgrounds is needed for optimizing strains for microbial bioprocessing applications. PMID:25085490

Corrosion Behavior of Plasma-Passivated Cu

DOE Office of Scientific and Technical Information (OSTI.GOV)

Barbour, J.C.; Braithwaite, J.W.; Son, K.A.

1999-07-09

A new approach is being pursued to study corrosion in Cu alloy systems by using combinatorial analysis combined with microscopic experimentation (the Combinatorial Microlab) to determine mechanisms for copper corrosion in air. Corrosion studies are inherently difficult because of complex interactions between materials and environment, forming a multidimensional phase space of corrosion variables. The Combinatorial Microlab was specifically developed to address the mechanism of Cu sulfidation, which is an important reliability issue for electronic components. This approach differs from convention by focusing on microscopic length scales, the relevant scale for corrosion. During accelerated aging, copper is exposed to a varietymore » of corrosive environments containing sulfidizing species that cause corrosion. A matrix experiment was done to determine independent and synergistic effects of initial Cu oxide thickness and point defect density. The CuO{sub x} was controlled by oxidizing Cu in an electron cyclotron resonance (ECR) O{sub 2} plasma, and the point defect density was modified by Cu ion irradiation. The matrix was exposed to 600 ppb H{sub 2}S in 65% relative humidity air atmosphere. This combination revealed the importance of oxide quality in passivating Cu and prevention of the sulfidizing reaction. A native oxide and a defect-laden ECR oxide both react at 20 C to form a thick Cu{sub 2}S layer after exposure to H{sub 2}S, while different thicknesses of as-grown ECR oxide stop the formation of Cu{sub 2}S. The species present in the ECR oxide will be compared to that of an air oxide, and the sulfide layer growth rate will be presented.« less

Combinatorial genetic perturbation to refine metabolic circuits for producing biofuels and biochemicals.

PubMed

Kim, Hyo Jin; Turner, Timothy Lee; Jin, Yong-Su

2013-11-01

Recent advances in metabolic engineering have enabled microbial factories to compete with conventional processes for producing fuels and chemicals. Both rational and combinatorial approaches coupled with synthetic and systematic tools play central roles in metabolic engineering to create and improve a selected microbial phenotype. Compared to knowledge-based rational approaches, combinatorial approaches exploiting biological diversity and high-throughput screening have been demonstrated as more effective tools for improving various phenotypes of interest. In particular, identification of unprecedented targets to rewire metabolic circuits for maximizing yield and productivity of a target chemical has been made possible. This review highlights general principles and the features of the combinatorial approaches using various libraries to implement desired phenotypes for strain improvement. In addition, recent applications that harnessed the combinatorial approaches to produce biofuels and biochemicals will be discussed. Copyright © 2013 Elsevier Inc. All rights reserved.

Tumor-targeting peptides from combinatorial libraries.

PubMed

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

2017-02-01

Cancer is one of the major and leading causes of death worldwide. Two of the greatest challenges in fighting 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. Copyright © 2017. Published by Elsevier B.V.

Morphological Constraints on Cerebellar Granule Cell Combinatorial Diversity.

PubMed

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. Despite the centrality of these theories to cerebellar physiology, the degree of expansion supported by anatomically realistic patterns of inputs is unknown. Using modeling and anatomy, we show that realistic input patterns constrain combinatorial diversity by producing redundant combinations, which nevertheless could support temporal diversification of like combinations, suitable for learned timing. Our study suggests a neural substrate for producing high levels of both combinatorial and temporal diversity in the granule cell layer. Copyright © 2017 the authors 0270-6474/17/3712153-14$15.00/0.

RetroPath2.0: A retrosynthesis workflow for metabolic engineers.

PubMed

Delépine, Baudoin; Duigou, Thomas; Carbonell, Pablo; Faulon, Jean-Loup

2018-01-01

Synthetic biology applied to industrial biotechnology is transforming the way we produce chemicals. However, despite advances in the scale and scope of metabolic engineering, the research and development process still remains costly. In order to expand the chemical repertoire for the production of next generation compounds, a major engineering biology effort is required in the development of novel design tools that target chemical diversity through rapid and predictable protocols. Addressing that goal involves retrosynthesis approaches that explore the chemical biosynthetic space. However, the complexity associated with the large combinatorial retrosynthesis design space has often been recognized as the main challenge hindering the approach. Here, we provide RetroPath2.0, an automated open source workflow for retrosynthesis based on generalized reaction rules that perform the retrosynthesis search from chassis to target through an efficient and well-controlled protocol. Its easiness of use and the versatility of its applications make this tool a valuable addition to the biological engineer bench desk. We show through several examples the application of the workflow to biotechnological relevant problems, including the identification of alternative biosynthetic routes through enzyme promiscuity or the development of biosensors. We demonstrate in that way the ability of the workflow to streamline retrosynthesis pathway design and its major role in reshaping the design, build, test and learn pipeline by driving the process toward the objective of optimizing bioproduction. The RetroPath2.0 workflow is built using tools developed by the bioinformatics and cheminformatics community, because it is open source we anticipate community contributions will likely expand further the features of the workflow. Copyright © 2017 The Authors. Published by Elsevier Inc. All rights reserved.

A diversity-oriented synthesis strategy enabling the combinatorial-type variation of macrocyclic peptidomimetic scaffolds.

PubMed

Isidro-Llobet, Albert; Hadje Georgiou, Kathy; Galloway, Warren R J D; Giacomini, Elisa; Hansen, Mette R; Méndez-Abt, Gabriela; Tan, Yaw Sing; Carro, Laura; Sore, Hannah F; Spring, David R

2015-04-21

Macrocyclic peptidomimetics are associated with a broad range of biological activities. However, despite such potentially valuable properties, the macrocyclic peptidomimetic structural class is generally considered as being poorly explored within drug discovery. This has been attributed to the lack of general methods for producing collections of macrocyclic peptidomimetics with high levels of structural, and thus shape, diversity. In particular, there is a lack of scaffold diversity in current macrocyclic peptidomimetic libraries; indeed, the efficient construction of diverse molecular scaffolds presents a formidable general challenge to the synthetic chemist. Herein we describe a new, advanced strategy for the diversity-oriented synthesis (DOS) of macrocyclic peptidomimetics that enables the combinatorial variation of molecular scaffolds (core macrocyclic ring architectures). The generality and robustness of this DOS strategy is demonstrated by the step-efficient synthesis of a structurally diverse library of over 200 macrocyclic peptidomimetic compounds, each based around a distinct molecular scaffold and isolated in milligram quantities, from readily available building-blocks. To the best of our knowledge this represents an unprecedented level of scaffold diversity in a synthetically derived library of macrocyclic peptidomimetics. Cheminformatic analysis indicated that the library compounds access regions of chemical space that are distinct from those addressed by top-selling brand-name drugs and macrocyclic natural products, illustrating the value of our DOS approach to sample regions of chemical space underexploited in current drug discovery efforts. An analysis of three-dimensional molecular shapes illustrated that the DOS library has a relatively high level of shape diversity.

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

NASA Astrophysics Data System (ADS)

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.

A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem

PubMed Central

Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

2016-01-01

The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them. PMID:26819585

A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem.

PubMed

Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

2016-01-01

The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them.

Towards a computational- and algorithmic-level account of concept blending using analogies and amalgams

NASA Astrophysics Data System (ADS)

Besold, Tarek R.; Kühnberger, Kai-Uwe; Plaza, Enric

2017-10-01

Concept blending - a cognitive process which allows for the combination of certain elements (and their relations) from originally distinct conceptual spaces into a new unified space combining these previously separate elements, and enables reasoning and inference over the combination - is taken as a key element of creative thought and combinatorial creativity. In this article, we summarise our work towards the development of a computational-level and algorithmic-level account of concept blending, combining approaches from computational analogy-making and case-based reasoning (CBR). We present the theoretical background, as well as an algorithmic proposal integrating higher-order anti-unification matching and generalisation from analogy with amalgams from CBR. The feasibility of the approach is then exemplified in two case studies.

Environmental Visualization and Horizontal Fusion

DTIC Science & Technology

2005-10-01

the section on EVIS Rules. Federated Search – Discovering Content Another method of discovering services and their content has been implemented...in HF through a next-generation knowledge discovery framework called Federated Search . A virtual information space, called Collateral Space was...environmental mission effects products, is presented later in the paper. Federated Search allows users to search through Collateral Space data that is

Genes@Work: an efficient algorithm for pattern discovery and multivariate feature selection in gene expression data.

PubMed

Lepre, Jorge; Rice, J Jeremy; Tu, Yuhai; Stolovitzky, Gustavo

2004-05-01

Despite the growing literature devoted to finding differentially expressed genes in assays probing different tissues types, little attention has been paid to the combinatorial nature of feature selection inherent to large, high-dimensional gene expression datasets. New flexible data analysis approaches capable of searching relevant subgroups of genes and experiments are needed to understand multivariate associations of gene expression patterns with observed phenotypes. We present in detail a deterministic algorithm to discover patterns of multivariate gene associations in gene expression data. The patterns discovered are differential with respect to a control dataset. The algorithm is exhaustive and efficient, reporting all existent patterns that fit a given input parameter set while avoiding enumeration of the entire pattern space. The value of the pattern discovery approach is demonstrated by finding a set of genes that differentiate between two types of lymphoma. Moreover, these genes are found to behave consistently in an independent dataset produced in a different laboratory using different arrays, thus validating the genes selected using our algorithm. We show that the genes deemed significant in terms of their multivariate statistics will be missed using other methods. Our set of pattern discovery algorithms including a user interface is distributed as a package called Genes@Work. This package is freely available to non-commercial users and can be downloaded from our website (http://www.research.ibm.com/FunGen).

Structural analysis of a set of proteins resulting from a bacterial genomics project.

PubMed

Badger, J; Sauder, J M; Adams, J M; Antonysamy, S; Bain, K; Bergseid, M G; Buchanan, S G; Buchanan, M D; Batiyenko, Y; Christopher, J A; Emtage, S; Eroshkina, A; Feil, I; Furlong, E B; Gajiwala, K S; Gao, X; He, D; Hendle, J; Huber, A; Hoda, K; Kearins, P; Kissinger, C; Laubert, B; Lewis, H A; Lin, J; Loomis, K; Lorimer, D; Louie, G; Maletic, M; Marsh, C D; Miller, I; Molinari, J; Muller-Dieckmann, H J; Newman, J M; Noland, B W; Pagarigan, B; Park, F; Peat, T S; Post, K W; Radojicic, S; Ramos, A; Romero, R; Rutter, M E; Sanderson, W E; Schwinn, K D; Tresser, J; Winhoven, J; Wright, T A; Wu, L; Xu, J; Harris, T J R

2005-09-01

The targets of the Structural GenomiX (SGX) bacterial genomics project were proteins conserved in multiple prokaryotic organisms with no obvious sequence homolog in the Protein Data Bank of known structures. The outcome of this work was 80 structures, covering 60 unique sequences and 49 different genes. Experimental phase determination from proteins incorporating Se-Met was carried out for 45 structures with most of the remainder solved by molecular replacement using members of the experimentally phased set as search models. An automated tool was developed to deposit these structures in the Protein Data Bank, along with the associated X-ray diffraction data (including refined experimental phases) and experimentally confirmed sequences. BLAST comparisons of the SGX structures with structures that had appeared in the Protein Data Bank over the intervening 3.5 years since the SGX target list had been compiled identified homologs for 49 of the 60 unique sequences represented by the SGX structures. This result indicates that, for bacterial structures that are relatively easy to express, purify, and crystallize, the structural coverage of gene space is proceeding rapidly. More distant sequence-structure relationships between the SGX and PDB structures were investigated using PDB-BLAST and Combinatorial Extension (CE). Only one structure, SufD, has a truly unique topology compared to all folds in the PDB. Copyright 2005 Wiley-Liss, Inc.

Optimisation by hierarchical search

NASA Astrophysics Data System (ADS)

Zintchenko, Ilia; Hastings, Matthew; Troyer, Matthias

2015-03-01

Finding optimal values for a set of variables relative to a cost function gives rise to some of the hardest problems in physics, computer science and applied mathematics. Although often very simple in their formulation, these problems have a complex cost function landscape which prevents currently known algorithms from efficiently finding the global optimum. Countless techniques have been proposed to partially circumvent this problem, but an efficient method is yet to be found. We present a heuristic, general purpose approach to potentially improve the performance of conventional algorithms or special purpose hardware devices by optimising groups of variables in a hierarchical way. We apply this approach to problems in combinatorial optimisation, machine learning and other fields.

Stochastic search, optimization and regression with energy applications

NASA Astrophysics Data System (ADS)

Hannah, Lauren A.

Designing clean energy systems will be an important task over the next few decades. One of the major roadblocks is a lack of mathematical tools to economically evaluate those energy systems. However, solutions to these mathematical problems are also of interest to the operations research and statistical communities in general. This thesis studies three problems that are of interest to the energy community itself or provide support for solution methods: R&D portfolio optimization, nonparametric regression and stochastic search with an observable state variable. First, we consider the one stage R&D portfolio optimization problem to avoid the sequential decision process associated with the multi-stage. The one stage problem is still difficult because of a non-convex, combinatorial decision space and a non-convex objective function. We propose a heuristic solution method that uses marginal project values---which depend on the selected portfolio---to create a linear objective function. In conjunction with the 0-1 decision space, this new problem can be solved as a knapsack linear program. This method scales well to large decision spaces. We also propose an alternate, provably convergent algorithm that does not exploit problem structure. These methods are compared on a solid oxide fuel cell R&D portfolio problem. Next, we propose Dirichlet Process mixtures of Generalized Linear Models (DPGLM), a new method of nonparametric regression that accommodates continuous and categorical inputs, and responses that can be modeled by a generalized linear model. We prove conditions for the asymptotic unbiasedness of the DP-GLM regression mean function estimate. We also give examples for when those conditions hold, including models for compactly supported continuous distributions and a model with continuous covariates and categorical response. We empirically analyze the properties of the DP-GLM and why it provides better results than existing Dirichlet process mixture regression models. We evaluate DP-GLM on several data sets, comparing it to modern methods of nonparametric regression like CART, Bayesian trees and Gaussian processes. Compared to existing techniques, the DP-GLM provides a single model (and corresponding inference algorithms) that performs well in many regression settings. Finally, we study convex stochastic search problems where a noisy objective function value is observed after a decision is made. There are many stochastic search problems whose behavior depends on an exogenous state variable which affects the shape of the objective function. Currently, there is no general purpose algorithm to solve this class of problems. We use nonparametric density estimation to take observations from the joint state-outcome distribution and use them to infer the optimal decision for a given query state. We propose two solution methods that depend on the problem characteristics: function-based and gradient-based optimization. We examine two weighting schemes, kernel-based weights and Dirichlet process-based weights, for use with the solution methods. The weights and solution methods are tested on a synthetic multi-product newsvendor problem and the hour-ahead wind commitment problem. Our results show that in some cases Dirichlet process weights offer substantial benefits over kernel based weights and more generally that nonparametric estimation methods provide good solutions to otherwise intractable problems.

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

PubMed

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.

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

PubMed

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.

Systematic Identification of Combinatorial Drivers and Targets in Cancer Cell Lines

PubMed Central

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. PMID:23577104

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

PubMed

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.

Combinatorial materials approach to accelerate materials discovery for transportation (Conference Presentation)

NASA Astrophysics Data System (ADS)

Tong, Wei

2017-04-01

Combinatorial material research offers fast and efficient solutions to identify promising and advanced materials. It has revolutionized the pharmaceutical industry and now is being applied to accelerate the discovery of other new compounds, e.g. superconductors, luminescent materials, catalysts etc. Differing from the traditional trial-and-error process, this approach allows for the synthesis of a large number of compositionally diverse compounds by varying the combinations of the components and adjusting the ratios. It largely reduces the cost of single-sample synthesis/characterization, along with the turnaround time in the material discovery process, therefore, could dramatically change the existing paradigm for discovering and commercializing new materials. This talk outlines the use of combinatorial materials approach in the material discovery in transportation sector. It covers the general introduction to the combinatorial material concept, state of art for its application in energy-related research. At the end, LBNL capabilities in combinatorial materials synthesis and high throughput characterization that are applicable for material discovery research will be highlighted.

Fluctuations of Wigner-type random matrices associated with symmetric spaces of class DIII and CI

NASA Astrophysics Data System (ADS)

Stolz, Michael

2018-02-01

Wigner-type randomizations of the tangent spaces of classical symmetric spaces can be thought of as ordinary Wigner matrices on which additional symmetries have been imposed. In particular, they fall within the scope of a framework, due to Schenker and Schulz-Baldes, for the study of fluctuations of Wigner matrices with additional dependencies among their entries. In this contribution, we complement the results of these authors by explicit calculations of the asymptotic covariances for symmetry classes DIII and CI and thus obtain explicit CLTs for these classes. On the technical level, the present work is an exercise in controlling the cumulative effect of systematically occurring sign factors in an involved sum of products by setting up a suitable combinatorial model for the summands. This aspect may be of independent interest. Research supported by Deutsche Forschungsgemeinschaft (DFG) via SFB 878.

Statistical physics of the symmetric group.

PubMed

Williams, Mobolaji

2017-04-01

Ordered chains (such as chains of amino acids) are ubiquitous in biological cells, and these chains perform specific functions contingent on the sequence of their components. Using the existence and general properties of such sequences as a theoretical motivation, we study the statistical physics of systems whose state space is defined by the possible permutations of an ordered list, i.e., the symmetric group, and whose energy is a function of how certain permutations deviate from some chosen correct ordering. Such a nonfactorizable state space is quite different from the state spaces typically considered in statistical physics systems and consequently has novel behavior in systems with interacting and even noninteracting Hamiltonians. Various parameter choices of a mean-field model reveal the system to contain five different physical regimes defined by two transition temperatures, a triple point, and a quadruple point. Finally, we conclude by discussing how the general analysis can be extended to state spaces with more complex combinatorial properties and to other standard questions of statistical mechanics models.

Statistical physics of the symmetric group

NASA Astrophysics Data System (ADS)

Williams, Mobolaji

2017-04-01

Ordered chains (such as chains of amino acids) are ubiquitous in biological cells, and these chains perform specific functions contingent on the sequence of their components. Using the existence and general properties of such sequences as a theoretical motivation, we study the statistical physics of systems whose state space is defined by the possible permutations of an ordered list, i.e., the symmetric group, and whose energy is a function of how certain permutations deviate from some chosen correct ordering. Such a nonfactorizable state space is quite different from the state spaces typically considered in statistical physics systems and consequently has novel behavior in systems with interacting and even noninteracting Hamiltonians. Various parameter choices of a mean-field model reveal the system to contain five different physical regimes defined by two transition temperatures, a triple point, and a quadruple point. Finally, we conclude by discussing how the general analysis can be extended to state spaces with more complex combinatorial properties and to other standard questions of statistical mechanics models.

From grand-canonical density functional theory towards rational compound design

NASA Astrophysics Data System (ADS)

von Lilienfeld, Anatole

2008-03-01

The fundamental challenge of rational compound design, ie the reverse engineering of chemical compounds with predefined specific properties, originates in the high-dimensional combinatorial nature of chemical space. Chemical space is the hyper-space of a given set of molecular observables that is spanned by the grand-canonical variables (particle densities of electrons and nuclei) which define chemical composition. A brief but rigorous description of chemical space within the molecular grand-canonical ensemble multi-component density functional theory framework will be given [1]. Numerical results will be presented for intermolecular energies as a continuous function of alchemical variations within a neutral and isoelectronic 10 proton system, including CH4, NH3, H2O, and HF, interacting with formic acid [2]. Furthermore, engineering the Fermi level through alchemical generation of boron-nitrogen doped mutants of benzene shall be discussed [3].[1] von Lilienfeld and Tuckerman JCP 125 154104 (2006)[2] von Lilienfeld and Tuckerman JCTC 3 1083 (2007)[3] Marcon et al. JCP 127 064305 (2007)

The Paragon Algorithm, a next generation search engine that uses sequence temperature values and feature probabilities to identify peptides from tandem mass spectra.

PubMed

Shilov, Ignat V; Seymour, Sean L; Patel, Alpesh A; Loboda, Alex; Tang, Wilfred H; Keating, Sean P; Hunter, Christie L; Nuwaysir, Lydia M; Schaeffer, Daniel A

2007-09-01

The Paragon Algorithm, a novel database search engine for the identification of peptides from tandem mass spectrometry data, is presented. Sequence Temperature Values are computed using a sequence tag algorithm, allowing the degree of implication by an MS/MS spectrum of each region of a database to be determined on a continuum. Counter to conventional approaches, features such as modifications, substitutions, and cleavage events are modeled with probabilities rather than by discrete user-controlled settings to consider or not consider a feature. The use of feature probabilities in conjunction with Sequence Temperature Values allows for a very large increase in the effective search space with only a very small increase in the actual number of hypotheses that must be scored. The algorithm has a new kind of user interface that removes the user expertise requirement, presenting control settings in the language of the laboratory that are translated to optimal algorithmic settings. To validate this new algorithm, a comparison with Mascot is presented for a series of analogous searches to explore the relative impact of increasing search space probed with Mascot by relaxing the tryptic digestion conformance requirements from trypsin to semitrypsin to no enzyme and with the Paragon Algorithm using its Rapid mode and Thorough mode with and without tryptic specificity. Although they performed similarly for small search space, dramatic differences were observed in large search space. With the Paragon Algorithm, hundreds of biological and artifact modifications, all possible substitutions, and all levels of conformance to the expected digestion pattern can be searched in a single search step, yet the typical cost in search time is only 2-5 times that of conventional small search space. Despite this large increase in effective search space, there is no drastic loss of discrimination that typically accompanies the exploration of large search space.

Putting Man in the Machine: Exploiting Expertise to Enhance Multiobjective Design of Water Supply Monitoring Network

NASA Astrophysics Data System (ADS)

Bode, F.; Nowak, W.; Reed, P. M.; Reuschen, S.

2016-12-01

Drinking-water well catchments need effective early-warning monitoring networks. Groundwater water supply wells in complex urban environments are in close proximity to a myriad of potential industrial pollutant sources that could irreversibly damage their source aquifers. These urban environments pose fiscal and physical challenges to designing monitoring networks. Ideal early-warning monitoring networks would satisfy three objectives: to detect (1) all potential contaminations within the catchment (2) as early as possible before they reach the pumping wells, (3) while minimizing costs. Obviously, the ideal case is nonexistent, so we search for tradeoffs using multiobjective optimization. The challenge of this optimization problem is the high number of potential monitoring-well positions (the search space) and the non-linearity of the underlying groundwater flow-and-transport problem. This study evaluates (1) different ways to effectively restrict the search space in an efficient way, with and without expert knowledge, (2) different methods to represent the search space during the optimization and (3) the influence of incremental increases in uncertainty in the system. Conductivity, regional flow direction and potential source locations are explored as key uncertainties. We show the need and the benefit of our methods by comparing optimized monitoring networks for different uncertainty levels with networks that seek to effectively exploit expert knowledge. The study's main contributions are the different approaches restricting and representing the search space. The restriction algorithms are based on a point-wise comparison of decision elements of the search space. The representation of the search space can be either binary or continuous. For both cases, the search space must be adjusted properly. Our results show the benefits and drawbacks of binary versus continuous search space representations and the high potential of automated search space restriction algorithms for high-dimensional, highly non-linear optimization problems.

Discovery of the leinamycin family of natural products by mining actinobacterial genomes

PubMed Central

Xu, Zhengren; Guo, Zhikai; Hindra; Ma, Ming; Zhou, Hao; Gansemans, Yannick; Zhu, Xiangcheng; Huang, Yong; Zhao, Li-Xing; Jiang, Yi; Cheng, Jinhua; Van Nieuwerburgh, Filip; Suh, Joo-Won; Duan, Yanwen

2017-01-01

Nature’s ability to generate diverse natural products from simple building blocks has inspired combinatorial biosynthesis. The knowledge-based approach to combinatorial biosynthesis has allowed the production of designer analogs by rational metabolic pathway engineering. While successful, structural alterations are limited, with designer analogs often produced in compromised titers. The discovery-based approach to combinatorial biosynthesis complements the knowledge-based approach by exploring the vast combinatorial biosynthesis repertoire found in Nature. Here we showcase the discovery-based approach to combinatorial biosynthesis by targeting the domain of unknown function and cysteine lyase domain (DUF–SH) didomain, specific for sulfur incorporation from the leinamycin (LNM) biosynthetic machinery, to discover the LNM family of natural products. By mining bacterial genomes from public databases and the actinomycetes strain collection at The Scripps Research Institute, we discovered 49 potential producers that could be grouped into 18 distinct clades based on phylogenetic analysis of the DUF–SH didomains. Further analysis of the representative genomes from each of the clades identified 28 lnm-type gene clusters. Structural diversities encoded by the LNM-type biosynthetic machineries were predicted based on bioinformatics and confirmed by in vitro characterization of selected adenylation proteins and isolation and structural elucidation of the guangnanmycins and weishanmycins. These findings demonstrate the power of the discovery-based approach to combinatorial biosynthesis for natural product discovery and structural diversity and highlight Nature’s rich biosynthetic repertoire. Comparative analysis of the LNM-type biosynthetic machineries provides outstanding opportunities to dissect Nature’s biosynthetic strategies and apply these findings to combinatorial biosynthesis for natural product discovery and structural diversity. PMID:29229819

Discovery of the leinamycin family of natural products by mining actinobacterial genomes.

PubMed

Pan, Guohui; Xu, Zhengren; Guo, Zhikai; Hindra; Ma, Ming; Yang, Dong; Zhou, Hao; Gansemans, Yannick; Zhu, Xiangcheng; Huang, Yong; Zhao, Li-Xing; Jiang, Yi; Cheng, Jinhua; Van Nieuwerburgh, Filip; Suh, Joo-Won; Duan, Yanwen; Shen, Ben

2017-12-26

Nature's ability to generate diverse natural products from simple building blocks has inspired combinatorial biosynthesis. The knowledge-based approach to combinatorial biosynthesis has allowed the production of designer analogs by rational metabolic pathway engineering. While successful, structural alterations are limited, with designer analogs often produced in compromised titers. The discovery-based approach to combinatorial biosynthesis complements the knowledge-based approach by exploring the vast combinatorial biosynthesis repertoire found in Nature. Here we showcase the discovery-based approach to combinatorial biosynthesis by targeting the domain of unknown function and cysteine lyase domain (DUF-SH) didomain, specific for sulfur incorporation from the leinamycin (LNM) biosynthetic machinery, to discover the LNM family of natural products. By mining bacterial genomes from public databases and the actinomycetes strain collection at The Scripps Research Institute, we discovered 49 potential producers that could be grouped into 18 distinct clades based on phylogenetic analysis of the DUF-SH didomains. Further analysis of the representative genomes from each of the clades identified 28 lnm -type gene clusters. Structural diversities encoded by the LNM-type biosynthetic machineries were predicted based on bioinformatics and confirmed by in vitro characterization of selected adenylation proteins and isolation and structural elucidation of the guangnanmycins and weishanmycins. These findings demonstrate the power of the discovery-based approach to combinatorial biosynthesis for natural product discovery and structural diversity and highlight Nature's rich biosynthetic repertoire. Comparative analysis of the LNM-type biosynthetic machineries provides outstanding opportunities to dissect Nature's biosynthetic strategies and apply these findings to combinatorial biosynthesis for natural product discovery and structural diversity.

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

PubMed

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 pretreatment, together with fermentation optimization, favorably improves lipid production using lignin as the carbon source. Combinatorial pretreatment integrated with fed-batch fermentation was an effective strategy to improve the bioconversion of lignin into lipids, thus facilitating lignin valorization in biorefineries.

Optimal placement of tuning masses on truss structures by genetic algorithms

NASA Technical Reports Server (NTRS)

Ponslet, Eric; Haftka, Raphael T.; Cudney, Harley H.

1993-01-01

Optimal placement of tuning masses, actuators and other peripherals on large space structures is a combinatorial optimization problem. This paper surveys several techniques for solving this problem. The genetic algorithm approach to the solution of the placement problem is described in detail. An example of minimizing the difference between the two lowest frequencies of a laboratory truss by adding tuning masses is used for demonstrating some of the advantages of genetic algorithms. The relative efficiencies of different codings are compared using the results of a large number of optimization runs.

Fuzzy connectedness and object definition

NASA Astrophysics Data System (ADS)

Udupa, Jayaram K.; Samarasekera, Supun

1995-04-01

Approaches to object information extraction from images should attempt to use the fact that images are fuzzy. In past image segmentation research, the notion of `hanging togetherness' of image elements specified by their fuzzy connectedness has been lacking. We present a theory of fuzzy objects for n-dimensional digital spaces based on a notion of fuzzy connectedness of image elements. Although our definitions lead to problems of enormous combinatorial complexity, the theoretical results allow us to reduce this dramatically. We demonstrate the utility of the theory and algorithms in image segmentation based on several practical examples.

Target-distractor similarity has a larger impact on visual search in school-age children than spacing.

PubMed

Huurneman, Bianca; Boonstra, F Nienke

2015-01-22

In typically developing children, crowding decreases with increasing age. The influence of target-distractor similarity with respect to orientation and element spacing on visual search performance was investigated in 29 school-age children with normal vision (4- to 6-year-olds [N = 16], 7- to 8-year-olds [N = 13]). Children were instructed to search for a target E among distractor Es (feature search: all flanking Es pointing right; conjunction search: flankers in three orientations). Orientation of the target was manipulated in four directions: right (target absent), left (inversed), up, and down (vertical). Spacing was varied in four steps: 0.04°, 0.5°, 1°, and 2°. During feature search, high target-distractor similarity had a stronger impact on performance than spacing: Orientation affected accuracy until spacing was 1°, and spacing only influenced accuracy for identifying inversed targets. Spatial analyses showed that orientation affected oculomotor strategy: Children made more fixations in the "inversed" target area (4.6) than the vertical target areas (1.8 and 1.9). Furthermore, age groups differed in fixation duration: 4- to 6-year-old children showed longer fixation durations than 7- to 8-year-olds at the two largest element spacings (p = 0.039 and p = 0.027). Conjunction search performance was unaffected by spacing. Four conclusions can be drawn from this study: (a) Target-distractor similarity governs visual search performance in school-age children, (b) children make more fixations in target areas when target-distractor similarity is high, (c) 4- to 6-year-olds show longer fixation durations than 7- to 8-year-olds at 1° and 2° element spacing, and (d) spacing affects feature but not conjunction search-a finding that might indicate top-down control ameliorates crowding in children. © 2015 ARVO.

Protein Side-Chain Resonance Assignment and NOE Assignment Using RDC-Defined Backbones without TOCSY Data3

PubMed Central

Zeng, Jianyang; Zhou, Pei; Donald, Bruce Randall

2011-01-01

One bottleneck in NMR structure determination lies in the laborious and time-consuming process of side-chain resonance and NOE assignments. Compared to the well-studied backbone resonance assignment problem, automated side-chain resonance and NOE assignments are relatively less explored. Most NOE assignment algorithms require nearly complete side-chain resonance assignments from a series of through-bond experiments such as HCCH-TOCSY or HCCCONH. Unfortunately, these TOCSY experiments perform poorly on large proteins. To overcome this deficiency, we present a novel algorithm, called NASCA (NOE Assignment and Side-Chain Assignment), to automate both side-chain resonance and NOE assignments and to perform high-resolution protein structure determination in the absence of any explicit through-bond experiment to facilitate side-chain resonance assignment, such as HCCH-TOCSY. After casting the assignment problem into a Markov Random Field (MRF), NASCA extends and applies combinatorial protein design algorithms to compute optimal assignments that best interpret the NMR data. The MRF captures the contact map information of the protein derived from NOESY spectra, exploits the backbone structural information determined by RDCs, and considers all possible side-chain rotamers. The complexity of the combinatorial search is reduced by using a dead-end elimination (DEE) algorithm, which prunes side-chain resonance assignments that are provably not part of the optimal solution. Then an A* search algorithm is employed to find a set of optimal side-chain resonance assignments that best fit the NMR data. These side-chain resonance assignments are then used to resolve the NOE assignment ambiguity and compute high-resolution protein structures. Tests on five proteins show that NASCA assigns resonances for more than 90% of side-chain protons, and achieves about 80% correct assignments. The final structures computed using the NOE distance restraints assigned by NASCA have backbone RMSD 0.8 – 1.5 Å from the reference structures determined by traditional NMR approaches. PMID:21706248

An Indexed Combinatorial Library: The Synthesis and Testing of Insect Repellents

NASA Astrophysics Data System (ADS)

Miles, William H.; Gelato, Kathy A.; Pompizzi, Kristen M.; Scarbinsky, Aislinn M.; Albrecht, Brian K.; Reynolds, Elaine R.

2001-04-01

An indexed combinatorial library of amides was prepared by the reaction of amines and acid chlorides. A simple test for insect repellency using fruit flies (Drosophila melanogaster) allowed the determination of the most repellent sublibraries. The student-generated data were collected and analyzed to determine the most active amide(s) in the library. This experiment illustrates the fundamentals of combinatorial chemistry, a field that has undergone explosive growth in the last decade.

Identification of a small molecule inhibitor of the aminoglycoside 6'-N-acetyltransferase type Ib [AAC(6')-Ib] using mixture-based combinatorial libraries.

PubMed

Tran, Tung; Chiem, Kevin; Jani, Saumya; Arivett, Brock A; Lin, David L; Lad, Rupali; Jimenez, Verónica; Farone, Mary B; Debevec, Ginamarie; Santos, Radleigh; Giulianotti, Marc; Pinilla, Clemencia; Tolmasky, Marcelo E

2018-05-01

The aminoglycoside, 6'-N-acetyltransferase type Ib [AAC(6')-Ib] is the most widely distributed enzyme among AAC(6')-I-producing Gram-negative pathogens and confers resistance to clinically relevant aminoglycosides, including amikacin. This enzyme is therefore an ideal target for enzymatic inhibitors that could overcome resistance to aminoglycosides. The search for inhibitors was carried out using mixture-based combinatorial libraries, the scaffold ranking approach, and the positional scanning strategy. A library with high inhibitory activity had pyrrolidine pentamine scaffold and was selected for further analysis. This library contained 738,192 compounds with functionalities derived from 26 different amino acids (R1, R2 and R3) and 42 different carboxylic acids (R4) in four R-group functionalities. The most active compounds all contained S-phenyl (R1 and R3) and S-hydromethyl (R2) functionalities at three locations and differed at the R4 position. The compound containing 3-phenylbutyl at R4 (compound 206) was a robust enzymatic inhibitor in vitro, in combination with amikacin it potentiated the inhibition of growth of three resistant bacteria in culture, and it improved survival when used as treatment of Galleria mellonella infected with aac(6')-Ib-harboring Klebsiella pneumoniae and Acinetobacter baumannii strains. Copyright © 2018 Elsevier B.V. and International Society of Chemotherapy. All rights reserved.

Distributed Drug Discovery, Part 2: Global Rehearsal of Alkylating Agents for the Synthesis of Resin-Bound Unnatural Amino Acids and Virtual D3 Catalog Construction

PubMed Central

2008-01-01

Distributed Drug Discovery (D3) proposes solving large drug discovery problems by breaking them into smaller units for processing at multiple sites. A key component of the synthetic and computational stages of D3 is the global rehearsal of prospective reagents and their subsequent use in the creation of virtual catalogs of molecules accessible by simple, inexpensive combinatorial chemistry. The first section of this article documents the feasibility of the synthetic component of Distributed Drug Discovery. Twenty-four alkylating agents were rehearsed in the United States, Poland, Russia, and Spain, for their utility in the synthesis of resin-bound unnatural amino acids 1, key intermediates in many combinatorial chemistry procedures. This global reagent rehearsal, coupled to virtual library generation, increases the likelihood that any member of that virtual library can be made. It facilitates the realistic integration of worldwide virtual D3 catalog computational analysis with synthesis. The second part of this article describes the creation of the first virtual D3 catalog. It reports the enumeration of 24 416 acylated unnatural amino acids 5, assembled from lists of either rehearsed or well-precedented alkylating and acylating reagents, and describes how the resulting catalog can be freely accessed, searched, and downloaded by the scientific community. PMID:19105725

How the brain assigns a neural tag to arbitrary points in a high-dimensional space

NASA Astrophysics Data System (ADS)

Stevens, Charles

Brains in almost all organisms need to deal with very complex stimuli. For example, most mammals are very good at face recognition, and faces are very complex objects indeed. For example, modern face recognition software represents a face as a point in a 10,000 dimensional space. Every human must be able to learn to recognize any of the 7 billion faces in the world, and can recognize familiar faces after a display of the face is viewed for only a few hundred milliseconds. Because we do not understand how faces are assigned locations in a high-dimensional space by the brain, attacking the problem of how face recognition is accomplished is very difficult. But a much easier problem of the same sort can be studied for odor recognition. For the mouse, each odor is assigned a point in a 1000 dimensional space, and the fruit fly assigns any odor a location in only a 50 dimensional space. A fly has about 50 distinct types of odorant receptor neurons (ORNs), each of which produce nerve impulses at a specific rate for each different odor. This pattern of firing produced across 50 ORNs is called `a combinatorial odor code', and this code assigns every odor a point in a 50 dimensional space that is used to identify the odor. In order to learn the odor, the brain must alter the strength of synapses. The combinatorial code cannot itself by used to change synaptic strength because all odors use same neurons to form the code, and so all synapses would be changed for any odor and the odors could not be distinguished. In order to learn an odor, the brain must assign a set of neurons - the odor tag - that have the property that these neurons (1) should make use of all of the information available about the odor, and (2) insure that any two tags overlap as little as possible (so one odor does not modify synapses used by other odors). In the talk, I will explain how the olfactory system of both the fruit fly and the mouse produce a tag for each odor that has these two properties. Supported by NSF.

Combinatorial fabrication and screening of organic light-emitting device arrays

NASA Astrophysics Data System (ADS)

Shinar, Joseph; Shinar, Ruth; Zhou, Zhaoqun

2007-11-01

The combinatorial fabrication and screening of 2-dimensional (2-d) small molecular UV-violet organic light-emitting device (OLED) arrays, 1-d blue-to-red arrays, 1-d intense white OLED libraries, 1-d arrays to study Förster energy transfer in guest-host OLEDs, and 2-d arrays to study exciplex emission from OLEDs is described. The results demonstrate the power of combinatorial approaches for screening OLED materials and configurations, and for studying their basic properties.

Combinatorial Dyson-Schwinger equations and inductive data types

NASA Astrophysics Data System (ADS)

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.

Combinatorial stresses kill pathogenic Candida species

PubMed Central

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

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

PubMed

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.

OPTIMIZING THROUGH CO-EVOLUTIONARY AVALANCHES

DOE Office of Scientific and Technical Information (OSTI.GOV)

S. BOETTCHER; A. PERCUS

2000-08-01

We explore a new general-purpose heuristic for finding high-quality solutions to hard optimization problems. The method, called extremal optimization, is inspired by ''self-organized critically,'' a concept introduced to describe emergent complexity in many physical systems. In contrast to Genetic Algorithms which operate on an entire ''gene-pool'' of possible solutions, extremal optimization successively replaces extremely undesirable elements of a sub-optimal solution with new, random ones. Large fluctuations, called ''avalanches,'' ensue that efficiently explore many local optima. Drawing upon models used to simulate far-from-equilibrium dynamics, extremal optimization complements approximation methods inspired by equilibrium statistical physics, such as simulated annealing. With only onemore » adjustable parameter, its performance has proved competitive with more elaborate methods, especially near phase transitions. Those phase transitions are found in the parameter space of most optimization problems, and have recently been conjectured to be the origin of some of the hardest instances in computational complexity. We will demonstrate how extremal optimization can be implemented for a variety of combinatorial optimization problems. We believe that extremal optimization will be a useful tool in the investigation of phase transitions in combinatorial optimization problems, hence valuable in elucidating the origin of computational complexity.« less

Spatial Rule-Based Modeling: A Method and Its Application to the Human Mitotic Kinetochore

PubMed Central

Ibrahim, Bashar; Henze, Richard; Gruenert, Gerd; Egbert, Matthew; Huwald, Jan; Dittrich, Peter

2013-01-01

A common problem in the analysis of biological systems is the combinatorial explosion that emerges from the complexity of multi-protein assemblies. Conventional formalisms, like differential equations, Boolean networks and Bayesian networks, are unsuitable for dealing with the combinatorial explosion, because they are designed for a restricted state space with fixed dimensionality. To overcome this problem, the rule-based modeling language, BioNetGen, and the spatial extension, SRSim, have been developed. Here, we describe how to apply rule-based modeling to integrate experimental data from different sources into a single spatial simulation model and how to analyze the output of that model. The starting point for this approach can be a combination of molecular interaction data, reaction network data, proximities, binding and diffusion kinetics and molecular geometries at different levels of detail. We describe the technique and then use it to construct a model of the human mitotic inner and outer kinetochore, including the spindle assembly checkpoint signaling pathway. This allows us to demonstrate the utility of the procedure, show how a novel perspective for understanding such complex systems becomes accessible and elaborate on challenges that arise in the formulation, simulation and analysis of spatial rule-based models. PMID:24709796

Solving multi-objective optimization problems in conservation with the reference point method

PubMed Central

Dujardin, Yann; Chadès, Iadine

2018-01-01

Managing the biodiversity extinction crisis requires wise decision-making processes able to account for the limited resources available. In most decision problems in conservation biology, several conflicting objectives have to be taken into account. Most methods used in conservation either provide suboptimal solutions or use strong assumptions about the decision-maker’s preferences. Our paper reviews some of the existing approaches to solve multi-objective decision problems and presents new multi-objective linear programming formulations of two multi-objective optimization problems in conservation, allowing the use of a reference point approach. Reference point approaches solve multi-objective optimization problems by interactively representing the preferences of the decision-maker with a point in the criteria (objectives) space, called the reference point. We modelled and solved the following two problems in conservation: a dynamic multi-species management problem under uncertainty and a spatial allocation resource management problem. Results show that the reference point method outperforms classic methods while illustrating the use of an interactive methodology for solving combinatorial problems with multiple objectives. The method is general and can be adapted to a wide range of ecological combinatorial problems. PMID:29293650

A combinatorial approach to protein docking with flexible side chains.

PubMed

Althaus, Ernst; Kohlbacher, Oliver; Lenhof, Hans-Peter; Müller, Peter

2002-01-01

Rigid-body docking approaches are not sufficient to predict the structure of a protein complex from the unbound (native) structures of the two proteins. Accounting for side chain flexibility is an important step towards fully flexible protein docking. This work describes an approach that allows conformational flexibility for the side chains while keeping the protein backbone rigid. Starting from candidates created by a rigid-docking algorithm, we demangle the side chains of the docking site, thus creating reasonable approximations of the true complex structure. These structures are ranked with respect to the binding free energy. We present two new techniques for side chain demangling. Both approaches are based on a discrete representation of the side chain conformational space by the use of a rotamer library. This leads to a combinatorial optimization problem. For the solution of this problem, we propose a fast heuristic approach and an exact, albeit slower, method that uses branch-and-cut techniques. As a test set, we use the unbound structures of three proteases and the corresponding protein inhibitors. For each of the examples, the highest-ranking conformation produced was a good approximation of the true complex structure.

SCRaMbLE generates designed combinatorial stochastic diversity in synthetic chromosomes.

PubMed

Shen, Yue; Stracquadanio, Giovanni; Wang, Yun; Yang, Kun; Mitchell, Leslie A; Xue, Yaxin; Cai, Yizhi; Chen, Tai; Dymond, Jessica S; Kang, Kang; Gong, Jianhui; Zeng, Xiaofan; Zhang, Yongfen; Li, Yingrui; Feng, Qiang; Xu, Xun; Wang, Jun; Wang, Jian; Yang, Huanming; Boeke, Jef D; Bader, Joel S

2016-01-01

Synthetic chromosome rearrangement and modification by loxP-mediated evolution (SCRaMbLE) generates combinatorial genomic diversity through rearrangements at designed recombinase sites. We applied SCRaMbLE to yeast synthetic chromosome arm synIXR (43 recombinase sites) and then used a computational pipeline to infer or unscramble the sequence of recombinations that created the observed genomes. Deep sequencing of 64 synIXR SCRaMbLE strains revealed 156 deletions, 89 inversions, 94 duplications, and 55 additional complex rearrangements; several duplications are consistent with a double rolling circle mechanism. Every SCRaMbLE strain was unique, validating the capability of SCRaMbLE to explore a diverse space of genomes. Rearrangements occurred exclusively at designed loxPsym sites, with no significant evidence for ectopic rearrangements or mutations involving synthetic regions, the 99% nonsynthetic nuclear genome, or the mitochondrial genome. Deletion frequencies identified genes required for viability or fast growth. Replacement of 3' UTR by non-UTR sequence had surprisingly little effect on fitness. SCRaMbLE generates genome diversity in designated regions, reveals fitness constraints, and should scale to simultaneous evolution of multiple synthetic chromosomes. © 2016 Shen et al.; Published by Cold Spring Harbor Laboratory Press.

Asymmetry of Neuronal Combinatorial Codes Arises from Minimizing Synaptic Weight Change.

PubMed

Leibold, Christian; Monsalve-Mercado, Mauro M

2016-08-01

Synaptic change is a costly resource, particularly for brain structures that have a high demand of synaptic plasticity. For example, building memories of object positions requires efficient use of plasticity resources since objects can easily change their location in space and yet we can memorize object locations. But how should a neural circuit ideally be set up to integrate two input streams (object location and identity) in case the overall synaptic changes should be minimized during ongoing learning? This letter provides a theoretical framework on how the two input pathways should ideally be specified. Generally the model predicts that the information-rich pathway should be plastic and encoded sparsely, whereas the pathway conveying less information should be encoded densely and undergo learning only if a neuronal representation of a novel object has to be established. As an example, we consider hippocampal area CA1, which combines place and object information. The model thereby provides a normative account of hippocampal rate remapping, that is, modulations of place field activity by changes of local cues. It may as well be applicable to other brain areas (such as neocortical layer V) that learn combinatorial codes from multiple input streams.

Branch-pipe-routing approach for ships using improved genetic algorithm

NASA Astrophysics Data System (ADS)

Sui, Haiteng; Niu, Wentie

2016-09-01

Branch-pipe routing plays fundamental and critical roles in ship-pipe design. The branch-pipe-routing problem is a complex combinatorial optimization problem and is thus difficult to solve when depending only on human experts. A modified genetic-algorithm-based approach is proposed in this paper to solve this problem. The simplified layout space is first divided into threedimensional (3D) grids to build its mathematical model. Branch pipes in layout space are regarded as a combination of several two-point pipes, and the pipe route between two connection points is generated using an improved maze algorithm. The coding of branch pipes is then defined, and the genetic operators are devised, especially the complete crossover strategy that greatly accelerates the convergence speed. Finally, simulation tests demonstrate the performance of proposed method.

Estimation of the size of drug-like chemical space based on GDB-17 data.

PubMed

Polishchuk, P G; Madzhidov, T I; Varnek, A

2013-08-01

The goal of this paper is to estimate the number of realistic drug-like molecules which could ever be synthesized. Unlike previous studies based on exhaustive enumeration of molecular graphs or on combinatorial enumeration preselected fragments, we used results of constrained graphs enumeration by Reymond to establish a correlation between the number of generated structures (M) and the number of heavy atoms (N): logM = 0.584 × N × logN + 0.356. The number of atoms limiting drug-like chemical space of molecules which follow Lipinsky's rules (N = 36) has been obtained from the analysis of the PubChem database. This results in M ≈ 10³³ which is in between the numbers estimated by Ertl (10²³) and by Bohacek (10⁶⁰).

Design space pruning heuristics and global optimization method for conceptual design of low-thrust asteroid tour missions

NASA Astrophysics Data System (ADS)

Alemany, Kristina

Electric propulsion has recently become a viable technology for spacecraft, enabling shorter flight times, fewer required planetary gravity assists, larger payloads, and/or smaller launch vehicles. With the maturation of this technology, however, comes a new set of challenges in the area of trajectory design. Because low-thrust trajectory optimization has historically required long run-times and significant user-manipulation, mission design has relied on expert-based knowledge for selecting departure and arrival dates, times of flight, and/or target bodies and gravitational swing-bys. These choices are generally based on known configurations that have worked well in previous analyses or simply on trial and error. At the conceptual design level, however, the ability to explore the full extent of the design space is imperative to locating the best solutions in terms of mass and/or flight times. Beginning in 2005, the Global Trajectory Optimization Competition posed a series of difficult mission design problems, all requiring low-thrust propulsion and visiting one or more asteroids. These problems all had large ranges on the continuous variables---launch date, time of flight, and asteroid stay times (when applicable)---as well as being characterized by millions or even billions of possible asteroid sequences. Even with recent advances in low-thrust trajectory optimization, full enumeration of these problems was not possible within the stringent time limits of the competition. This investigation develops a systematic methodology for determining a broad suite of good solutions to the combinatorial, low-thrust, asteroid tour problem. The target application is for conceptual design, where broad exploration of the design space is critical, with the goal being to rapidly identify a reasonable number of promising solutions for future analysis. The proposed methodology has two steps. The first step applies a three-level heuristic sequence developed from the physics of the problem, which allows for efficient pruning of the design space. The second phase applies a global optimization scheme to locate a broad suite of good solutions to the reduced problem. The global optimization scheme developed combines a novel branch-and-bound algorithm with a genetic algorithm and an industry-standard low-thrust trajectory optimization program to solve for the following design variables: asteroid sequence, launch date, times of flight, and asteroid stay times. The methodology is developed based on a small sample problem, which is enumerated and solved so that all possible discretized solutions are known. The methodology is then validated by applying it to a larger intermediate sample problem, which also has a known solution. Next, the methodology is applied to several larger combinatorial asteroid rendezvous problems, using previously identified good solutions as validation benchmarks. These problems include the 2nd and 3rd Global Trajectory Optimization Competition problems. The methodology is shown to be capable of achieving a reduction in the number of asteroid sequences of 6-7 orders of magnitude, in terms of the number of sequences that require low-thrust optimization as compared to the number of sequences in the original problem. More than 70% of the previously known good solutions are identified, along with several new solutions that were not previously reported by any of the competitors. Overall, the methodology developed in this investigation provides an organized search technique for the low-thrust mission design of asteroid rendezvous problems.

Search space mapping: getting a picture of coherent laser control.

PubMed

Shane, Janelle C; Lozovoy, Vadim V; Dantus, Marcos

2006-10-12

Search space mapping is a method for quickly visualizing the experimental parameters that can affect the outcome of a coherent control experiment. We demonstrate experimental search space mapping for the selective fragmentation and ionization of para-nitrotoluene and show how this method allows us to gather information about the dominant trends behind our achieved control.

Galaxy Redshifts from Discrete Optimization of Correlation Functions

NASA Astrophysics Data System (ADS)

Lee, Benjamin C. G.; Budavári, Tamás; Basu, Amitabh; Rahman, Mubdi

2016-12-01

We propose a new method of constraining the redshifts of individual extragalactic sources based on celestial coordinates and their ensemble statistics. Techniques from integer linear programming (ILP) are utilized to optimize simultaneously for the angular two-point cross- and autocorrelation functions. Our novel formalism introduced here not only transforms the otherwise hopelessly expensive, brute-force combinatorial search into a linear system with integer constraints but also is readily implementable in off-the-shelf solvers. We adopt Gurobi, a commercial optimization solver, and use Python to build the cost function dynamically. The preliminary results on simulated data show potential for future applications to sky surveys by complementing and enhancing photometric redshift estimators. Our approach is the first application of ILP to astronomical analysis.

Temperature-programmed technique accompanied with high-throughput methodology for rapidly searching the optimal operating temperature of MOX gas sensors.

PubMed

Zhang, Guozhu; Xie, Changsheng; Zhang, Shunping; Zhao, Jianwei; Lei, Tao; Zeng, Dawen

2014-09-08

A combinatorial high-throughput temperature-programmed method to obtain the optimal operating temperature (OOT) of gas sensor materials is demonstrated here for the first time. A material library consisting of SnO2, ZnO, WO3, and In2O3 sensor films was fabricated by screen printing. Temperature-dependent conductivity curves were obtained by scanning this gas sensor library from 300 to 700 K in different atmospheres (dry air, formaldehyde, carbon monoxide, nitrogen dioxide, toluene and ammonia), giving the OOT of each sensor formulation as a function of the carrier and analyte gases. A comparative study of the temperature-programmed method and a conventional method showed good agreement in measured OOT.

Programmable synaptic devices for electronic neural nets

NASA Technical Reports Server (NTRS)

Moopenn, A.; Thakoor, A. P.

1990-01-01

The architecture, design, and operational characteristics of custom VLSI and thin film synaptic devices are described. The devices include CMOS-based synaptic chips containing 1024 reprogrammable synapses with a 6-bit dynamic range, and nonvolatile, write-once, binary synaptic arrays based on memory switching in hydrogenated amorphous silicon films. Their suitability for embodiment of fully parallel and analog neural hardware is discussed. Specifically, a neural network solution to an assignment problem of combinatorial global optimization, implemented in fully parallel hardware using the synaptic chips, is described. The network's ability to provide optimal and near optimal solutions over a time scale of few neuron time constants has been demonstrated and suggests a speedup improvement of several orders of magnitude over conventional search methods.

Evaluation of the Current Status of the Combinatorial Approach for the Study of Phase Diagrams

PubMed Central

Wong-Ng, W.

2012-01-01

This paper provides an evaluation of the effectiveness of using the high throughput combinatorial approach for preparing phase diagrams of thin film and bulk materials. Our evaluation is based primarily on examples of combinatorial phase diagrams that have been reported in the literature as well as based on our own laboratory experiments. Various factors that affect the construction of these phase diagrams are examined. Instrumentation and analytical approaches needed to improve data acquisition and data analysis are summarized. PMID:26900530

Research on thermal protection mechanism of forward-facing cavity and opposing jet combinatorial thermal protection system

NASA Astrophysics Data System (ADS)

Lu, Hai-Bo; Liu, Wei-Qiang

2014-04-01

Validated by the correlated experiments, a nose-tip with forward-facing cavity/opposing jet/the combinatorial configuration of forward-facing cavity and opposing jet thermal protection system (TPS) are investigated numerically. The physical mechanism of these TPS is discussed, and the cooling efficiency of them is compared. The combinatorial system is more suitable to be the TPS for the high speed vehicles which need fly under various flow conditions with long-range and long time.

Massively multiplex single-cell Hi-C

PubMed Central

Ramani, Vijay; Deng, Xinxian; Qiu, Ruolan; Gunderson, Kevin L; Steemers, Frank J; Disteche, Christine M; Noble, William S; Duan, Zhijun; Shendure, Jay

2016-01-01

We present single-cell combinatorial indexed Hi-C (sciHi-C), which applies the concept of combinatorial cellular indexing to chromosome conformation capture. In this proof-of-concept, we generate and sequence six sciHi-C libraries comprising a total of 10,696 single cells. We use sciHi-C data to separate cells by karytoypic and cell-cycle state differences and identify cell-to-cell heterogeneity in mammalian chromosomal conformation. Our results demonstrate that combinatorial indexing is a generalizable strategy for single-cell genomics. PMID:28135255

Combinatorial Interdependence in Lottery

ERIC Educational Resources Information Center

Helman, Danny

2005-01-01

This paper examines a real life question of gamble facing lottery players. Combinatorial dependence plays a central role in shaping the game probabilistic structure, but might not carry the merited weight in punters' considerations.

Joint search and sensor management for geosynchronous satellites

NASA Astrophysics Data System (ADS)

Zatezalo, A.; El-Fallah, A.; Mahler, R.; Mehra, R. K.; Pham, K.

2008-04-01

Joint search and sensor management for space situational awareness presents daunting scientific and practical challenges as it requires a simultaneous search for new, and the catalog update of the current space objects. We demonstrate a new approach to joint search and sensor management by utilizing the Posterior Expected Number of Targets (PENT) as the objective function, an observation model for a space-based EO/IR sensor, and a Probability Hypothesis Density Particle Filter (PHD-PF) tracker. Simulation and results using actual Geosynchronous Satellites are presented.

A depth-first search algorithm to compute elementary flux modes by linear programming.

PubMed

Quek, Lake-Ee; Nielsen, Lars K

2014-07-30

The decomposition of complex metabolic networks into elementary flux modes (EFMs) provides a useful framework for exploring reaction interactions systematically. Generating a complete set of EFMs for large-scale models, however, is near impossible. Even for moderately-sized models (<400 reactions), existing approaches based on the Double Description method must iterate through a large number of combinatorial candidates, thus imposing an immense processor and memory demand. Based on an alternative elementarity test, we developed a depth-first search algorithm using linear programming (LP) to enumerate EFMs in an exhaustive fashion. Constraints can be introduced to directly generate a subset of EFMs satisfying the set of constraints. The depth-first search algorithm has a constant memory overhead. Using flux constraints, a large LP problem can be massively divided and parallelized into independent sub-jobs for deployment into computing clusters. Since the sub-jobs do not overlap, the approach scales to utilize all available computing nodes with minimal coordination overhead or memory limitations. The speed of the algorithm was comparable to efmtool, a mainstream Double Description method, when enumerating all EFMs; the attrition power gained from performing flux feasibility tests offsets the increased computational demand of running an LP solver. Unlike the Double Description method, the algorithm enables accelerated enumeration of all EFMs satisfying a set of constraints.

VaProS: a database-integration approach for protein/genome information retrieval.

PubMed

Gojobori, Takashi; Ikeo, Kazuho; Katayama, Yukie; Kawabata, Takeshi; Kinjo, Akira R; Kinoshita, Kengo; Kwon, Yeondae; Migita, Ohsuke; Mizutani, Hisashi; Muraoka, Masafumi; Nagata, Koji; Omori, Satoshi; Sugawara, Hideaki; Yamada, Daichi; Yura, Kei

2016-12-01

Life science research now heavily relies on all sorts of databases for genome sequences, transcription, protein three-dimensional (3D) structures, protein-protein interactions, phenotypes and so forth. The knowledge accumulated by all the omics research is so vast that a computer-aided search of data is now a prerequisite for starting a new study. In addition, a combinatory search throughout these databases has a chance to extract new ideas and new hypotheses that can be examined by wet-lab experiments. By virtually integrating the related databases on the Internet, we have built a new web application that facilitates life science researchers for retrieving experts' knowledge stored in the databases and for building a new hypothesis of the research target. This web application, named VaProS, puts stress on the interconnection between the functional information of genome sequences and protein 3D structures, such as structural effect of the gene mutation. In this manuscript, we present the notion of VaProS, the databases and tools that can be accessed without any knowledge of database locations and data formats, and the power of search exemplified in quest of the molecular mechanisms of lysosomal storage disease. VaProS can be freely accessed at http://p4d-info.nig.ac.jp/vapros/ .

A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem.

PubMed

Jiang, Zi-Bin; Yang, Qiong

2016-01-01

The fruit fly optimization algorithm (FOA) is a newly developed bio-inspired algorithm. The continuous variant version of FOA has been proven to be a powerful evolutionary approach to determining the optima of a numerical function on a continuous definition domain. In this study, a discrete FOA (DFOA) is developed and applied to the traveling salesman problem (TSP), a common combinatorial problem. In the DFOA, the TSP tour is represented by an ordering of city indices, and the bio-inspired meta-heuristic search processes are executed with two elaborately designed main procedures: the smelling and tasting processes. In the smelling process, an effective crossover operator is used by the fruit fly group to search for the neighbors of the best-known swarm location. During the tasting process, an edge intersection elimination (EXE) operator is designed to improve the neighbors of the non-optimum food location in order to enhance the exploration performance of the DFOA. In addition, benchmark instances from the TSPLIB are classified in order to test the searching ability of the proposed algorithm. Furthermore, the effectiveness of the proposed DFOA is compared to that of other meta-heuristic algorithms. The results indicate that the proposed DFOA can be effectively used to solve TSPs, especially large-scale problems.

A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem

PubMed Central

Jiang, Zi-bin; Yang, Qiong

2016-01-01

The fruit fly optimization algorithm (FOA) is a newly developed bio-inspired algorithm. The continuous variant version of FOA has been proven to be a powerful evolutionary approach to determining the optima of a numerical function on a continuous definition domain. In this study, a discrete FOA (DFOA) is developed and applied to the traveling salesman problem (TSP), a common combinatorial problem. In the DFOA, the TSP tour is represented by an ordering of city indices, and the bio-inspired meta-heuristic search processes are executed with two elaborately designed main procedures: the smelling and tasting processes. In the smelling process, an effective crossover operator is used by the fruit fly group to search for the neighbors of the best-known swarm location. During the tasting process, an edge intersection elimination (EXE) operator is designed to improve the neighbors of the non-optimum food location in order to enhance the exploration performance of the DFOA. In addition, benchmark instances from the TSPLIB are classified in order to test the searching ability of the proposed algorithm. Furthermore, the effectiveness of the proposed DFOA is compared to that of other meta-heuristic algorithms. The results indicate that the proposed DFOA can be effectively used to solve TSPs, especially large-scale problems. PMID:27812175

Use of an informed search space maximizes confidence of site-specific assignment of glycoprotein glycosylation.

PubMed

Khatri, Kshitij; Klein, Joshua A; Zaia, Joseph

2017-01-01

In order to interpret glycopeptide tandem mass spectra, it is necessary to estimate the theoretical glycan compositions and peptide sequences, known as the search space. The simplest way to do this is to build a naïve search space from sets of glycan compositions from public databases and to assume that the target glycoprotein is pure. Often, however, purified glycoproteins contain co-purified glycoprotein contaminants that have the potential to confound assignment of tandem mass spectra based on naïve assumptions. In addition, there is increasing need to characterize glycopeptides from complex biological mixtures. Fortunately, liquid chromatography-mass spectrometry (LC-MS) methods for glycomics and proteomics are now mature and accessible. We demonstrate the value of using an informed search space built from measured glycomes and proteomes to define the search space for interpretation of glycoproteomics data. We show this using α-1-acid glycoprotein (AGP) mixed into a set of increasingly complex matrices. As the mixture complexity increases, the naïve search space balloons and the ability to assign glycopeptides with acceptable confidence diminishes. In addition, it is not possible to identify glycopeptides not foreseen as part of the naïve search space. A search space built from released glycan glycomics and proteomics data is smaller than its naïve counterpart while including the full range of proteins detected in the mixture. This maximizes the ability to assign glycopeptide tandem mass spectra with confidence. As the mixture complexity increases, the number of tandem mass spectra per glycopeptide precursor ion decreases, resulting in lower overall scores and reduced depth of coverage for the target glycoprotein. We suggest use of α-1-acid glycoprotein as a standard to gauge effectiveness of analytical methods and bioinformatics search parameters for glycoproteomics studies. Graphical Abstract Assignment of site specific glycosylation from LC-tandemMS data.

MGA trajectory planning with an ACO-inspired algorithm

NASA Astrophysics Data System (ADS)

Ceriotti, Matteo; Vasile, Massimiliano

2010-11-01

Given a set of celestial bodies, the problem of finding an optimal sequence of swing-bys, deep space manoeuvres (DSM) and transfer arcs connecting the elements of the set is combinatorial in nature. The number of possible paths grows exponentially with the number of celestial bodies. Therefore, the design of an optimal multiple gravity assist (MGA) trajectory is a NP-hard mixed combinatorial-continuous problem. Its automated solution would greatly improve the design of future space missions, allowing the assessment of a large number of alternative mission options in a short time. This work proposes to formulate the complete automated design of a multiple gravity assist trajectory as an autonomous planning and scheduling problem. The resulting scheduled plan will provide the optimal planetary sequence and a good estimation of the set of associated optimal trajectories. The trajectory model consists of a sequence of celestial bodies connected by two-dimensional transfer arcs containing one DSM. For each transfer arc, the position of the planet and the spacecraft, at the time of arrival, are matched by varying the pericentre of the preceding swing-by, or the magnitude of the launch excess velocity, for the first arc. For each departure date, this model generates a full tree of possible transfers from the departure to the destination planet. Each leaf of the tree represents a planetary encounter and a possible way to reach that planet. An algorithm inspired by ant colony optimization (ACO) is devised to explore the space of possible plans. The ants explore the tree from departure to destination adding one node at the time: every time an ant is at a node, a probability function is used to select a feasible direction. This approach to automatic trajectory planning is applied to the design of optimal transfers to Saturn and among the Galilean moons of Jupiter. Solutions are compared to those found through more traditional genetic-algorithm techniques.

A sub-space greedy search method for efficient Bayesian Network inference.

PubMed

Zhang, Qing; Cao, Yong; Li, Yong; Zhu, Yanming; Sun, Samuel S M; Guo, Dianjing

2011-09-01

Bayesian network (BN) has been successfully used to infer the regulatory relationships of genes from microarray dataset. However, one major limitation of BN approach is the computational cost because the calculation time grows more than exponentially with the dimension of the dataset. In this paper, we propose a sub-space greedy search method for efficient Bayesian Network inference. Particularly, this method limits the greedy search space by only selecting gene pairs with higher partial correlation coefficients. Using both synthetic and real data, we demonstrate that the proposed method achieved comparable results with standard greedy search method yet saved ∼50% of the computational time. We believe that sub-space search method can be widely used for efficient BN inference in systems biology. Copyright © 2011 Elsevier Ltd. All rights reserved.

A Systematic Study of Simple Combinatorial Configurations.

ERIC Educational Resources Information Center

Dubois, Jean-Guy

1984-01-01

A classification of the simple combinatorial configurations which correspond to various cases of distribution and ordering of objects into boxes is given (in French). Concrete descriptions, structured relations, translations, and formalizations are discussed. (MNS)

Combinatorial Mathematics: Research into Practice

ERIC Educational Resources Information Center

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 vector fields and the valley structure of fitness landscapes.

PubMed

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.

Measuring and Specifying Combinatorial Coverage of Test Input Configurations

PubMed Central

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

2015-01-01

A key issue in testing is how many tests are needed for a required level of coverage or fault detection. Estimates are often based on error rates in initial testing, or on code coverage. For example, tests may be run until a desired level of statement or branch coverage is achieved. Combinatorial methods present an opportunity for a different approach to estimating required test set size, using characteristics of the test set. This paper describes methods for estimating the coverage of, and ability to detect, t-way interaction faults of a test set based on a covering array. We also develop a connection between (static) combinatorial coverage and (dynamic) code coverage, such that if a specific condition is satisfied, 100% branch coverage is assured. Using these results, we propose practical recommendations for using combinatorial coverage in specifying test requirements. PMID:28133442

Combinatorial chemical bath deposition of CdS contacts for chalcogenide photovoltaics

DOE PAGES

Mokurala, Krishnaiah; Baranowski, Lauryn L.; de Souza Lucas, Francisco W.; ...

2016-08-01

Contact layers play an important role in thin film solar cells, but new material development and optimization of its thickness is usually a long and tedious process. A high-throughput experimental approach has been used to accelerate the rate of research in photovoltaic (PV) light absorbers and transparent conductive electrodes, however the combinatorial research on contact layers is less common. Here, we report on the chemical bath deposition (CBD) of CdS thin films by combinatorial dip coating technique and apply these contact layers to Cu(In,Ga)Se 2 (CIGSe) and Cu 2ZnSnSe 4 (CZTSe) light absorbers in PV devices. Combinatorial thickness steps ofmore » CdS thin films were achieved by removal of the substrate from the chemical bath, at regular intervals of time, and in equal distance increments. The trends in the photoconversion efficiency and in the spectral response of the PV devices as a function of thickness of CdS contacts were explained with the help of optical and morphological characterization of the CdS thin films. The maximum PV efficiency achieved for the combinatorial dip-coating CBD was similar to that for the PV devices processed using conventional CBD. Finally, the results of this study lead to the conclusion that combinatorial dip-coating can be used to accelerate the optimization of PV device performance of CdS and other candidate contact layers for a wide range of emerging absorbers.« less

Polynomial functors and combinatorial Dyson-Schwinger equations

NASA Astrophysics Data System (ADS)

Kock, Joachim

2017-04-01

We present a general abstract framework for combinatorial Dyson-Schwinger equations, in which combinatorial identities are lifted to explicit bijections of sets, and more generally equivalences of groupoids. Key features of combinatorial Dyson-Schwinger equations are revealed to follow from general categorical constructions and universal properties. Rather than beginning with an equation inside a given Hopf algebra and referring to given Hochschild 1-cocycles, our starting point is an abstract fixpoint equation in groupoids, shown canonically to generate all the algebraic structures. Precisely, for any finitary polynomial endofunctor P defined over groupoids, the system of combinatorial Dyson-Schwinger equations X = 1 + P(X) has a universal solution, namely the groupoid of P-trees. The isoclasses of P-trees generate naturally a Connes-Kreimer-like bialgebra, in which the abstract Dyson-Schwinger equation can be internalised in terms of canonical B+-operators. The solution to this equation is a series (the Green function), which always enjoys a Faà di Bruno formula, and hence generates a sub-bialgebra isomorphic to the Faà di Bruno bialgebra. Varying P yields different bialgebras, and cartesian natural transformations between various P yield bialgebra homomorphisms and sub-bialgebras, corresponding for example to truncation of Dyson-Schwinger equations. Finally, all constructions can be pushed inside the classical Connes-Kreimer Hopf algebra of trees by the operation of taking core of P-trees. A byproduct of the theory is an interpretation of combinatorial Green functions as inductive data types in the sense of Martin-Löf type theory (expounded elsewhere).

The search space of the rat during whisking behavior.

PubMed

Huet, Lucie A; Hartmann, Mitra J Z

2014-09-15

Rodents move their vibrissae rhythmically to tactually explore their surroundings. We used a three-dimensional model of the vibrissal array to quantify the rat's 'search space' during whisking. Search space was quantified either as the volume encompassed by the array or as the surface formed by the vibrissal tips. At rest, the average position of the vibrissal tips lies near the rat's mouth, and the tips are all approximately equidistant from the midpoint between the rat's eyes, suggesting spatial registration with the visual system. The intrinsic curvature of the vibrissae greatly increases the volume encompassed by the array, and during a protraction, roll and elevation changes have strong effects on the trajectories of the vibrissal tips. The size of the rat's search space--as measured either by the volume of the array or by the surface area formed by the vibrissal tips--was surprisingly unaffected by protraction angle. In contrast, search space was strongly correlated with the 'spread' of the array, defined as the angle between rostral and caudal-most whiskers. We draw two conclusions: first, that with some caveats, spread can be used as a proxy for changes in search space, and second, in order to change its sensing resolution, the rat must differentially control rostral and caudal vibrissae. Finally, we show that behavioral data can be incorporated into the three-dimensional model to visualize changes in vibrissal search space and sensing resolution during natural exploratory whisking. © 2014. Published by The Company of Biologists Ltd.

A Novel Method Using Abstract Convex Underestimation in Ab-Initio Protein Structure Prediction for Guiding Search in Conformational Feature Space.

PubMed

Hao, Xiao-Hu; Zhang, Gui-Jun; Zhou, Xiao-Gen; Yu, Xu-Feng

2016-01-01

To address the searching problem of protein conformational space in ab-initio protein structure prediction, a novel method using abstract convex underestimation (ACUE) based on the framework of evolutionary algorithm was proposed. Computing such conformations, essential to associate structural and functional information with gene sequences, is challenging due to the high-dimensionality and rugged energy surface of the protein conformational space. As a consequence, the dimension of protein conformational space should be reduced to a proper level. In this paper, the high-dimensionality original conformational space was converted into feature space whose dimension is considerably reduced by feature extraction technique. And, the underestimate space could be constructed according to abstract convex theory. Thus, the entropy effect caused by searching in the high-dimensionality conformational space could be avoided through such conversion. The tight lower bound estimate information was obtained to guide the searching direction, and the invalid searching area in which the global optimal solution is not located could be eliminated in advance. Moreover, instead of expensively calculating the energy of conformations in the original conformational space, the estimate value is employed to judge if the conformation is worth exploring to reduce the evaluation time, thereby making computational cost lower and the searching process more efficient. Additionally, fragment assembly and the Monte Carlo method are combined to generate a series of metastable conformations by sampling in the conformational space. The proposed method provides a novel technique to solve the searching problem of protein conformational space. Twenty small-to-medium structurally diverse proteins were tested, and the proposed ACUE method was compared with It Fix, HEA, Rosetta and the developed method LEDE without underestimate information. Test results show that the ACUE method can more rapidly and more efficiently obtain the near-native protein structure.

Molecular Library Synthesis Using Complex Substrates: Expanding the Framework of Triterpenoids

PubMed Central

Ignatenko, Vasily A.; Han, Yong; Tochtrop, Gregory P.

2013-01-01

The remodelling of a natural product core framework by means of diversity-oriented synthesis (DOS) is a valuable approach to access diverse/biologically relevant chemical space and to overcome the limitations of combinatorial-type compounds. Here we provide proof of principle and a thorough conformational analysis for a general strategy whereby the inherent complexity of a starting material is used to define the regio- and stereochemical outcomes of reactions in chemical library construction. This is in contrast to the traditional DOS logic employing reaction development and catalysis to drive library diversity PMID:23245400

Disease clusters, exact distributions of maxima, and P-values.

PubMed

Grimson, R C

1993-10-01

This paper presents combinatorial (exact) methods that are useful in the analysis of disease cluster data obtained from small environments, such as buildings and neighbourhoods. Maxwell-Boltzmann and Fermi-Dirac occupancy models are compared in terms of appropriateness of representation of disease incidence patterns (space and/or time) in these environments. The methods are illustrated by a statistical analysis of the incidence pattern of bone fractures in a setting wherein fracture clustering was alleged to be occurring. One of the methodological results derived in this paper is the exact distribution of the maximum cell frequency in occupancy models.

Higher Order Heavy Quark Corrections to Deep-Inelastic Scattering

NASA Astrophysics Data System (ADS)

Blümlein, Johannes; DeFreitas, Abilio; Schneider, Carsten

2015-04-01

The 3-loop heavy flavor corrections to deep-inelastic scattering are essential for consistent next-to-next-to-leading order QCD analyses. We report on the present status of the calculation of these corrections at large virtualities Q2. We also describe a series of mathematical, computer-algebraic and combinatorial methods and special function spaces, needed to perform these calculations. Finally, we briefly discuss the status of measuring αs (MZ), the charm quark mass mc, and the parton distribution functions at next-to-next-to-leading order from the world precision data on deep-inelastic scattering.

Optical solver of combinatorial problems: nanotechnological approach.

PubMed

Cohen, Eyal; Dolev, Shlomi; Frenkel, Sergey; Kryzhanovsky, Boris; Palagushkin, Alexandr; Rosenblit, Michael; Zakharov, Victor

2013-09-01

We present an optical computing system to solve NP-hard problems. As nano-optical computing is a promising venue for the next generation of computers performing parallel computations, we investigate the application of submicron, or even subwavelength, computing device designs. The system utilizes a setup of exponential sized masks with exponential space complexity produced in polynomial time preprocessing. The masks are later used to solve the problem in polynomial time. The size of the masks is reduced to nanoscaled density. Simulations were done to choose a proper design, and actual implementations show the feasibility of such a system.

GExplore: a web server for integrated queries of protein domains, gene expression and mutant phenotypes

PubMed Central

2009-01-01

Background The majority of the genes even in well-studied multi-cellular model organisms have not been functionally characterized yet. Mining the numerous genome wide data sets related to protein function to retrieve potential candidate genes for a particular biological process remains a challenge. Description GExplore has been developed to provide a user-friendly database interface for data mining at the gene expression/protein function level to help in hypothesis development and experiment design. It supports combinatorial searches for proteins with certain domains, tissue- or developmental stage-specific expression patterns, and mutant phenotypes. GExplore operates on a stand-alone database and has fast response times, which is essential for exploratory searches. The interface is not only user-friendly, but also modular so that it accommodates additional data sets in the future. Conclusion GExplore is an online database for quick mining of data related to gene and protein function, providing a multi-gene display of data sets related to the domain composition of proteins as well as expression and phenotype data. GExplore is publicly available at: http://genome.sfu.ca/gexplore/ PMID:19917126

Chance and necessity in biochemistry: implications for the search for extraterrestrial biomarkers in Earth-like environments.

PubMed

Davila, Alfonso F; McKay, Christopher P

2014-06-01

In this paper, we examine a restricted subset of the question of possible alien biochemistries. That is, we look into how different life might be if it emerged in environments similar to that required for life on Earth. We advocate a principle of chance and necessity in biochemistry. According to this principle, biochemistry is in some fundamental way the sum of two processes: there is an aspect of biochemistry that is an endowment from prebiotic processes, which represents the necessity, plus an aspect that is invented by the process of evolution, which represents the chance. As a result, we predict that life originating in extraterrestrial Earth-like environments will share biochemical motifs that can be traced back to the prebiotic world but will also have intrinsic biochemical traits that are unlikely to be duplicated elsewhere as they are combinatorially path-dependent. Effective and objective strategies to search for biomarkers, and evidence for a second genesis, on planets with Earth-like environments can be built based on this principle.

Ant system: optimization by a colony of cooperating agents.

PubMed

Dorigo, M; Maniezzo, V; Colorni, A

1996-01-01

An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call ant system (AS). We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation, and the use of a constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence, and the greedy heuristic helps find acceptable solutions in the early stages of the search process. We apply the proposed methodology to the classical traveling salesman problem (TSP), and report simulation results. We also discuss parameter selection and the early setups of the model, and compare it with tabu search and simulated annealing using TSP. To demonstrate the robustness of the approach, we show how the ant system (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadratic assignment and the job-shop scheduling. Finally we discuss the salient characteristics-global data structure revision, distributed communication and probabilistic transitions of the AS.

A multipopulation PSO based memetic algorithm for permutation flow shop scheduling.

PubMed

Liu, Ruochen; Ma, Chenlin; Ma, Wenping; Li, Yangyang

2013-01-01

The permutation flow shop scheduling problem (PFSSP) is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO) based memetic algorithm (MPSOMA) is proposed in this paper. In the proposed algorithm, the whole particle swarm population is divided into three subpopulations in which each particle evolves itself by the standard PSO and then updates each subpopulation by using different local search schemes such as variable neighborhood search (VNS) and individual improvement scheme (IIS). Then, the best particle of each subpopulation is selected to construct a probabilistic model by using estimation of distribution algorithm (EDA) and three particles are sampled from the probabilistic model to update the worst individual in each subpopulation. The best particle in the entire particle swarm is used to update the global optimal solution. The proposed MPSOMA is compared with two recently proposed algorithms, namely, PSO based memetic algorithm (PSOMA) and hybrid particle swarm optimization with estimation of distribution algorithm (PSOEDA), on 29 well-known PFFSPs taken from OR-library, and the experimental results show that it is an effective approach for the PFFSP.

Combinatorial Search for High-Activity Hydrogen Catalysts Based on Transition-Metal-Embedded Graphitic Carbons

DOE PAGES

Choi, Woon Ih; Wood, Brandon C.; Schwegler, Eric; ...

2015-09-22

Transition metal (TM) atoms in porphyrin–like complexes play important roles in many protein and enzymetic systems, where crystal–field effects are used to modify d–orbital levels. Inspired by the tunable electronic structure of these motifs, a high–throughput computational search for synthetic hydrogen catalysts is performed based on a similar motif of TM atoms embedded into the lattice of graphene. Based on an initial list of 300 possible embedding geometries, binders, and host atoms, descriptors for stability and catalytic activity are applied to extract ten promising candidates for hydrogen evolution, two of which are expected to exhibit high activity for hydrogen oxidation.more » In several instances, the active TM atoms are earth–abundant elements that show no activity in the bulk phase, highlighting the importance of the coordination environment in tuning the d–orbitals. In conclusion, it is found that the most active candidates involve a hitherto unreported surface reaction pathway that involves a Kubas–complex intermediate, which significantly lowers the kinetic barrier associated with hydrogen dissociation and association.« less

Properties of heuristic search strategies

NASA Technical Reports Server (NTRS)

Vanderbrug, G. J.

1973-01-01

A directed graph is used to model the search space of a state space representation with single input operators, an AND/OR is used for problem reduction representations, and a theorem proving graph is used for state space representations with multiple input operators. These three graph models and heuristic strategies for searching them are surveyed. The completeness, admissibility, and optimality properties of search strategies which use the evaluation function f = (1 - omega)g = omega(h) are presented and interpreted using a representation of the search process in the plane. The use of multiple output operators to imply dependent successors, and thus obtain a formalism which includes all three types of representations, is discussed.

Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces

NASA Astrophysics Data System (ADS)

Jin, Wenliang

2016-01-01

We discuss at length the dynamical behavior of Grover's search algorithm for which all the Walsh-Hadamard transformations contained in this algorithm are exposed to their respective random perturbations inducing the augmentation of the dimension of the search space. We give the concise and general mathematical formulations for approximately characterizing the maximum success probabilities of finding a unique desired state in a large unsorted database and their corresponding numbers of Grover iterations, which are applicable to the search spaces of arbitrary dimension and are used to answer a salient open problem posed by Grover (Phys Rev Lett 80:4329-4332, 1998).

On the suitability of different representations of solid catalysts for combinatorial library design by genetic algorithms.

PubMed

Gobin, Oliver C; Schüth, Ferdi

2008-01-01

Genetic algorithms are widely used to solve and optimize combinatorial problems and are more often applied for library design in combinatorial chemistry. Because of their flexibility, however, their implementation can be challenging. In this study, the influence of the representation of solid catalysts on the performance of genetic algorithms was systematically investigated on the basis of a new, constrained, multiobjective, combinatorial test problem with properties common to problems in combinatorial materials science. Constraints were satisfied by penalty functions, repair algorithms, or special representations. The tests were performed using three state-of-the-art evolutionary multiobjective algorithms by performing 100 optimization runs for each algorithm and test case. Experimental data obtained during the optimization of a noble metal-free solid catalyst system active in the selective catalytic reduction of nitric oxide with propene was used to build up a predictive model to validate the results of the theoretical test problem. A significant influence of the representation on the optimization performance was observed. Binary encodings were found to be the preferred encoding in most of the cases, and depending on the experimental test unit, repair algorithms or penalty functions performed best.

Direct Profiling the Post-Translational Modification Codes of a Single Protein Immobilized on a Surface Using Cu-free Click Chemistry.

PubMed

Kim, Kyung Lock; Park, Kyeng Min; Murray, James; Kim, Kimoon; Ryu, Sung Ho

2018-05-23

Combinatorial post-translational modifications (PTMs), which can serve as dynamic "molecular barcodes", have been proposed to regulate distinct protein functions. However, studies of combinatorial PTMs on single protein molecules have been hindered by a lack of suitable analytical methods. Here, we describe erasable single-molecule blotting (eSiMBlot) for combinatorial PTM profiling. This assay is performed in a highly multiplexed manner and leverages the benefits of covalent protein immobilization, cyclic probing with different antibodies, and single molecule fluorescence imaging. Especially, facile and efficient covalent immobilization on a surface using Cu-free click chemistry permits multiple rounds (>10) of antibody erasing/reprobing without loss of antigenicity. Moreover, cumulative detection of coregistered multiple data sets for immobilized single-epitope molecules, such as HA peptide, can be used to increase the antibody detection rate. Finally, eSiMBlot enables direct visualization and quantitative profiling of combinatorial PTM codes at the single-molecule level, as we demonstrate by revealing the novel phospho-codes of ligand-induced epidermal growth factor receptor. Thus, eSiMBlot provides an unprecedentedly simple, rapid, and versatile platform for analyzing the vast number of combinatorial PTMs in biological pathways.

Direct Profiling the Post-Translational Modification Codes of a Single Protein Immobilized on a Surface Using Cu-free Click Chemistry

PubMed Central

2018-01-01

Combinatorial post-translational modifications (PTMs), which can serve as dynamic “molecular barcodes”, have been proposed to regulate distinct protein functions. However, studies of combinatorial PTMs on single protein molecules have been hindered by a lack of suitable analytical methods. Here, we describe erasable single-molecule blotting (eSiMBlot) for combinatorial PTM profiling. This assay is performed in a highly multiplexed manner and leverages the benefits of covalent protein immobilization, cyclic probing with different antibodies, and single molecule fluorescence imaging. Especially, facile and efficient covalent immobilization on a surface using Cu-free click chemistry permits multiple rounds (>10) of antibody erasing/reprobing without loss of antigenicity. Moreover, cumulative detection of coregistered multiple data sets for immobilized single-epitope molecules, such as HA peptide, can be used to increase the antibody detection rate. Finally, eSiMBlot enables direct visualization and quantitative profiling of combinatorial PTM codes at the single-molecule level, as we demonstrate by revealing the novel phospho-codes of ligand-induced epidermal growth factor receptor. Thus, eSiMBlot provides an unprecedentedly simple, rapid, and versatile platform for analyzing the vast number of combinatorial PTMs in biological pathways.

Hiding and Searching Strategies of Adult Humans in a Virtual and a Real-Space Room

ERIC Educational Resources Information Center

Talbot, Katherine J.; Legge, Eric L. G.; Bulitko, Vadim; Spetch, Marcia L.

2009-01-01

Adults searched for or cached three objects in nine hiding locations in a virtual room or a real-space room. In both rooms, the locations selected by participants differed systematically between searching and hiding. Specifically, participants moved farther from origin and dispersed their choices more when hiding objects than when searching for…

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

DOT National Transportation Integrated Search

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...

"Anticlumping" and Other Combinatorial Effects on Clumped Isotopes: Implications for Tracing Biogeochemical Cycling

NASA Astrophysics Data System (ADS)

Yeung, L.

2015-12-01

I present a mode of isotopic ordering that has purely combinatorial origins. It can be important when identical rare isotopes are paired by coincidence (e.g., they are neighbors on the same molecule), or when extrinsic factors govern the isotopic composition of the two atoms that share a chemical bond. By itself, combinatorial isotope pairing yields products with isotopes either randomly distributed or with a deficit relative to a random distribution of isotopes. These systematics arise because of an unconventional coupling between the formation of singly- and multiply-substituted isotopic moieties. In a random distribution, rare isotopes are symmetrically distributed: Single isotopic substitutions (e.g., H‒D and D‒H in H2) occur with equal probability, and double isotopic substitutions (e.g., D2) occur according to random chance. The absence of symmetry in a bond-making complex can yield unequal numbers of singly-substituted molecules (e.g., more H‒D than D‒H in H2), which is recorded in the product molecule as a deficit in doubly-substituted moieties and an "anticlumped" isotope distribution (i.e., Δn < 0). Enzymatic isotope pairing reactions, which can have site-specific isotopic fractionation factors and atom reservoirs, should express this class of combinatorial isotope effect. Chemical-kinetic isotope effects, which are related to the bond-forming transition state, arise independently and express second-order combinatorial effects. In general, both combinatorial and chemical factors are important for calculating and interpreting clumped-isotope signatures of individual reactions. In many reactions relevant to geochemical oxygen, carbon, and nitrogen cycling, combinatorial isotope pairing likely plays a strong role in the clumped isotope distribution of the products. These isotopic signatures, manifest as either directly bound isotope clumps or as features of a molecule's isotopic anatomy, could be exploited as tracers of biogeochemistry that can relate molecular mechanisms to signals observable at environmentally relevant spatial scales.

Qubit and fermionic Fock spaces from type II superstring black holes

NASA Astrophysics Data System (ADS)

Belhaj, A.; Bensed, M.; Benslimane, Z.; Sedra, M. B.; Segui, A.

Using Hodge diagram combinatorial data, we study qubit and fermionic Fock spaces from the point of view of type II superstring black holes based on complex compactifications. Concretely, we establish a one-to-one correspondence between qubits, fermionic spaces and extremal black holes in maximally supersymmetric supergravity obtained from type II superstring on complex toroidal and Calabi-Yau compactifications. We interpret the differential forms of the n-dimensional complex toroidal compactification as states of n-qubits encoding information on extremal black hole charges. We show that there are 2n copies of n qubit systems which can be split as 2n = 2n-1 + 2n-1. More precisely, 2n-1 copies are associated with even D-brane charges in type IIA superstring and the other 2n-1 ones correspond to odd D-brane charges in IIB superstring. This correspondence is generalized to a class of Calabi-Yau manifolds. In connection with black hole charges in type IIA superstring, an n-qubit system has been obtained from a canonical line bundle of n factors of one-dimensional projective space ℂℙ1.

Unexpected series of regular frequency spacing of δ Scuti stars in the non-asymptotic regime - I. The methodology

DOE PAGES

Paparo, M.; Benko, J. M.; Hareter, M.; ...

2016-05-11

In this study, a sequence search method was developed to search the regular frequency spacing in δ Scuti stars through visual inspection and an algorithmic search. We searched for sequences of quasi-equally spaced frequencies, containing at least four members per sequence, in 90 δ Scuti stars observed by CoRoT. We found an unexpectedly large number of independent series of regular frequency spacing in 77 δ Scuti stars (from one to eight sequences) in the non-asymptotic regime. We introduce the sequence search method presenting the sequences and echelle diagram of CoRoT 102675756 and the structure of the algorithmic search. Four sequencesmore » (echelle ridges) were found in the 5–21 d –1 region where the pairs of the sequences are shifted (between 0.5 and 0.59 d –1) by twice the value of the estimated rotational splitting frequency (0.269 d –1). The general conclusions for the whole sample are also presented in this paper. The statistics of the spacings derived by the sequence search method, by FT (Fourier transform of the frequencies), and the statistics of the shifts are also compared. In many stars more than one almost equally valid spacing appeared. The model frequencies of FG Vir and their rotationally split components were used to formulate the possible explanation that one spacing is the large separation while the other is the sum of the large separation and the rotational frequency. In CoRoT 102675756, the two spacings (2.249 and 1.977 d –1) are in better agreement with the sum of a possible 1.710 d –1 large separation and two or one times, respectively, the value of the rotational frequency.« less

Unexpected series of regular frequency spacing of δ Scuti stars in the non-asymptotic regime - I. The methodology

DOE Office of Scientific and Technical Information (OSTI.GOV)

Paparo, M.; Benko, J. M.; Hareter, M.

In this study, a sequence search method was developed to search the regular frequency spacing in δ Scuti stars through visual inspection and an algorithmic search. We searched for sequences of quasi-equally spaced frequencies, containing at least four members per sequence, in 90 δ Scuti stars observed by CoRoT. We found an unexpectedly large number of independent series of regular frequency spacing in 77 δ Scuti stars (from one to eight sequences) in the non-asymptotic regime. We introduce the sequence search method presenting the sequences and echelle diagram of CoRoT 102675756 and the structure of the algorithmic search. Four sequencesmore » (echelle ridges) were found in the 5–21 d –1 region where the pairs of the sequences are shifted (between 0.5 and 0.59 d –1) by twice the value of the estimated rotational splitting frequency (0.269 d –1). The general conclusions for the whole sample are also presented in this paper. The statistics of the spacings derived by the sequence search method, by FT (Fourier transform of the frequencies), and the statistics of the shifts are also compared. In many stars more than one almost equally valid spacing appeared. The model frequencies of FG Vir and their rotationally split components were used to formulate the possible explanation that one spacing is the large separation while the other is the sum of the large separation and the rotational frequency. In CoRoT 102675756, the two spacings (2.249 and 1.977 d –1) are in better agreement with the sum of a possible 1.710 d –1 large separation and two or one times, respectively, the value of the rotational frequency.« less

Creative thought as blind-variation and selective-retention: Combinatorial models of exceptional creativity

NASA Astrophysics Data System (ADS)

Simonton, Dean Keith

2010-06-01

Campbell (1960) proposed that creative thought should be conceived as a blind-variation and selective-retention process (BVSR). This article reviews the developments that have taken place in the half century that has elapsed since his proposal, with special focus on the use of combinatorial models as formal representations of the general theory. After defining the key concepts of blind variants, creative thought, and disciplinary context, the combinatorial models are specified in terms of individual domain samples, variable field size, ideational combination, and disciplinary communication. Empirical implications are then derived with respect to individual, domain, and field systems. These abstract combinatorial models are next provided substantive reinforcement with respect to findings concerning the cognitive processes, personality traits, developmental factors, and social contexts that contribute to creativity. The review concludes with some suggestions regarding future efforts to explicate creativity according to BVSR theory.

Optimized Reaction Conditions for Amide Bond Formation in DNA-Encoded Combinatorial Libraries.

PubMed

Li, Yizhou; Gabriele, Elena; Samain, Florent; Favalli, Nicholas; Sladojevich, Filippo; Scheuermann, Jörg; Neri, Dario

2016-08-08

DNA-encoded combinatorial libraries are increasingly being used as tools for the discovery of small organic binding molecules to proteins of biological or pharmaceutical interest. In the majority of cases, synthetic procedures for the formation of DNA-encoded combinatorial libraries incorporate at least one step of amide bond formation between amino-modified DNA and a carboxylic acid. We investigated reaction conditions and established a methodology by using 1-ethyl-3-(3-(dimethylamino)propyl)carbodiimide, 1-hydroxy-7-azabenzotriazole and N,N'-diisopropylethylamine (EDC/HOAt/DIPEA) in combination, which provided conversions greater than 75% for 423/543 (78%) of the carboxylic acids tested. These reaction conditions were efficient with a variety of primary and secondary amines, as well as with various types of amino-modified oligonucleotides. The reaction conditions, which also worked efficiently over a broad range of DNA concentrations and reaction scales, should facilitate the synthesis of novel DNA-encoded combinatorial libraries.

Combinatorial games with a pass: a dynamical systems approach.

PubMed

Morrison, Rebecca E; Friedman, Eric J; Landsberg, Adam S

2011-12-01

By treating combinatorial games as dynamical systems, we are able to address a longstanding open question in combinatorial game theory, namely, how the introduction of a "pass" move into a game affects its behavior. We consider two well known combinatorial games, 3-pile Nim and 3-row Chomp. In the case of Nim, we observe that the introduction of the pass dramatically alters the game's underlying structure, rendering it considerably more complex, while for Chomp, the pass move is found to have relatively minimal impact. We show how these results can be understood by recasting these games as dynamical systems describable by dynamical recursion relations. From these recursion relations, we are able to identify underlying structural connections between these "games with passes" and a recently introduced class of "generic (perturbed) games." This connection, together with a (non-rigorous) numerical stability analysis, allows one to understand and predict the effect of a pass on a game.

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

PubMed

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.

Distance-Based Phylogenetic Methods Around a Polytomy.

PubMed

Davidson, Ruth; Sullivant, Seth

2014-01-01

Distance-based phylogenetic algorithms attempt to solve the NP-hard least-squares phylogeny problem by mapping an arbitrary dissimilarity map representing biological data to a tree metric. The set of all dissimilarity maps is a Euclidean space properly containing the space of all tree metrics as a polyhedral fan. Outputs of distance-based tree reconstruction algorithms such as UPGMA and neighbor-joining are points in the maximal cones in the fan. Tree metrics with polytomies lie at the intersections of maximal cones. A phylogenetic algorithm divides the space of all dissimilarity maps into regions based upon which combinatorial tree is reconstructed by the algorithm. Comparison of phylogenetic methods can be done by comparing the geometry of these regions. We use polyhedral geometry to compare the local nature of the subdivisions induced by least-squares phylogeny, UPGMA, and neighbor-joining when the true tree has a single polytomy with exactly four neighbors. Our results suggest that in some circumstances, UPGMA and neighbor-joining poorly match least-squares phylogeny.

Adaptation in protein fitness landscapes is facilitated by indirect paths

PubMed Central

Wu, Nicholas C; Dai, Lei; Olson, C Anders; Lloyd-Smith, James O; Sun, Ren

2016-01-01

The structure of fitness landscapes is critical for understanding adaptive protein evolution. Previous empirical studies on fitness landscapes were confined to either the neighborhood around the wild type sequence, involving mostly single and double mutants, or a combinatorially complete subgraph involving only two amino acids at each site. In reality, the dimensionality of protein sequence space is higher (20L) and there may be higher-order interactions among more than two sites. Here we experimentally characterized the fitness landscape of four sites in protein GB1, containing 204 = 160,000 variants. We found that while reciprocal sign epistasis blocked many direct paths of adaptation, such evolutionary traps could be circumvented by indirect paths through genotype space involving gain and subsequent loss of mutations. These indirect paths alleviate the constraint on adaptive protein evolution, suggesting that the heretofore neglected dimensions of sequence space may change our views on how proteins evolve. DOI: http://dx.doi.org/10.7554/eLife.16965.001 PMID:27391790

Kernel Method Based Human Model for Enhancing Interactive Evolutionary Optimization

PubMed Central

Zhao, Qiangfu; Liu, Yong

2015-01-01

A fitness landscape presents the relationship between individual and its reproductive success in evolutionary computation (EC). However, discrete and approximate landscape in an original search space may not support enough and accurate information for EC search, especially in interactive EC (IEC). The fitness landscape of human subjective evaluation in IEC is very difficult and impossible to model, even with a hypothesis of what its definition might be. In this paper, we propose a method to establish a human model in projected high dimensional search space by kernel classification for enhancing IEC search. Because bivalent logic is a simplest perceptual paradigm, the human model is established by considering this paradigm principle. In feature space, we design a linear classifier as a human model to obtain user preference knowledge, which cannot be supported linearly in original discrete search space. The human model is established by this method for predicting potential perceptual knowledge of human. With the human model, we design an evolution control method to enhance IEC search. From experimental evaluation results with a pseudo-IEC user, our proposed model and method can enhance IEC search significantly. PMID:25879050

Optimal Fungal Space Searching Algorithms.

PubMed

Asenova, Elitsa; Lin, Hsin-Yu; Fu, Eileen; Nicolau, Dan V; Nicolau, Dan V

2016-10-01

Previous experiments have shown that fungi use an efficient natural algorithm for searching the space available for their growth in micro-confined networks, e.g., mazes. This natural "master" algorithm, which comprises two "slave" sub-algorithms, i.e., collision-induced branching and directional memory, has been shown to be more efficient than alternatives, with one, or the other, or both sub-algorithms turned off. In contrast, the present contribution compares the performance of the fungal natural algorithm against several standard artificial homologues. It was found that the space-searching fungal algorithm consistently outperforms uninformed algorithms, such as Depth-First-Search (DFS). Furthermore, while the natural algorithm is inferior to informed ones, such as A*, this under-performance does not importantly increase with the increase of the size of the maze. These findings suggest that a systematic effort of harvesting the natural space searching algorithms used by microorganisms is warranted and possibly overdue. These natural algorithms, if efficient, can be reverse-engineered for graph and tree search strategies.

Combinatorial Effects of Aromatic 1,3-Disubstituted Ureas and Fluoride on In vitro Inhibition of Streptococcus mutans Biofilm Formation.

PubMed

Kaur, Gurmeet; Balamurugan, P; Uma Maheswari, C; Anitha, A; Princy, S Adline

2016-01-01

Dental caries occur as a result of disequilibrium between acid producing pathogenic bacteria and alkali generating commensal bacteria within a dental biofilm (dental plaque). Streptococcus mutans has been reported as a primary cariogenic pathogen associated with dental caries. Emergence of multidrug resistant as well as fluoride resistant strains of S. mutans due to over use of various antibiotics are a rising problem and prompted the researchers worldwide to search for alternative therapies. In this perspective, the present study was aimed to screen selective inhibitors against ComA, a bacteriocin associated ABC transporter, involved in the quorum sensing of S. mutans. In light of our present in silico findings, 1,3-disubstituted urea derivatives which had better affinity to ComA were chemically synthesized in the present study for in vitro evaluation of S. mutans biofilm inhibition. The results revealed that 1,3-disubstituted urea derivatives showed good biofilm inhibition. In addition, synthesized compounds exhibited potent synergy with a very low concentration of fluoride (31.25-62.5 ppm) in inhibiting the biofilm formation of S. mutans without affecting the bacterial growth. Further, the results were supported by confocal laser scanning microscopy. On the whole, from our experimental results we conclude that the combinatorial application of fluoride and disubstituted ureas has a potential synergistic effect which has a promising approach in combating multidrug resistant and fluoride resistant S. mutans in dental caries management.

PNA-COMBO-FISH: From combinatorial probe design in silico to vitality compatible, specific labelling of gene targets in cell nuclei

DOE Office of Scientific and Technical Information (OSTI.GOV)

Müller, Patrick; Rößler, Jens; Schwarz-Finsterle, Jutta

Recently, advantages concerning targeting specificity of PCR constructed oligonucleotide FISH probes in contrast to established FISH probes, e.g. BAC clones, have been demonstrated. These techniques, however, are still using labelling protocols with DNA denaturing steps applying harsh heat treatment with or without further denaturing chemical agents. COMBO-FISH (COMBinatorial Oligonucleotide FISH) allows the design of specific oligonucleotide probe combinations in silico. Thus, being independent from primer libraries or PCR laboratory conditions, the probe sequences extracted by computer sequence data base search can also be synthesized as single stranded PNA-probes (Peptide Nucleic Acid probes). Gene targets can be specifically labelled with atmore » least about 20 PNA-probes obtaining visibly background free specimens. By using appropriately designed triplex forming oligonucleotides, the denaturing procedures can completely be omitted. These results reveal a significant step towards oligonucleotide-FISH maintaining the 3D-nanostructure and even the viability of the cell target. The method is demonstrated with the detection of Her2/neu and GRB7 genes, which are indicators in breast cancer diagnosis and therapy. - Highlights: • Denaturation free protocols preserve 3D architecture of chromosomes and nuclei. • Labelling sets are determined in silico for duplex and triplex binding. • Probes are produced chemically with freely chosen backbones and base variants. • Peptide nucleic acid backbones reduce hindering charge interactions. • Intercalating side chains stabilize binding of short oligonucleotides.« less

Precursor-Directed Combinatorial Biosynthesis of Cinnamoyl, Dihydrocinnamoyl, and Benzoyl Anthranilates in Saccharomyces cerevisiae

DOE PAGES

Eudes, Aymerick; Teixeira Benites, Veronica; Wang, George; ...

2015-10-02

Biological synthesis of pharmaceuticals and biochemicals offers an environmentally friendly alternative to conventional chemical synthesis. These alternative methods require the design of metabolic pathways and the identification of enzymes exhibiting adequate activities. Cinnamoyl, dihydrocinnamoyl, and benzoyl anthranilates are natural metabolites which possess beneficial activities for human health, and the search is expanding for novel derivatives that might have enhanced biological activity. For example, biosynthesis in Dianthus caryophyllus is catalyzed by hydroxycinnamoyl/benzoyl-CoA:anthranilate N-hydroxycinnamoyl/ benzoyltransferase (HCBT), which couples hydroxycinnamoyl-CoAs and benzoyl-CoAs to anthranilate. We recently demonstrated the potential of using yeast (Saccharomyces cerevisiae) for the biological production of a few cinnamoyl anthranilatesmore » by heterologous co-expression of 4-coumaroyl:CoA ligase from Arabidopsis thaliana (4CL5) and HCBT. Here we report that, by exploiting the substrate flexibility of both 4CL5 and HCBT, we achieved rapid biosynthesis of more than 160 cinnamoyl, dihydrocinnamoyl, and benzoyl anthranilates in yeast upon feeding with both natural and non-natural cinnamates, dihydrocinnamates, benzoates, and anthranilates. Our results demonstrate the use of enzyme promiscuity in biological synthesis to achieve high chemical diversity within a defined class of molecules. Finally, this work also points to the potential for the combinatorial biosynthesis of diverse and valuable cinnamoylated, dihydrocinnamoylated, and benzoylated products by using the versatile biological enzyme 4CL5 along with characterized cinnamoyl-CoA- and benzoyl-CoA-utilizing transferases.« less

Microprocessor-based integration of microfluidic control for the implementation of automated sensor monitoring and multithreaded optimization algorithms.

PubMed

Ezra, Elishai; Maor, Idan; Bavli, Danny; Shalom, Itai; Levy, Gahl; Prill, Sebastian; Jaeger, Magnus S; Nahmias, Yaakov

2015-08-01

Microfluidic applications range from combinatorial synthesis to high throughput screening, with platforms integrating analog perfusion components, digitally controlled micro-valves and a range of sensors that demand a variety of communication protocols. Currently, discrete control units are used to regulate and monitor each component, resulting in scattered control interfaces that limit data integration and synchronization. Here, we present a microprocessor-based control unit, utilizing the MS Gadgeteer open framework that integrates all aspects of microfluidics through a high-current electronic circuit that supports and synchronizes digital and analog signals for perfusion components, pressure elements, and arbitrary sensor communication protocols using a plug-and-play interface. The control unit supports an integrated touch screen and TCP/IP interface that provides local and remote control of flow and data acquisition. To establish the ability of our control unit to integrate and synchronize complex microfluidic circuits we developed an equi-pressure combinatorial mixer. We demonstrate the generation of complex perfusion sequences, allowing the automated sampling, washing, and calibrating of an electrochemical lactate sensor continuously monitoring hepatocyte viability following exposure to the pesticide rotenone. Importantly, integration of an optical sensor allowed us to implement automated optimization protocols that require different computational challenges including: prioritized data structures in a genetic algorithm, distributed computational efforts in multiple-hill climbing searches and real-time realization of probabilistic models in simulated annealing. Our system offers a comprehensive solution for establishing optimization protocols and perfusion sequences in complex microfluidic circuits.

Transport of calcium ions through a bulk membrane by use of a dynamic combinatorial library.

PubMed

Saggiomo, Vittorio; Lüning, Ulrich

2009-07-07

In a bulk membrane transport experiment, a dynamic combinatorial library (DCL) has been used to transport calcium ions; the calcium ions amplify the formation of a macrocyclic carrier which results in transport.

Counting Pizza Pieces and Other Combinatorial Problems.

ERIC Educational Resources Information Center

Maier, Eugene

1988-01-01

The general combinatorial problem of counting the number of regions into which the interior of a circle is divided by a family of lines is considered. A general formula is developed and its use is illustrated in two situations. (PK)

On the existence of binary simplex codes. [using combinatorial construction

NASA Technical Reports Server (NTRS)

Taylor, H.

1977-01-01

Using a simple combinatorial construction, the existence of a binary simplex code with m codewords for all m is greater than or equal to 1 is proved. The problem of the shortest possible length is left open.

Application of combinatorial biocatalysis for a unique ring expansion of dihydroxymethylzearalenone

USDA-ARS?s Scientific Manuscript database

Combinatorial biocatalysis was applied to generate a diverse set of dihydroxymethylzearalenone derivatives with modified ring structure. In one chemoenzymatic reaction sequence, dihydroxymethylzearalenone was first subjected to a unique enzyme-catalyzed oxidative ring opening reaction that creates ...

Foraging in Semantic Fields: How We Search Through Memory.

PubMed

Hills, Thomas T; Todd, Peter M; Jones, Michael N

2015-07-01

When searching for concepts in memory--as in the verbal fluency task of naming all the animals one can think of--people appear to explore internal mental representations in much the same way that animals forage in physical space: searching locally within patches of information before transitioning globally between patches. However, the definition of the patches being searched in mental space is not well specified. Do we search by activating explicit predefined categories (e.g., pets) and recall items from within that category (categorical search), or do we activate and recall a connected sequence of individual items without using categorical information, with each item recalled leading to the retrieval of an associated item in a stream (associative search), or both? Using semantic representations in a search of associative memory framework and data from the animal fluency task, we tested competing hypotheses based on associative and categorical search models. Associative, but not categorical, patch transitions took longer to make than position-matched productions, suggesting that categorical transitions were not true transitions. There was also clear evidence of associative search even within categorical patch boundaries. Furthermore, most individuals' behavior was best explained by an associative search model without the addition of categorical information. Thus, our results support a search process that does not use categorical information, but for which patch boundaries shift with each recall and local search is well described by a random walk in semantic space, with switches to new regions of the semantic space when the current region is depleted. Copyright © 2015 Cognitive Science Society, Inc.

A diversity-oriented synthesis strategy enabling the combinatorial-type variation of macrocyclic peptidomimetic scaffolds† †Electronic supplementary information (ESI) available: Experimental procedures, characterization data and details of the computational analyses. See DOI: 10.1039/c5ob00371g Click here for additional data file.

PubMed Central

Isidro-Llobet, Albert; Hadje Georgiou, Kathy; Galloway, Warren R. J. D.; Giacomini, Elisa; Hansen, Mette R.; Méndez-Abt, Gabriela; Tan, Yaw Sing; Carro, Laura; Sore, Hannah F.

2015-01-01

Macrocyclic peptidomimetics are associated with a broad range of biological activities. However, despite such potentially valuable properties, the macrocyclic peptidomimetic structural class is generally considered as being poorly explored within drug discovery. This has been attributed to the lack of general methods for producing collections of macrocyclic peptidomimetics with high levels of structural, and thus shape, diversity. In particular, there is a lack of scaffold diversity in current macrocyclic peptidomimetic libraries; indeed, the efficient construction of diverse molecular scaffolds presents a formidable general challenge to the synthetic chemist. Herein we describe a new, advanced strategy for the diversity-oriented synthesis (DOS) of macrocyclic peptidomimetics that enables the combinatorial variation of molecular scaffolds (core macrocyclic ring architectures). The generality and robustness of this DOS strategy is demonstrated by the step-efficient synthesis of a structurally diverse library of over 200 macrocyclic peptidomimetic compounds, each based around a distinct molecular scaffold and isolated in milligram quantities, from readily available building-blocks. To the best of our knowledge this represents an unprecedented level of scaffold diversity in a synthetically derived library of macrocyclic peptidomimetics. Cheminformatic analysis indicated that the library compounds access regions of chemical space that are distinct from those addressed by top-selling brand-name drugs and macrocyclic natural products, illustrating the value of our DOS approach to sample regions of chemical space underexploited in current drug discovery efforts. An analysis of three-dimensional molecular shapes illustrated that the DOS library has a relatively high level of shape diversity. PMID:25778821

Combinatorial drug approaches to tackle Candida albicans biofilms.

PubMed

De Cremer, Kaat; Staes, Ines; Delattin, Nicolas; Cammue, Bruno P A; Thevissen, Karin; De Brucker, Katrijn

2015-08-01

The human fungal opportunistic pathogen Candida albicans resides in the human gut, genitourinary tract and on the skin. The majority of infections caused by C. albicans are biofilm-related. In the first part of this review, we discuss new insights into C. albicans biofilm characteristics, concentrating on the extracellular matrix, phenotypic switching, efflux pumps and persister cells. It is widely accepted that this multicellular lifestyle is more resistant to traditional antifungal treatment compared to free-living cells. Therefore, much effort is put in the search for combinations of drugs leading to synergistic interactions against microbial biofilms to achieve lower effective doses of the drugs. In the second part of this manuscript, we review all recently identified compounds that act synergistically with azoles, echinocandins and/or polyenes against C. albicans biofilms.

Searching for Majorana Neutrinos in the Like-Sign Dilepton Final State

NASA Astrophysics Data System (ADS)

Clarida, Warren

2010-02-01

The Standard Model can be extended to include massive neutrinos as observed in the recent oscillation experiments. Perhaps the most commonly studied model is the type-I seesaw mechanism. This model introduces a new neutrino with a Majorana nature with an unknown mass. In this study we present the potential for the discovery of a Majorana neutrino during the first year of data collection from the Large Hadron Collider. In the analysis we used muon triggers, muon isolation, jet energy corrections, b-tagging, and an examination of the combinatorial background. We conclude that the discovery potential can be reached in the first year of running at the LHC at 10 TeV startup collision energy with the CMS detector for the Majorana neutrino mass range near 100 GeV. )

A coherent Ising machine for 2000-node optimization problems

NASA Astrophysics Data System (ADS)

Inagaki, Takahiro; Haribara, Yoshitaka; Igarashi, Koji; Sonobe, Tomohiro; Tamate, Shuhei; Honjo, Toshimori; Marandi, Alireza; McMahon, Peter L.; Umeki, Takeshi; Enbutsu, Koji; Tadanaga, Osamu; Takenouchi, Hirokazu; Aihara, Kazuyuki; Kawarabayashi, Ken-ichi; Inoue, Kyo; Utsunomiya, Shoko; Takesue, Hiroki

2016-11-01

The analysis and optimization of complex systems can be reduced to mathematical problems collectively known as combinatorial optimization. Many such problems can be mapped onto ground-state search problems of the Ising model, and various artificial spin systems are now emerging as promising approaches. However, physical Ising machines have suffered from limited numbers of spin-spin couplings because of implementations based on localized spins, resulting in severe scalability problems. We report a 2000-spin network with all-to-all spin-spin couplings. Using a measurement and feedback scheme, we coupled time-multiplexed degenerate optical parametric oscillators to implement maximum cut problems on arbitrary graph topologies with up to 2000 nodes. Our coherent Ising machine outperformed simulated annealing in terms of accuracy and computation time for a 2000-node complete graph.

The active muon shield in the SHiP experiment

NASA Astrophysics Data System (ADS)

Akmete, A.; Alexandrov, A.; Anokhina, A.; Aoki, S.; Atkin, E.; Azorskiy, N.; Back, J. J.; Bagulya, A.; Baranov, A.; Barker, G. J.; Bay, A.; Bayliss, V.; Bencivenni, G.; Berdnikov, A. Y.; Berdnikov, Y. A.; Bertani, M.; Betancourt, C.; Bezshyiko, I.; Bezshyyko, O.; Bick, D.; Bieschke, S.; Blanco, A.; Boehm, J.; Bogomilov, M.; Bondarenko, K.; Bonivento, W. M.; Boyarsky, A.; Brenner, R.; Breton, D.; Brundler, R.; Bruschi, M.; Büscher, V.; Buonaura, A.; Buontempo, S.; Cadeddu, S.; Calcaterra, A.; Campanelli, M.; Chauveau, J.; Chepurnov, A.; Chernyavsky, M.; Choi, K.-Y.; Chumakov, A.; Ciambrone, P.; Dallavalle, G. M.; D'Ambrosio, N.; D'Appollonio, G.; De Lellis, G.; De Roeck, A.; De Serio, M.; Dedenko, L.; Di Crescenzo, A.; Di Marco, N.; Dib, C.; Dijkstra, H.; Dmitrenko, V.; Domenici, D.; Donskov, S.; Dubreuil, A.; Ebert, J.; Enik, T.; Etenko, A.; Fabbri, F.; Fabbri, L.; Fedin, O.; Fedorova, G.; Felici, G.; Ferro-Luzzi, M.; Fini, R. A.; Fonte, P.; Franco, C.; Fukuda, T.; Galati, G.; Gavrilov, G.; Gerlach, S.; Golinka-Bezshyyko, L.; Golubkov, D.; Golutvin, A.; Gorbunov, D.; Gorbunov, S.; Gorkavenko, V.; Gornushkin, Y.; Gorshenkov, M.; Grachev, V.; Graverini, E.; Grichine, V.; Guler, A. M.; Guz, Yu.; Hagner, C.; Hakobyan, H.; van Herwijnen, E.; Hollnagel, A.; Hosseini, B.; Hushchyn, M.; Iaselli, G.; Iuliano, A.; Jacobsson, R.; Jonker, M.; Kadenko, I.; Kamiscioglu, C.; Kamiscioglu, M.; Khabibullin, M.; Khaustov, G.; Khotyantsev, A.; Kim, S. H.; Kim, V.; Kim, Y. G.; Kitagawa, N.; Ko, J.-W.; Kodama, K.; Kolesnikov, A.; Kolev, D. I.; Kolosov, V.; Komatsu, M.; Konovalova, N.; Korkmaz, M. A.; Korol, I.; Korol'ko, I.; Korzenev, A.; Kovalenko, S.; Krasilnikova, I.; Krivova, K.; Kudenko, Y.; Kurochka, V.; Kuznetsova, E.; Lacker, H. M.; Lai, A.; Lanfranchi, G.; Lantwin, O.; Lauria, A.; Lebbolo, H.; Lee, K. Y.; Lévy, J.-M.; Lopes, L.; Lyubovitskij, V.; Maalmi, J.; Magnan, A.; Maleev, V.; Malinin, A.; Mefodev, A.; Mermod, P.; Mikado, S.; Mikhaylov, Yu.; Milstead, D. A.; Mineev, O.; Montanari, A.; Montesi, M. C.; Morishima, K.; Movchan, S.; Naganawa, N.; Nakamura, M.; Nakano, T.; Novikov, A.; Obinyakov, B.; Ogawa, S.; Okateva, N.; Owen, P. H.; Paoloni, A.; Park, B. D.; Paparella, L.; Pastore, A.; Patel, M.; Pereyma, D.; Petrenko, D.; Petridis, K.; Podgrudkov, D.; Poliakov, V.; Polukhina, N.; Prokudin, M.; Prota, A.; Rademakers, A.; Ratnikov, F.; Rawlings, T.; Razeti, M.; Redi, F.; Ricciardi, S.; Roganova, T.; Rogozhnikov, A.; Rokujo, H.; Rosa, G.; Rovelli, T.; Ruchayskiy, O.; Ruf, T.; Samoylenko, V.; Saputi, A.; Sato, O.; Savchenko, E. S.; Schmidt-Parzefall, W.; Serra, N.; Shakin, A.; Shaposhnikov, M.; Shatalov, P.; Shchedrina, T.; Shchutska, L.; Shevchenko, V.; Shibuya, H.; Shustov, A.; Silverstein, S. B.; Simone, S.; Skorokhvatov, M.; Smirnov, S.; Sohn, J. Y.; Sokolenko, A.; Starkov, N.; Storaci, B.; Strolin, P.; Takahashi, S.; Timiryasov, I.; Tioukov, V.; Tosi, N.; Treille, D.; Tsenov, R.; Ulin, S.; Ustyuzhanin, A.; Uteshev, Z.; Vankova-Kirilova, G.; Vannucci, F.; Venkova, P.; Vilchinski, S.; Villa, M.; Vlasik, K.; Volkov, A.; Voronkov, R.; Wanke, R.; Woo, J.-K.; Wurm, M.; Xella, S.; Yilmaz, D.; Yilmazer, A. U.; Yoon, C. S.; Zaytsev, Yu.

2017-05-01

The SHiP experiment is designed to search for very weakly interacting particles beyond the Standard Model which are produced in a 400 GeV/c proton beam dump at the CERN SPS. An essential task for the experiment is to keep the Standard Model background level to less than 0.1 event after 2× 1020 protons on target. In the beam dump, around 1011 muons will be produced per second. The muon rate in the spectrometer has to be reduced by at least four orders of magnitude to avoid muon-induced combinatorial background. A novel active muon shield is used to magnetically deflect the muons out of the acceptance of the spectrometer. This paper describes the basic principle of such a shield, its optimization and its performance.

Flight Test of ASAC Aircraft Interior Noise Control System

NASA Technical Reports Server (NTRS)

Palumbo, Dan; Cabell, Ran; Cline, John; Sullivan, Brenda

1999-01-01

A flight test is described in which an active structural/acoustic control system reduces turboprop induced interior noise on a Raytheon Aircraft Company 1900D airliner. Control inputs to 21 inertial force actuators were computed adaptively using a transform domain version of the multichannel filtered-X LMS algorithm to minimize the mean square response of 32 microphones. A combinatorial search algorithm was employed to optimize placement of the force actuators on the aircraft frame. Both single frequency and multi-frequency results are presented. Reductions of up to 15 dB were obtained at the blade passage frequency (BPF) during single frequency control tests. Simultaneous reductions of the BPF and next 2 harmonics of 10 dB, 2.5 dB and 3.0 dB, were obtained in a multi-frequency test.

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

PubMed

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.

Generalized Minimum-Time Follow-up Approaches Applied to Tasking Electro-Optical Sensor Tasking

NASA Astrophysics Data System (ADS)

Murphy, T. S.; Holzinger, M. J.

This work proposes a methodology for tasking of sensors to search an area of state space for a particular object, group of objects, or class of objects. This work creates a general unified mathematical framework for analyzing reacquisition, search, scheduling, and custody operations. In particular, this work looks at searching for unknown space object(s) with prior knowledge in the form of a set, which can be defined via an uncorrelated track, region of state space, or a variety of other methods. The follow-up tasking can occur from a variable location and time, which often requires searching a large region of the sky. This work analyzes the area of a search region over time to inform a time optimal search method. Simulation work looks at analyzing search regions relative to a particular sensor, and testing a tasking algorithm to search through the region. The tasking algorithm is also validated on a reacquisition problem with a telescope system at Georgia Tech.

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

PubMed

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.

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

NASA Astrophysics Data System (ADS)

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-01

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.

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

PubMed Central

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-01-01

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. PMID:27230692

Running Clubs--A Combinatorial Investigation.

ERIC Educational Resources Information Center

Nissen, Phillip; Taylor, John

1991-01-01

Presented is a combinatorial problem based on the Hash House Harriers rule which states that the route of the run should not have previously been traversed by the club. Discovered is how many weeks the club can meet before the rule has to be broken. (KR)

Quantum Resonance Approach to Combinatorial Optimization

NASA Technical Reports Server (NTRS)

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.

Antenna concepts for interstellar search systems

NASA Technical Reports Server (NTRS)

Basler, R. P.; Johnson, G. L.; Vondrak, R. R.

1977-01-01

An evaluation is made of microwave receiving systems designed to search for signals from extraterrestrial intelligence. Specific design concepts are analyzed parametrically to determine whether the optimum antenna system location is on earth, in space, or on the moon. Parameters considered include the hypothesized number of transmitting civilizations, the number of stars that must be searched to give any desired probability of receiving a signal, the antenna collecting area, the search time, the search range, and the cost. This analysis suggests that (1) search systems based on the moon are not cost-competitive, (2) if the search is extended only a few hundred light years from the earth, a Cyclops-type array on earth may be the most cost-effective system, (3) for a search extending to 500 light years or more, a substantial cost and search-time advantage can be achieved with a large spherical reflector in space with multiple feeds, (4) radio frequency interference shields can be provided for space systems, and (5) cost can range from a few hundred million to tens of billions of dollars, depending on the parameter values assumed.

Parameter-space metric of semicoherent searches for continuous gravitational waves

NASA Astrophysics Data System (ADS)

Pletsch, Holger J.

2010-08-01

Continuous gravitational-wave (CW) signals such as emitted by spinning neutron stars are an important target class for current detectors. However, the enormous computational demand prohibits fully coherent broadband all-sky searches for prior unknown CW sources over wide ranges of parameter space and for yearlong observation times. More efficient hierarchical “semicoherent” search strategies divide the data into segments much shorter than one year, which are analyzed coherently; then detection statistics from different segments are combined incoherently. To optimally perform the incoherent combination, understanding of the underlying parameter-space structure is requisite. This problem is addressed here by using new coordinates on the parameter space, which yield the first analytical parameter-space metric for the incoherent combination step. This semicoherent metric applies to broadband all-sky surveys (also embedding directed searches at fixed sky position) for isolated CW sources. Furthermore, the additional metric resolution attained through the combination of segments is studied. From the search parameters (sky position, frequency, and frequency derivatives), solely the metric resolution in the frequency derivatives is found to significantly increase with the number of segments.

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

PubMed

Müller-Molina, Arnoldo J; Schöler, Hans R; Araúzo-Bravo, Marcos J

2012-01-01

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.

Comprehensive Human Transcription Factor Binding Site Map for Combinatory Binding Motifs Discovery

PubMed Central

Müller-Molina, Arnoldo J.; Schöler, Hans R.; Araúzo-Bravo, Marcos J.

2012-01-01

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. PMID:23209563

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

NASA Technical Reports Server (NTRS)

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.

Combinatorial Pooling Enables Selective Sequencing of the Barley Gene Space

PubMed Central

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 pooling enables selective sequencing of the barley gene space.

PubMed

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.

Formal Operations and Ego Identity in Adolescence.

ERIC Educational Resources Information Center

Wagner, Janis A.

1987-01-01

Investigated the relationship between the development of formal operations and the formation of ego identity in adolescence. Obtained significant positive correlations between combinatorial ability and degree of identity, suggesting that high identity may facilitate the application of combinatorial operations. Found some gender differences in task…

Manipulating Combinatorial Structures.

ERIC Educational Resources Information Center

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…

Gian-Carlos Rota and Combinatorial Math.

ERIC Educational Resources Information Center

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

ERIC Educational Resources Information Center

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…

The LATL as locus of composition: MEG evidence from English and Arabic.

PubMed

Westerlund, Masha; Kastner, Itamar; Al Kaabi, Meera; Pylkkänen, Liina

2015-02-01

Neurolinguistic investigations into the processing of structured sentences as well as simple adjective-noun phrases point to the left anterior temporal lobe (LATL) as a leading candidate for basic linguistic composition. Here, we characterized the combinatory profile of the LATL over a variety of syntactic and semantic environments, and across two languages, English and Arabic. The contribution of the LATL was investigated across two types of composition: the optional modification of a predicate (modification) and the satisfaction of a predicate's argument position (argument saturation). Target words were presented during MEG recordings, either in combinatory contexts (e.g. "eats meat") or in non-combinatory contexts (preceded by an unpronounceable consonant string, e.g. "xqkr meat"). Across both languages, the LATL showed increased responses to words in combinatory contexts, an effect that was robust to composition type and word order. Together with related findings, these results solidify the role of the LATL in basic semantic composition. Copyright © 2014 Elsevier Inc. All rights reserved.

DNA Assembly Techniques for Next Generation Combinatorial Biosynthesis of Natural Products

PubMed Central

Cobb, Ryan E.; Ning, Jonathan C.; Zhao, Huimin

2013-01-01

Natural product scaffolds remain important leads for pharmaceutical development. However, transforming a natural product into a drug entity often requires derivatization to enhance the compound’s therapeutic properties. A powerful method by which to perform this derivatization is combinatorial biosynthesis, the manipulation of the genes in the corresponding pathway to divert synthesis towards novel derivatives. While these manipulations have traditionally been carried out via restriction digestion/ligation-based cloning, the shortcomings of such techniques limit their throughput and thus the scope of corresponding combinatorial biosynthesis experiments. In the burgeoning field of synthetic biology, the demand for facile DNA assembly techniques has promoted the development of a host of novel DNA assembly strategies. Here we describe the advantages of these recently-developed tools for rapid, efficient synthesis of large DNA constructs. We also discuss their potential to facilitate the simultaneous assembly of complete libraries of natural product biosynthetic pathways, ushering in the next generation of combinatorial biosynthesis. PMID:24127070

Novel Design Strategy for Checkpoint Kinase 2 Inhibitors Using Pharmacophore Modeling, Combinatorial Fusion, and Virtual Screening

PubMed Central

Wang, Yen-Ling

2014-01-01

Checkpoint kinase 2 (Chk2) has a great effect on DNA-damage and plays an important role in response to DNA double-strand breaks and related lesions. In this study, we will concentrate on Chk2 and the purpose is to find the potential inhibitors by the pharmacophore hypotheses (PhModels), combinatorial fusion, and virtual screening techniques. Applying combinatorial fusion into PhModels and virtual screening techniques is a novel design strategy for drug design. We used combinatorial fusion to analyze the prediction results and then obtained the best correlation coefficient of the testing set (r test) with the value 0.816 by combining the BesttrainBesttest and FasttrainFasttest prediction results. The potential inhibitors were selected from NCI database by screening according to BesttrainBesttest + FasttrainFasttest prediction results and molecular docking with CDOCKER docking program. Finally, the selected compounds have high interaction energy between a ligand and a receptor. Through these approaches, 23 potential inhibitors for Chk2 are retrieved for further study. PMID:24864236

Amoeba-Inspired Heuristic Search Dynamics for Exploring Chemical Reaction Paths.

PubMed

Aono, Masashi; Wakabayashi, Masamitsu

2015-09-01

We propose a nature-inspired model for simulating chemical reactions in a computationally resource-saving manner. The model was developed by extending our previously proposed heuristic search algorithm, called "AmoebaSAT [Aono et al. 2013]," which was inspired by the spatiotemporal dynamics of a single-celled amoeboid organism that exhibits sophisticated computing capabilities in adapting to its environment efficiently [Zhu et al. 2013]. AmoebaSAT is used for solving an NP-complete combinatorial optimization problem [Garey and Johnson 1979], "the satisfiability problem," and finds a constraint-satisfying solution at a speed that is dramatically faster than one of the conventionally known fastest stochastic local search methods [Iwama and Tamaki 2004] for a class of randomly generated problem instances [ http://www.cs.ubc.ca/~hoos/5/benchm.html ]. In cases where the problem has more than one solution, AmoebaSAT exhibits dynamic transition behavior among a variety of the solutions. Inheriting these features of AmoebaSAT, we formulate "AmoebaChem," which explores a variety of metastable molecules in which several constraints determined by input atoms are satisfied and generates dynamic transition processes among the metastable molecules. AmoebaChem and its developed forms will be applied to the study of the origins of life, to discover reaction paths for which expected or unexpected organic compounds may be formed via unknown unstable intermediates and to estimate the likelihood of each of the discovered paths.

Amoeba-inspired nanoarchitectonic computing: solving intractable computational problems using nanoscale photoexcitation transfer dynamics.

PubMed

Aono, Masashi; Naruse, Makoto; Kim, Song-Ju; Wakabayashi, Masamitsu; Hori, Hirokazu; Ohtsu, Motoichi; Hara, Masahiko

2013-06-18

Biologically inspired computing devices and architectures are expected to overcome the limitations of conventional technologies in terms of solving computationally demanding problems, adapting to complex environments, reducing energy consumption, and so on. We previously demonstrated that a primitive single-celled amoeba (a plasmodial slime mold), which exhibits complex spatiotemporal oscillatory dynamics and sophisticated computing capabilities, can be used to search for a solution to a very hard combinatorial optimization problem. We successfully extracted the essential spatiotemporal dynamics by which the amoeba solves the problem. This amoeba-inspired computing paradigm can be implemented by various physical systems that exhibit suitable spatiotemporal dynamics resembling the amoeba's problem-solving process. In this Article, we demonstrate that photoexcitation transfer phenomena in certain quantum nanostructures mediated by optical near-field interactions generate the amoebalike spatiotemporal dynamics and can be used to solve the satisfiability problem (SAT), which is the problem of judging whether a given logical proposition (a Boolean formula) is self-consistent. SAT is related to diverse application problems in artificial intelligence, information security, and bioinformatics and is a crucially important nondeterministic polynomial time (NP)-complete problem, which is believed to become intractable for conventional digital computers when the problem size increases. We show that our amoeba-inspired computing paradigm dramatically outperforms a conventional stochastic search method. These results indicate the potential for developing highly versatile nanoarchitectonic computers that realize powerful solution searching with low energy consumption.

A depth-first search algorithm to compute elementary flux modes by linear programming

PubMed Central

2014-01-01

Background The decomposition of complex metabolic networks into elementary flux modes (EFMs) provides a useful framework for exploring reaction interactions systematically. Generating a complete set of EFMs for large-scale models, however, is near impossible. Even for moderately-sized models (<400 reactions), existing approaches based on the Double Description method must iterate through a large number of combinatorial candidates, thus imposing an immense processor and memory demand. Results Based on an alternative elementarity test, we developed a depth-first search algorithm using linear programming (LP) to enumerate EFMs in an exhaustive fashion. Constraints can be introduced to directly generate a subset of EFMs satisfying the set of constraints. The depth-first search algorithm has a constant memory overhead. Using flux constraints, a large LP problem can be massively divided and parallelized into independent sub-jobs for deployment into computing clusters. Since the sub-jobs do not overlap, the approach scales to utilize all available computing nodes with minimal coordination overhead or memory limitations. Conclusions The speed of the algorithm was comparable to efmtool, a mainstream Double Description method, when enumerating all EFMs; the attrition power gained from performing flux feasibility tests offsets the increased computational demand of running an LP solver. Unlike the Double Description method, the algorithm enables accelerated enumeration of all EFMs satisfying a set of constraints. PMID:25074068

Functional equations for orbifold wreath products

NASA Astrophysics Data System (ADS)

Farsi, Carla; Seaton, Christopher

2017-10-01

We present generating functions for extensions of multiplicative invariants of wreath symmetric products of orbifolds presented as the quotient by the locally free action of a compact, connected Lie group in terms of orbifold sector decompositions. Particularly interesting instances of these product formulas occur for the Euler and Euler-Satake characteristics, which we compute for a class of weighted projective spaces. This generalizes results known for global quotients by finite groups to all closed, effective orbifolds. We also describe a combinatorial approach to extensions of multiplicative invariants using decomposable functors that recovers the formula for the Euler-Satake characteristic of a wreath product of a global quotient orbifold.

Stochastic methods for analysis of power flow in electric networks

NASA Astrophysics Data System (ADS)

1982-09-01

The modeling and effects of probabilistic behavior on steady state power system operation were analyzed. A solution to the steady state network flow equations which adhere both to Kirchoff's Laws and probabilistic laws, using either combinatorial or functional approximation techniques was obtained. The development of sound techniques for producing meaningful data to serve as input is examined. Electric demand modeling, equipment failure analysis, and algorithm development are investigated. Two major development areas are described: a decomposition of stochastic processes which gives stationarity, ergodicity, and even normality; and a powerful surrogate probability approach using proportions of time which allows the calculation of joint events from one dimensional probability spaces.

Combinatorial refinement of thin-film microstructure, properties and process conditions: iterative nanoscale search for self-assembled TiAlN nanolamellae.

PubMed

Zalesak, J; Todt, J; Pitonak, R; Köpf, A; Weißenbacher, R; Sartory, B; Burghammer, M; Daniel, R; Keckes, J

2016-12-01

Because of the tremendous variability of crystallite sizes and shapes in nano-materials, it is challenging to assess the corresponding size-property relationships and to identify microstructures with particular physical properties or even optimized functions. This task is especially difficult for nanomaterials formed by self-organization, where the spontaneous evolution of microstructure and properties is coupled. In this work, two compositionally graded TiAlN films were (i) grown using chemical vapour deposition by applying a varying ratio of reacting gases and (ii) subsequently analysed using cross-sectional synchrotron X-ray nanodiffraction, electron microscopy and nanoindentation in order to evaluate the microstructure and hardness depth gradients. The results indicate the formation of self-organized hexagonal-cubic and cubic-cubic nanolamellae with varying compositions and thicknesses in the range of ∼3-15 nm across the film thicknesses, depending on the actual composition of the reactive gas mixtures. On the basis of the occurrence of the nanolamellae and their correlation with the local film hardness, progressively narrower ranges of the composition and hardness were refined in three steps. The third film was produced using an AlCl 3 /TiCl 4 precursor ratio of ∼1.9, resulting in the formation of an optimized lamellar microstructure with ∼1.3 nm thick cubic Ti(Al)N and ∼12 nm thick cubic Al(Ti)N nanolamellae which exhibits a maximal hardness of ∼36 GPa and an indentation modulus of ∼522 GPa. The presented approach of an iterative nanoscale search based on the application of cross-sectional synchrotron X-ray nanodiffraction and cross-sectional nanoindentation allows one to refine the relationship between (i) varying deposition conditions, (ii) gradients of microstructure and (iii) gradients of mechanical properties in nanostructured materials prepared as thin films. This is done in a combinatorial way in order to screen a wide range of deposition conditions, while identifying those that result in the formation of a particular microstructure with optimized functional attributes.

A search for experiments to exploit the space shuttle environment, volume 2

NASA Technical Reports Server (NTRS)

Fenn, J. B.

1979-01-01

Institutions and laboratories in India, Japan, and Western Europe which were visited during a search for experiments to exploit the space shuttle environment are described. The facilities and current research interests of the various centers are discussed with particular emphasis given to the Indian Space Research Organization.

UNEXPECTED SERIES OF REGULAR FREQUENCY SPACING OF δ SCUTI STARS IN THE NON-ASYMPTOTIC REGIME. I. THE METHODOLOGY

DOE Office of Scientific and Technical Information (OSTI.GOV)

Paparó, M.; Benkő, J. M.; Hareter, M.

A sequence search method was developed to search the regular frequency spacing in δ Scuti stars through visual inspection and an algorithmic search. We searched for sequences of quasi-equally spaced frequencies, containing at least four members per sequence, in 90 δ Scuti stars observed by CoRoT . We found an unexpectedly large number of independent series of regular frequency spacing in 77 δ Scuti stars (from one to eight sequences) in the non-asymptotic regime. We introduce the sequence search method presenting the sequences and echelle diagram of CoRoT 102675756 and the structure of the algorithmic search. Four sequences (echelle ridges)more » were found in the 5–21 d{sup −1} region where the pairs of the sequences are shifted (between 0.5 and 0.59 d{sup −1}) by twice the value of the estimated rotational splitting frequency (0.269 d{sup −1}). The general conclusions for the whole sample are also presented in this paper. The statistics of the spacings derived by the sequence search method, by FT (Fourier transform of the frequencies), and the statistics of the shifts are also compared. In many stars more than one almost equally valid spacing appeared. The model frequencies of FG Vir and their rotationally split components were used to formulate the possible explanation that one spacing is the large separation while the other is the sum of the large separation and the rotational frequency. In CoRoT 102675756, the two spacings (2.249 and 1.977 d{sup −1}) are in better agreement with the sum of a possible 1.710 d{sup −1} large separation and two or one times, respectively, the value of the rotational frequency.« less

Autonomous Data Collection Using a Self-Organizing Map.

PubMed

Faigl, Jan; Hollinger, Geoffrey A

2018-05-01

The self-organizing map (SOM) is an unsupervised learning technique providing a transformation of a high-dimensional input space into a lower dimensional output space. In this paper, we utilize the SOM for the traveling salesman problem (TSP) to develop a solution to autonomous data collection. Autonomous data collection requires gathering data from predeployed sensors by moving within a limited communication radius. We propose a new growing SOM that adapts the number of neurons during learning, which also allows our approach to apply in cases where some sensors can be ignored due to a lower priority. Based on a comparison with available combinatorial heuristic algorithms for relevant variants of the TSP, the proposed approach demonstrates improved results, while also being less computationally demanding. Moreover, the proposed learning procedure can be extended to cases where particular sensors have varying communication radii, and it can also be extended to multivehicle planning.

Generic strategies for chemical space exploration.

PubMed

Andersen, Jakob L; Flamm, Christoph; Merkle, Daniel; Stadler, Peter F

2014-01-01

The chemical universe of molecules reachable from a set of start compounds by iterative application of a finite number of reactions is usually so vast, that sophisticated and efficient exploration strategies are required to cope with the combinatorial complexity. A stringent analysis of (bio)chemical reaction networks, as approximations of these complex chemical spaces, forms the foundation for the understanding of functional relations in Chemistry and Biology. Graphs and graph rewriting are natural models for molecules and reactions. Borrowing the idea of partial evaluation from functional programming, we introduce partial applications of rewrite rules. A framework for the specification of exploration strategies in graph-rewriting systems is presented. Using key examples of complex reaction networks from carbohydrate chemistry we demonstrate the feasibility of this high-level strategy framework. While being designed for chemical applications, the framework can also be used to emulate higher-level transformation models such as illustrated in a small puzzle game.

Application of Multi-Hypothesis Sequential Monte Carlo for Breakup Analysis

NASA Astrophysics Data System (ADS)

Faber, W. R.; Zaidi, W.; Hussein, I. I.; Roscoe, C. W. T.; Wilkins, M. P.; Schumacher, P. W., Jr.

As more objects are launched into space, the potential for breakup events and space object collisions is ever increasing. These events create large clouds of debris that are extremely hazardous to space operations. Providing timely, accurate, and statistically meaningful Space Situational Awareness (SSA) data is crucial in order to protect assets and operations in space. The space object tracking problem, in general, is nonlinear in both state dynamics and observations, making it ill-suited to linear filtering techniques such as the Kalman filter. Additionally, given the multi-object, multi-scenario nature of the problem, space situational awareness requires multi-hypothesis tracking and management that is combinatorially challenging in nature. In practice, it is often seen that assumptions of underlying linearity and/or Gaussianity are used to provide tractable solutions to the multiple space object tracking problem. However, these assumptions are, at times, detrimental to tracking data and provide statistically inconsistent solutions. This paper details a tractable solution to the multiple space object tracking problem applicable to space object breakup events. Within this solution, simplifying assumptions of the underlying probability density function are relaxed and heuristic methods for hypothesis management are avoided. This is done by implementing Sequential Monte Carlo (SMC) methods for both nonlinear filtering as well as hypothesis management. This goal of this paper is to detail the solution and use it as a platform to discuss computational limitations that hinder proper analysis of large breakup events.

In vitro and direct in vivo testing of mixture-based combinatorial libraries for the identification of highly active and specific opiate ligands.

PubMed

Houghten, Richard A; Dooley, Colette T; Appel, Jon R

2006-05-26

The use of combinatorial libraries for the identification of novel opiate and related ligands in opioid receptor assays is reviewed. Case studies involving opioid assays used to demonstrate the viability of combinatorial libraries are described. The identification of new opioid peptides composed of L-amino acids, D-amino acids, or L-, D-, and unnatural amino acids is reviewed. New opioid compounds have also been identified from peptidomimetic libraries, such as peptoids and alkylated dipeptides, and those identified from acyclic (eg, polyamine, urea) and heterocyclic (eg, bicyclic guanidine) libraries are reviewed.

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

ERIC Educational Resources Information Center

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'…

A comparative study of the A* heuristic search algorithm used to solve efficiently a puzzle game

NASA Astrophysics Data System (ADS)

Iordan, A. E.

2018-01-01

The puzzle game presented in this paper consists in polyhedra (prisms, pyramids or pyramidal frustums) which can be moved using the free available spaces. The problem requires to be found the minimum number of movements in order the game reaches to a goal configuration starting from an initial configuration. Because the problem is enough complex, the principal difficulty in solving it is given by dimension of search space, that leads to necessity of a heuristic search. The improving of the search method consists into determination of a strong estimation by the heuristic function which will guide the search process to the most promising side of the search tree. The comparative study is realized among Manhattan heuristic and the Hamming heuristic using A* search algorithm implemented in Java. This paper also presents the necessary stages in object oriented development of a software used to solve efficiently this puzzle game. The modelling of the software is achieved through specific UML diagrams representing the phases of analysis, design and implementation, the system thus being described in a clear and practical manner. With the purpose to confirm the theoretical results which demonstrates that Manhattan heuristic is more efficient was used space complexity criterion. The space complexity was measured by the number of generated nodes from the search tree, by the number of the expanded nodes and by the effective branching factor. From the experimental results obtained by using the Manhattan heuristic, improvements were observed regarding space complexity of A* algorithm versus Hamming heuristic.

Quantum Efficiency and Bandgap Analysis for Combinatorial Photovoltaics: Sorting Activity of Cu–O Compounds in All-Oxide Device Libraries

PubMed Central

2014-01-01

All-oxide-based photovoltaics (PVs) encompass the potential for extremely low cost solar cells, provided they can obtain an order of magnitude improvement in their power conversion efficiencies. To achieve this goal, we perform a combinatorial materials study of metal oxide based light absorbers, charge transporters, junctions between them, and PV devices. Here we report the development of a combinatorial internal quantum efficiency (IQE) method. IQE measures the efficiency associated with the charge separation and collection processes, and thus is a proxy for PV activity of materials once placed into devices, discarding optical properties that cause uncontrolled light harvesting. The IQE is supported by high-throughput techniques for bandgap fitting, composition analysis, and thickness mapping, which are also crucial parameters for the combinatorial investigation cycle of photovoltaics. As a model system we use a library of 169 solar cells with a varying thickness of sprayed titanium dioxide (TiO2) as the window layer, and covarying thickness and composition of binary compounds of copper oxides (Cu–O) as the light absorber, fabricated by Pulsed Laser Deposition (PLD). The analysis on the combinatorial devices shows the correlation between compositions and bandgap, and their effect on PV activity within several device configurations. The analysis suggests that the presence of Cu4O3 plays a significant role in the PV activity of binary Cu–O compounds. PMID:24410367

Learning Problem-Solving Rules as Search through a Hypothesis Space

ERIC Educational Resources Information Center

Lee, Hee Seung; Betts, Shawn; Anderson, John R.

2016-01-01

Learning to solve a class of problems can be characterized as a search through a space of hypotheses about the rules for solving these problems. A series of four experiments studied how different learning conditions affected the search among hypotheses about the solution rule for a simple computational problem. Experiment 1 showed that a problem…

Active Solution Space and Search on Job-shop Scheduling Problem

NASA Astrophysics Data System (ADS)

Watanabe, Masato; Ida, Kenichi; Gen, Mitsuo

In this paper we propose a new searching method of Genetic Algorithm for Job-shop scheduling problem (JSP). The coding method that represent job number in order to decide a priority to arrange a job to Gannt Chart (called the ordinal representation with a priority) in JSP, an active schedule is created by using left shift. We define an active solution at first. It is solution which can create an active schedule without using left shift, and set of its defined an active solution space. Next, we propose an algorithm named Genetic Algorithm with active solution space search (GA-asol) which can create an active solution while solution is evaluated, in order to search the active solution space effectively. We applied it for some benchmark problems to compare with other method. The experimental results show good performance.

Balancing novelty with confined chemical space in modern drug discovery.

PubMed

Medina-Franco, José L; Martinez-Mayorga, Karina; Meurice, Nathalie

2014-02-01

The concept of chemical space has broad applications in drug discovery. In response to the needs of drug discovery campaigns, different approaches are followed to efficiently populate, mine and select relevant chemical spaces that overlap with biologically relevant chemical spaces. This paper reviews major trends in current drug discovery and their impact on the mining and population of chemical space. We also survey different approaches to develop screening libraries with confined chemical spaces balancing physicochemical properties. In this context, the confinement is guided by criteria that can be divided in two broad categories: i) library design focused on a relevant therapeutic target or disease and ii) library design focused on the chemistry or a desired molecular function. The design and development of chemical libraries should be associated with the specific purpose of the library and the project goals. The high complexity of drug discovery and the inherent imperfection of individual experimental and computational technologies prompt the integration of complementary library design and screening approaches to expedite the identification of new and better drugs. Library design approaches including diversity-oriented synthesis, biological-oriented synthesis or combinatorial library design, to name a few, and the design of focused libraries driven by target/disease, chemical structure or molecular function are more efficient if they are guided by multi-parameter optimization. In this context, consideration of pharmaceutically relevant properties is essential for balancing novelty with chemical space in drug discovery.

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

USDA-ARS?s Scientific Manuscript database

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...

Students' Verification Strategies for Combinatorial Problems

ERIC Educational Resources Information Center

Mashiach Eizenberg, Michal; Zaslavsky, Orit

2004-01-01

We focus on a major difficulty in solving combinatorial problems, namely, on the verification of a solution. Our study aimed at identifying undergraduate students' tendencies to verify their solutions, and the verification strategies that they employ when solving these problems. In addition, an attempt was made to evaluate the level of efficiency…