Statistical physics of hard combinatorial optimization: Vertex cover problem
Zhao, Jin-Hua; Zhou, Hai-Jun
2014-07-01
Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years, the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper, we use the vertex cover problem, a basic nondeterministic-polynomial (NP)-complete combinatorial optimization problem of wide application, as an example to introduce the statistical physical methods and algorithms. We do not go into the technical details but emphasize mainly the intuitive physical meanings of the message-passing equations. A nonfamiliar reader shall be able to understand to a large extent the physics behind the mean field approaches and to adjust the mean field methods in solving other optimization problems.
Number systems and combinatorial problems
Yordzhev, Krasimir
2014-01-01
The present work has been designed for students in secondary school and their teachers in mathematics. We will show how with the help of our knowledge of number systems we can solve problems from other fields of mathematics for example in combinatorial analysis and most of all when proving some combinatorial identities. To demonstrate discussed in this article method we have chosen several suitable mathematical tasks.
Combinatorial problems and exercises
Lovász, László
2007-01-01
The main purpose of this book is to provide help in learning existing techniques in combinatorics. The most effective way of learning such techniques is to solve exercises and problems. This book presents all the material in the form of problems and series of problems (apart from some general comments at the beginning of each chapter). In the second part, a hint is given for each exercise, which contains the main idea necessary for the solution, but allows the reader to practice the techniques by completing the proof. In the third part, a full solution is provided for each problem. This book w
Advances in bio-inspired computing for combinatorial optimization problems
Pintea, Camelia-Mihaela
2013-01-01
Advances in Bio-inspired Combinatorial Optimization Problems' illustrates several recent bio-inspired efficient algorithms for solving NP-hard problems.Theoretical bio-inspired concepts and models, in particular for agents, ants and virtual robots are described. Large-scale optimization problems, for example: the Generalized Traveling Salesman Problem and the Railway Traveling Salesman Problem, are solved and their results are discussed.Some of the main concepts and models described in this book are: inner rule to guide ant search - a recent model in ant optimization, heterogeneous sensitive a
Exploiting Quantum Resonance to Solve Combinatorial Problems
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.
Asessing for Structural Understanding in Childrens' Combinatorial Problem Solving.
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…
Quantum resonance for simulating combinatorial problems
International Nuclear Information System (INIS)
Zak, Michail; Fijany, Amir
2005-01-01
Quantum computing by simulations is based upon similarity between mathematical formalism of a quantum phenomenon and phenomena to be analyzed. In this Letter, the mathematical formalism of quantum resonance combined with tensor product decomposability of unitary evolutions is mapped onto a class of NP-complete combinatorial problems. It has been demonstrated that nature has polynomial resources for solving NP-complete problems and that will help to develop a new strategy for artificial intelligence, as well as to re-evaluate the role of natural selection in biological evolution
Characterizing the combinatorial beam angle selection problem
Bangert, Mark; Ziegenhein, Peter; Oelfke, Uwe
2012-10-01
The beam angle selection (BAS) problem in intensity-modulated radiation therapy is often interpreted as a combinatorial optimization problem, i.e. finding the best combination of η beams in a discrete set of candidate beams. It is well established that the combinatorial BAS problem may be solved efficiently with metaheuristics such as simulated annealing or genetic algorithms. However, the underlying parameters of the optimization process, such as the inclusion of non-coplanar candidate beams, the angular resolution in the space of candidate beams, and the number of evaluated beam ensembles as well as the relative performance of different metaheuristics have not yet been systematically investigated. We study these open questions in a meta-analysis of four strategies for combinatorial optimization in order to provide a reference for future research related to the BAS problem in intensity-modulated radiation therapy treatment planning. We introduce a high-performance inverse planning engine for BAS. It performs a full fluence optimization for ≈3600 treatment plans per hour while handling up to 50 GB of dose influence data (≈1400 candidate beams). For three head and neck patients, we compare the relative performance of a genetic, a cross-entropy, a simulated annealing and a naive iterative algorithm. The selection of ensembles with 5, 7, 9 and 11 beams considering either only coplanar or all feasible candidate beams is studied for an angular resolution of 5°, 10°, 15° and 20° in the space of candidate beams. The impact of different convergence criteria is investigated in comparison to a fixed termination after the evaluation of 10 000 beam ensembles. In total, our simulations comprise a full fluence optimization for about 3000 000 treatment plans. All four combinatorial BAS strategies yield significant improvements of the objective function value and of the corresponding dose distributions compared to standard beam configurations with equi
Characterizing the combinatorial beam angle selection problem
International Nuclear Information System (INIS)
Bangert, Mark; Ziegenhein, Peter; Oelfke, Uwe
2012-01-01
The beam angle selection (BAS) problem in intensity-modulated radiation therapy is often interpreted as a combinatorial optimization problem, i.e. finding the best combination of η beams in a discrete set of candidate beams. It is well established that the combinatorial BAS problem may be solved efficiently with metaheuristics such as simulated annealing or genetic algorithms. However, the underlying parameters of the optimization process, such as the inclusion of non-coplanar candidate beams, the angular resolution in the space of candidate beams, and the number of evaluated beam ensembles as well as the relative performance of different metaheuristics have not yet been systematically investigated. We study these open questions in a meta-analysis of four strategies for combinatorial optimization in order to provide a reference for future research related to the BAS problem in intensity-modulated radiation therapy treatment planning. We introduce a high-performance inverse planning engine for BAS. It performs a full fluence optimization for ≈3600 treatment plans per hour while handling up to 50 GB of dose influence data (≈1400 candidate beams). For three head and neck patients, we compare the relative performance of a genetic, a cross-entropy, a simulated annealing and a naive iterative algorithm. The selection of ensembles with 5, 7, 9 and 11 beams considering either only coplanar or all feasible candidate beams is studied for an angular resolution of 5°, 10°, 15° and 20° in the space of candidate beams. The impact of different convergence criteria is investigated in comparison to a fixed termination after the evaluation of 10 000 beam ensembles. In total, our simulations comprise a full fluence optimization for about 3000 000 treatment plans. All four combinatorial BAS strategies yield significant improvements of the objective function value and of the corresponding dose distributions compared to standard beam configurations with equi
Binary Cockroach Swarm Optimization for Combinatorial Optimization Problem
Directory of Open Access Journals (Sweden)
Ibidun Christiana Obagbuwa
2016-09-01
Full Text Available The Cockroach Swarm Optimization (CSO algorithm is inspired by cockroach social behavior. It is a simple and efficient meta-heuristic algorithm and has been applied to solve global optimization problems successfully. The original CSO algorithm and its variants operate mainly in continuous search space and cannot solve binary-coded optimization problems directly. Many optimization problems have their decision variables in binary. Binary Cockroach Swarm Optimization (BCSO is proposed in this paper to tackle such problems and was evaluated on the popular Traveling Salesman Problem (TSP, which is considered to be an NP-hard Combinatorial Optimization Problem (COP. A transfer function was employed to map a continuous search space CSO to binary search space. The performance of the proposed algorithm was tested firstly on benchmark functions through simulation studies and compared with the performance of existing binary particle swarm optimization and continuous space versions of CSO. The proposed BCSO was adapted to TSP and applied to a set of benchmark instances of symmetric TSP from the TSP library. The results of the proposed Binary Cockroach Swarm Optimization (BCSO algorithm on TSP were compared to other meta-heuristic algorithms.
Analysis and design of algorithms for combinatorial problems
Ausiello, G
1985-01-01
Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed. The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in computing power and the availability of data and software. The availability of such basic tools has led to the feasibility of the exact or well approximate solution of large scale realistic combinatorial optimization problems and has created a number of new combinatorial problems.
Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems
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.
Neurogenetic Algorithm for Solving Combinatorial Engineering Problems
Directory of Open Access Journals (Sweden)
M. Jalali Varnamkhasti
2012-01-01
Full Text Available Diversity of the population in a genetic algorithm plays an important role in impeding premature convergence. This paper proposes an adaptive neurofuzzy inference system genetic algorithm based on sexual selection. In this technique, for choosing the female chromosome during sexual selection, a bilinear allocation lifetime approach is used to label the chromosomes based on their fitness value which will then be used to characterize the diversity of the population. The motivation of this algorithm is to maintain the population diversity throughout the search procedure. To promote diversity, the proposed algorithm combines the concept of gender and age of individuals and the fuzzy logic during the selection of parents. In order to appraise the performance of the techniques used in this study, one of the chemistry problems and some nonlinear functions available in literature is used.
A combinatorial perspective of the protein inference problem.
Yang, Chao; He, Zengyou; Yu, Weichuan
2013-01-01
In a shotgun proteomics experiment, proteins are the most biologically meaningful output. The success of proteomics studies depends on the ability to accurately and efficiently identify proteins. Many methods have been proposed to facilitate the identification of proteins from peptide identification results. However, the relationship between protein identification and peptide identification has not been thoroughly explained before. In this paper, we devote ourselves to a combinatorial perspective of the protein inference problem. We employ combinatorial mathematics to calculate the conditional protein probabilities (protein probability means the probability that a protein is correctly identified) under three assumptions, which lead to a lower bound, an upper bound, and an empirical estimation of protein probabilities, respectively. The combinatorial perspective enables us to obtain an analytical expression for protein inference. Our method achieves comparable results with ProteinProphet in a more efficient manner in experiments on two data sets of standard protein mixtures and two data sets of real samples. Based on our model, we study the impact of unique peptides and degenerate peptides (degenerate peptides are peptides shared by at least two proteins) on protein probabilities. Meanwhile, we also study the relationship between our model and ProteinProphet. We name our program ProteinInfer. Its Java source code, our supplementary document and experimental results are available at: >http://bioinformatics.ust.hk/proteininfer.
The hard problem of cooperation.
Directory of Open Access Journals (Sweden)
Kimmo Eriksson
Full Text Available Based on individual variation in cooperative inclinations, we define the "hard problem of cooperation" as that of achieving high levels of cooperation in a group of non-cooperative types. Can the hard problem be solved by institutions with monitoring and sanctions? In a laboratory experiment we find that the answer is affirmative if the institution is imposed on the group but negative if development of the institution is left to the group to vote on. In the experiment, participants were divided into groups of either cooperative types or non-cooperative types depending on their behavior in a public goods game. In these homogeneous groups they repeatedly played a public goods game regulated by an institution that incorporated several of the key properties identified by Ostrom: operational rules, monitoring, rewards, punishments, and (in one condition change of rules. When change of rules was not possible and punishments were set to be high, groups of both types generally abided by operational rules demanding high contributions to the common good, and thereby achieved high levels of payoffs. Under less severe rules, both types of groups did worse but non-cooperative types did worst. Thus, non-cooperative groups profited the most from being governed by an institution demanding high contributions and employing high punishments. Nevertheless, in a condition where change of rules through voting was made possible, development of the institution in this direction was more often voted down in groups of non-cooperative types. We discuss the relevance of the hard problem and fit our results into a bigger picture of institutional and individual determinants of cooperative behavior.
The hard problem of cooperation.
Eriksson, Kimmo; Strimling, Pontus
2012-01-01
Based on individual variation in cooperative inclinations, we define the "hard problem of cooperation" as that of achieving high levels of cooperation in a group of non-cooperative types. Can the hard problem be solved by institutions with monitoring and sanctions? In a laboratory experiment we find that the answer is affirmative if the institution is imposed on the group but negative if development of the institution is left to the group to vote on. In the experiment, participants were divided into groups of either cooperative types or non-cooperative types depending on their behavior in a public goods game. In these homogeneous groups they repeatedly played a public goods game regulated by an institution that incorporated several of the key properties identified by Ostrom: operational rules, monitoring, rewards, punishments, and (in one condition) change of rules. When change of rules was not possible and punishments were set to be high, groups of both types generally abided by operational rules demanding high contributions to the common good, and thereby achieved high levels of payoffs. Under less severe rules, both types of groups did worse but non-cooperative types did worst. Thus, non-cooperative groups profited the most from being governed by an institution demanding high contributions and employing high punishments. Nevertheless, in a condition where change of rules through voting was made possible, development of the institution in this direction was more often voted down in groups of non-cooperative types. We discuss the relevance of the hard problem and fit our results into a bigger picture of institutional and individual determinants of cooperative behavior.
Estimating meme fitness in adaptive memetic algorithms for combinatorial problems.
Smith, J E
2012-01-01
Among the most promising and active research areas in heuristic optimisation is the field of adaptive memetic algorithms (AMAs). These gain much of their reported robustness by adapting the probability with which each of a set of local improvement operators is applied, according to an estimate of their current value to the search process. This paper addresses the issue of how the current value should be estimated. Assuming the estimate occurs over several applications of a meme, we consider whether the extreme or mean improvements should be used, and whether this aggregation should be global, or local to some part of the solution space. To investigate these issues, we use the well-established COMA framework that coevolves the specification of a population of memes (representing different local search algorithms) alongside a population of candidate solutions to the problem at hand. Two very different memetic algorithms are considered: the first using adaptive operator pursuit to adjust the probabilities of applying a fixed set of memes, and a second which applies genetic operators to dynamically adapt and create memes and their functional definitions. For the latter, especially on combinatorial problems, credit assignment mechanisms based on historical records, or on notions of landscape locality, will have limited application, and it is necessary to estimate the value of a meme via some form of sampling. The results on a set of binary encoded combinatorial problems show that both methods are very effective, and that for some problems it is necessary to use thousands of variables in order to tease apart the differences between different reward schemes. However, for both memetic algorithms, a significant pattern emerges that reward based on mean improvement is better than that based on extreme improvement. This contradicts recent findings from adapting the parameters of operators involved in global evolutionary search. The results also show that local reward schemes
Quantum particle swarm approaches applied to combinatorial problems
Energy Technology Data Exchange (ETDEWEB)
Nicolau, Andressa dos S.; Schirru, Roberto; Lima, Alan M.M. de, E-mail: andressa@lmp.ufrj.br [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Programa de Engenharia Nuclear
2017-07-01
Quantum Particle Swarm Optimization (QPSO) is a global convergence algorithm that combines the classical PSO philosophy and quantum mechanics to improve performance of PSO. Different from PSO it only has the 'measurement' of the position equation for all particles. The process of 'measurement' in quantum mechanics, obey classic laws while the particle itself follows the quantum rules. QPSO works like PSO in search ability but has fewer parameters control. In order to improve the QPSO performance, some strategies have been proposed in the literature. Weighted QPSO (WQPSO) is a version of QPSO, where weight parameter is insert in the calculation of the balance between the global and local searching of the algorithm. It has been shown to perform well in finding the optimal solutions for many optimization problems. In this article random confinement was introduced in WQPSO. The WQPSO with random confinement was tested in two combinatorial problems. First, we execute the model on Travelling Salesman Problem (TSP) to find the parameters' values resulting in good solutions in general. Finally, the model was tested on Nuclear Reactor Reload Problem, and the performance was compared with QPSO standard. (author)
Quantum particle swarm approaches applied to combinatorial problems
International Nuclear Information System (INIS)
Nicolau, Andressa dos S.; Schirru, Roberto; Lima, Alan M.M. de
2017-01-01
Quantum Particle Swarm Optimization (QPSO) is a global convergence algorithm that combines the classical PSO philosophy and quantum mechanics to improve performance of PSO. Different from PSO it only has the 'measurement' of the position equation for all particles. The process of 'measurement' in quantum mechanics, obey classic laws while the particle itself follows the quantum rules. QPSO works like PSO in search ability but has fewer parameters control. In order to improve the QPSO performance, some strategies have been proposed in the literature. Weighted QPSO (WQPSO) is a version of QPSO, where weight parameter is insert in the calculation of the balance between the global and local searching of the algorithm. It has been shown to perform well in finding the optimal solutions for many optimization problems. In this article random confinement was introduced in WQPSO. The WQPSO with random confinement was tested in two combinatorial problems. First, we execute the model on Travelling Salesman Problem (TSP) to find the parameters' values resulting in good solutions in general. Finally, the model was tested on Nuclear Reactor Reload Problem, and the performance was compared with QPSO standard. (author)
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.
Lexicographic goal programming and assessment tools for a combinatorial production problem.
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...
Counting in Lattices: Combinatorial Problems from Statistical Mechanics.
Randall, Dana Jill
In this thesis we consider two classical combinatorial problems arising in statistical mechanics: counting matchings and self-avoiding walks in lattice graphs. The first problem arises in the study of the thermodynamical properties of monomers and dimers (diatomic molecules) in crystals. Fisher, Kasteleyn and Temperley discovered an elegant technique to exactly count the number of perfect matchings in two dimensional lattices, but it is not applicable for matchings of arbitrary size, or in higher dimensional lattices. We present the first efficient approximation algorithm for computing the number of matchings of any size in any periodic lattice in arbitrary dimension. The algorithm is based on Monte Carlo simulation of a suitable Markov chain and has rigorously derived performance guarantees that do not rely on any assumptions. In addition, we show that these results generalize to counting matchings in any graph which is the Cayley graph of a finite group. The second problem is counting self-avoiding walks in lattices. This problem arises in the study of the thermodynamics of long polymer chains in dilute solution. While there are a number of Monte Carlo algorithms used to count self -avoiding walks in practice, these are heuristic and their correctness relies on unproven conjectures. In contrast, we present an efficient algorithm which relies on a single, widely-believed conjecture that is simpler than preceding assumptions and, more importantly, is one which the algorithm itself can test. Thus our algorithm is reliable, in the sense that it either outputs answers that are guaranteed, with high probability, to be correct, or finds a counterexample to the conjecture. In either case we know we can trust our results and the algorithm is guaranteed to run in polynomial time. This is the first algorithm for counting self-avoiding walks in which the error bounds are rigorously controlled. This work was supported in part by an AT&T graduate fellowship, a University of
Hartmann, Alexander K
2005-01-01
A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimization, bringing together theoretical concepts and algorithms from computer science with analytical methods from physics. The result bridges the gap between statistical physics and combinatorial optimization, investigating problems taken from theoretical computing, such as the vertex-cover problem, with the concepts and methods of theoretical physics. The authors cover rapid developments and analytical methods that are both extremely complex and spread by word-of-mouth, providing all the necessary
A Comparison of Approaches for Solving Hard Graph-Theoretic Problems
2015-04-29
and Search”, in Discrete Mathematics and Its Applications, Book 7, CRC Press (1998): Boca Raton. [6] A. Lucas, “Ising Formulations of Many NP Problems...owner. 14. ABSTRACT In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many... combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a standard brute force approach on a
A combinatorial enumeration problem of RNA secondary structures
African Journals Online (AJOL)
use
2011-12-21
Dec 21, 2011 ... interesting combinatorial questions (Chen et al., 2005;. Liu, 2006; Schmitt and Waterman 1994; Stein and. Waterman 1978). The research on the enumeration of. RNA secondary structures becomes one of the hot topics in Computational Molecular Biology. An RNA molecule is described by its sequences of.
A further problem of the hard problem of consciousness | Gbenga ...
African Journals Online (AJOL)
Justifying this assertion is identified as the further problem of the hard problem of consciousness. This shows that assertions about phenomenal properties of mental experiences are wholly epistemological. Hence, the problem of explaining phenomenal properties of a mental state is not a metaphysical problem, and what is ...
Directory of Open Access Journals (Sweden)
Angel A. Juan
2015-12-01
Full Text Available Many combinatorial optimization problems (COPs encountered in real-world logistics, transportation, production, healthcare, financial, telecommunication, and computing applications are NP-hard in nature. These real-life COPs are frequently characterized by their large-scale sizes and the need for obtaining high-quality solutions in short computing times, thus requiring the use of metaheuristic algorithms. Metaheuristics benefit from different random-search and parallelization paradigms, but they frequently assume that the problem inputs, the underlying objective function, and the set of optimization constraints are deterministic. However, uncertainty is all around us, which often makes deterministic models oversimplified versions of real-life systems. After completing an extensive review of related work, this paper describes a general methodology that allows for extending metaheuristics through simulation to solve stochastic COPs. ‘Simheuristics’ allow modelers for dealing with real-life uncertainty in a natural way by integrating simulation (in any of its variants into a metaheuristic-driven framework. These optimization-driven algorithms rely on the fact that efficient metaheuristics already exist for the deterministic version of the corresponding COP. Simheuristics also facilitate the introduction of risk and/or reliability analysis criteria during the assessment of alternative high-quality solutions to stochastic COPs. Several examples of applications in different fields illustrate the potential of the proposed methodology.
A new evolutionary algorithm with LQV learning for combinatorial problems optimization
International Nuclear Information System (INIS)
Machado, Marcelo Dornellas; Schirru, Roberto
2000-01-01
Genetic algorithms are biologically motivated adaptive systems which have been used, with good results, for combinatorial problems optimization. In this work, a new learning mode, to be used by the population-based incremental learning algorithm, has the aim to build a new evolutionary algorithm to be used in optimization of numerical problems and combinatorial problems. This new learning mode uses a variable learning rate during the optimization process, constituting a process known as proportional reward. The development of this new algorithm aims its application in the optimization of reload problem of PWR nuclear reactors, in order to increase the useful life of the nuclear fuel. For the test, two classes of problems are used: numerical problems and combinatorial problems. Due to the fact that the reload problem is a combinatorial problem, the major interest relies on the last class. The results achieved with the tests indicate the applicability of the new learning mode, showing its potential as a developing tool in the solution of reload problem. (author)
Statistical physics of hard optimization problems
International Nuclear Information System (INIS)
Zdeborova, L.
2009-01-01
Optimization is fundamental in many areas of science, from computer science and information theory to engineering and statistical physics, as well as to biology or social sciences. It typically involves a large number of variables and a cost function depending on these variables. Optimization problems in the non-deterministic polynomial (NP)-complete class are particularly difficult, it is believed that the number of operations required to minimize the cost function is in the most difficult cases exponential in the system size. However, even in an NP-complete problem the practically arising instances might, in fact, be easy to solve. The principal question we address in this article is: How to recognize if an NP-complete constraint satisfaction problem is typically hard and what are the main reasons for this? We adopt approaches from the statistical physics of disordered systems, in particular the cavity method developed originally to describe glassy systems. We describe new properties of the space of solutions in two of the most studied constraint satisfaction problems - random satisfy ability and random graph coloring. We suggest a relation between the existence of the so-called frozen variables and the algorithmic hardness of a problem. Based on these insights, we introduce a new class of problems which we named ”locked” constraint satisfaction, where the statistical description is easily solvable, but from the algorithmic point of view they are even more challenging than the canonical satisfy ability.
Statistical physics of hard optimization problems
International Nuclear Information System (INIS)
Zdeborova, L.
2009-01-01
Optimization is fundamental in many areas of science, from computer science and information theory to engineering and statistical physics, as well as to biology or social sciences. It typically involves a large number of variables and a cost function depending on these variables. Optimization problems in the non-deterministic polynomial-complete class are particularly difficult, it is believed that the number of operations required to minimize the cost function is in the most difficult cases exponential in the system size. However, even in an non-deterministic polynomial-complete problem the practically arising instances might, in fact, be easy to solve. The principal the question we address in the article is: How to recognize if an non-deterministic polynomial-complete constraint satisfaction problem is typically hard and what are the main reasons for this? We adopt approaches from the statistical physics of disordered systems, in particular the cavity method developed originally to describe glassy systems. We describe new properties of the space of solutions in two of the most studied constraint satisfaction problems - random satisfiability and random graph coloring. We suggest a relation between the existence of the so-called frozen variables and the algorithmic hardness of a problem. Based on these insights, we introduce a new class of problems which we named 'locked' constraint satisfaction, where the statistical description is easily solvable, but from the algorithmic point of view they are even more challenging than the canonical satisfiability (Authors)
Statistical physics of hard optimization problems
Zdeborová, Lenka
2009-06-01
Optimization is fundamental in many areas of science, from computer science and information theory to engineering and statistical physics, as well as to biology or social sciences. It typically involves a large number of variables and a cost function depending on these variables. Optimization problems in the non-deterministic polynomial (NP)-complete class are particularly difficult, it is believed that the number of operations required to minimize the cost function is in the most difficult cases exponential in the system size. However, even in an NP-complete problem the practically arising instances might, in fact, be easy to solve. The principal question we address in this article is: How to recognize if an NP-complete constraint satisfaction problem is typically hard and what are the main reasons for this? We adopt approaches from the statistical physics of disordered systems, in particular the cavity method developed originally to describe glassy systems. We describe new properties of the space of solutions in two of the most studied constraint satisfaction problems - random satisfiability and random graph coloring. We suggest a relation between the existence of the so-called frozen variables and the algorithmic hardness of a problem. Based on these insights, we introduce a new class of problems which we named "locked" constraint satisfaction, where the statistical description is easily solvable, but from the algorithmic point of view they are even more challenging than the canonical satisfiability.
The World of Combinatorial Fuzzy Problems and the Efficiency of Fuzzy Approximation Algorithms
Yamakami, Tomoyuki
2015-01-01
We re-examine a practical aspect of combinatorial fuzzy problems of various types, including search, counting, optimization, and decision problems. We are focused only on those fuzzy problems that take series of fuzzy input objects and produce fuzzy values. To solve such problems efficiently, we design fast fuzzy algorithms, which are modeled by polynomial-time deterministic fuzzy Turing machines equipped with read-only auxiliary tapes and write-only output tapes and also modeled by polynomia...
Prodromou, Theodosia
2012-01-01
This article seeks to address a pedagogical theory of introducing the classicist and the frequentist approach to probability, by investigating important elements in 9th grade students' learning process while working with a "TinkerPlots2" combinatorial problem. Results from this research study indicate that, after the students had seen…
International Nuclear Information System (INIS)
Meneses, Anderson Alvarenga de Moura; Schirru, Roberto
2005-01-01
This work focuses on the usage the Artificial Intelligence technique Particle Swarm Optimization (PSO) to optimize the fuel recharge at a nuclear reactor. This is a combinatorial problem, in which the search of the best feasible solution is done by minimizing a specific objective function. However, in this first moment it is possible to compare the fuel recharge problem with the Traveling Salesman Problem (TSP), since both of them are combinatorial, with one advantage: the evaluation of the TSP objective function is much more simple. Thus, the proposed methods have been applied to two TSPs: Oliver 30 and Rykel 48. In 1995, KENNEDY and EBERHART presented the PSO technique to optimize non-linear continued functions. Recently some PSO models for discrete search spaces have been developed for combinatorial optimization. Although all of them having different formulation from the ones presented here. In this paper, we use the PSO theory associated with to the Random Keys (RK)model, used in some optimizations with Genetic Algorithms. The Particle Swarm Optimization with Random Keys (PSORK) results from this association, which combines PSO and RK. The adaptations and changings in the PSO aim to allow the usage of the PSO at the nuclear fuel recharge. This work shows the PSORK being applied to the proposed combinatorial problem and the obtained results. (author)
A note on the depth function of combinatorial optimization problems
Woeginger, G.J.
2001-01-01
In a recent paper [Discrete Appl. Math. 43 (1993) 115–129], Kern formulates two conjectures on the relationship between the computational complexity of computing the depth function of a discrete optimization problem and the computational complexity of solving this optimization problem to optimality.
A Combinatorial Benders’ Cuts Algorithm for the Local Container Drayage Problem
Directory of Open Access Journals (Sweden)
Zhaojie Xue
2015-01-01
Full Text Available This paper examines the local container drayage problem under a special operation mode in which tractors and trailers can be separated; that is, tractors can be assigned to a new task at another location while trailers with containers are waiting for packing or unpacking. Meanwhile, the strategy of sharing empty containers between different customers is also considered to improve the efficiency and lower the operation cost. The problem is formulated as a vehicle routing and scheduling problem with temporal constraints. We adopt combinatorial benders’ cuts algorithm to solve this problem. Numerical experiments are performed on a group of randomly generated instances to test the performance of the proposed algorithm.
Hartmann, Alexander K.; Weigt, Martin
2005-10-01
A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimization, bringing together theoretical concepts and algorithms from computer science with analytical methods from physics. The result bridges the gap between statistical physics and combinatorial optimization, investigating problems taken from theoretical computing, such as the vertex-cover problem, with the concepts and methods of theoretical physics. The authors cover rapid developments and analytical methods that are both extremely complex and spread by word-of-mouth, providing all the necessary basics in required detail. Throughout, the algorithms are shown with examples and calculations, while the proofs are given in a way suitable for graduate students, post-docs, and researchers. Ideal for newcomers to this young, multidisciplinary field.
Using combinatorial problem decomposition for optimizing plutonium inventory management
International Nuclear Information System (INIS)
Niquil, Y.; Gondran, M.; Voskanian, A.; Paris-11 Univ., 91 - Orsay
1997-03-01
Plutonium Inventory Management Optimization can be modeled as a very large 0-1 linear program. To solve it, problem decomposition is necessary, since other classic techniques are not efficient for such a size. The first decomposition consists in favoring constraints that are the most difficult to reach and variables that have the highest influence on the cost: fortunately, both correspond to stock output decisions. The second decomposition consists in mixing continuous linear program solving and integer linear program solving. Besides, the first decisions to be taken are systematically favored, for they are based on data considered to be sure, when data supporting later decisions in known with less accuracy and confidence. (author)
Using combinatorial problem decomposition for optimizing plutonium inventory management
Energy Technology Data Exchange (ETDEWEB)
Niquil, Y.; Gondran, M. [Electricite de France (EDF), 92 - Clamart (France). Direction des Etudes et Recherches; Voskanian, A. [Electricite de France (EDF), 92 - Clamart (France). Direction des Etudes et Recherches]|[Paris-11 Univ., 91 - Orsay (France). Lab. de Recherche en Informatique
1997-03-01
Plutonium Inventory Management Optimization can be modeled as a very large 0-1 linear program. To solve it, problem decomposition is necessary, since other classic techniques are not efficient for such a size. The first decomposition consists in favoring constraints that are the most difficult to reach and variables that have the highest influence on the cost: fortunately, both correspond to stock output decisions. The second decomposition consists in mixing continuous linear program solving and integer linear program solving. Besides, the first decisions to be taken are systematically favored, for they are based on data considered to be sure, when data supporting later decisions in known with less accuracy and confidence. (author) 7 refs.
Directory of Open Access Journals (Sweden)
Fushing Hsieh
2016-11-01
Full Text Available Discrete combinatorial optimization problems in real world are typically defined via an ensemble of potentially high dimensional measurements pertaining to all subjects of a system under study. We point out that such a data ensemble in fact embeds with system's information content that is not directly used in defining the combinatorial optimization problems. Can machine learning algorithms extract such information content and make combinatorial optimizing tasks more efficient? Would such algorithmic computations bring new perspectives into this classic topic of Applied Mathematics and Theoretical Computer Science? We show that answers to both questions are positive. One key reason is due to permutation invariance. That is, the data ensemble of subjects' measurement vectors is permutation invariant when it is represented through a subject-vs-measurement matrix. An unsupervised machine learning algorithm, called Data Mechanics (DM, is applied to find optimal permutations on row and column axes such that the permuted matrix reveals coupled deterministic and stochastic structures as the system's information content. The deterministic structures are shown to facilitate geometry-based divide-and-conquer scheme that helps optimizing task, while stochastic structures are used to generate an ensemble of mimicries retaining the deterministic structures, and then reveal the robustness pertaining to the original version of optimal solution. Two simulated systems, Assignment problem and Traveling Salesman problem, are considered. Beyond demonstrating computational advantages and intrinsic robustness in the two systems, we propose brand new robust optimal solutions. We believe such robust versions of optimal solutions are potentially more realistic and practical in real world settings.
Constraint satisfaction problems with isolated solutions are hard
International Nuclear Information System (INIS)
Zdeborová, Lenka; Mézard, Marc
2008-01-01
We study the phase diagram and the algorithmic hardness of the random 'locked' constraint satisfaction problems, and compare them to the commonly studied 'non-locked' problems like satisfiability of Boolean formulae or graph coloring. The special property of the locked problems is that clusters of solutions are isolated points. This simplifies significantly the determination of the phase diagram, which makes the locked problems particularly appealing from the mathematical point of view. On the other hand, we show empirically that the clustered phase of these problems is extremely hard from the algorithmic point of view: the best known algorithms all fail to find solutions. Our results suggest that the easy/hard transition (for currently known algorithms) in the locked problems coincides with the clustering transition. These should thus be regarded as new benchmarks of really hard constraint satisfaction problems
International Nuclear Information System (INIS)
Kamioka, Shuhei; Takagaki, Tomoaki
2013-01-01
Combinatorial expressions are presented of the solutions to initial value problems of the discrete and ultradiscrete Toda molecules. For the discrete Toda molecule, a subtraction-free expression of the solution is derived in terms of non-intersecting paths, for which two results in combinatorics, Flajolet’s interpretation of continued fractions and Gessel–Viennot’s lemma on determinants, are applied. By ultradiscretizing the subtraction-free expression, the solution to the ultradiscrete Toda molecule is obtained. It is finally shown that the initial value problem of the ultradiscrete Toda molecule is exactly solved in terms of shortest paths on a specific graph. The behavior of the solution is also investigated in comparison with the box–ball system. (paper)
Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I
Directory of Open Access Journals (Sweden)
Eremeev Anton V.
2014-01-01
Full Text Available This paper surveys results on complexity of the optimal recombination problem (ORP, which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We consider efficient reductions of the ORPs, allowing to establish polynomial solvability or NP-hardness of the ORPs, as well as direct proofs of hardness results. Part I presents the basic principles of optimal recombination with a survey of results on Boolean Linear Programming Problems. Part II (to appear in a subsequent issue is devoted to the ORPs for problems which are naturally formulated in terms of search for an optimal permutation.
Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II
Directory of Open Access Journals (Sweden)
Eremeev Anton V.
2014-01-01
Full Text Available This paper surveys results on complexity of the optimal recombination problem (ORP, which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. In Part II, we consider the computational complexity of ORPs arising in genetic algorithms for problems on permutations: the Travelling Salesman Problem, the Shortest Hamilton Path Problem and the Makespan Minimization on Single Machine and some other related problems. The analysis indicates that the corresponding ORPs are NP-hard, but solvable by faster algorithms, compared to the problems they are derived from.
The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
Directory of Open Access Journals (Sweden)
Denis Pinha
2016-11-01
Full Text Available This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practical situations where the definition of optimal changes on a regular basis. The proposed approach empowers the project manager to determine what is optimal, on a given day, under the current constraints, such as, change of priorities, lack of skilled worker. The proposed method utilizes a simulation approach to determine feasible solutions, under the current constraints. Resources can be non-consumable, consumable, or doubly constrained. The paper also presents a real-life case study dealing with scheduling of ship repair activities.
An overview on polynomial approximation of NP-hard problems
Directory of Open Access Journals (Sweden)
Paschos Vangelis Th.
2009-01-01
Full Text Available The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between computational time and solution's quality. In other words, heuristic computation consists of trying to find not the best solution but one solution which is 'close to' the optimal one in reasonable time. Among the classes of heuristic methods for NP-hard problems, the polynomial approximation algorithms aim at solving a given NP-hard problem in poly-nomial time by computing feasible solutions that are, under some predefined criterion, as near to the optimal ones as possible. The polynomial approximation theory deals with the study of such algorithms. This survey first presents and analyzes time approximation algorithms for some classical examples of NP-hard problems. Secondly, it shows how classical notions and tools of complexity theory, such as polynomial reductions, can be matched with polynomial approximation in order to devise structural results for NP-hard optimization problems. Finally, it presents a quick description of what is commonly called inapproximability results. Such results provide limits on the approximability of the problems tackled.
Combinatorial Algorithms for Portfolio Optimization Problems - Case of Risk Moderate Investor
Juarna, A.
2017-03-01
Portfolio optimization problem is a problem of finding optimal combination of n stocks from N ≥ n available stocks that gives maximal aggregate return and minimal aggregate risk. In this paper given N = 43 from the IDX (Indonesia Stock Exchange) group of the 45 most-traded stocks, known as the LQ45, with p = 24 data of monthly returns for each stock, spanned over interval 2013-2014. This problem actually is a combinatorial one where its algorithm is constructed based on two considerations: risk moderate type of investor and maximum allowed correlation coefficient between every two eligible stocks. The main outputs resulted from implementation of the algorithms is a multiple curve of three portfolio’s attributes, e.g. the size, the ratio of return to risk, and the percentage of negative correlation coefficient for every two chosen stocks, as function of maximum allowed correlation coefficient between each two stocks. The output curve shows that the portfolio contains three stocks with ratio of return to risk at 14.57 if the maximum allowed correlation coefficient between every two eligible stocks is negative and contains 19 stocks with maximum allowed correlation coefficient 0.17 to get maximum ratio of return to risk at 25.48.
Concepts of combinatorial optimization
Paschos, Vangelis Th
2014-01-01
Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization.Concepts of Combinatorial Optimization, is divided into three parts:- On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomi
Directory of Open Access Journals (Sweden)
Chefi Triki
2016-08-01
Full Text Available We address in this paper a periodic petroleum station replenishment problem (PPSRP that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks over an extended planning horizon. The problem configuration is described through a set of trucks with several compartments each and a set of stations with demands and prefixed delivery frequencies. Given such input data, the minimization of the total distance is subject to assignment and routing constraints that express the capacity limitations of each truck's compartment in terms of the frequency and the pathways' restrictions. In this paper, we develop and solve the full space mathematical formulation for the PPSRP with application to the Omani context. Our ultimate aim is to include such a model into an integrated framework having the objective of advising petroleum distribution companies on how to prepare bids in case of participation in combinatorial auctions of the transportation procurement.
Directory of Open Access Journals (Sweden)
Vladimir A. Emelichev
2004-06-01
Full Text Available We consider one type of stability (quasistability of a vector combinatorial problem of finding the Pareto set. Under quasistability we understand a discrete analogue of lower semicontinuity by Hausdorff of the many-valued mapping, which defines the Pareto choice function. A vector problem on a system of subsets of a finite set (trajectorial problem with non-linear partial criteria is in focus. Two necessary and sufficient conditions for stability of this problem are proved. Mathematics Subject Classification: 2000, 90C10, 90C05, 90C29, 90C31
Hen, Itay; Rieffel, Eleanor G.; Do, Minh; Venturelli, Davide
2014-01-01
There are two common ways to evaluate algorithms: performance on benchmark problems derived from real applications and analysis of performance on parametrized families of problems. The two approaches complement each other, each having its advantages and disadvantages. The planning community has concentrated on the first approach, with few ways of generating parametrized families of hard problems known prior to this work. Our group's main interest is in comparing approaches to solving planning problems using a novel type of computational device - a quantum annealer - to existing state-of-the-art planning algorithms. Because only small-scale quantum annealers are available, we must compare on small problem sizes. Small problems are primarily useful for comparison only if they are instances of parametrized families of problems for which scaling analysis can be done. In this technical report, we discuss our approach to the generation of hard planning problems from classes of well-studied NP-complete problems that map naturally to planning problems or to aspects of planning problems that many practical planning problems share. These problem classes exhibit a phase transition between easy-to-solve and easy-to-show-unsolvable planning problems. The parametrized families of hard planning problems lie at the phase transition. The exponential scaling of hardness with problem size is apparent in these families even at very small problem sizes, thus enabling us to characterize even very small problems as hard. The families we developed will prove generally useful to the planning community in analyzing the performance of planning algorithms, providing a complementary approach to existing evaluation methods. We illustrate the hardness of these problems and their scaling with results on four state-of-the-art planners, observing significant differences between these planners on these problem families. Finally, we describe two general, and quite different, mappings of planning
Directory of Open Access Journals (Sweden)
E. Osaba
2014-01-01
Full Text Available Since their first formulation, genetic algorithms (GAs have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test.
Osaba, E.; Carballedo, R.; Diaz, F.; Onieva, E.; de la Iglesia, I.; Perallos, A.
2014-01-01
Since their first formulation, genetic algorithms (GAs) have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test. PMID:25165731
NP-hardness of the cluster minimization problem revisited
Adib, Artur B.
2005-10-01
The computational complexity of the 'cluster minimization problem' is revisited (Wille and Vennik 1985 J. Phys. A: Math. Gen. 18 L419). It is argued that the original NP-hardness proof does not apply to pairwise potentials of physical interest, such as those that depend on the geometric distance between the particles. A geometric analogue of the original problem is formulated, and a new proof for such potentials is provided by polynomial time transformation from the independent set problem for unit disk graphs. Limitations of this formulation are pointed out, and new subproblems that bear more direct consequences to the numerical study of clusters are suggested.
NP-hardness of the cluster minimization problem revisited
International Nuclear Information System (INIS)
Adib, Artur B
2005-01-01
The computational complexity of the 'cluster minimization problem' is revisited (Wille and Vennik 1985 J. Phys. A: Math. Gen. 18 L419). It is argued that the original NP-hardness proof does not apply to pairwise potentials of physical interest, such as those that depend on the geometric distance between the particles. A geometric analogue of the original problem is formulated, and a new proof for such potentials is provided by polynomial time transformation from the independent set problem for unit disk graphs. Limitations of this formulation are pointed out, and new subproblems that bear more direct consequences to the numerical study of clusters are suggested
NP-hardness of the cluster minimization problem revisited
Energy Technology Data Exchange (ETDEWEB)
Adib, Artur B [Physics Department, Brown University, Providence, RI 02912 (United States)
2005-10-07
The computational complexity of the 'cluster minimization problem' is revisited (Wille and Vennik 1985 J. Phys. A: Math. Gen. 18 L419). It is argued that the original NP-hardness proof does not apply to pairwise potentials of physical interest, such as those that depend on the geometric distance between the particles. A geometric analogue of the original problem is formulated, and a new proof for such potentials is provided by polynomial time transformation from the independent set problem for unit disk graphs. Limitations of this formulation are pointed out, and new subproblems that bear more direct consequences to the numerical study of clusters are suggested.
International Nuclear Information System (INIS)
Machado, Marcelo Dornellas
1999-04-01
Genetic algorithms are biologically motivated adaptive systems which have been used, with good results, for function optimization. In this work, a new learning mode, to be used by the Population-Based Incremental Learning (PBIL) algorithm, who combines mechanisms of standard genetic algorithm with simple competitive learning, has the aim to build a new evolutionary algorithm to be used in optimization of numerical problems and combinatorial problems. This new learning mode uses a variable learning rate during the optimization process, constituting a process know as proportional reward. The development of this new algorithm aims its application in the optimization of reload problem of PWR nuclear reactors. This problem can be interpreted as search of a load pattern to be used in the nucleus of the reactor in order to increase the useful life of the nuclear fuel. For the test, two classes of problems are used: numerical problems and combinatorial problem, the major interest relies on the last class. The results achieved with the tests indicate the applicability of the new learning mode, showing its potential as a developing tool in the solution of reload problem. (author)
Structural qualia: a solution to the hard problem of consciousness.
Loorits, Kristjan
2014-01-01
The hard problem of consciousness has been often claimed to be unsolvable by the methods of traditional empirical sciences. It has been argued that all the objects of empirical sciences can be fully analyzed in structural terms but that consciousness is (or has) something over and above its structure. However, modern neuroscience has introduced a theoretical framework in which also the apparently non-structural aspects of consciousness, namely the so called qualia or qualitative properties, can be analyzed in structural terms. That framework allows us to see qualia as something compositional with internal structures that fully determine their qualitative nature. Moreover, those internal structures can be identified which certain neural patterns. Thus consciousness as a whole can be seen as a complex neural pattern that misperceives some of its own highly complex structural properties as monadic and qualitative. Such neural pattern is analyzable in fully structural terms and thereby the hard problem is solved.
Structural qualia: a solution to the hard problem of consciousness
Directory of Open Access Journals (Sweden)
Kristjan eLoorits
2014-03-01
Full Text Available The hard problem of consciousness has been often claimed to be unsolvable by the methods of traditional empirical sciences. It has been argued that all the objects of empirical sciences can be fully analyzed in structural terms but that consciousness is (or has something over and above its structure. However, modern neuroscience has introduced a theoretical framework in which also the apparently non-structural aspects of consciousness, namely the so called qualia or qualitative properties, can be analyzed in structural terms. That framework allows us to see qualia as something compositional with internal structures that fully determine their qualitative nature. Moreover, those internal structures can be identified which certain neural patterns. Thus consciousness as a whole can be seen as a complex neural pattern that misperceives some of its own highly complex structural properties as monadic and qualitative. Such neural pattern is analyzable in fully structural terms and thereby the hard problem is solved.
Heuristics for NP-hard optimization problems - simpler is better!?
Directory of Open Access Journals (Sweden)
Žerovnik Janez
2015-11-01
Full Text Available We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at least considered as one of very natural possibilities. In this critical survey, selected examples discussed include the traveling salesman, the resource-constrained project scheduling, the channel assignment, and computation of bounds for the Shannon capacity.
Directory of Open Access Journals (Sweden)
Nelson Maculan
2003-01-01
Full Text Available We present integer linear models with a polynomial number of variables and constraints for combinatorial optimization problems in graphs: optimum elementary cycles, optimum elementary paths and optimum tree problems.Apresentamos modelos lineares inteiros com um número polinomial de variáveis e restrições para problemas de otimização combinatória em grafos: ciclos elementares ótimos, caminhos elementares ótimos e problemas em árvores ótimas.
Energy Technology Data Exchange (ETDEWEB)
Ohori, T.; Yamamoto, H.; Setsu, Nenso; Watanabe, K. (Hokkaido Inst. of Technology, Hokkaido (Japan))
1994-04-20
The accelerated approximate solution of combinatorial optimization problems by symmetry integrating hopfield neural network (NN) has been applied to many combinatorial problems such as the traveling salesman problem, the network planning problem, etc. However, the hopfield NN converges to local minimum solutions very slowly. In this paper, a general inclination model composed by introducing an accelerated parameter to the hopfield model is proposed, and it has been shown that the acceleration parameter can make the model converge to the local minima more quickly. Moreover, simulation experiments for random quadratic combinatorial problems with two and twenty-five variables were carried out. The results show that the acceleration of convergence makes the attraction region of the local minimum change and the accuracy of solution worse. If an initial point is selected around the center of unit hyper cube, solutions with high accuracy not affected by the acceleration parameter can be obtained. 9 refs., 8 figs., 3 tabs.
International Nuclear Information System (INIS)
Onomi, T; Nakajima, K
2014-01-01
We have proposed a superconducting Hopfield-type neural network for solving the N-Queens problem which is one of combinatorial optimization problems. The sigmoid-shape function of a neuron output is represented by the output of coupled SQUIDs gate consisting of a single-junction and a double-junction SQUIDs. One of the important factors for an improvement of the network performance is an improvement of a threshold characteristic of a neuron circuit. In this paper, we report an improved design of coupled SQUID gates for a superconducting neural network. A step-like function with a steep threshold at a rising edge is desirable for a neuron circuit to solve a combinatorial optimization problem. A neuron circuit is composed of two coupled SQUIDs gates with a cascade connection in order to obtain such characteristics. The designed neuron circuit is fabricated by a 2.5 kA/cm 2 Nb/AlOx/Nb process. The operation of a fabricated neuron circuit is experimentally demonstrated. Moreover, we discuss about the performance of the neural network using the improved neuron circuits and delayed negative self-connections.
DEFF Research Database (Denmark)
Nielsen, John
1994-01-01
An overview of combinatorial chemistry is presented. Combinatorial chemistry, sometimes referred to as `irrational drug design,' involves the generation of molecular diversity. The resulting chemical library is then screened for biologically active compounds.......An overview of combinatorial chemistry is presented. Combinatorial chemistry, sometimes referred to as `irrational drug design,' involves the generation of molecular diversity. The resulting chemical library is then screened for biologically active compounds....
Nuclear many-body problem with repulsive hard core interactions
Energy Technology Data Exchange (ETDEWEB)
Haddad, L M
1965-07-01
The nuclear many-body problem is considered using the perturbation-theoretic approach of Brueckner and collaborators. This approach is outlined with particular attention paid to the graphical representation of the terms in the perturbation expansion. The problem is transformed to centre-of-mass coordinates in configuration space and difficulties involved in ordinary methods of solution of the resulting equation are discussed. A new technique, the 'reference spectrum method', devised by Bethe, Brandow and Petschek in an attempt to simplify the numerical work in presented. The basic equations are derived in this approximation and considering the repulsive hard core part of the interaction only, the effective mass is calculated at high momentum (using the same energy spectrum for both 'particle' and 'hole' states). The result of 0.87m is in agreement with that of Bethe et al. A more complete treatment using the reference spectrum method in introduced and a self-consistent set of equations is established for the reference spectrum parameters again for the case of hard core repulsions. (author)
Integer and combinatorial optimization
Nemhauser, George L
1999-01-01
Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION ""This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list.""-Optima ""A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such f
Deaf and hard of hearing students' problem-solving strategies with signed arithmetic story problems.
Pagliaro, Claudia M; Ansell, Ellen
2012-01-01
The use of problem-solving strategies by 59 deaf and hard of hearing children, grades K-3, was investigated. The children were asked to solve 9 arithmetic story problems presented to them in American Sign Language. The researchers found that while the children used the same general types of strategies that are used by hearing children (i.e., modeling, counting, and fact-based strategies), they showed an overwhelming use of counting strategies for all types of problems and at all ages. This difference may have its roots in language or instruction (or in both), and calls attention to the need for conceptual rather than procedural mathematics instruction for deaf and hard of hearing students.
Yu, Xue; Chen, Wei-Neng; Gu, Tianlong; Zhang, Huaxiang; Yuan, Huaqiang; Kwong, Sam; Zhang, Jun
2017-08-07
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.
Effect of the Implicit Combinatorial Model on Combinatorial Reasoning in Secondary School Pupils.
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…
The Role of the Goal in Solving Hard Computational Problems: Do People Really Optimize?
Carruthers, Sarah; Stege, Ulrike; Masson, Michael E. J.
2018-01-01
The role that the mental, or internal, representation plays when people are solving hard computational problems has largely been overlooked to date, despite the reality that this internal representation drives problem solving. In this work we investigate how performance on versions of two hard computational problems differs based on what internal…
Excavation Technology for Hard Rock - Problems and Prospects
International Nuclear Information System (INIS)
Gillani, S.T.A.; Butt, N.
2009-01-01
Civil engineering projects have greatly benefited from the mechanical excavation of hard rock technology. Mining industry, on the other hand, is still searching for major breakthroughs to mechanize and then automate the winning of ore and drivage of access tunnels in its metalliferous sector. The aim of this study is to extend the scope of drag bits for road headers in hard rock cutting. Various factors that can impose limitations on the potential applications of drag bits in hard rock mining are investigated and discussed along with alternative technology options. (author)
Set-theoretical and Combinatorial Instruments for Problem Space Analysis in Adaptive Serious Games.
Nyamsuren, Enkhbold; van der Maas, Han L.J.; Maurer, Matthias
2018-01-01
The Computerized Adaptive Practice (CAP) system describes a set of algorithms for assessing player’s expertise and difficulties of in-game problems and for adapting the latter to the former. However, an effective use of CAP requires that in-game problems are designed carefully and refined over time
A genetic algorithm solution for combinatorial problems - the nuclear core reload example
Energy Technology Data Exchange (ETDEWEB)
Schirru, R.; Silva, F.C. [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia; Pereira, C.M.N.A. [Instituto de Engenharia Nuclear (IEN), Rio de Janeiro, RJ (Brazil); Chapot, J.L.C. [FURNAS, Rio de Janeiro, RJ (Brazil)
1997-12-01
This paper presents a solution to Traveling Salesman Problem based upon genetic algorithms (GA), using the classic crossover, but avoiding the feasibility problem in offspring individuals, allowing the natural evolution of the GA without introduction of heuristics in the genetic crossover operator. The genetic model presented, that we call the List Model (LM) is based on the encoding and decoding genotype in the way to always generate a phenotype that has a valid structure, over which will be applied the fitness, represented by the total distance. The main purpose of this work was to develop the basis for a new genetic model to be used in the reload of nuclear core of a PWR. In a generic way, this problem can be interpreted as a a search of the optimal combination of N different fuel elements in N nuclear core `holes`, where each combination or load pattern, determines the neutron flux shape and its associate peak factor. The goal is to find out the load pattern that minimizes the peak factor and consequently maximize the useful life of the nuclear fuel. The GA with the List Model was applied to the Angra-1 PWR reload problem and the results are remarkably better than the ones used in the last fuel cycle. (author). 12 refs., 3 figs., 2 tabs.
Takabe, Satoshi; Hukushima, Koji
2016-05-01
Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover (min-VC), a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of α-uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical mechanical model with a one-parameter family. Statistical mechanical analyses reveal for α=2 that the LP optimal solution is typically equal to that given by the IP below the critical average degree c=e in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result c=1 and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with α≥3, minimum vertex covers on α-uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree c=e/(α-1) where the replica symmetry is broken.
Takabe, Satoshi; Hukushima, Koji
2016-05-01
Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover (min-VC), a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of α -uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical mechanical model with a one-parameter family. Statistical mechanical analyses reveal for α =2 that the LP optimal solution is typically equal to that given by the IP below the critical average degree c =e in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result c =1 and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with α ≥3 , minimum vertex covers on α -uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree c =e /(α -1 ) where the replica symmetry is broken.
Introduction to combinatorial geometry
International Nuclear Information System (INIS)
Gabriel, T.A.; Emmett, M.B.
1985-01-01
The combinatorial geometry package as used in many three-dimensional multimedia Monte Carlo radiation transport codes, such as HETC, MORSE, and EGS, is becoming the preferred way to describe simple and complicated systems. Just about any system can be modeled using the package with relatively few input statements. This can be contrasted against the older style geometry packages in which the required input statements could be large even for relatively simple systems. However, with advancements come some difficulties. The users of combinatorial geometry must be able to visualize more, and, in some instances, all of the system at a time. Errors can be introduced into the modeling which, though slight, and at times hard to detect, can have devastating effects on the calculated results. As with all modeling packages, the best way to learn the combinatorial geometry is to use it, first on a simple system then on more complicated systems. The basic technique for the description of the geometry consists of defining the location and shape of the various zones in terms of the intersections and unions of geometric bodies. The geometric bodies which are generally included in most combinatorial geometry packages are: (1) box, (2) right parallelepiped, (3) sphere, (4) right circular cylinder, (5) right elliptic cylinder, (6) ellipsoid, (7) truncated right cone, (8) right angle wedge, and (9) arbitrary polyhedron. The data necessary to describe each of these bodies are given. As can be easily noted, there are some subsets included for simplicity
Energy Technology Data Exchange (ETDEWEB)
Meneses, Anderson Alvarenga de Moura; Schirru, Roberto [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia. Programa de Engenharia Nuclear]. E-mail: ameneses@con.ufrj.br; schirru@lmp.ufrj.br
2005-07-01
This work focuses on the usage the Artificial Intelligence technique Particle Swarm Optimization (PSO) to optimize the fuel recharge at a nuclear reactor. This is a combinatorial problem, in which the search of the best feasible solution is done by minimizing a specific objective function. However, in this first moment it is possible to compare the fuel recharge problem with the Traveling Salesman Problem (TSP), since both of them are combinatorial, with one advantage: the evaluation of the TSP objective function is much more simple. Thus, the proposed methods have been applied to two TSPs: Oliver 30 and Rykel 48. In 1995, KENNEDY and EBERHART presented the PSO technique to optimize non-linear continued functions. Recently some PSO models for discrete search spaces have been developed for combinatorial optimization. Although all of them having different formulation from the ones presented here. In this paper, we use the PSO theory associated with to the Random Keys (RK)model, used in some optimizations with Genetic Algorithms. The Particle Swarm Optimization with Random Keys (PSORK) results from this association, which combines PSO and RK. The adaptations and changings in the PSO aim to allow the usage of the PSO at the nuclear fuel recharge. This work shows the PSORK being applied to the proposed combinatorial problem and the obtained results. (author)
New Unconditional Hardness Results for Dynamic and Online Problems
DEFF Research Database (Denmark)
Clifford, Raphaël; Jørgensen, Allan Grønlund; Larsen, Kasper Green
2015-01-01
Data summarization is an effective approach to dealing with the 'big data' problem. While data summarization problems traditionally have been studied is the streaming model, the focus is starting to shift to distributed models, as distributed/parallel computation seems to be the only viable way...... to handle today's massive data sets. In this paper, we study ε-approximations, a classical data summary that, intuitively speaking, preserves approximately the density of the underlying data set over a certain range space. We consider the problem of computing ε-approximations for a data set which is held...
Hybrid IP/CP Methods for Solving Sports Scheduling Problems
DEFF Research Database (Denmark)
Rasmussen, Rasmus Vinther
2006-01-01
The field of sports scheduling comprises a challenging research areawith a great variety of hard combinatorial optimization problems andchallenging practical applications. This dissertation gives acomprehensive survey of the area and a number of new contributionsare presented. First a general sol...
Directory of Open Access Journals (Sweden)
Laxmi A. Bewoor
2017-10-01
Full Text Available The no-wait flow shop is a flowshop in which the scheduling of jobs is continuous and simultaneous through all machines without waiting for any consecutive machines. The scheduling of a no-wait flow shop requires finding an appropriate sequence of jobs for scheduling, which in turn reduces total processing time. The classical brute force method for finding the probabilities of scheduling for improving the utilization of resources may become trapped in local optima, and this problem can hence be observed as a typical NP-hard combinatorial optimization problem that requires finding a near optimal solution with heuristic and metaheuristic techniques. This paper proposes an effective hybrid Particle Swarm Optimization (PSO metaheuristic algorithm for solving no-wait flow shop scheduling problems with the objective of minimizing the total flow time of jobs. This Proposed Hybrid Particle Swarm Optimization (PHPSO algorithm presents a solution by the random key representation rule for converting the continuous position information values of particles to a discrete job permutation. The proposed algorithm initializes population efficiently with the Nawaz-Enscore-Ham (NEH heuristic technique and uses an evolutionary search guided by the mechanism of PSO, as well as simulated annealing based on a local neighborhood search to avoid getting stuck in local optima and to provide the appropriate balance of global exploration and local exploitation. Extensive computational experiments are carried out based on Taillard’s benchmark suite. Computational results and comparisons with existing metaheuristics show that the PHPSO algorithm outperforms the existing methods in terms of quality search and robustness for the problem considered. The improvement in solution quality is confirmed by statistical tests of significance.
Structured pigeonhole principle, search problems and hard tautologies
Czech Academy of Sciences Publication Activity Database
Krajíček, Jan
2005-01-01
Roč. 70, č. 2 (2005), s. 619-630 ISSN 0022-4812 R&D Projects: GA AV ČR(CZ) IAA1019401; GA MŠk(CZ) LN00A056 Institutional research plan: CEZ:AV0Z10190503 Keywords : proof complexity * pigeonhole principle * serch problems Subject RIV: BA - General Mathematics Impact factor: 0.470, year: 2005
Deaf and Hard of Hearing Students' Problem-Solving Strategies with Signed Arithmetic Story Problems
Pagliaro, Claudia M.; Ansell, Ellen
2011-01-01
The use of problem-solving strategies by 59 deaf and hard of hearing children, grades K-3, was investigated. The children were asked to solve 9 arithmetic story problems presented to them in American Sign Language. The researchers found that while the children used the same general types of strategies that are used by hearing children (i.e.,…
The Czech base of hard coal, problems, possibilities for utilization
International Nuclear Information System (INIS)
Cermak, T.; Roubicek, V.
1993-01-01
The Czech coal and power engineering base is in a deep restructuring period now. The basic problems represents the changeover from the system of the centrally planned state economy to the market model of the energy resources mining, production and consumption. The Czech economy will have to face to up to now unknown competitive forces on the coal market in Europe where American, Canadian, Australian and South African coals compete. The paper discusses historical aspects of the development of the coal mining industry in the Czechoslavakia, the present coal preparation techniques for coking coals, the coking industry, and the utilization of brown coal. How to utilize the domestic coal base and coal generally is closely connected with the global restructuralization of the Czech economy. The most difficult step of this process is undoubtedly the adaptation of the Czech fuel and energy base to the market economy conditions
Combinatorial optimization on a Boltzmann machine
Korst, J.H.M.; Aarts, E.H.L.
1989-01-01
We discuss the problem of solving (approximately) combinatorial optimization problems on a Boltzmann machine. It is shown for a number of combinatorial optimization problems how they can be mapped directly onto a Boltzmann machine by choosing appropriate connection patterns and connection strengths.
Problems in education, employment and social integration of hard of hearing artists
Directory of Open Access Journals (Sweden)
Radić-Šestić Marina
2013-01-01
Full Text Available The aim of this research was to determine the problems in education (primary, secondary and undergraduate academic studies, employment and social integration of hard of hearing artists based on a multiple case study. The sample consisted of 4 examinees of both genders, aged between 29 and 54, from the field of visual arts (a painter, a sculptor, a graphic designer, and an interior designer. The structured interview consisted of 30 questions testing three areas: the first area involved family, primary and secondary education; the second area was about the length of studying and socio-emotional problems of the examinees; the third area dealt with problems in employment and job satisfaction of our examinees. Research results indicate the existence of several problems which more or less reflect the success in education, employment and social integration of hard of hearing artists. One of the problems which can influence the development of language abilities, socioemotional maturity, and better educational achievement of hard of hearing artists in general, is prolongation in diagnosing hearing impairments, amplification and auditory rehabilitation. Furthermore, parents of hard of hearing artists have difficulties in adjusting to their children's hearing impairments and ignore the language and culture of the Deaf, i.e. they tend to identify their children with typically developing population. Another problem are negative attitudes of teachers/professors/employers and typically developing peers/ colleagues towards the inclusion of hard of hearing people into the regular education/employment system. Apart from that, unmodified instruction, course books, information, school and working area further complicate the acquisition of knowledge, information, and the progress of hard of hearing people in education and profession.
Fourier analysis in combinatorial number theory
International Nuclear Information System (INIS)
Shkredov, Il'ya D
2010-01-01
In this survey applications of harmonic analysis to combinatorial number theory are considered. Discussion topics include classical problems of additive combinatorics, colouring problems, higher-order Fourier analysis, theorems about sets of large trigonometric sums, results on estimates for trigonometric sums over subgroups, and the connection between combinatorial and analytic number theory. Bibliography: 162 titles.
Fourier analysis in combinatorial number theory
Energy Technology Data Exchange (ETDEWEB)
Shkredov, Il' ya D [M. V. Lomonosov Moscow State University, Moscow (Russian Federation)
2010-09-16
In this survey applications of harmonic analysis to combinatorial number theory are considered. Discussion topics include classical problems of additive combinatorics, colouring problems, higher-order Fourier analysis, theorems about sets of large trigonometric sums, results on estimates for trigonometric sums over subgroups, and the connection between combinatorial and analytic number theory. Bibliography: 162 titles.
Problems in accounting for the soft and hard components in transverse energy triggers
International Nuclear Information System (INIS)
Anjos, J.C.; Santoro, A.F.S.; Souza, M.H.G.; Escobar, C.O.
1983-01-01
It is argued that for a transverse energy trigger, the cancellation theorem of DeTar, Ellis and Landshoff is not valid. As a consequence, the problem of accounting for soft and hard components in this kind of trigger becomes complicated and no simple separation between them is expected. (Author) [pt
Applications of combinatorial optimization
Paschos, Vangelis Th
2013-01-01
Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aims to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. "Applications of Combinatorial Optimization" is presenting a certain number among the most common and well-known applications of Combinatorial Optimization.
Combinatorial optimization networks and matroids
Lawler, Eugene
2011-01-01
Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.
Exponential-Time Algorithms and Complexity of NP-Hard Graph Problems
DEFF Research Database (Denmark)
Taslaman, Nina Sofia
of algorithms, as well as investigations into how far such improvements can get under reasonable assumptions. The first part is concerned with detection of cycles in graphs, especially parameterized generalizations of Hamiltonian cycles. A remarkably simple Monte Carlo algorithm is presented......NP-hard problems are deemed highly unlikely to be solvable in polynomial time. Still, one can often find algorithms that are substantially faster than brute force solutions. This thesis concerns such algorithms for problems from graph theory; techniques for constructing and improving this type......, and with high probability any found solution is shortest possible. Moreover, the algorithm can be used to find a cycle of given parity through the specified elements. The second part concerns the hardness of problems encoded as evaluations of the Tutte polynomial at some fixed point in the rational plane...
Combinatorial algebra syntax and semantics
Sapir, Mark V
2014-01-01
Combinatorial Algebra: Syntax and Semantics provides a comprehensive account of many areas of combinatorial algebra. It contains self-contained proofs of more than 20 fundamental results, both classical and modern. This includes Golod–Shafarevich and Olshanskii's solutions of Burnside problems, Shirshov's solution of Kurosh's problem for PI rings, Belov's solution of Specht's problem for varieties of rings, Grigorchuk's solution of Milnor's problem, Bass–Guivarc'h theorem about the growth of nilpotent groups, Kleiman's solution of Hanna Neumann's problem for varieties of groups, Adian's solution of von Neumann-Day's problem, Trahtman's solution of the road coloring problem of Adler, Goodwyn and Weiss. The book emphasize several ``universal" tools, such as trees, subshifts, uniformly recurrent words, diagrams and automata. With over 350 exercises at various levels of difficulty and with hints for the more difficult problems, this book can be used as a textbook, and aims to reach a wide and diversified...
Ghosh, D.; Sierksma, G.
2000-01-01
Sensitivity analysis of e-optimal solutions is the problem of calculating the range within which a problem parameter may lie so that the given solution re-mains e-optimal. In this paper we study the sensitivity analysis problem for e-optimal solutions tocombinatorial optimization problems with
Computational Complexity of Combinatorial Surfaces
Vegter, Gert; Yap, Chee K.
1990-01-01
We investigate the computational problems associated with combinatorial surfaces. Specifically, we present an algorithm (based on the Brahana-Dehn-Heegaard approach) for transforming the polygonal schema of a closed triangulated surface into its canonical form in O(n log n) time, where n is the
Combinatorial optimization theory and algorithms
Korte, Bernhard
2018-01-01
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial opti...
Mitjana, Margarida
2018-01-01
This book contains the notes of the lectures delivered at an Advanced Course on Combinatorial Matrix Theory held at Centre de Recerca Matemàtica (CRM) in Barcelona. These notes correspond to five series of lectures. The first series is dedicated to the study of several matrix classes defined combinatorially, and was delivered by Richard A. Brualdi. The second one, given by Pauline van den Driessche, is concerned with the study of spectral properties of matrices with a given sign pattern. Dragan Stevanović delivered the third one, devoted to describing the spectral radius of a graph as a tool to provide bounds of parameters related with properties of a graph. The fourth lecture was delivered by Stephen Kirkland and is dedicated to the applications of the Group Inverse of the Laplacian matrix. The last one, given by Ángeles Carmona, focuses on boundary value problems on finite networks with special in-depth on the M-matrix inverse problem.
Hall, Marshall
2011-01-01
Includes proof of van der Waerden's 1926 conjecture on permanents, Wilson's theorem on asymptotic existence, and other developments in combinatorics since 1967. Also covers coding theory and its important connection with designs, problems of enumeration, and partition. Presents fundamentals in addition to latest advances, with illustrative problems at the end of each chapter. Enlarged appendixes include a longer list of block designs.
Cryptographic Combinatorial Securities Exchanges
Thorpe, Christopher; Parkes, David C.
We present a useful new mechanism that facilitates the atomic exchange of many large baskets of securities in a combinatorial exchange. Cryptography prevents information about the securities in the baskets from being exploited, enhancing trust. Our exchange offers institutions who wish to trade large positions a new alternative to existing methods of block trading: they can reduce transaction costs by taking advantage of other institutions’ available liquidity, while third party liquidity providers guarantee execution—preserving their desired portfolio composition at all times. In our exchange, institutions submit encrypted orders which are crossed, leaving a “remainder”. The exchange proves facts about the portfolio risk of this remainder to third party liquidity providers without revealing the securities in the remainder, the knowledge of which could also be exploited. The third parties learn either (depending on the setting) the portfolio risk parameters of the remainder itself, or how their own portfolio risk would change if they were to incorporate the remainder into a portfolio they submit. In one setting, these third parties submit bids on the commission, and the winner supplies necessary liquidity for the entire exchange to clear. This guaranteed clearing, coupled with external price discovery from the primary markets for the securities, sidesteps difficult combinatorial optimization problems. This latter method of proving how taking on the remainder would change risk parameters of one’s own portfolio, without revealing the remainder’s contents or its own risk parameters, is a useful protocol of independent interest.
Neural Meta-Memes Framework for Combinatorial Optimization
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).
Hu, T C
2002-01-01
Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9
Handelman's hierarchy for the maximum stable set problem
Laurent, M.; Sun, Z.
2014-01-01
The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of linear programming relaxations for this problem, based on a
Combinatorial optimization games
Energy Technology Data Exchange (ETDEWEB)
Deng, X. [York Univ., North York, Ontario (Canada); Ibaraki, Toshihide; Nagamochi, Hiroshi [Kyoto Univ. (Japan)
1997-06-01
We introduce a general integer programming formulation for a class of combinatorial optimization games, which immediately allows us to improve the algorithmic result for finding amputations in the core (an important solution concept in cooperative game theory) of the network flow game on simple networks by Kalai and Zemel. An interesting result is a general theorem that the core for this class of games is nonempty if and only if a related linear program has an integer optimal solution. We study the properties for this mathematical condition to hold for several interesting problems, and apply them to resolve algorithmic and complexity issues for their cores along the line as put forward in: decide whether the core is empty; if the core is empty, find an imputation in the core; given an imputation x, test whether x is in the core. We also explore the properties of totally balanced games in this succinct formulation of cooperative games.
Directory of Open Access Journals (Sweden)
Eneko Osaba
2016-12-01
Full Text Available This paper aims to give a presentation of the PhD defended by Eneko Osaba on November 16th, 2015, at the University of Deusto. The thesis can be placed in the field of artificial intelligence. Specifically, it is related with multi- population meta-heuristics for solving vehicle routing problems. The dissertation was held in the main auditorium of the University, in a publicly open presentation. After the presentation, Eneko was awarded with the highest grade (cum laude. Additionally, Eneko obtained the PhD obtaining award granted by the Basque Government through.
Conferences on Combinatorial and Additive Number Theory
2014-01-01
This proceedings volume is based on papers presented at the Workshops on Combinatorial and Additive Number Theory (CANT), which were held at the Graduate Center of the City University of New York in 2011 and 2012. The goal of the workshops is to survey recent progress in combinatorial number theory and related parts of mathematics. The workshop attracts researchers and students who discuss the state-of-the-art, open problems, and future challenges in number theory.
Jack superpolynomials: physical and combinatorial definitions
International Nuclear Information System (INIS)
Desrosiers, P.; Mathieu, P.; Lapointe, L.
2004-01-01
Jack superpolynomials are eigenfunctions of the supersymmetric extension of the quantum trigonometric Calogero-Moser-Sutherland Hamiltonian. They are orthogonal with respect to the scalar product, dubbed physical, that is naturally induced by this quantum-mechanical problem. But Jack superpolynomials can also be defined more combinatorially, starting from the multiplicative bases of symmetric superpolynomials, enforcing orthogonality with respect to a one-parameter deformation of the combinatorial scalar product. Both constructions turn out to be equivalent. (author)
Combinatorial commutative algebra
Miller, Ezra
2005-01-01
Offers an introduction to combinatorial commutative algebra, focusing on combinatorial techniques for multigraded polynomial rings, semigroup algebras, and determined rings. The chapters in this work cover topics ranging from homological invariants of monomial ideals and their polyhedral resolutions, to tools for studying algebraic varieties.
Dynamic combinatorial chemistry
Otto, Sijbren; Furlan, Ricardo L.E.; Sanders, Jeremy K.M.
2002-01-01
A combinatorial library that responds to its target by increasing the concentration of strong binders at the expense of weak binders sounds ideal. Dynamic combinatorial chemistry has the potential to achieve exactly this. In this review, we will highlight the unique features that distinguish dynamic
The linear ordering problem: an algorithm for the optimal solution ...
African Journals Online (AJOL)
In this paper we describe and implement an algorithm for the exact solution of the Linear Ordering problem. Linear Ordering is the problem of finding a linear order of the nodes of a graph such that the sum of the weights which are consistent with this order is as large as possible. It is an NP - Hard combinatorial optimisation ...
A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows
Directory of Open Access Journals (Sweden)
N. Rincon-Garcia
2017-01-01
Full Text Available This article paper presents a hybrid metaheuristic algorithm to solve the time-dependent vehicle routing problem with hard time windows. Time-dependent travel times are influenced by different congestion levels experienced throughout the day. Vehicle scheduling without consideration of congestion might lead to underestimation of travel times and consequently missed deliveries. The algorithm presented in this paper makes use of Large Neighbourhood Search approaches and Variable Neighbourhood Search techniques to guide the search. A first stage is specifically designed to reduce the number of vehicles required in a search space by the reduction of penalties generated by time-window violations with Large Neighbourhood Search procedures. A second stage minimises the travel distance and travel time in an ‘always feasible’ search space. Comparison of results with available test instances shows that the proposed algorithm is capable of obtaining a reduction in the number of vehicles (4.15%, travel distance (10.88% and travel time (12.00% compared to previous implementations in reasonable time.
Well-solvable special cases of the Traveling Salesman Problem : a survey
Burkard, R.E.; Deineko, V.G.; Dal, van R.; Veen, van der J.A.A.; Woeginger, G.J.
1998-01-01
The traveling salesman problem (TSP) belongs to the most basic, most important, and most investigated problems in combinatorial optimization. Although it is an ${\\cal NP}$-hard problem, many of its special cases can be solved efficiently in polynomial time. We survey these special cases with
Quantum Resonance Approach to Combinatorial Optimization
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.
Nonparametric combinatorial sequence models.
Wauthier, Fabian L; Jordan, Michael I; Jojic, Nebojsa
2011-11-01
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 article 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 biological sequence families 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 over sequence representations induced by the prior. By integrating out the posterior, our method compares favorably to leading binding predictors.
Marshall, Matthew M.; Carrano, Andres L.; Dannels, Wendy A.
2016-01-01
Individuals who are deaf and hard-of-hearing (DHH) are underrepresented in science, technology, engineering, and mathematics (STEM) professions, and this may be due in part to their level of preparation in the development and retention of mathematical and problem-solving skills. An approach was developed that incorporates experiential learning and…
DEFF Research Database (Denmark)
Larsen, Jesper Abildgaard; Wisniewski, Rafal; Grunnet, Jacob Deleuran
2008-01-01
indicates for a given face the future simplex. In the suggested definition we allow nondeterminacy in form of splitting and merging of solution trajectories. The combinatorial vector field gives rise to combinatorial counterparts of most concepts from dynamical systems, such as duals to vector fields, flow......, flow lines, fixed points and Lyapunov functions. Finally it will be shown how this theory extends to switched dynamical systems and an algorithmic overview of how to do supervisory control will be shown towards the end....
Music algorithm for imaging of a sound-hard arc in limited-view inverse scattering problem
Park, Won-Kwang
2017-07-01
MUltiple SIgnal Classification (MUSIC) algorithm for a non-iterative imaging of sound-hard arc in limited-view inverse scattering problem is considered. In order to discover mathematical structure of MUSIC, we derive a relationship between MUSIC and an infinite series of Bessel functions of integer order. This structure enables us to examine some properties of MUSIC in limited-view problem. Numerical simulations are performed to support the identified structure of MUSIC.
A taxing problem: the complementary use of hard and soft OR in public policy
Cooper, C; Brown, J; Pidd, M
2004-01-01
A review of the UK personal taxation system used a combination of hard and soft OR approaches in a complementary way. The hard OR was based on data mining to increase understanding of individual taxpayers and their changing needs within the personal tax system. The soft OR was based on soft systems methodology with two aims in mind. First, to guide the review and, secondly, as an auditable approach for collecting the views of key internal and external stakeholders. The soft and hard OR were u...
Use of Software Programs as Zero Fill Help in Overcoming the Problem Around Hard Drive
Eko Prasetyo Nugroho; Fivtatianti Fivtatianti, Skom, MM
2003-01-01
Zero Fill, is a software tool programs that are designed for hard disk drive specially branded Quantum. This software is a tool programs that function to format the hard drive. Where is the type of format here is the first format or in other words the software to format the hard drive is working under conditions of low- level or commonly referred to as a low- level format. The advantages of this software is able to fix and remove all existing data within the disk, such as files...
Mental health problems among the survivors in the hard-hit areas of the Yushu earthquake.
Directory of Open Access Journals (Sweden)
Zhen Zhang
Full Text Available BACKGROUND: On April 14, 2010, an earthquake registering 7.1 on the Richter scale shook Qinghai Province in southwest China. The earthquake caused numerous casualties and much damage. The epicenter, Yushu County, suffered the most severe damage. As a part of the psychological relief work, the present study evaluated the mental health statuses of the people affected and identified the mental disorder risk factors related to earthquakes. METHODS: Five hundred and five earthquake survivors living in Yushu County were investigated 3-4 months after the earthquake. Participant demographic data including gender, age, marital status, ethnicity, educational level, and religious beliefs were collected. The Earthquake-Specific Trauma Exposure Indicators assessed the intensity of exposure to trauma during the earthquake. The PTSD Checklist-Civilian version (PCL-C and the Hopkins Symptoms Checklist-25 (HSCL-25 assessed the symptoms and prevalence rates of probable Posttraumatic Stress Disorder (PTSD as well as anxiety and depression, respectively. The Perceived Social Support Scale (PSSS evaluated subjective social support. RESULTS: The prevalence rates of probable PTSD, anxiety, and depression were 33.7%, 43.8% and 38.6%, respectively. Approximately one fifth of participants suffered from all three conditions. Individuals who were female, felt initial fear during the earthquake, and had less social support were the most likely to have poor mental health. CONCLUSIONS: The present study revealed that there are serious mental problems among the hard-hit survivors of the Yushu earthquake. Survivors at high risk for mental disorders should be specifically considered. The present study provides useful information for rebuilding and relief work.
Gebremedhin, Daniel H; Weatherford, Charles A
2015-02-01
This is a response to the comment we received on our recent paper "Calculations for the one-dimensional soft Coulomb problem and the hard Coulomb limit." In that paper, we introduced a computational algorithm that is appropriate for solving stiff initial value problems, and which we applied to the one-dimensional time-independent Schrödinger equation with a soft Coulomb potential. We solved for the eigenpairs using a shooting method and hence turned it into an initial value problem. In particular, we examined the behavior of the eigenpairs as the softening parameter approached zero (hard Coulomb limit). The commenters question the existence of the ground state of the hard Coulomb potential, which we inferred by extrapolation of the softening parameter to zero. A key distinction between the commenters' approach and ours is that they consider only the half-line while we considered the entire x axis. Based on mathematical considerations, the commenters consider only a vanishing solution function at the origin, and they question our conclusion that the ground state of the hard Coulomb potential exists. The ground state we inferred resembles a δ(x), and hence it cannot even be addressed based on their argument. For the excited states, there is agreement with the fact that the particle is always excluded from the origin. Our discussion with regard to the symmetry of the excited states is an extrapolation of the soft Coulomb case and is further explained herein.
Probabilistic methods in combinatorial analysis
Sachkov, Vladimir N
2014-01-01
This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorems. The basic objects under investigation are nonnegative matrices, partitions and mappings of finite sets, with special emphasis on permutations and graphs, and equivalence classes specified on sequences of finite length consisting of elements of partially ordered sets; these specify the probabilist
Causal gene identification using combinatorial V-structure search.
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.
ALE-PSO: An Adaptive Swarm Algorithm to Solve Design Problems of Laminates
Directory of Open Access Journals (Sweden)
Paolo Vannucci
2009-04-01
Full Text Available This paper presents an adaptive PSO algorithm whose numerical parameters can be updated following a scheduled protocol respecting some known criteria of convergence in order to enhance the chances to reach the global optimum of a hard combinatorial optimization problem, such those encountered in global optimization problems of composite laminates. Some examples concerning hard design problems are provided, showing the effectiveness of the approach.
Directory of Open Access Journals (Sweden)
Boldachev Alexander
2015-01-01
Full Text Available Any low-level processes, the sequence of chemical interactions in a living cell, muscle cellular activity, processor commands or neuron interaction, is possible only if there is a downward causality, only due to uniting and controlling power of the highest level. Therefore, there is no special “hard problem of consciousness”, i.e. the problem of relation of ostensibly purely biological materiality and non-causal mentality - we have only the single philosophical problem of relation between the upward and downward causalities, the problem of interrelation between hierarchic levels of existence. It is necessary to conclude that the problem of determinacy of chemical processes by the biological ones and the problem of neuron interactions caused by consciousness are of one nature and must have one solution.
Combinatorial designs a tribute to Haim Hanani
Hartman, A
1989-01-01
Haim Hanani pioneered the techniques for constructing designs and the theory of pairwise balanced designs, leading directly to Wilson''s Existence Theorem. He also led the way in the study of resolvable designs, covering and packing problems, latin squares, 3-designs and other combinatorial configurations.The Hanani volume is a collection of research and survey papers at the forefront of research in combinatorial design theory, including Professor Hanani''s own latest work on Balanced Incomplete Block Designs. Other areas covered include Steiner systems, finite geometries, quasigroups, and t-designs.
A Model of Students' Combinatorial Thinking
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…
Introduction to combinatorial designs
Wallis, WD
2007-01-01
Combinatorial theory is one of the fastest growing areas of modern mathematics. Focusing on a major part of this subject, Introduction to Combinatorial Designs, Second Edition provides a solid foundation in the classical areas of design theory as well as in more contemporary designs based on applications in a variety of fields. After an overview of basic concepts, the text introduces balanced designs and finite geometries. The author then delves into balanced incomplete block designs, covering difference methods, residual and derived designs, and resolvability. Following a chapter on the e
Horeni, O.; Arentze, T.A.; Dellaert, B.G.C.; Timmermans, H.J.P.
2014-01-01
This paper introduces the online Causal Network Elicitation Technique (CNET), as a technique for measuring components of mental representations of choice tasks and compares it with the more common technique of online 'hard' laddering (HL). While CNET works in basically two phases, one in open
Torus actions, combinatorial topology, and homological algebra
International Nuclear Information System (INIS)
Bukhshtaber, V M; Panov, T E
2000-01-01
This paper is a survey of new results and open problems connected with fundamental combinatorial concepts, including polytopes, simplicial complexes, cubical complexes, and arrangements of subspaces. Attention is concentrated on simplicial and cubical subdivisions of manifolds, and especially on spheres. Important constructions are described that enable one to study these combinatorial objects by using commutative and homological algebra. The proposed approach to combinatorial problems is based on the theory of moment-angle complexes recently developed by the authors. The crucial construction assigns to each simplicial complex K with m vertices a T m -space Z K with special bigraded cellular decomposition. In the framework of this theory, well-known non-singular toric varieties arise as orbit spaces of maximally free actions of subtori on moment-angle complexes corresponding to simplicial spheres. It is shown that diverse invariants of simplicial complexes and related combinatorial-geometric objects can be expressed in terms of bigraded cohomology rings of the corresponding moment-angle complexes. Finally, it is shown that the new relationships between combinatorics, geometry, and topology lead to solutions of some well-known topological problems
Energy Technology Data Exchange (ETDEWEB)
Pan, Feng [Los Alamos National Laboratory; Kasiviswanathan, Shiva [Los Alamos National Laboratory
2010-01-01
In the matrix interdiction problem, a real-valued matrix and an integer k is given. The objective is to remove k columns such that the sum over all rows of the maximum entry in each row is minimized. This combinatorial problem is closely related to bipartite network interdiction problem which can be applied to prioritize the border checkpoints in order to minimize the probability that an adversary can successfully cross the border. After introducing the matrix interdiction problem, we will prove the problem is NP-hard, and even NP-hard to approximate with an additive n{gamma} factor for a fixed constant {gamma}. We also present an algorithm for this problem that achieves a factor of (n-k) mUltiplicative approximation ratio.
Infinitary Combinatory Reduction Systems
DEFF Research Database (Denmark)
Ketema, Jeroen; Simonsen, Jakob Grue
2011-01-01
We define infinitary Combinatory Reduction Systems (iCRSs), thus providing the first notion of infinitary higher-order rewriting. The systems defined are sufficiently general that ordinary infinitary term rewriting and infinitary ¿-calculus are special cases. Furthermore,we generalise a number...
Manipulating Combinatorial Structures.
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…
Enabling high performance computational science through combinatorial algorithms
International Nuclear Information System (INIS)
Boman, Erik G; Bozdag, Doruk; Catalyurek, Umit V; Devine, Karen D; Gebremedhin, Assefaw H; Hovland, Paul D; Pothen, Alex; Strout, Michelle Mills
2007-01-01
The Combinatorial Scientific Computing and Petascale Simulations (CSCAPES) Institute is developing algorithms and software for combinatorial problems that play an enabling role in scientific and engineering computations. Discrete algorithms will be increasingly critical for achieving high performance for irregular problems on petascale architectures. This paper describes recent contributions by researchers at the CSCAPES Institute in the areas of load balancing, parallel graph coloring, performance improvement, and parallel automatic differentiation
Enabling high performance computational science through combinatorial algorithms
Energy Technology Data Exchange (ETDEWEB)
Boman, Erik G [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Bozdag, Doruk [Biomedical Informatics, and Electrical and Computer Engineering, Ohio State University (United States); Catalyurek, Umit V [Biomedical Informatics, and Electrical and Computer Engineering, Ohio State University (United States); Devine, Karen D [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Gebremedhin, Assefaw H [Computer Science and Center for Computational Science, Old Dominion University (United States); Hovland, Paul D [Mathematics and Computer Science Division, Argonne National Laboratory (United States); Pothen, Alex [Computer Science and Center for Computational Science, Old Dominion University (United States); Strout, Michelle Mills [Computer Science, Colorado State University (United States)
2007-07-15
The Combinatorial Scientific Computing and Petascale Simulations (CSCAPES) Institute is developing algorithms and software for combinatorial problems that play an enabling role in scientific and engineering computations. Discrete algorithms will be increasingly critical for achieving high performance for irregular problems on petascale architectures. This paper describes recent contributions by researchers at the CSCAPES Institute in the areas of load balancing, parallel graph coloring, performance improvement, and parallel automatic differentiation.
Goldengorin, B.; Ghosh, D.
Maximization of submodular functions on a ground set is a NP-hard combinatorial optimization problem. Data correcting algorithms are among the several algorithms suggested for solving this problem exactly and approximately. From the point of view of Hasse diagrams data correcting algorithms use
Energy Technology Data Exchange (ETDEWEB)
Gevorkyan, A. S., E-mail: g-ashot@sci.am; Sahakyan, V. V. [National Academy of Sciences of the Republic of Armenia, Institute for Informatics and Automation Problems (Armenia)
2017-03-15
We study the classical 1D Heisenberg spin glasses in the framework of nearest-neighboring model. Based on the Hamilton equations we obtained the system of recurrence equations which allows to perform node-by-node calculations of a spin-chain. It is shown that calculations from the first principles of classical mechanics lead to ℕℙ hard problem, that however in the limit of the statistical equilibrium can be calculated by ℙ algorithm. For the partition function of the ensemble a new representation is offered in the form of one-dimensional integral of spin-chains’ energy distribution.
The actual problems of the standardization of magnetically hard materials and permanent magnets
International Nuclear Information System (INIS)
Kurbatov, P.A.; Podolskiy, I.D.
1998-01-01
The standardization of industrial products raises their accordance with functional purpose, contributes to technological developments and the elimination of technical barriers in trade. The progress of the world trade necessitates the certification of permanent magnets and their manufacturing methods. According to ISO/IEC recommendations, the certification standards should contain the clear requirements to operation parameters of products, that can be impartially controlled. The testing procedures should be clearly formulated and assure that the results may be reproduced. This calls for creation of a system of interconnected certification standards: the standard for technical characteristics of prospective commercial magnetically hard materials, the standard specifications for permanent magnets, the standards for typical testing procedures and the standards for metrological assurance of measurements. (orig.)
On the problem of creation of structural materials on the basis of hard alloys
International Nuclear Information System (INIS)
Kajbyshev, O.A.; Merzhanov, A.G.; Zaripov, N.G.; Bloshenko, V.N.; Bokij, V.A.; Efimov, O.Yu.
1992-01-01
Chemical composition and structure of refractory skeletons produced by the methods of self-propagating high temperature synthesis (SHS) and powder metallurgy were studied for their effects on high temperature mechanical properties hard alloys on these skeletons base. Porous skeletons were obtained on the base of TiC 0.55 ; TiC 0.65 ; TiC 0.75 ; TiC 0.85 and TiC 1.0 carbides with their subsequent impregnation with heat resisting nickel base alloy ZhS6U. It was shown that a sintered skeleton was prone to fracture while SHS-skeleton preserved its structure. Optimal operating temperature of materials considered was noted to depend on the temperatures of brittle-ductile transition and transition into superplastic stable of refractory phase
A Heuristic Design Information Sharing Framework for Hard Discrete Optimization Problems
National Research Council Canada - National Science Library
Jacobson, Sheldon H
2007-01-01
.... This framework has been used to gain new insights into neighborhood structure designs that allow different neighborhood functions to share information when using the same heuristic applied to the same problem...
A Hard Road: Driving Local Action against Alcohol Related Problems in a Rural Town
Directory of Open Access Journals (Sweden)
Julaine Allan
2012-12-01
Full Text Available Context is important in developing strategies to address alcohol related violence. Knowledge of local conditions is critical to action in rural areas. The aim of this study was to gather information about context specific alcohol related problems experienced by frontline workers in a regional centre to inform the local alcohol action plan. Frontline workers were invited to participate in one of five focus group discussions that investigated problems experienced as a result of other people’s alcohol use. Alcohol related problems were more frequently associated with time periods than any single group in the community. Social media was used to incite arguments between groups in different venues during the lock-out periods. The focus groups identified that the location of licensed premises and a taxi rank; and previous relationships between protagonists were the key contextual factors causing alcohol related problems. A second taxi rank was identified as a useful local management strategy. Supply reduction was suggested as a key factor in long term solutions to alcohol related problems in rural towns. The local liquor accord did not want to reduce supply of alcohol by closing late night venues earlier. Local action to reduce alcohol related problems will be limited to pragmatic solutions because supply reduction is unacceptable to those in the business of selling alcohol.
arXiv Spin models in complex magnetic fields: a hard sign problem
de Forcrand, Philippe
2018-01-01
Coupling spin models to complex external fields can give rise to interesting phenomena like zeroes of the partition function (Lee-Yang zeroes, edge singularities) or oscillating propagators. Unfortunately, it usually also leads to a severe sign problem that can be overcome only in special cases; if the partition function has zeroes, the sign problem is even representation-independent at these points. In this study, we couple the N-state Potts model in different ways to a complex external magnetic field and discuss the above mentioned phenomena and their relations based on analytic calculations (1D) and results obtained using a modified cluster algorithm (general D) that in many cases either cures or at least drastically reduces the sign-problem induced by the complex external field.
Marshall, Matthew M; Carrano, Andres L; Dannels, Wendy A
2016-10-01
Individuals who are deaf and hard-of-hearing (DHH) are underrepresented in science, technology, engineering, and mathematics (STEM) professions, and this may be due in part to their level of preparation in the development and retention of mathematical and problem-solving skills. An approach was developed that incorporates experiential learning and best practices of STEM instruction to give first-year DHH students enrolled in a postsecondary STEM program the opportunity to develop problem-solving skills in real-world scenarios. Using an industrial engineering laboratory that provides manufacturing and warehousing environments, students were immersed in real-world scenarios in which they worked on teams to address prescribed problems encountered during the activities. The highly structured, Plan-Do-Check-Act approach commonly used in industry was adapted for the DHH student participants to document and communicate the problem-solving steps. Students who experienced the intervention realized a 14.6% improvement in problem-solving proficiency compared with a control group, and this gain was retained at 6 and 12 months, post-intervention. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.
Comment on "Calculations for the one-dimensional soft Coulomb problem and the hard Coulomb limit".
Carrillo-Bernal, M A; Núñez-Yépez, H N; Salas-Brito, A L; Solis, Didier A
2015-02-01
In the referred paper, the authors use a numerical method for solving ordinary differential equations and a softened Coulomb potential -1/√[x(2)+β(2)] to study the one-dimensional Coulomb problem by approaching the parameter β to zero. We note that even though their numerical findings in the soft potential scenario are correct, their conclusions do not extend to the one-dimensional Coulomb problem (β=0). Their claims regarding the possible existence of an even ground state with energy -∞ with a Dirac-δ eigenfunction and of well-defined parity eigenfunctions in the one-dimensional hydrogen atom are questioned.
Distributing the computation in combinatorial optimization experiments over the cloud
Mario Brcic; Nikica Hlupic; Nenad Katanic
2017-01-01
Combinatorial optimization is an area of great importance since many of the real-world problems have discrete parameters which are part of the objective function to be optimized. Development of combinatorial optimization algorithms is guided by the empirical study of the candidate ideas and their performance over a wide range of settings or scenarios to infer general conclusions. Number of scenarios can be overwhelming, especially when modeling uncertainty in some of the problem’s parameters....
Combinatorial methods for advanced materials research and development
Energy Technology Data Exchange (ETDEWEB)
Cremer, R.; Dondorf, S.; Hauck, M.; Horbach, D.; Kaiser, M.; Krysta, S.; Kyrylov, O.; Muenstermann, E.; Philipps, M.; Reichert, K.; Strauch, G. [Rheinisch-Westfaelische Technische Hochschule Aachen (Germany). Lehrstuhl fuer Theoretische Huettenkunde
2001-10-01
The applicability of combinatorial methods in developing advanced materials is illustrated presenting four examples for the deposition and characterization of one- and two-dimensionally laterally graded coatings, which were deposited by means of (reactive) magnetron sputtering and plasma-enhanced chemical vapor deposition. To emphasize the advantages of combinatorial approaches, metastable hard coatings like (Ti,Al)N and (Ti,Al,Hf)N respectively, as well as Ge-Sb-Te based films for rewritable optical data storage were investigated with respect to the relations between structure, composition, and the desired materials properties. (orig.)
A new approach for solution of vehicle routing problem with hard ...
Indian Academy of Sciences (India)
SERAP ERCAN CжMERT
2017-11-27
Nov 27, 2017 ... to deal with a large size real problem and to solve it in a short time using the exact method. Finally .... programming model was used for VRPTW with pickup and ...... [3] Han J and Kamber M 2001 Data mining and concepts.
Directory of Open Access Journals (Sweden)
Igor V. Protasov
2013-09-01
$\\Delta(A=\\{g\\in G:|gA\\cap A|=\\infty\\}$. The mapping $\\Delta:\\mathcal{P}_G\\rightarrow\\mathcal{P}_G$, $A\\mapsto\\Delta(A$, is called a combinatorial derivation and can be considered as an analogue of the topological derivation $d:\\mathcal{P}_X\\rightarrow\\mathcal{P}_X$, $A\\mapsto A^d$, where $X$ is a topological space and $A^d$ is the set of all limit points of $A$. Content: elementary properties, thin and almost thin subsets, partitions, inverse construction and $\\Delta$-trajectories, $\\Delta$ and $d$.
Dynamic Combinatorial Chemistry
DEFF Research Database (Denmark)
Lisbjerg, Micke
This thesis is divided into seven chapters, which can all be read individually. The first chapter, however, contains a general introduction to the chemistry used in the remaining six chapters, and it is therefore recommended to read chapter one before reading the other chapters. Chapter 1...... is a general introductory chapter for the whole thesis. The history and concepts of dynamic combinatorial chemistry are described, as are some of the new and intriguing results recently obtained. Finally, the properties of a broad range of hexameric macrocycles are described in detail. Chapter 2 gives...
Boltzmann Oracle for Combinatorial Systems
Pivoteau , Carine; Salvy , Bruno; Soria , Michèle
2008-01-01
International audience; Boltzmann random generation applies to well-deﬁned systems of recursive combinatorial equations. It relies on oracles giving values of the enumeration generating series inside their disk of convergence. We show that the combinatorial systems translate into numerical iteration schemes that provide such oracles. In particular, we give a fast oracle based on Newton iteration.
Polyhedral and semidefinite programming methods in combinatorial optimization
Tunçel, Levent
2010-01-01
Since the early 1960s, polyhedral methods have played a central role in both the theory and practice of combinatorial optimization. Since the early 1990s, a new technique, semidefinite programming, has been increasingly applied to some combinatorial optimization problems. The semidefinite programming problem is the problem of optimizing a linear function of matrix variables, subject to finitely many linear inequalities and the positive semidefiniteness condition on some of the matrix variables. On certain problems, such as maximum cut, maximum satisfiability, maximum stable set and geometric r
Approximation and hardness results for the maximum edge q-coloring problem
DEFF Research Database (Denmark)
Adamaszek, Anna Maria; Popa, Alexandru
2016-01-01
We consider the problem of coloring edges of a graph subject to the following constraints: for every vertex v, all the edges incident with v have to be colored with at most q colors. The goal is to find a coloring satisfying the above constraints and using the maximum number of colors. Notice...... ϵ>0 and any q≥2 assuming the unique games conjecture (UGC), or 1+−ϵ for any ϵ>0 and any q≥3 (≈1.19 for q=2) assuming P≠NP. These results hold even when the considered graphs are bipartite. On the algorithmic side, we restrict to the case q=2, since this is the most important in practice and we show...... a 5/3-approximation algorithm for graphs which have a perfect matching....
Why is risk communication hardly applied in Japan? Psychological problem of scientific experts
International Nuclear Information System (INIS)
Kosugi, Motoko; Tsuchiya, Tomoko; Taniguchi, Taketoshi
2000-01-01
The purpose of this paper is to discuss the problems that impair to communicate about technological risks with the public in Japan, especially focusing on views of experts as a supplier of risk information. In this study, we also clarified through the questionnaire surveys that there were significant differences of risk perception and of information environment about science and technology between the public and scientific experts, as many previous studies showed. And most important fact is that experts perceive the difference in risk perception between the public and experts larger than the public does. We conclude that this experts' cognition impedes to take a first step toward communicating with the public about technological risks. (author)
An Investigation into Post-Secondary Students' Understanding of Combinatorial Questions
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…
Burrows, J.; Johnson, V.; Henckel, D.
2016-01-01
Work Hard / Play Hard was a participatory performance/workshop or CPD experience hosted by interdisciplinary arts atelier WeAreCodeX, in association with AntiUniversity.org. As a socially/economically engaged arts practice, Work Hard / Play Hard challenged employees/players to get playful, or go to work. 'The game changes you, you never change the game'. Employee PLAYER A 'The faster the better.' Employer PLAYER B
Measuring systems of hard to get objects: problems with analysis of measurement results
Gilewska, Grazyna
2005-02-01
The problem accessibility of metrological parameters features of objects appeared in many measurements. Especially if it is biological object which parameters very often determined on the basis of indirect research. Accidental component predominate in forming of measurement results with very limited access to measurement objects. Every measuring process has a lot of conditions limiting its abilities to any way processing (e.g. increase number of measurement repetition to decrease random limiting error). It may be temporal, financial limitations, or in case of biological object, small volume of sample, influence measuring tool and observers on object, or whether fatigue effects e.g. at patient. It's taken listing difficulties into consideration author worked out and checked practical application of methods outlying observation reduction and next innovative methods of elimination measured data with excess variance to decrease of mean standard deviation of measured data, with limited aomunt of data and accepted level of confidence. Elaborated methods wee verified on the basis of measurement results of knee-joint width space got from radiographs. Measurements were carried out by indirectly method on the digital images of radiographs. Results of examination confirmed legitimacy to using of elaborated methodology and measurement procedures. Such methodology has special importance when standard scientific ways didn't bring expectations effects.
Gent, Tiejo van
2012-01-01
The aim of this thesis is to expand the knowledge of mental health problems with deaf and severely hard of hearing children and adolescents in the following domains: 1. The prevalence of mental health problems; 2. Specific intra- and interpersonal aspects of pathogenesis; 3. characteristics of the
Gems of combinatorial optimization and graph algorithms
Skutella, Martin; Stiller, Sebastian; Wagner, Dorothea
2015-01-01
Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar? Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science? Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks. This ...
Evolving hard problems: Generating human genetics datasets with a complex etiology
Directory of Open Access Journals (Sweden)
Himmelstein Daniel S
2011-07-01
Full Text Available Abstract Background A goal of human genetics is to discover genetic factors that influence individuals' susceptibility to common diseases. Most common diseases are thought to result from the joint failure of two or more interacting components instead of single component failures. This greatly complicates both the task of selecting informative genetic variants and the task of modeling interactions between them. We and others have previously developed algorithms to detect and model the relationships between these genetic factors and disease. Previously these methods have been evaluated with datasets simulated according to pre-defined genetic models. Results Here we develop and evaluate a model free evolution strategy to generate datasets which display a complex relationship between individual genotype and disease susceptibility. We show that this model free approach is capable of generating a diverse array of datasets with distinct gene-disease relationships for an arbitrary interaction order and sample size. We specifically generate eight-hundred Pareto fronts; one for each independent run of our algorithm. In each run the predictiveness of single genetic variation and pairs of genetic variants have been minimized, while the predictiveness of third, fourth, or fifth-order combinations is maximized. Two hundred runs of the algorithm are further dedicated to creating datasets with predictive four or five order interactions and minimized lower-level effects. Conclusions This method and the resulting datasets will allow the capabilities of novel methods to be tested without pre-specified genetic models. This allows researchers to evaluate which methods will succeed on human genetics problems where the model is not known in advance. We further make freely available to the community the entire Pareto-optimal front of datasets from each run so that novel methods may be rigorously evaluated. These 76,600 datasets are available from http://discovery.dartmouth.edu/model_free_data/.
DEFF Research Database (Denmark)
Larsen, Peter Gorm; Lausdahl, Kenneth; Battle, Nick
2010-01-01
by forgotten preconditions as well as broken invariants and post-conditions. Trace definitions are defined as regular expressions describing possible sequences of operation calls, and are conceptually similar to UML sequence diagrams. In this paper we present a tool enabling test automation based on VDM traces......Abstract—Combinatorial testing in VDM involves the automatic generation and execution of a large collection of test cases derived from templates provided in the form of trace definitions added to a VDM specification. The main value of this is the rapid detection of run-time errors caused......, and explain how it is possible to reduce large collections of test cases in different ways. Its use is illustrated with a small case study....
On an extension of a combinatorial identity
Indian Academy of Sciences (India)
to an infinite family of 4-way combinatorial identities. In some particular cases we get even 5-way combinatorial identities which give us four new combinatorial versions of. Göllnitz–Gordon identities. Keywords. n-Color partitions; lattice paths; Frobenius partitions; Göllnitz–Gordon identities; combinatorial interpretations. 1.
Dynamical System Approaches to Combinatorial Optimization
DEFF Research Database (Denmark)
Starke, Jens
2013-01-01
of large times as an asymptotically stable point of the dynamics. The obtained solutions are often not globally optimal but good approximations of it. Dynamical system and neural network approaches are appropriate methods for distributed and parallel processing. Because of the parallelization......Several dynamical system approaches to combinatorial optimization problems are described and compared. These include dynamical systems derived from penalty methods; the approach of Hopfield and Tank; self-organizing maps, that is, Kohonen networks; coupled selection equations; and hybrid methods...... thereof can be used as models for many industrial problems like manufacturing planning and optimization of flexible manufacturing systems. This is illustrated for an example in distributed robotic systems....
Confluence of an extension of combinatory logic by Boolean constants
DEFF Research Database (Denmark)
Czajka, Łukasz
2017-01-01
We show confluence of a conditional term rewriting system CL-pc1, which is an extension of Combinatory Logic by Boolean constants. This solves problem 15 from the RTA list of open problems. The proof has been fully formalized in the Coq proof assistant....
Combinatorial Nano-Bio Interfaces.
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 designs constructions and analysis
Stinson, Douglas R
2004-01-01
Created to teach students many of the most important techniques used for constructing combinatorial designs, this is an ideal textbook for advanced undergraduate and graduate courses in combinatorial design theory. The text features clear explanations of basic designs, such as Steiner and Kirkman triple systems, mutual orthogonal Latin squares, finite projective and affine planes, and Steiner quadruple systems. In these settings, the student will master various construction techniques, both classic and modern, and will be well-prepared to construct a vast array of combinatorial designs. Design theory offers a progressive approach to the subject, with carefully ordered results. It begins with simple constructions that gradually increase in complexity. Each design has a construction that contains new ideas or that reinforces and builds upon similar ideas previously introduced. A new text/reference covering all apsects of modern combinatorial design theory. Graduates and professionals in computer science, applie...
Combinatorial Mathematics: Research into Practice
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 methods with computer applications
Gross, Jonathan L
2007-01-01
Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the textbook in a combinatorial methods course or in a combined graph theory and combinatorics course.After an introduction to combinatorics, the book explores six systematic approaches within a comprehensive framework: sequences, solving recurrences, evaluating summation exp
Relativity in Combinatorial Gravitational Fields
Directory of Open Access Journals (Sweden)
Mao Linfan
2010-04-01
Full Text Available A combinatorial spacetime $(mathscr{C}_G| uboverline{t}$ is a smoothly combinatorial manifold $mathscr{C}$ underlying a graph $G$ evolving on a time vector $overline{t}$. As we known, Einstein's general relativity is suitable for use only in one spacetime. What is its disguise in a combinatorial spacetime? Applying combinatorial Riemannian geometry enables us to present a combinatorial spacetime model for the Universe and suggest a generalized Einstein gravitational equation in such model. Forfinding its solutions, a generalized relativity principle, called projective principle is proposed, i.e., a physics law ina combinatorial spacetime is invariant under a projection on its a subspace and then a spherically symmetric multi-solutions ofgeneralized Einstein gravitational equations in vacuum or charged body are found. We also consider the geometrical structure in such solutions with physical formations, and conclude that an ultimate theory for the Universe maybe established if all such spacetimes in ${f R}^3$. Otherwise, our theory is only an approximate theory and endless forever.
Exact model reduction of combinatorial reaction networks
Directory of Open Access Journals (Sweden)
Fey Dirk
2008-08-01
Full Text Available Abstract Background Receptors and scaffold proteins usually possess a high number of distinct binding domains inducing the formation of large multiprotein signaling complexes. Due to combinatorial reasons the number of distinguishable species grows exponentially with the number of binding domains and can easily reach several millions. Even by including only a limited number of components and binding domains the resulting models are very large and hardly manageable. A novel model reduction technique allows the significant reduction and modularization of these models. Results We introduce methods that extend and complete the already introduced approach. For instance, we provide techniques to handle the formation of multi-scaffold complexes as well as receptor dimerization. Furthermore, we discuss a new modeling approach that allows the direct generation of exactly reduced model structures. The developed methods are used to reduce a model of EGF and insulin receptor crosstalk comprising 5,182 ordinary differential equations (ODEs to a model with 87 ODEs. Conclusion The methods, presented in this contribution, significantly enhance the available methods to exactly reduce models of combinatorial reaction networks.
Combinatorial reasoning an introduction to the art of counting
DeTemple, Duane
2014-01-01
Written by well-known scholars in the field, this book introduces combinatorics alongside modern techniques, showcases the interdisciplinary aspects of the topic, and illustrates how to problem solve with a multitude of exercises throughout. The authors' approach is very reader-friendly and avoids the ""scholarly tone"" found in many books on this topic. Combinatorial Reasoning: An Introduction to the Art of Counting: Focuses on enumeration and combinatorial thinking as a way to develop a variety of effective approaches to solving counting problemsIncludes brief summaries of basic concepts f
Doerr, Timothy; Alves, Gelio; Yu, Yi-Kuo
2006-03-01
Typical combinatorial optimizations are NP-hard; however, for a particular class of cost functions the corresponding combinatorial optimizations can be solved in polynomial time. This suggests a way to efficiently find approximate solutions - - find a transformation that makes the cost function as similar as possible to that of the solvable class. After keeping many high-ranking solutions using the approximate cost function, one may then re-assess these solutions with the full cost function to find the best approximate solution. Under this approach, it is important to be able to assess the quality of the solutions obtained, e.g., by finding the true ranking of kth best approximate solution when all possible solutions are considered exhaustively. To tackle this statistical issue, we provide a systematic method starting with a scaling function generated from the fininte number of high- ranking solutions followed by a convergent iterative mapping. This method, useful in a variant of the directed paths in random media problem proposed here, can also provide a statistical significance assessment for one of the most important proteomic tasks - - peptide sequencing using tandem mass spectrometry data.
Hard electronics; Hard electronics
Energy Technology Data Exchange (ETDEWEB)
NONE
1997-03-01
Hard material technologies were surveyed to establish the hard electronic technology which offers superior characteristics under hard operational or environmental conditions as compared with conventional Si devices. The following technologies were separately surveyed: (1) The device and integration technologies of wide gap hard semiconductors such as SiC, diamond and nitride, (2) The technology of hard semiconductor devices for vacuum micro- electronics technology, and (3) The technology of hard new material devices for oxides. The formation technology of oxide thin films made remarkable progress after discovery of oxide superconductor materials, resulting in development of an atomic layer growth method and mist deposition method. This leading research is expected to solve such issues difficult to be easily realized by current Si technology as high-power, high-frequency and low-loss devices in power electronics, high temperature-proof and radiation-proof devices in ultimate electronics, and high-speed and dense- integrated devices in information electronics. 432 refs., 136 figs., 15 tabs.
Combinatorial synthesis of natural products
DEFF Research Database (Denmark)
Nielsen, John
2002-01-01
Combinatorial syntheses allow production of compound libraries in an expeditious and organized manner immediately applicable for high-throughput screening. Natural products possess a pedigree to justify quality and appreciation in drug discovery and development. Currently, we are seeing a rapid...... increase in application of natural products in combinatorial chemistry and vice versa. The therapeutic areas of infectious disease and oncology still dominate but many new areas are emerging. Several complex natural products have now been synthesised by solid-phase methods and have created the foundation...... for preparation of combinatorial libraries. In other examples, natural products or intermediates have served as building blocks or scaffolds in the synthesis of complex natural products, bioactive analogues or designed hybrid molecules. Finally, structural motifs from the biologically active parent molecule have...
Mitigation of Control Channel Jamming via Combinatorial Key Distribution
Falahati, Abolfazl; Azarafrooz, Mahdi
The problem of countering control channel jamming against internal adversaries in wireless ad hoc networks is addressed. Using combinatorial key distribution, a new method to secure the control channel access is introduced. This method, utilizes the established keys in the key establishment phase to hide the location of control channels without the need for a secure BS. This is in obtained by combination of a collision free one-way function and a combinatorial key establishment method. The proposed scheme can be considered as a special case of the ALOHA random access schemes which uses the common established keys as its seeds to generate the pattern of transmission.
Markov's theorem and algorithmically non-recognizable combinatorial manifolds
International Nuclear Information System (INIS)
Shtan'ko, M A
2004-01-01
We prove the theorem of Markov on the existence of an algorithmically non-recognizable combinatorial n-dimensional manifold for every n≥4. We construct for the first time a concrete manifold which is algorithmically non-recognizable. A strengthened form of Markov's theorem is proved using the combinatorial methods of regular neighbourhoods and handle theory. The proofs coincide for all n≥4. We use Borisov's group with insoluble word problem. It has two generators and twelve relations. The use of this group forms the base for proving the strengthened form of Markov's theorem
On some interconnections between combinatorial optimization and extremal graph theory
Directory of Open Access Journals (Sweden)
Cvetković Dragoš M.
2004-01-01
Full Text Available The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified types of problems, the extremal graph theory deals with finding bounds for various graph invariants under some constraints and with constructing extremal graphs. We analyze by examples some interconnections and interactions of the two theories and propose some conclusions.
From combinatorial optimization to real algebraic geometry and back
Directory of Open Access Journals (Sweden)
Janez Povh
2014-12-01
Full Text Available In this paper, we explain the relations between combinatorial optimization and real algebraic geometry with a special focus to the quadratic assignment problem. We demonstrate how to write a quadratic optimization problem over discrete feasible set as a linear optimization problem over the cone of completely positive matrices. The latter formulation enables a hierarchy of approximations which rely on results from polynomial optimization, a sub-eld of real algebraic geometry.
Experiments with parallel algorithms for combinatorial problems
G.A.P. Kindervater (Gerard); H.W.J.M. Trienekens
1985-01-01
textabstractIn the last decade many models for parallel computation have been proposed and many parallel algorithms have been developed. However, few of these models have been realized and most of these algorithms are supposed to run on idealized, unrealistic parallel machines. The parallel machines
Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.
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.
Some experience of shielding calculations by combinatorial method
International Nuclear Information System (INIS)
Korobejnikov, V.V.; Oussanov, V.I.
1996-01-01
Some aspects of the compound systems shielding calculations by a combinatorial approach are discussed. The effectiveness of such an approach is based on the fundamental characteristic of a compound system: if some element of the system have in itself mathematical or physical properties favorable for calculation, these properties may be used in a combinatorial approach and are lost when the system is being calculated in the whole by a direct approach. The combinatorial technique applied is well known. A compound system are being splitting for two or more auxiliary subsystems (so that calculation each of them is a more simple problem than calculation of the original problem (or at last is a soluble problem if original one is not). Calculation of every subsystem are carried out by suitable method and code, the coupling being made through boundary conditions or boundary source. The special consideration in the paper is given to a fast reactor shielding combinatorial analysis and to the testing of the results received. (author)
Algorithms in combinatorial design theory
Colbourn, CJ
1985-01-01
The scope of the volume includes all algorithmic and computational aspects of research on combinatorial designs. Algorithmic aspects include generation, isomorphism and analysis techniques - both heuristic methods used in practice, and the computational complexity of these operations. The scope within design theory includes all aspects of block designs, Latin squares and their variants, pairwise balanced designs and projective planes and related geometries.
Combinatorial synthesis of ceramic materials
Lauf, Robert J.; Walls, Claudia A.; Boatner, Lynn A.
2006-11-14
A combinatorial library includes a gelcast substrate defining a plurality of cavities in at least one surface thereof; and a plurality of gelcast test materials in the cavities, at least two of the test materials differing from the substrate in at least one compositional characteristic, the two test materials differing from each other in at least one compositional characteristic.
Combinatorial auctions for electronic business
Indian Academy of Sciences (India)
R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22
(6) Information feedback: An auction protocol may be a direct mechanism or an .... transparency of allocation decisions arise in resolving these ties. .... bidding, however more recently, combinatorial bids are allowed [50] making ...... Also, truth revelation and other game theoretic considerations are not taken into account.
Combinatorial Proofs and Algebraic Proofs
Indian Academy of Sciences (India)
Permanent link: https://www.ias.ac.in/article/fulltext/reso/018/07/0630-0645. Keywords. Combinatorial proof; algebraic proof; binomial identity; recurrence relation; composition; Fibonacci number; Fibonacci identity; Pascal triangle. Author Affiliations. Shailesh A Shirali1. Sahyadri School Tiwai Hill, Rajgurunagar Pune 410 ...
Integrating packing and distribution problems and optimization through mathematical programming
Directory of Open Access Journals (Sweden)
Fabio Miguel
2016-06-01
Full Text Available This paper analyzes the integration of two combinatorial problems that frequently arise in production and distribution systems. One is the Bin Packing Problem (BPP problem, which involves finding an ordering of some objects of different volumes to be packed into the minimal number of containers of the same or different size. An optimal solution to this NP-Hard problem can be approximated by means of meta-heuristic methods. On the other hand, we consider the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW, which is a variant of the Travelling Salesman Problem (again a NP-Hard problem with extra constraints. Here we model those two problems in a single framework and use an evolutionary meta-heuristics to solve them jointly. Furthermore, we use data from a real world company as a test-bed for the method introduced here.
The construction of combinatorial manifolds with prescribed sets of links of vertices
International Nuclear Information System (INIS)
Gaifullin, A A
2008-01-01
To every oriented closed combinatorial manifold we assign the set (with repetitions) of isomorphism classes of links of its vertices. The resulting transformation L is the main object of study in this paper. We pose an inversion problem for L and show that this problem is closely related to Steenrod's problem on the realization of cycles and to the Rokhlin-Schwartz-Thom construction of combinatorial Pontryagin classes. We obtain a necessary condition for a set of isomorphism classes of combinatorial spheres to belong to the image of L. (Sets satisfying this condition are said to be balanced.) We give an explicit construction showing that every balanced set of isomorphism classes of combinatorial spheres falls into the image of L after passing to a multiple set and adding several pairs of the form (Z,-Z), where -Z is the sphere Z with the orientation reversed. Given any singular simplicial cycle ξ of a space X, this construction enables us to find explicitly a combinatorial manifold M and a map φ:M→X such that φ * [M]=r[ξ] for some positive integer r. The construction is based on resolving singularities of ξ. We give applications of the main construction to cobordisms of manifolds with singularities and cobordisms of simple cells. In particular, we prove that every rational additive invariant of cobordisms of manifolds with singularities admits a local formula. Another application is the construction of explicit (though inefficient) local combinatorial formulae for polynomials in the rational Pontryagin classes of combinatorial manifolds
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity
DEFF Research Database (Denmark)
Neumann, Frank; Witt, Carsten
2012-01-01
Bioinspired computation methods, such as evolutionary algorithms and ant colony optimization, are being applied successfully to complex engineering and combinatorial optimization problems, and it is very important that we understand the computational complexity of these algorithms. This tutorials...... problems. Classical single objective optimization is examined first. They then investigate the computational complexity of bioinspired computation applied to multiobjective variants of the considered combinatorial optimization problems, and in particular they show how multiobjective optimization can help...... to speed up bioinspired computation for single-objective optimization problems. The tutorial is based on a book written by the authors with the same title. Further information about the book can be found at www.bioinspiredcomputation.com....
Combinatorial Speculations and the Combinatorial Conjecture for Mathematics
Mao, Linfan
2006-01-01
Combinatorics is a powerful tool for dealing with relations among objectives mushroomed in the past century. However, an more important work for mathematician is to apply combinatorics to other mathematics and other sciences not merely to find combinatorial behavior for objectives. Recently, such research works appeared on journals for mathematics and theoretical physics on cosmos. The main purpose of this paper is to survey these thinking and ideas for mathematics and cosmological physics, s...
Combinatorial aspects of covering arrays
Directory of Open Access Journals (Sweden)
Charles J. Colbourn
2004-11-01
Full Text Available Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiring that the appearance of t -tuples be balanced.Their uses in screening experiments has found application in software testing, hardware testing, and a variety of fields in which interactions among factors are to be identified. Here a combinatorial view of covering arrays is adopted, encompassing basic bounds, direct constructions, recursive constructions, algorithmic methods, and applications.
SOLVING FLOWSHOP SCHEDULING PROBLEMS USING A DISCRETE AFRICAN WILD DOG ALGORITHM
Directory of Open Access Journals (Sweden)
M. K. Marichelvam
2013-04-01
Full Text Available The problem of m-machine permutation flowshop scheduling is considered in this paper. The objective is to minimize the makespan. The flowshop scheduling problem is a typical combinatorial optimization problem and has been proved to be strongly NP-hard. Hence, several heuristics and meta-heuristics were addressed by the researchers. In this paper, a discrete African wild dog algorithm is applied for solving the flowshop scheduling problems. Computational results using benchmark problems show that the proposed algorithm outperforms many other algorithms addressed in the literature.
Dynamic combinatorial libraries : new opportunities in systems chemistry
Hunt, Rosemary A. R.; Otto, Sijbren; Hunt, Rosemary A.R.
2011-01-01
Combinatorial chemistry is a tool for selecting molecules with special properties. Dynamic combinatorial chemistry started off aiming to be just that. However, unlike ordinary combinatorial chemistry, the interconnectedness of dynamic libraries gives them an extra dimension. An understanding of
The Yoccoz Combinatorial Analytic Invariant
DEFF Research Database (Denmark)
Petersen, Carsten Lunde; Roesch, Pascale
2008-01-01
In this paper we develop a combinatorial analytic encoding of the Mandelbrot set M. The encoding is implicit in Yoccoz' proof of local connectivity of M at any Yoccoz parameter, i.e. any at most finitely renormalizable parameter for which all periodic orbits are repelling. Using this encoding we ...... to reprove that the dyadic veins of M are arcs and that more generally any two Yoccoz parameters are joined by a unique ruled (in the sense of Douady-Hubbard) arc in M....
Log-balanced combinatorial sequences
Directory of Open Access Journals (Sweden)
Tomislav Došlic
2005-01-01
Full Text Available We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions for log-balancedness are given for the case when the sequence satisfies a two- (or more- term linear recurrence. It is shown that many combinatorially interesting sequences belong to this class, and, as a consequence, that the above-mentioned double inequalities are valid for all of them.
Some unsolved problems in discrete mathematics and mathematical cybernetics
Energy Technology Data Exchange (ETDEWEB)
Korshunov, Aleksei D [S.L. Sobolev Institute for Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk (Russian Federation)
2009-10-31
There are many unsolved problems in discrete mathematics and mathematical cybernetics. Writing a comprehensive survey of such problems involves great difficulties. First, such problems are rather numerous and varied. Second, they greatly differ from each other in degree of completeness of their solution. Therefore, even a comprehensive survey should not attempt to cover the whole variety of such problems; only the most important and significant problems should be reviewed. An impersonal choice of problems to include is quite hard. This paper includes 13 unsolved problems related to combinatorial mathematics and computational complexity theory. The problems selected give an indication of the author's studies for 50 years; for this reason, the choice of the problems reviewed here is, to some extent, subjective. At the same time, these problems are very difficult and quite important for discrete mathematics and mathematical cybernetics. Bibliography: 74 items.
Some unsolved problems in discrete mathematics and mathematical cybernetics
Korshunov, Aleksei D.
2009-10-01
There are many unsolved problems in discrete mathematics and mathematical cybernetics. Writing a comprehensive survey of such problems involves great difficulties. First, such problems are rather numerous and varied. Second, they greatly differ from each other in degree of completeness of their solution. Therefore, even a comprehensive survey should not attempt to cover the whole variety of such problems; only the most important and significant problems should be reviewed. An impersonal choice of problems to include is quite hard. This paper includes 13 unsolved problems related to combinatorial mathematics and computational complexity theory. The problems selected give an indication of the author's studies for 50 years; for this reason, the choice of the problems reviewed here is, to some extent, subjective. At the same time, these problems are very difficult and quite important for discrete mathematics and mathematical cybernetics. Bibliography: 74 items.
Some unsolved problems in discrete mathematics and mathematical cybernetics
International Nuclear Information System (INIS)
Korshunov, Aleksei D
2009-01-01
There are many unsolved problems in discrete mathematics and mathematical cybernetics. Writing a comprehensive survey of such problems involves great difficulties. First, such problems are rather numerous and varied. Second, they greatly differ from each other in degree of completeness of their solution. Therefore, even a comprehensive survey should not attempt to cover the whole variety of such problems; only the most important and significant problems should be reviewed. An impersonal choice of problems to include is quite hard. This paper includes 13 unsolved problems related to combinatorial mathematics and computational complexity theory. The problems selected give an indication of the author's studies for 50 years; for this reason, the choice of the problems reviewed here is, to some extent, subjective. At the same time, these problems are very difficult and quite important for discrete mathematics and mathematical cybernetics. Bibliography: 74 items.
Wang, Wenlong; Mandrà, Salvatore; Katzgraber, Helmut
We propose a patch planting heuristic that allows us to create arbitrarily-large Ising spin-glass instances on any topology and with any type of disorder, and where the exact ground-state energy of the problem is known by construction. By breaking up the problem into patches that can be treated either with exact or heuristic solvers, we can reconstruct the optimum of the original, considerably larger, problem. The scaling of the computational complexity of these instances with various patch numbers and sizes is investigated and compared with random instances using population annealing Monte Carlo and quantum annealing on the D-Wave 2X quantum annealer. The method can be useful for benchmarking of novel computing technologies and algorithms. NSF-DMR-1208046 and the Office of the Director of National Intelligence (ODNI), Intelligence Advanced Research Projects Activity (IARPA), via MIT Lincoln Laboratory Air Force Contract No. FA8721-05-C-0002.
Combinatorial Interpretation of General Eulerian Numbers
Tingyao Xiong; Jonathan I. Hall; Hung-Ping Tsao
2014-01-01
Since 1950s, mathematicians have successfully interpreted the traditional Eulerian numbers and $q-$Eulerian numbers combinatorially. In this paper, the authors give a combinatorial interpretation to the general Eulerian numbers defined on general arithmetic progressions { a, a+d, a+2d,...}.
Toward Chemical Implementation of Encoded Combinatorial Libraries
DEFF Research Database (Denmark)
Nielsen, John; Janda, Kim D.
1994-01-01
The recent application of "combinatorial libraries" to supplement existing drug screening processes might simplify and accelerate the search for new lead compounds or drugs. Recently, a scheme for encoded combinatorial chemistry was put forward to surmount a number of the limitations possessed...
A combinatorial approach to the design of vaccines.
Martínez, Luis; Milanič, Martin; Legarreta, Leire; Medvedev, Paul; Malaina, Iker; de la Fuente, Ildefonso M
2015-05-01
We present two new problems of combinatorial optimization and discuss their applications to the computational design of vaccines. In the shortest λ-superstring problem, given a family S1,...,S(k) of strings over a finite alphabet, a set Τ of "target" strings over that alphabet, and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ target strings as substrings of S(i). In the shortest λ-cover superstring problem, given a collection X1,...,X(n) of finite sets of strings over a finite alphabet and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ elements of X(i) as substrings. The two problems are polynomially equivalent, and the shortest λ-cover superstring problem is a common generalization of two well known combinatorial optimization problems, the shortest common superstring problem and the set cover problem. We present two approaches to obtain exact or approximate solutions to the shortest λ-superstring and λ-cover superstring problems: one based on integer programming, and a hill-climbing algorithm. An application is given to the computational design of vaccines and the algorithms are applied to experimental data taken from patients infected by H5N1 and HIV-1.
KENO-IV/CG, the combinatorial geometry version of the KENO Monte Carlo criticality safety program
International Nuclear Information System (INIS)
West, J.T.; Petrie, L.M.; Fraley, S.K.
1979-09-01
KENO-IV/CG was developed to merge the simple geometry input description utilized by combinatorial geometry with the repeating lattice feature of the original KENO geometry package. The result is a criticality code with the ability to model a complex system of repeating rectangular lattices inside a complicated three-dimensional geometry system. Furthermore, combinatorial geometry was modified to differentiate between combinatorial zones describing a particular KENO BOX to be repeated in a KENO array and those combinatorial zones describing geometry external to an array. This allows the user to maintain a simple coordinate system without any geometric conflict due to spatial overlap. Several difficult criticality design problems have been solved with the new geometry package in KENO-IV/CG, thus illustrating the power of the code to model difficult geometries with a minimum of effort
Application of Viral Systems for Single-Machine Total Weighted Tardiness Problem
International Nuclear Information System (INIS)
Santosa, Budi; Affandi, Umar
2013-01-01
In this paper, a relatively new algorithm inspired by the viral replication system called Viral Systems is used to solve the Single-Machine Total Weighted Tardiness (SMTWTP). SMTWTP is a job scheduling problem which is one of classical combinatorial problems known as np-hard problems. This algorithm makes the process of finding solutions through neighborhood and mutation mechanism. The experiment was conducted to evaluate its performance. There are seven parameters which are required to tune in to find best solution. The experiment was implemented on data sets of 40 jobs, 50 jobs, and 100 jobs. The results show that the algorithm can solve 235 optimally out of 275 problems.
A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM
Directory of Open Access Journals (Sweden)
F. NURIYEVA
2017-06-01
Full Text Available The Multiple Traveling Salesman Problem (mTSP is a combinatorial optimization problem in NP-hard class. The mTSP aims to acquire the minimum cost for traveling a given set of cities by assigning each of them to a different salesman in order to create m number of tours. This paper presents a new heuristic algorithm based on the shortest path algorithm to find a solution for the mTSP. The proposed method has been programmed in C language and its performance analysis has been carried out on the library instances. The computational results show the efficiency of this method.
Distributing the computation in combinatorial optimization experiments over the cloud
Directory of Open Access Journals (Sweden)
Mario Brcic
2017-12-01
Full Text Available Combinatorial optimization is an area of great importance since many of the real-world problems have discrete parameters which are part of the objective function to be optimized. Development of combinatorial optimization algorithms is guided by the empirical study of the candidate ideas and their performance over a wide range of settings or scenarios to infer general conclusions. Number of scenarios can be overwhelming, especially when modeling uncertainty in some of the problem’s parameters. Since the process is also iterative and many ideas and hypotheses may be tested, execution time of each experiment has an important role in the efficiency and successfulness. Structure of such experiments allows for significant execution time improvement by distributing the computation. We focus on the cloud computing as a cost-efficient solution in these circumstances. In this paper we present a system for validating and comparing stochastic combinatorial optimization algorithms. The system also deals with selection of the optimal settings for computational nodes and number of nodes in terms of performance-cost tradeoff. We present applications of the system on a new class of project scheduling problem. We show that we can optimize the selection over cloud service providers as one of the settings and, according to the model, it resulted in a substantial cost-savings while meeting the deadline.
CUNY Graduate Center Workshops on Combinatorial and Additive Number Theory
2017-01-01
Based on talks from the 2015 and 2016 Combinatorial and Additive Number Theory (CANT) workshops at the City University of New York, these proceedings offer 19 peer-reviewed and edited papers on current topics in number theory. Held every year since 2003, the workshop series surveys state-of-the-art open problems in combinatorial and additive number theory and related parts of mathematics. Sumsets, partitions, convex polytopes and discrete geometry, Ramsey theory, primality testing, and cryptography are among the topics featured in this volume. Each contribution is dedicated to a specific topic that reflects the latest results by experts in the field. Researchers and graduate students interested in the current progress in number theory will find this selection of articles relevant and compelling. .
Combinatorial geometry domain decomposition strategies for Monte Carlo simulations
Energy Technology Data Exchange (ETDEWEB)
Li, G.; Zhang, B.; Deng, L.; Mo, Z.; Liu, Z.; Shangguan, D.; Ma, Y.; Li, S.; Hu, Z. [Institute of Applied Physics and Computational Mathematics, Beijing, 100094 (China)
2013-07-01
Analysis and modeling of nuclear reactors can lead to memory overload for a single core processor when it comes to refined modeling. A method to solve this problem is called 'domain decomposition'. In the current work, domain decomposition algorithms for a combinatorial geometry Monte Carlo transport code are developed on the JCOGIN (J Combinatorial Geometry Monte Carlo transport INfrastructure). Tree-based decomposition and asynchronous communication of particle information between domains are described in the paper. Combination of domain decomposition and domain replication (particle parallelism) is demonstrated and compared with that of MERCURY code. A full-core reactor model is simulated to verify the domain decomposition algorithms using the Monte Carlo particle transport code JMCT (J Monte Carlo Transport Code), which has being developed on the JCOGIN infrastructure. Besides, influences of the domain decomposition algorithms to tally variances are discussed. (authors)
Combinatorial geometry domain decomposition strategies for Monte Carlo simulations
International Nuclear Information System (INIS)
Li, G.; Zhang, B.; Deng, L.; Mo, Z.; Liu, Z.; Shangguan, D.; Ma, Y.; Li, S.; Hu, Z.
2013-01-01
Analysis and modeling of nuclear reactors can lead to memory overload for a single core processor when it comes to refined modeling. A method to solve this problem is called 'domain decomposition'. In the current work, domain decomposition algorithms for a combinatorial geometry Monte Carlo transport code are developed on the JCOGIN (J Combinatorial Geometry Monte Carlo transport INfrastructure). Tree-based decomposition and asynchronous communication of particle information between domains are described in the paper. Combination of domain decomposition and domain replication (particle parallelism) is demonstrated and compared with that of MERCURY code. A full-core reactor model is simulated to verify the domain decomposition algorithms using the Monte Carlo particle transport code JMCT (J Monte Carlo Transport Code), which has being developed on the JCOGIN infrastructure. Besides, influences of the domain decomposition algorithms to tally variances are discussed. (authors)
Combinatorial Optimization in Project Selection Using Genetic Algorithm
Dewi, Sari; Sawaluddin
2018-01-01
This paper discusses the problem of project selection in the presence of two objective functions that maximize profit and minimize cost and the existence of some limitations is limited resources availability and time available so that there is need allocation of resources in each project. These resources are human resources, machine resources, raw material resources. This is treated as a consideration to not exceed the budget that has been determined. So that can be formulated mathematics for objective function (multi-objective) with boundaries that fulfilled. To assist the project selection process, a multi-objective combinatorial optimization approach is used to obtain an optimal solution for the selection of the right project. It then described a multi-objective method of genetic algorithm as one method of multi-objective combinatorial optimization approach to simplify the project selection process in a large scope.
Xie, Zongtang; Xu, Jiuping; Wu, Zhibin
2017-02-01
Earthquake exposure has often been associated with psychological distress. However, little is known about the cumulative effect of exposure to two earthquakes on psychological distress and in particular, the effect on the development of post-traumatic stress disorder (PTSD), anxiety and depression disorders. This study explored the effect of exposure on mental health outcomes after a first earthquake and again after a second earthquake. A population-based mental health survey using self-report questionnaires was conducted on 278 people in the hard-hit areas of Lushan and Baoxing Counties 13-16 months after the Wenchuan earthquake (Sample 1). 191 of these respondents were evaluated again 8-9 months after the Lushan earthquake (Sample 2), which struck almost 5 years after the Wenchuan earthquake. In Sample 1, the prevalence rates for PTSD, anxiety and depression disorders were 44.53, 54.25 and 51.82%, respectively, and in Sample 2 the corresponding rates were 27.27, 38.63 and 36.93%. Females, the middle-aged, those of Tibetan nationality, and people who reported fear during the earthquake were at an increased risk of experiencing post-traumatic symptoms. Although the incidence of PTSD, anxiety and depression disorders decreased from Sample 1 to Sample 2, the cumulative effect of exposure to two earthquakes on mental health problems was serious in the hard-hit areas. Therefore, it is important that psychological counseling be provided for earthquake victims, and especially those exposed to multiple earthquakes.
Box, Simon
2014-12-01
Optimal switching of traffic lights on a network of junctions is a computationally intractable problem. In this research, road traffic networks containing signallized junctions are simulated. A computer game interface is used to enable a human 'player' to control the traffic light settings on the junctions within the simulation. A supervised learning approach, based on simple neural network classifiers can be used to capture human player's strategies in the game and thus develop a human-trained machine control (HuTMaC) system that approaches human levels of performance. Experiments conducted within the simulation compare the performance of HuTMaC to two well-established traffic-responsive control systems that are widely deployed in the developed world and also to a temporal difference learning-based control method. In all experiments, HuTMaC outperforms the other control methods in terms of average delay and variance over delay. The conclusion is that these results add weight to the suggestion that HuTMaC may be a viable alternative, or supplemental method, to approximate optimization for some practical engineering control problems where the optimal strategy is computationally intractable.
Petters, Dean; Hogg, David
2014-01-01
Cognitive Science is a discipline that brings together research in natural and artificial systems and this is clearly reflected in the diverse contributions to From Animals to Robots and Back: Reflections on Hard Problems in the Study of Cognition. In tribute to Aaron Sloman and his pioneering work in Cognitive Science and Artificial Intelligence, the editors have collected a unique collection of cross-disciplinary papers that include work on: · intelligent robotics; · philosophy of cognitive science; · emotional research · computational vision; · comparative psychology; and · human-computer interaction. Key themes such as the importance of taking an architectural view in approaching cognition, run through the text. Drawing on the expertize of leading international researchers, contemporary debates in the study of natural and artificial cognition are addressed from complementary and contrasting perspectives with key issues being outlined at various levels of abstraction. From Animals to Robots and Back:...
Frusawa, Hiroshi
2014-05-01
A coarse-grained system of one-dimensional (1D) hard spheres (HSs) is created using the Delaunay tessellation, which enables one to define the quasi-0D state. It is found from comparing the quasi-0D and 1D free energy densities that a frozen state due to the emergence of quasi-0D HSs is thermodynamically more favorable than fluidity with a large-scale heterogeneity above crossover volume fraction of ϕc=e/(1+e)=0.731⋯ , at which the total entropy of the 1D state vanishes. The Delaunay-based lattice mapping further provides a similarity between the dense HS system above ϕc and the jamming limit in the car parking problem.
International Nuclear Information System (INIS)
Frusawa, Hiroshi
2014-01-01
A coarse-grained system of one-dimensional (1D) hard spheres (HSs) is created using the Delaunay tessellation, which enables one to define the quasi-0D state. It is found from comparing the quasi-0D and 1D free energy densities that a frozen state due to the emergence of quasi-0D HSs is thermodynamically more favorable than fluidity with a large-scale heterogeneity above crossover volume fraction of ϕ c =e/(1+e)=0.731⋯ , at which the total entropy of the 1D state vanishes. The Delaunay-based lattice mapping further provides a similarity between the dense HS system above ϕ c and the jamming limit in the car parking problem.
Theoretical analysis of two ACO approaches for the traveling salesman problem
DEFF Research Database (Denmark)
Kötzing, Timo; Neumann, Frank; Röglin, Heiko
2012-01-01
Bioinspired algorithms, such as evolutionary algorithms and ant colony optimization, are widely used for different combinatorial optimization problems. These algorithms rely heavily on the use of randomness and are hard to understand from a theoretical point of view. This paper contributes...... to the theoretical analysis of ant colony optimization and studies this type of algorithm on one of the most prominent combinatorial optimization problems, namely the traveling salesperson problem (TSP). We present a new construction graph and show that it has a stronger local property than one commonly used...... for constructing solutions of the TSP. The rigorous runtime analysis for two ant colony optimization algorithms, based on these two construction procedures, shows that they lead to good approximation in expected polynomial time on random instances. Furthermore, we point out in which situations our algorithms get...
Combinatorial effects of arginine and fluoride on oral bacteria.
Zheng, X; Cheng, X; Wang, L; Qiu, W; Wang, S; Zhou, Y; Li, M; Li, Y; Cheng, L; Li, J; Zhou, X; Xu, X
2015-02-01
Dental caries is closely associated with the microbial disequilibrium between acidogenic/aciduric pathogens and alkali-generating commensal residents within the dental plaque. Fluoride is a widely used anticaries agent, which promotes tooth hard-tissue remineralization and suppresses bacterial activities. Recent clinical trials have shown that oral hygiene products containing both fluoride and arginine possess a greater anticaries effect compared with those containing fluoride alone, indicating synergy between fluoride and arginine in caries management. Here, we hypothesize that arginine may augment the ecological benefit of fluoride by enriching alkali-generating bacteria in the plaque biofilm and thus synergizes with fluoride in controlling dental caries. Specifically, we assessed the combinatory effects of NaF/arginine on planktonic and biofilm cultures of Streptococcus mutans, Streptococcus sanguinis, and Porphyromonas gingivalis with checkerboard microdilution assays. The optimal NaF/arginine combinations were selected, and their combinatory effects on microbial composition were further examined in single-, dual-, and 3-species biofilm using bacterial species-specific fluorescence in situ hybridization and quantitative polymerase chain reaction. We found that arginine synergized with fluoride in suppressing acidogenic S. mutans in both planktonic and biofilm cultures. In addition, the NaF/arginine combination synergistically reduced S. mutans but enriched S. sanguinis within the multispecies biofilms. More importantly, the optimal combination of NaF/arginine maintained a "streptococcal pressure" against the potential growth of oral anaerobe P. gingivalis within the alkalized biofilm. Taken together, we conclude that the combinatory application of fluoride and arginine has a potential synergistic effect in maintaining a healthy oral microbial equilibrium and thus represents a promising ecological approach to caries management. © International & American
Tumor-targeting peptides from combinatorial libraries*
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
Combinatorial Micro-Macro Dynamical Systems
Diaz, Rafael; Villamarin, Sergio
2015-01-01
The second law of thermodynamics states that the entropy of an isolated system is almost always increasing. We propose combinatorial formalizations of the second law and explore their conditions of possibilities.
Directory of Open Access Journals (Sweden)
Mohammed Essaid Riffi
2017-11-01
Full Text Available The bat algorithm is one of the recent nature-inspired algorithms, which has been emerged as a powerful search method for solving continuous as well as discrete problems. The quadratic assignment problem is a well-known NP-hard problem in combinatorial optimization. The goal of this problem is to assign n facilities to n locations in such a way as to minimize the assignment cost. For that purpose, this paper introduces a novel discrete variant of bat algorithm to deal with this combinatorial optimization problem. The proposed algorithm was evaluated on a set of benchmark instances from the QAPLIB library and the performance was compared to other algorithms. The empirical results of exhaustive experiments were promising and illustrated the efficacy of the suggested approach.
Cubical version of combinatorial differential forms
DEFF Research Database (Denmark)
Kock, Anders
2010-01-01
The theory of combinatorial differential forms is usually presented in simplicial terms. We present here a cubical version; it depends on the possibility of forming affine combinations of mutual neighbour points in a manifold, in the context of synthetic differential geometry.......The theory of combinatorial differential forms is usually presented in simplicial terms. We present here a cubical version; it depends on the possibility of forming affine combinations of mutual neighbour points in a manifold, in the context of synthetic differential geometry....
Distributed Systems: The Hard Problems
CERN. Geneva
2015-01-01
**Nicholas Bellerophon** works as a client services engineer at Basho Technologies, helping customers setup and run distributed systems at scale in the wild. He has also worked in massively multiplayer games, and recently completed a live scalable simulation engine. He is an avid TED-watcher with interests in many areas of the arts, science, and engineering, including of course high-energy physics.
Directory of Open Access Journals (Sweden)
Paweł Sitek
2016-01-01
Full Text Available This paper presents a hybrid method for modeling and solving supply chain optimization problems with soft, hard, and logical constraints. Ability to implement soft and logical constraints is a very important functionality for supply chain optimization models. Such constraints are particularly useful for modeling problems resulting from commercial agreements, contracts, competition, technology, safety, and environmental conditions. Two programming and solving environments, mathematical programming (MP and constraint logic programming (CLP, were combined in the hybrid method. This integration, hybridization, and the adequate multidimensional transformation of the problem (as a presolving method helped to substantially reduce the search space of combinatorial models for supply chain optimization problems. The operation research MP and declarative CLP, where constraints are modeled in different ways and different solving procedures are implemented, were linked together to use the strengths of both. This approach is particularly important for the decision and combinatorial optimization models with the objective function and constraints, there are many decision variables, and these are summed (common in manufacturing, supply chain management, project management, and logistic problems. The ECLiPSe system with Eplex library was proposed to implement a hybrid method. Additionally, the proposed hybrid transformed model is compared with the MILP-Mixed Integer Linear Programming model on the same data instances. For illustrative models, its use allowed finding optimal solutions eight to one hundred times faster and reducing the size of the combinatorial problem to a significant extent.
Topics in combinatorial pattern matching
DEFF Research Database (Denmark)
Vildhøj, Hjalte Wedel
Problem. Given m documents of total length n, we consider the problem of finding a longest string common to at least d ≥ 2 of the documents. This problem is known as the longest common substring (LCS) problem and has a classic O(n) space and O(n) time solution (Weiner [FOCS’73], Hui [CPM’92]). However...
Solving the 0/1 Knapsack Problem by a Biomolecular DNA Computer
Directory of Open Access Journals (Sweden)
Hassan Taghipour
2013-01-01
Full Text Available Solving some mathematical problems such as NP-complete problems by conventional silicon-based computers is problematic and takes so long time. DNA computing is an alternative method of computing which uses DNA molecules for computing purposes. DNA computers have massive degrees of parallel processing capability. The massive parallel processing characteristic of DNA computers is of particular interest in solving NP-complete and hard combinatorial problems. NP-complete problems such as knapsack problem and other hard combinatorial problems can be easily solved by DNA computers in a very short period of time comparing to conventional silicon-based computers. Sticker-based DNA computing is one of the methods of DNA computing. In this paper, the sticker based DNA computing was used for solving the 0/1 knapsack problem. At first, a biomolecular solution space was constructed by using appropriate DNA memory complexes. Then, by the application of a sticker-based parallel algorithm using biological operations, knapsack problem was resolved in polynomial time.
Doerr, Timothy P.; Alves, Gelio; Yu, Yi-Kuo
2005-08-01
Typical combinatorial optimizations are NP-hard; however, for a particular class of cost functions the corresponding combinatorial optimizations can be solved in polynomial time using the transfer matrix technique or, equivalently, the dynamic programming approach. This suggests a way to efficiently find approximate solutions-find a transformation that makes the cost function as similar as possible to that of the solvable class. After keeping many high-ranking solutions using the approximate cost function, one may then re-assess these solutions with the full cost function to find the best approximate solution. Under this approach, it is important to be able to assess the quality of the solutions obtained, e.g., by finding the true ranking of the kth best approximate solution when all possible solutions are considered exhaustively. To tackle this statistical issue, we provide a systematic method starting with a scaling function generated from the finite number of high-ranking solutions followed by a convergent iterative mapping. This method, useful in a variant of the directed paths in random media problem proposed here, can also provide a statistical significance assessment for one of the most important proteomic tasks-peptide sequencing using tandem mass spectrometry data. For directed paths in random media, the scaling function depends on the particular realization of randomness; in the mass spectrometry case, the scaling function is spectrum-specific.
Combinatorial stresses kill pathogenic Candida species
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
Local formulae for combinatorial Pontryagin classes
International Nuclear Information System (INIS)
Gaifullin, Alexander A
2004-01-01
Let p(|K|) be the characteristic class of a combinatorial manifold K given by a polynomial p in the rational Pontryagin classes of K. We prove that for any polynomial p there is a function taking each combinatorial manifold K to a cycle z p (K) in its rational simplicial chains such that: 1) the Poincare dual of z p (K) represents the cohomology class p(|K|); 2) the coefficient of each simplex Δ in the cycle z p (K) is determined solely by the combinatorial type of linkΔ. We explicitly describe all such functions for the first Pontryagin class. We obtain estimates for the denominators of the coefficients of the simplices in the cycles z p (K)
Accessing Specific Peptide Recognition by Combinatorial Chemistry
DEFF Research Database (Denmark)
Li, Ming
Molecular recognition is at the basis of all processes for life, and plays a central role in many biological processes, such as protein folding, the structural organization of cells and organelles, signal transduction, and the immune response. Hence, my PhD project is entitled “Accessing Specific...... Peptide Recognition by Combinatorial Chemistry”. Molecular recognition is a specific interaction between two or more molecules through noncovalent bonding, such as hydrogen bonding, metal coordination, van der Waals forces, π−π, hydrophobic, or electrostatic interactions. The association involves kinetic....... Combinatorial chemistry was invented in 1980s based on observation of functional aspects of the adaptive immune system. It was employed for drug development and optimization in conjunction with high-throughput synthesis and screening. (chapter 2) Combinatorial chemistry is able to rapidly produce many thousands...
Combinatorial explosion in model gene networks
Edwards, R.; Glass, L.
2000-09-01
The explosive growth in knowledge of the genome of humans and other organisms leaves open the question of how the functioning of genes in interacting networks is coordinated for orderly activity. One approach to this problem is to study mathematical properties of abstract network models that capture the logical structures of gene networks. The principal issue is to understand how particular patterns of activity can result from particular network structures, and what types of behavior are possible. We study idealized models in which the logical structure of the network is explicitly represented by Boolean functions that can be represented by directed graphs on n-cubes, but which are continuous in time and described by differential equations, rather than being updated synchronously via a discrete clock. The equations are piecewise linear, which allows significant analysis and facilitates rapid integration along trajectories. We first give a combinatorial solution to the question of how many distinct logical structures exist for n-dimensional networks, showing that the number increases very rapidly with n. We then outline analytic methods that can be used to establish the existence, stability and periods of periodic orbits corresponding to particular cycles on the n-cube. We use these methods to confirm the existence of limit cycles discovered in a sample of a million randomly generated structures of networks of 4 genes. Even with only 4 genes, at least several hundred different patterns of stable periodic behavior are possible, many of them surprisingly complex. We discuss ways of further classifying these periodic behaviors, showing that small mutations (reversal of one or a few edges on the n-cube) need not destroy the stability of a limit cycle. Although these networks are very simple as models of gene networks, their mathematical transparency reveals relationships between structure and behavior, they suggest that the possibilities for orderly dynamics in such
Solutions manual to accompany Combinatorial reasoning an introduction to the art of counting
DeTemple, Duane
2014-01-01
This is a solutions manual to accompany Combinatorial Reasoning: An Introduction to the Art of CountingWritten by well-known scholars in the field, Combinatorial Reasoning: An Introduction to the Art of Counting introduces combinatorics alongside modern techniques, showcases the interdisciplinary aspects of the topic, and illustrates how to problem solve with a multitude of exercises throughout. The authors'' approach is very reader-friendly and avoids the ""scholarly tone"" found in many books on this topic.
Complexity and Tractability Islands for Combinatorial Auctions on Discrete Intervals with Gaps
Döcker, J.; Dorn, B.; Endriss, U.; Krüger, D.; Kaminka, G.A.; Fox, M.; Bouquet, P.; Hüllermeyer, E.; Dignum, V.; Dignum, F.; van Harmelen, F.
2016-01-01
Combinatorial auctions are mechanisms for allocating bundles of goods to agents who each have preferences over these goods. Finding an economically efficient allocation, the so-called winner determination problem, is computationally intractable in the general case, which is why it is important to
A quark interpretation of the combinatorial hierarchy
International Nuclear Information System (INIS)
Enqvist, Kari.
1979-01-01
We propose a physical interpretation of the second level of the combinatorial hierarchy in terms of three quarks, three antiquarks and the vacuum. This interpretation allows us to introduce a new quantum number, which measures electromagnetic mass splitting of the quarks. We extend our argument by analogue to baryons, and find some SU(3) and some new mass formulas for baryons. The generalization of our approach to other hierarchy levels is discussed. We present also an empirical mass formula for baryons, which seems to be loosely connected with the combinatorial hierarchy. (author)
Development of Combinatorial Methods for Alloy Design and Optimization
International Nuclear Information System (INIS)
Pharr, George M.; George, Easo P.; Santella, Michael L
2005-01-01
rapid structural and chemical characterization of alloy libraries was developed based on high intensity x-radiation available at synchrotron sources such as the Advanced Photon Source (APS) at Argonne National Laboratory (ANL). With the technique, structural and chemical characterization of up to 2500 discrete positions on a library can made in a period of less than 4 hours. Among the parameters that can be measured are the chemical composition, crystal structure, lattice parameters, texture, and grain size. From these, one can also deduce isothermal sections of ternary phase diagrams. The equipment and techniques needed to do this are now in place for use in future combinatorial studies at the ORNL beam line at the APS. In conjunction with the chemical and structural investigations, nanoindentation techniques were developed to investigate the mechanical properties of the combinatorial libraries. The two primary mechanical properties of interest were the elastic modulus, E, and hardness, H, both of which were measured on alloy library surfaces with spatial resolutions of better than 1 m. A nanoindentation testing system at ORNL was programmed to make a series of indentations at specified locations on the library surface and automatically collect and store all the data needed to obtain hardness and modulus as a function of position. Approximately 200 indentations can be made during an overnight run, which allows for mechanical property measurement over a wide range of chemical composition in a relatively short time. Since the materials based on the Fe-Ni-Cr system often find application in highly carburizing and harsh chemical environments, simple techniques were developed to assess the resistance of Fe-Ni-Cr alloy libraries to carburization and corrosion. Alloy libraries were carburized by standard techniques, and the effectiveness of the carburization at various points along the sample surface was assessed by nanoindentation hardness measurement. Corrosion tests were
Combinatorial Clustering Algorithm of Quantum-Behaved Particle Swarm Optimization and Cloud Model
Directory of Open Access Journals (Sweden)
Mi-Yuan Shan
2013-01-01
Full Text Available We propose a combinatorial clustering algorithm of cloud model and quantum-behaved particle swarm optimization (COCQPSO to solve the stochastic problem. The algorithm employs a novel probability model as well as a permutation-based local search method. We are setting the parameters of COCQPSO based on the design of experiment. In the comprehensive computational study, we scrutinize the performance of COCQPSO on a set of widely used benchmark instances. By benchmarking combinatorial clustering algorithm with state-of-the-art algorithms, we can show that its performance compares very favorably. The fuzzy combinatorial optimization algorithm of cloud model and quantum-behaved particle swarm optimization (FCOCQPSO in vague sets (IVSs is more expressive than the other fuzzy sets. Finally, numerical examples show the clustering effectiveness of COCQPSO and FCOCQPSO clustering algorithms which are extremely remarkable.
Dynamic combinatorial chemistry with diselenides and disulfides in water
DEFF Research Database (Denmark)
Rasmussen, Brian; Sørensen, Anne; Gotfredsen, Henrik
2014-01-01
Diselenide exchange is introduced as a reversible reaction in dynamic combinatorial chemistry in water. At neutral pH, diselenides are found to mix with disulfides and form dynamic combinatorial libraries of diselenides, disulfides, and selenenylsulfides. This journal is......Diselenide exchange is introduced as a reversible reaction in dynamic combinatorial chemistry in water. At neutral pH, diselenides are found to mix with disulfides and form dynamic combinatorial libraries of diselenides, disulfides, and selenenylsulfides. This journal is...
ON range searching in the group model and combinatorial discrepancy
DEFF Research Database (Denmark)
Larsen, Kasper Green
2014-01-01
In this paper we establish an intimate connection between dynamic range searching in the group model and combinatorial discrepancy. Our result states that, for a broad class of range searching data structures (including all known upper bounds), it must hold that $t_u t_q=\\Omega(\\mbox{disc}^2......)$, where $t_u$ is the worst case update time, $t_q$ is the worst case query time, and disc is the combinatorial discrepancy of the range searching problem in question. This relation immediately implies a whole range of exceptionally high and near-tight lower bounds for all of the basic range searching...... problems. We list a few of them in the following: (1) For $d$-dimensional halfspace range searching, we get a lower bound of $t_u t_q=\\Omega(n^{1-1/d})$. This comes within an lg lg $n$ factor of the best known upper bound. (2) For orthogonal range searching, we get a lower bound of $t_u t...
Combinatorial optimization algorithms and complexity
Papadimitriou, Christos H
1998-01-01
This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering.
A New Approach for Proving or Generating Combinatorial Identities
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…
International Nuclear Information System (INIS)
Maor, Uri; Tel Aviv Univ.
1995-09-01
The role of s-channel unitarity screening corrections, calculated in the eikonal approximation, is investigated for soft Pomeron exchange responsible for elastic and diffractive hadron scattering in the high energy limit. We examine the differences between our results and those obtained from the supercritical Pomeron-Regge model with no such corrections. It is shown that screening saturation is attained at different scales for different channels. We then proceed to discuss the new HERA data on hard (PQCD) Pomeron diffractive channels and discuss the relationship between the soft and hard Pomerons and the relevance of our analysis to this problem. (author). 18 refs, 9 figs, 1 tab
Branch and peg algorithms for the simple plant location problem
Goldengorin, B.; Ghosh, D.; Sierksma, G.
The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. This problem often appears as a subproblem in other combinatorial problems. Several
Branch and peg algorithms for the simple plant location problem
Goldengorin, Boris; Ghosh, Diptesh; Sierksma, Gerard
2001-01-01
The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. This problem of ten appears as a subproblem in other combinatorial problems. Several
Melting of polydisperse hard disks
Pronk, S.; Frenkel, D.
2004-01-01
The melting of a polydisperse hard-disk system is investigated by Monte Carlo simulations in the semigrand canonical ensemble. This is done in the context of possible continuous melting by a dislocation-unbinding mechanism, as an extension of the two-dimensional hard-disk melting problem. We find
Geometric Generalisation of Surrogate Model-Based Optimisation to Combinatorial and Program Spaces
Directory of Open Access Journals (Sweden)
Yong-Hyuk Kim
2014-01-01
Full Text Available Surrogate models (SMs can profitably be employed, often in conjunction with evolutionary algorithms, in optimisation in which it is expensive to test candidate solutions. The spatial intuition behind SMs makes them naturally suited to continuous problems, and the only combinatorial problems that have been previously addressed are those with solutions that can be encoded as integer vectors. We show how radial basis functions can provide a generalised SM for combinatorial problems which have a geometric solution representation, through the conversion of that representation to a different metric space. This approach allows an SM to be cast in a natural way for the problem at hand, without ad hoc adaptation to a specific representation. We test this adaptation process on problems involving binary strings, permutations, and tree-based genetic programs.
Combinatorial biosynthesis of medicinal plant secondary metabolites
Julsing, Mattijs K.; Koulman, Albert; Woerdenbag, Herman J.; Quax, Wim J.; Kayser, Oliver
2006-01-01
Combinatorial biosynthesis is a new tool in the generation of novel natural products and for the production of rare and expensive natural products. The basic concept is combining metabolic pathways in different organisms on a genetic level. As a consequence heterologous organisms provide precursors
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
Ketema, J.; Simonsen, Jakob Grue
2010-01-01
We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly generalise a number of results on normalising strategies in
PIPERIDINE OLIGOMERS AND COMBINATORIAL LIBRARIES THEREOF
DEFF Research Database (Denmark)
1999-01-01
The present invention relates to piperidine oligomers, methods for the preparation of piperidine oligomers and compound libraries thereof, and the use of piperidine oligomers as drug substances. The present invention also relates to the use of combinatorial libraries of piperidine oligomers...... in libraries (arrays) of compounds especially suitable for screening purposes....
Dendrimer-based dynamic combinatorial libraries
Chang, T.; Meijer, E.W.
2005-01-01
The aim of this project is to create water-sol. dynamic combinatorial libraries based upon dendrimer-guest complexes. The guest mols. are designed to bind to dendrimers using multiple secondary interactions, such as electrostatics and hydrogen bonding. We have been able to incorporate various guest
Gian-Carlos Rota and Combinatorial Math.
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)
Combinatorial Aspects of the Generalized Euler's Totient
Directory of Open Access Journals (Sweden)
Nittiya Pabhapote
2010-01-01
Full Text Available A generalized Euler's totient is defined as a Dirichlet convolution of a power function and a product of the Souriau-Hsu-Möbius function with a completely multiplicative function. Two combinatorial aspects of the generalized Euler's totient, namely, its connections to other totients and its relations with counting formulae, are investigated.
Logging to Facilitate Combinatorial System Testing
Kruse, P.M.; Prasetya, I.S.W.B.; Hage, J; Elyasov, Alexander
2014-01-01
Testing a web application is typically very complicated. Imposing simple coverage criteria such as function or line coverage is often not sufficient to uncover bugs due to incorrect components integration. Combinatorial testing can enforce a stronger criterion, while still allowing the
Methods of using the quadratic assignment problem solution
Directory of Open Access Journals (Sweden)
Izabela Kudelska
2012-09-01
Full Text Available Background: Quadratic assignment problem (QAP is one of the most interesting of combinatorial optimization. Was presented by Koopman and Beckamanna in 1957, as a mathematical model of the location of indivisible tasks. This problem belongs to the class NP-hard issues. This forces the application to the solution already approximate methods for tasks with a small size (over 30. Even though it is much harder than other combinatorial optimization problems, it enjoys wide interest because it models the important class of decision problems. Material and methods: The discussion was an artificial intelligence tool that allowed to solve the problem QAP, among others are: genetic algorithms, Tabu Search, Branch and Bound. Results and conclusions: QAP did not arise directly as a model for certain actions, but he found its application in many areas. Examples of applications of the problem is: arrangement of buildings on the campus of the university, layout design of electronic components in systems with large scale integration (VLSI, design a hospital, arrangement of keys on the keyboard.
Combinatorial structures to modeling simple games and applications
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.
Combinatorial optimization in foundry practice
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.
Combinatorial solutions to integrable hierarchies
Kazarian, M. E.; Lando, S. K.
2015-06-01
This paper reviews modern approaches to the construction of formal solutions to integrable hierarchies of mathematical physics whose coefficients are answers to various enumerative problems. The relationship between these approaches and the combinatorics of symmetric groups and their representations is explained. Applications of the results to the construction of efficient computations in problems related to models of quantum field theories are described. Bibliography: 34 titles.
American Society for Testing and Materials. Philadelphia
2007-01-01
1.1 Conversion Table 1 presents data in the Rockwell C hardness range on the relationship among Brinell hardness, Vickers hardness, Rockwell hardness, Rockwell superficial hardness, Knoop hardness, and Scleroscope hardness of non-austenitic steels including carbon, alloy, and tool steels in the as-forged, annealed, normalized, and quenched and tempered conditions provided that they are homogeneous. 1.2 Conversion Table 2 presents data in the Rockwell B hardness range on the relationship among Brinell hardness, Vickers hardness, Rockwell hardness, Rockwell superficial hardness, Knoop hardness, and Scleroscope hardness of non-austenitic steels including carbon, alloy, and tool steels in the as-forged, annealed, normalized, and quenched and tempered conditions provided that they are homogeneous. 1.3 Conversion Table 3 presents data on the relationship among Brinell hardness, Vickers hardness, Rockwell hardness, Rockwell superficial hardness, and Knoop hardness of nickel and high-nickel alloys (nickel content o...
International Nuclear Information System (INIS)
Dan, J.P.; Boving, H.J.; Hintermann, H.E.
1993-01-01
Hard, wear resistant and low friction coatings are presently produced on a world-wide basis, by different processes such as electrochemical or electroless methods, spray technologies, thermochemical, CVD and PVD. Some of the most advanced processes, especially those dedicated to thin film depositions, basically belong to CVD or PVD technologies, and will be looked at in more detail. The hard coatings mainly consist of oxides, nitrides, carbides, borides or carbon. Over the years, many processes have been developed which are variations and/or combinations of the basic CVD and PVD methods. The main difference between these two families of deposition techniques is that the CVD is an elevated temperature process (≥ 700 C), while the PVD on the contrary, is rather a low temperature process (≤ 500 C); this of course influences the choice of substrates and properties of the coating/substrate systems. Fundamental aspects of the vapor phase deposition techniques and some of their influences on coating properties will be discussed, as well as the very important interactions between deposit and substrate: diffusions, internal stress, etc. Advantages and limitations of CVD and PVD respectively will briefly be reviewed and examples of applications of the layers will be given. Parallel to the development and permanent updating of surface modification technologies, an effort was made to create novel characterisation methods. A close look will be given to the coating adherence control by means of the scratch test, at the coating hardness measurement by means of nanoindentation, at the coating wear resistance by means of a pin-on-disc tribometer, and at the surface quality evaluation by Atomic Force Microscopy (AFM). Finally, main important trends will be highlighted. (orig.)
Combinatorial therapy discovery using mixed integer linear programming.
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.
Solving optimization problems by the public goods game
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.
Combinatorial construction of toric residues
Khetan, Amit; Soprounov, Ivan
2004-01-01
The toric residue is a map depending on n+1 semi-ample divisors on a complete toric variety of dimension n. It appears in a variety of contexts such as sparse polynomial systems, mirror symmetry, and GKZ hypergeometric functions. In this paper we investigate the problem of finding an explicit element whose toric residue is equal to one. Such an element is shown to exist if and only if the associated polytopes are essential. We reduce the problem to finding a collection of partitions of the la...
Quantum fields and processes a combinatorial approach
Gough, John
2018-01-01
Wick ordering of creation and annihilation operators is of fundamental importance for computing averages and correlations in quantum field theory and, by extension, in the Hudson-Parthasarathy theory of quantum stochastic processes, quantum mechanics, stochastic processes, and probability. This book develops the unified combinatorial framework behind these examples, starting with the simplest mathematically, and working up to the Fock space setting for quantum fields. Emphasizing ideas from combinatorics such as the role of lattice of partitions for multiple stochastic integrals by Wallstrom-Rota and combinatorial species by Joyal, it presents insights coming from quantum probability. It also introduces a 'field calculus' which acts as a succinct alternative to standard Feynman diagrams and formulates quantum field theory (cumulant moments, Dyson-Schwinger equation, tree expansions, 1-particle irreducibility) in this language. Featuring many worked examples, the book is aimed at mathematical physicists, quant...
Quantum fields and processes a combinatorial approach
Gough, John
2018-01-01
Wick ordering of creation and annihilation operators is of fundamental importance for computing averages and correlations in quantum field theory and, by extension, in the Hudson–Parthasarathy theory of quantum stochastic processes, quantum mechanics, stochastic processes, and probability. This book develops the unified combinatorial framework behind these examples, starting with the simplest mathematically, and working up to the Fock space setting for quantum fields. Emphasizing ideas from combinatorics such as the role of lattice of partitions for multiple stochastic integrals by Wallstrom–Rota and combinatorial species by Joyal, it presents insights coming from quantum probability. It also introduces a 'field calculus' which acts as a succinct alternative to standard Feynman diagrams and formulates quantum field theory (cumulant moments, Dyson–Schwinger equation, tree expansions, 1-particle irreducibility) in this language. Featuring many worked examples, the book is aimed at mathematical physicists,...
Three Syntactic Theories for Combinatory Graph Reduction
DEFF Research Database (Denmark)
Danvy, Olivier; Zerny, Ian
2011-01-01
in a third syntactic theory. The structure of the store-based abstract machine corresponding to this third syntactic theory oincides with that of Turner's original reduction machine. The three syntactic theories presented here The three syntactic heories presented here therefore have the following......We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this syntactic theory as a reduction semantics, which we refocus into the first storeless abstract machine...... for combinatory graph reduction, which we refunctionalize into the first storeless natural semantics for combinatory graph reduction.We then factor out the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand, resulting in a second syntactic theory, this one...
Three Syntactic Theories for Combinatory Graph Reduction
DEFF Research Database (Denmark)
Danvy, Olivier; Zerny, Ian
2013-01-01
, as a store-based reduction semantics of combinatory term graphs. We then refocus this store-based reduction semantics into a store-based abstract machine. The architecture of this store-based abstract machine coincides with that of Turner's original reduction machine. The three syntactic theories presented......We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this rst syntactic theory as a storeless reduction semantics of combinatory terms. We then factor out...... the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand . The factored terms can be interpreted as term graphs in the sense of Barendregt et al. We express this second syntactic theory, which we prove equivalent to the rst, as a storeless reduction semantics...
DNA-Encoded Dynamic Combinatorial Chemical Libraries.
Reddavide, Francesco V; Lin, Weilin; Lehnert, Sarah; Zhang, Yixin
2015-06-26
Dynamic combinatorial chemistry (DCC) explores the thermodynamic equilibrium of reversible reactions. Its application in the discovery of protein binders is largely limited by difficulties in the analysis of complex reaction mixtures. DNA-encoded chemical library (DECL) technology allows the selection of binders from a mixture of up to billions of different compounds; however, experimental results often show low a signal-to-noise ratio and poor correlation between enrichment factor and binding affinity. Herein we describe the design and application of DNA-encoded dynamic combinatorial chemical libraries (EDCCLs). Our experiments have shown that the EDCCL approach can be used not only to convert monovalent binders into high-affinity bivalent binders, but also to cause remarkably enhanced enrichment of potent bivalent binders by driving their in situ synthesis. We also demonstrate the application of EDCCLs in DNA-templated chemical reactions. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Combinatorial Cis-regulation in Saccharomyces Species
Directory of Open Access Journals (Sweden)
Aaron T. Spivak
2016-03-01
Full Text Available Transcriptional control of gene expression requires interactions between the cis-regulatory elements (CREs controlling gene promoters. We developed a sensitive computational method to identify CRE combinations with conserved spacing that does not require genome alignments. When applied to seven sensu stricto and sensu lato Saccharomyces species, 80% of the predicted interactions displayed some evidence of combinatorial transcriptional behavior in several existing datasets including: (1 chromatin immunoprecipitation data for colocalization of transcription factors, (2 gene expression data for coexpression of predicted regulatory targets, and (3 gene ontology databases for common pathway membership of predicted regulatory targets. We tested several predicted CRE interactions with chromatin immunoprecipitation experiments in a wild-type strain and strains in which a predicted cofactor was deleted. Our experiments confirmed that transcription factor (TF occupancy at the promoters of the CRE combination target genes depends on the predicted cofactor while occupancy of other promoters is independent of the predicted cofactor. Our method has the additional advantage of identifying regulatory differences between species. By analyzing the S. cerevisiae and S. bayanus genomes, we identified differences in combinatorial cis-regulation between the species and showed that the predicted changes in gene regulation explain several of the species-specific differences seen in gene expression datasets. In some instances, the same CRE combinations appear to regulate genes involved in distinct biological processes in the two different species. The results of this research demonstrate that (1 combinatorial cis-regulation can be inferred by multi-genome analysis and (2 combinatorial cis-regulation can explain differences in gene expression between species.
The Combinatorial Trace Method in Action
Krebs, Mike; Martinez, Natalie C.
2013-01-01
On any finite graph, the number of closed walks of length k is equal to the sum of the kth powers of the eigenvalues of any adjacency matrix. This simple observation is the basis for the combinatorial trace method, wherein we attempt to count (or bound) the number of closed walks of a given length so as to obtain information about the graph's…
Directory of Open Access Journals (Sweden)
Daniel Khoshnoudirad
2015-11-01
Full Text Available The aim of this work is to provide a complete characterization of a (m,n-cube. The latter are the pieces of discrete planes appearing in Theoretical Computer Science, Discrete Geometry and Combinatorics. This characterization in three dimensions is the exact equivalent of the preimage for a discrete segment as it has been introduced by McIlroy. Further this characterization, which avoids the redundancies, reduces the combinatorial problem of determining the cardinality of the (m,n-cubes to a new combinatorial problem consisting of determining the volumic regions formed by the crossing of planes. This work can find applications in Imaging, Vision, and pattern recognition for instance.
Combinatorial geometry in the plane
Hadwiger, Hugo; Klee, Victor
2014-01-01
Geared toward advanced undergraduates familiar with analysis and college geometry, this concise book discusses theorems on topics restricted to the plane such as convexity, coverings, and graphs. In addition to helping students cultivate rigorous thought, the text encourages the development of mathematical intuition and clarifies the nature of mathematical research.The two-part treatment begins with specific topics including integral distances, covering problems, point set geometry and convexity, simple paradoxes involving point sets, and pure combinatorics, among other subjects. The second pa
MIFT: GIFT Combinatorial Geometry Input to VCS Code
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
Use of combinatorial chemistry to speed drug discovery.
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.
Advanced Aqueous Phase Catalyst Development using Combinatorial Methods, Phase II
National Aeronautics and Space Administration — Combinatorial methods are proposed to develop advanced Aqueous Oxidation Catalysts (AOCs) with the capability to mineralize organic contaminants present in effluents...
Quantum annealing for combinatorial clustering
Kumar, Vaibhaw; Bass, Gideon; Tomlin, Casey; Dulny, Joseph
2018-02-01
Clustering is a powerful machine learning technique that groups "similar" data points based on their characteristics. Many clustering algorithms work by approximating the minimization of an objective function, namely the sum of within-the-cluster distances between points. The straightforward approach involves examining all the possible assignments of points to each of the clusters. This approach guarantees the solution will be a global minimum; however, the number of possible assignments scales quickly with the number of data points and becomes computationally intractable even for very small datasets. In order to circumvent this issue, cost function minima are found using popular local search-based heuristic approaches such as k-means and hierarchical clustering. Due to their greedy nature, such techniques do not guarantee that a global minimum will be found and can lead to sub-optimal clustering assignments. Other classes of global search-based techniques, such as simulated annealing, tabu search, and genetic algorithms, may offer better quality results but can be too time-consuming to implement. In this work, we describe how quantum annealing can be used to carry out clustering. We map the clustering objective to a quadratic binary optimization problem and discuss two clustering algorithms which are then implemented on commercially available quantum annealing hardware, as well as on a purely classical solver "qbsolv." The first algorithm assigns N data points to K clusters, and the second one can be used to perform binary clustering in a hierarchical manner. We present our results in the form of benchmarks against well-known k-means clustering and discuss the advantages and disadvantages of the proposed techniques.
Complexity of hierarchically and 1-dimensional periodically specified problems
Energy Technology Data Exchange (ETDEWEB)
Marathe, M.V.; Hunt, H.B. III; Stearns, R.E.; Radhakrishnan, V.
1995-08-23
We study the complexity of various combinatorial and satisfiability problems when instances are specified using one of the following specifications: (1) the 1-dimensional finite periodic narrow specifications of Wanke and Ford et al. (2) the 1-dimensional finite periodic narrow specifications with explicit boundary conditions of Gale (3) the 2-way infinite1-dimensional narrow periodic specifications of Orlin et al. and (4) the hierarchical specifications of Lengauer et al. we obtain three general types of results. First, we prove that there is a polynomial time algorithm that given a 1-FPN- or 1-FPN(BC)specification of a graph (or a C N F formula) constructs a level-restricted L-specification of an isomorphic graph (or formula). This theorem along with the hardness results proved here provides alternative and unified proofs of many hardness results proved in the past either by Lengauer and Wagner or by Orlin. Second, we study the complexity of generalized CNF satisfiability problems of Schaefer. Assuming P {ne} PSPACE, we characterize completely the polynomial time solvability of these problems, when instances are specified as in (1), (2),(3) or (4). As applications of our first two types of results, we obtain a number of new PSPACE-hardness and polynomial time algorithms for problems specified as in (1), (2), (3) or(4). Many of our results also hold for O(log N) bandwidth bounded planar instances.
Effects of Suboptimal Bidding in Combinatorial Auctions
Schneider, Stefan; Shabalin, Pasha; Bichler, Martin
Though the VCG auction assumes a central place in the mechanism design literature, there are a number of reasons for favoring iterative combinatorial auction designs. Several promising ascending auction formats have been developed throughout the past few years based on primal-dual and subgradient algorithms and linear programming theory. Prices are interpreted as a feasible dual solution and the provisional allocation is interpreted as a feasible primal solution. iBundle( 3) (Parkes and Ungar 2000), dVSV (de Vries et al. 2007) and the Ascending Proxy auction (Ausubel and Milgrom 2002) result in VCG payoffs when the coalitional value function satisfies the buyer submodularity condition and bidders bid straightforward, which is an expost Nash equilibrium in that case. iBEA and CreditDebit auctions (Mishra and Parkes 2007) do not even require the buyer submodularity condition and achieve the same properties for general valuations. In many situations, however, one cannot assume bidders to bid straightforward and it is not clear from the theory how these non-linear personalized price auctions (NLPPAs) perform in this case. Robustness of auctions with respect to different bidding behavior is therefore a critical issue for any application. We have conducted a large number of computational experiments to analyze the performance of NLPPA designs with respect to different bidding strategies and different valuation models. We compare the results of NLPPAs to those of the VCG auction and those of iterative combinatorial auctions with approximate linear prices, such as ALPS (Bichler et al. 2009) and the Combinatorial Clock auction (Porter et al. 2003).
A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems
Thammano, Arit; Teekeng, Wannaporn
2015-05-01
The job-shop scheduling problem is one of the most difficult production planning problems. Since it is in the NP-hard class, a recent trend in solving the job-shop scheduling problem is shifting towards the use of heuristic and metaheuristic algorithms. This paper proposes a novel metaheuristic algorithm, which is a modification of the genetic algorithm. This proposed algorithm introduces two new concepts to the standard genetic algorithm: (1) fuzzy roulette wheel selection and (2) the mutation operation with tabu list. The proposed algorithm has been evaluated and compared with several state-of-the-art algorithms in the literature. The experimental results on 53 JSSPs show that the proposed algorithm is very effective in solving the combinatorial optimization problems. It outperforms all state-of-the-art algorithms on all benchmark problems in terms of the ability to achieve the optimal solution and the computational time.
A combinatorial enumeration problem of RNA secondary structures
African Journals Online (AJOL)
use
2011-12-21
Dec 21, 2011 ... connection between Discrete Mathematics and Compu- tational Molecular Biology (Chen et al, 2005; Hofacker et ... in Computational Molecular Biology. An RNA molecule is described by its sequences of bases ... Here, a mathematical definition of secondary structure is given (Stein and Waterman 1978).
Probabilistic Analysis of Combinatorial Optimization Problems on Hypergraph Matchings
2012-02-01
cliques, !.G/ < k. Let B D f1; : : : ; kg be the index set of partites in G, V D S b2B Vb , and BS denote the set of partites that have a node in S : BS D...CS D [ b2BS CS;b; where BS D B n BS , and CS;b Vb is given by CS;b D [ s2S .Vb \\N.s//; with N.s/ being the set of nodes adjacent to node s. At the...to a partite Vb in G: Zt D [ b2B Zt;b; t D 1; : : : ; k: The sets Zt;b are represented by bitsets of size jVbj. Let Zt;b;i be the i -th bit in Zt;b
Recursive deconvolution of combinatorial chemical libraries.
Erb, E; Janda, K D; Brenner, S
1994-01-01
A recursive strategy that solves for the active members of a chemical library is presented. A pentapeptide library with an alphabet of Gly, Leu, Phe, and Tyr (1024 members) was constructed on a solid support by the method of split synthesis. One member of this library (NH2-Tyr-Gly-Gly-Phe-Leu) is a native binder to a beta-endorphin antibody. A variation of the split synthesis approach is used to build the combinatorial library. In four vials, a member of the library's alphabet is coupled to a...
Automatic generation of combinatorial test data
Zhang, Jian; Ma, Feifei
2014-01-01
This book reviews the state-of-the-art in combinatorial testing, with particular emphasis on the automatic generation of test data. It describes the most commonly used approaches in this area - including algebraic construction, greedy methods, evolutionary computation, constraint solving and optimization - and explains major algorithms with examples. In addition, the book lists a number of test generation tools, as well as benchmarks and applications. Addressing a multidisciplinary topic, it will be of particular interest to researchers and professionals in the areas of software testing, combi
Method and apparatus for combinatorial chemistry
Foote, Robert S [Oak Ridge, TN
2012-06-05
A method and apparatus are provided for performing light-directed reactions in spatially addressable channels within a plurality of channels. One aspect of the invention employs photoactivatable reagents in solutions disposed into spatially addressable flow streams to control the parallel synthesis of molecules immobilized within the channels. The reagents may be photoactivated within a subset of channels at the site of immobilized substrate molecules or at a light-addressable site upstream from the substrate molecules. The method and apparatus of the invention find particularly utility in the synthesis of biopolymer arrays, e.g., oligonucleotides, peptides and carbohydrates, and in the combinatorial synthesis of small molecule arrays for drug discovery.
On Definitions and Existence of Combinatorial Entropy of 2d Fields
DEFF Research Database (Denmark)
Forchhammer, Søren Otto; Shtarkov, Yuri; Justesen, Jørn
1998-01-01
Different definitions of combinatorial entropy is presented and conditions for their existence examined.......Different definitions of combinatorial entropy is presented and conditions for their existence examined....
Energy Technology Data Exchange (ETDEWEB)
Zhang, X.D. [School of Material Science and Engineering, Central South University, Changsha, Hunan, 410083 (China); Liu, L.B., E-mail: lbliu.csu@gmail.com [School of Material Science and Engineering, Central South University, Changsha, Hunan, 410083 (China); State Key Laboratory for Powder Metallurgy, Changsha, Hunan, 410083 (China); Zhao, J.-C. [State Key Laboratory for Powder Metallurgy, Changsha, Hunan, 410083 (China); Department of Materials Science and Engineering, The Ohio State University, 2041 College Road, Columbus, OH 43210 (United States); Wang, J.L.; Zheng, F.; Jin, Z.P. [School of Material Science and Engineering, Central South University, Changsha, Hunan, 410083 (China)
2014-06-01
A high-efficiency combinatorial approach has been applied to rapidly build the database of composition-dependent elastic modulus and hardness of the Ti–Ta and Ti–Zr–Ta systems. A diffusion multiple of the Ti–Zr–Ta system was manufactured, then annealed at 1173 K for 1800 h, and water quenched to room temperature. Extensive interdiffusion among Ti, Zr and Ta has taken place. Combining nanoindentation and electron probe micro-analysis (EPMA), the elastic modulus, hardness as well as composition across the diffusion multiple were determined. The composition/elastic modulus/hardness relationship of the Ti–Ta and Ti–Zr–Ta alloys has been obtained. It was found that the elastic modulus and hardness depend strongly on the Ta and Zr content. The result can be used to accelerate the discovery/development of bio-titanium alloys for different components in implant prosthesis. - Highlights: • High-efficiency diffusion multiple of Ti–Zr–Ta was manufactured. • Composition-dependent elastic modulus and hardness of the Ti–Ta and Ti–Zr–Ta systems have been obtained effectively, • The methodology and the information can be used to accelerate the discovery/development of bio-titanium alloys.
Combinatorial Quantum Field Theory and Gluing Formula for Determinants
Reshetikhin, N.; Vertman, B.
2015-01-01
We define the combinatorial Dirichlet-to-Neumann operator and establish a gluing formula for determinants of discrete Laplacians using a combinatorial Gaussian quantum field theory. In case of a diagonal inner product on cochains we provide an explicit local expression for the discrete
Combinatorial Libraries of Bis-Heterocyclic Compounds with Skeletal Diversity
Soural, Miroslav; Bouillon, Isabelle; Krchňák, Viktor
2009-01-01
Combinatorial solid-phase synthesis of bis-heterocyclic compounds, characterized by the presence of two heterocyclic cores connected by a spacer of variable length/structure, provided structurally heterogeneous libraries with skeletal diversity. Both heterocyclic rings were assembled on resin in a combinatorial fashion. PMID:18811208
Combinatorial Libraries of Bis-Heterocyclic Compounds with Skeletal Diversity
Soural, Miroslav; Bouillon, Isabelle; Krchňák, Viktor
2008-01-01
Combinatorial solid-phase synthesis of bis-heterocyclic compounds, characterized by the presence of two heterocyclic cores connected by a spacer of variable length/structure, provided structurally heterogeneous libraries with skeletal diversity. Both heterocyclic rings were assembled on resin in a combinatorial fashion.
Combinatorial identities for tenth order mock theta functions
Indian Academy of Sciences (India)
44
which lead us to one 4-way and one 3-way combinatorial identity. ... mock theta functions, partition identities and different combinatorial parameters, see for ... 3. Example 1.1. There are twelve (n + 1)–color partitions of 2: 21, 21 + 01, 11 + 11, ...
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.
Heterogenous phase as a mean in combinatorial chemistry
International Nuclear Information System (INIS)
Abdel-Hamid, S.G.
2007-01-01
Combinatorial chemistry is a rapid and inexpensive technique for the synthesis of hundreds of thousands of organic compounds of potential medicinal activity. In the past few decades a large number of combinatorial libraries have been constructed, and significantly supplement the chemical diversity of the traditional collections of the potentially active medicinal compounds. Solid phase synthesis was used to enrich the combinatorial chemistry libraries, through the use of solid supports (resins) and their modified forms. Most of the new libraries of compounds appeared recently, were synthesized by the use of solid-phase. Solid-phase combinatorial chemistry (SPCC) is now considered as an outstanding branch in pharmaceutical chemistry research and used extensively as a tool for drug discovery within the context of high-throughput chemical synthesis. The best pure libraries synthesized by the use of solid phase combinatorial chemistry (SPCC) may well be those of intermediate complexity that are free of artifact-causing nuisance compounds. (author)
Computational Study on a PTAS for Planar Dominating Set Problem
Directory of Open Access Journals (Sweden)
Qian-Ping Gu
2013-01-01
Full Text Available The dominating set problem is a core NP-hard problem in combinatorial optimization and graph theory, and has many important applications. Baker [JACM 41,1994] introduces a k-outer planar graph decomposition-based framework for designing polynomial time approximation scheme (PTAS for a class of NP-hard problems in planar graphs. It is mentioned that the framework can be applied to obtain an O(2ckn time, c is a constant, (1+1/k-approximation algorithm for the planar dominating set problem. We show that the approximation ratio achieved by the mentioned application of the framework is not bounded by any constant for the planar dominating set problem. We modify the application of the framework to give a PTAS for the planar dominating set problem. With k-outer planar graph decompositions, the modified PTAS has an approximation ratio (1 + 2/k. Using 2k-outer planar graph decompositions, the modified PTAS achieves the approximation ratio (1+1/k in O(22ckn time. We report a computational study on the modified PTAS. Our results show that the modified PTAS is practical.
Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints
Juliandri, Dedy; Mawengkang, Herman; Bu'ulolo, F.
2018-01-01
Vehicle Routing Problem (VRP) is an important element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a hard combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve the demands a set of customers It is required that these vehicles return to the depot after serving customers’ demand. The problem incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon. The goal is to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the overall costs of all routes over the planning horizon. We model the problem as a linear mixed integer program. We develop a combination of heuristics and exact method for solving the model.
Directory of Open Access Journals (Sweden)
Bruno Avila Leal de Meirelles Herrera
2015-12-01
Full Text Available ABSTRACT The Traveling Salesman Problem (TSP is one of the most well-known and studied problems of Operations Research field, more specifically, in the Combinatorial Optimization field. As the TSP is a NP (Non-Deterministic Polynomial time-hard problem, there are several heuristic methods which have been proposed for the past decades in the attempt to solve it the best possible way. The aim of this work is to introduce and to evaluate the performance of some approaches for achieving optimal solution considering some symmetrical and asymmetrical TSP instances, which were taken from the Traveling Salesman Problem Library (TSPLIB. The analyzed approaches were divided into three methods: (i Lin-Kernighan-Helsgaun (LKH algorithm; (ii LKH with initial tour based on uniform distribution; and (iii an hybrid proposal combining Particle Swarm Optimization (PSO with quantum inspired behavior and LKH for local search procedure. The tested algorithms presented promising results in terms of computational cost and solution quality.
cDREM: inferring dynamic combinatorial gene regulation.
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.
Bifurcation-based approach reveals synergism and optimal combinatorial perturbation.
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.
Geometric differential evolution for combinatorial and programs spaces.
Moraglio, A; Togelius, J; Silva, S
2013-01-01
Geometric differential evolution (GDE) is a recently introduced formal generalization of traditional differential evolution (DE) that can be used to derive specific differential evolution algorithms for both continuous and combinatorial spaces retaining the same geometric interpretation of the dynamics of the DE search across representations. In this article, we first review the theory behind the GDE algorithm, then, we use this framework to formally derive specific GDE for search spaces associated with binary strings, permutations, vectors of permutations and genetic programs. The resulting algorithms are representation-specific differential evolution algorithms searching the target spaces by acting directly on their underlying representations. We present experimental results for each of the new algorithms on a number of well-known problems comprising NK-landscapes, TSP, and Sudoku, for binary strings, permutations, and vectors of permutations. We also present results for the regression, artificial ant, parity, and multiplexer problems within the genetic programming domain. Experiments show that overall the new DE algorithms are competitive with well-tuned standard search algorithms.
Combinatorial nanomedicines for colon cancer therapy.
Anitha, A; Maya, S; Sivaram, Amal J; Mony, U; Jayakumar, R
2016-01-01
Colon cancer is one of the major causes of cancer deaths worldwide. Even after surgical resection and aggressive chemotherapy, 50% of colorectal carcinoma patients develop recurrent disease. Thus, the rationale of developing new therapeutic approaches to improve the current chemotherapeutic regimen would be highly recommended. There are reports on the effectiveness of combination chemotherapy in colon cancer and it has been practiced in clinics for long time. These approaches are associated with toxic side effects. Later, the drug delivery research had shown the potential of nanoencapsulation techniques and active targeting as an effective method to improve the effectiveness of chemotherapy with less toxicity. This current focus article provides a brief analysis of the ongoing research in the colon cancer area using the combinatorial nanomedicines and its outcome. © 2015 Wiley Periodicals, Inc.
Identification and Interrogation of Combinatorial Histone Modifications
Directory of Open Access Journals (Sweden)
Kelly R Karch
2013-12-01
Full Text Available Histone proteins are dynamically modified to mediate a variety of cellular processes including gene transcription, DNA damage repair, and apoptosis. Regulation of these processes occurs through the recruitment of non-histone proteins to chromatin by specific combinations of histone post-translational modifications (PTMs. Mass spectrometry has emerged as an essential tool to discover and quantify histone PTMs both within and between samples in an unbiased manner. Developments in mass spectrometry that allow for characterization of large histone peptides or intact protein has made it possible to determine which modifications occur simultaneously on a single histone polypeptide. A variety of techniques from biochemistry, biophysics, and chemical biology have been employed to determine the biological relevance of discovered combinatorial codes. This review first describes advancements in the field of mass spectrometry that have facilitated histone PTM analysis and then covers notable approaches to probe the biological relevance of these modifications in their nucleosomal context.
Combinatorial nuclear level-density model
International Nuclear Information System (INIS)
Uhrenholt, H.; Åberg, S.; Dobrowolski, A.; Døssing, Th.; Ichikawa, T.; Möller, P.
2013-01-01
A microscopic nuclear level-density model is presented. The model is a completely combinatorial (micro-canonical) model based on the folded-Yukawa single-particle potential and includes explicit treatment of pairing, rotational and vibrational states. The microscopic character of all states enables extraction of level-distribution functions with respect to pairing gaps, parity and angular momentum. The results of the model are compared to available experimental data: level spacings at neutron separation energy, data on total level-density functions from the Oslo method, cumulative level densities from low-lying discrete states, and data on parity ratios. Spherical and deformed nuclei follow basically different coupling schemes, and we focus on deformed nuclei
Explaining the Mind: Problems, Problems
Harnad, Stevan
2001-01-01
The mind/body problem is the feeling/function problem: How and why do feeling systems feel? The problem is not just "hard" but insoluble (unless one is ready to resort to telekinetic dualism). Fortunately, the "easy" problems of cognitive science (such as the how and why of categorization and language) are not insoluble. Five books (by Damasio, Edelman/Tononi...
Human Performance on the Traveling Salesman and Related Problems: A Review
MacGregor, James N.; Chu, Yun
2011-01-01
The article provides a review of recent research on human performance on the traveling salesman problem (TSP) and related combinatorial optimization problems. We discuss what combinatorial optimization problems are, why they are important, and why they may be of interest to cognitive scientists. We next describe the main characteristics of human…
On the Cut-off Point for Combinatorial Group Testing
DEFF Research Database (Denmark)
Fischer, Paul; Klasner, N.; Wegener, I.
1999-01-01
is answered by 1 if Q contains at least one essential object and by 0 otherwise. In the statistical setting the objects are essential, independently of each other, with a given probability p combinatorial setting the number k ... group testing is equal to p* = 12(3 - 5), i.e., the strategy of testing each object individually minimizes the average number of queries iff p >= p* or n = 1. In the combinatorial setting the worst case number of queries is of interest. It has been conjectured that the cut-off point of combinatorial...
Maximization of Tsallis entropy in the combinatorial formulation
International Nuclear Information System (INIS)
Suyari, Hiroki
2010-01-01
This paper presents the mathematical reformulation for maximization of Tsallis entropy S q in the combinatorial sense. More concretely, we generalize the original derivation of Maxwell-Boltzmann distribution law to Tsallis statistics by means of the corresponding generalized multinomial coefficient. Our results reveal that maximization of S 2-q under the usual expectation or S q under q-average using the escort expectation are naturally derived from the combinatorial formulations for Tsallis statistics with respective combinatorial dualities, that is, one for additive duality and the other for multiplicative duality.
Hard equality constrained integer knapsacks
Aardal, K.I.; Lenstra, A.K.; Cook, W.J.; Schulz, A.S.
2002-01-01
We consider the following integer feasibility problem: "Given positive integer numbers a 0, a 1,..., a n, with gcd(a 1,..., a n) = 1 and a = (a 1,..., a n), does there exist a nonnegative integer vector x satisfying ax = a 0?" Some instances of this type have been found to be extremely hard to solve
Chang, Yuchao; Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Yuan, Baoqing Li andXiaobing
2017-07-19
Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.
Implementation of a combinatorial cleavage and deprotection scheme
DEFF Research Database (Denmark)
Nielsen, John; Rasmussen, Palle H.
1996-01-01
Phthalhydrazide libraries are synthesized in solution from substituted hydrazines and phthalimides in several different library formats including single compounds, indexed sub-libraries and a full library. When carried out during solid-phase synthesis, this combinatorial cleavage and deprotection...
ON 3-WAY COMBINATORIAL IDENTITIES A. K. AGARWAL MEGHA ...
Indian Academy of Sciences (India)
36
∗Corresponding author: Department of Basic and Applied Sciences, University College of Engineering,. Punjabi ... In this paper we provide combinatorial meanings to two generalized basic ... 2010 Mathematics Subject Classification. 05A15 ...
Olefin Metathesis in Peptidomimetics, Dynamic Combinatorial Chemistry, and Molecular Imprinting
National Research Council Canada - National Science Library
Low, Tammy K
2006-01-01
.... Our research goals consisted of employing olefin metathesis in the synthesis of peptidomimetics, and studying the feasibility of this method in dynamic combinatorial chemistry and molecular imprinting of nerve agents...
Dynamic combinatorial libraries: from exploring molecular recognition to systems chemistry.
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.
Novel Combinatorial Chemistry-Derived Inhibitors of Oncogenic Phosphatases
National Research Council Canada - National Science Library
Lazo, John
1999-01-01
Our overall goal of this US Army Breast Cancer Grant entitled "Novel Combinatorial Chemistry-Derived Inhibitors of Oncogenic Phosphatases" is to identity and develop novel therapeutic agents for human breast cancer...
The Combinatorial Rigidity Conjecture is False for Cubic Polynomials
DEFF Research Database (Denmark)
Henriksen, Christian
2003-01-01
We show that there exist two cubic polynomials with connected Julia sets which are combinatorially equivalent but not topologically conjugate on their Julia sets. This disproves a conjecture by McMullen from 1995.......We show that there exist two cubic polynomials with connected Julia sets which are combinatorially equivalent but not topologically conjugate on their Julia sets. This disproves a conjecture by McMullen from 1995....
On the combinatorial foundations of Regge-calculus
International Nuclear Information System (INIS)
Budach, L.
1989-01-01
Lipschitz-Killing curvatures of piecewise flat spaces are combinatorial analogues of Lipschitz-Killing curvatures of Riemannian manifolds. In the following paper rigorous combinatorial representations and proofs of all basic results for Lipschitz-Killing curvatures not using analytic arguments are given. The principal tools for an elementary representation of Regge calculus can be developed by means of basic properties of dihedral angles. (author)
Immune-Stimulating Combinatorial Therapy for Prostate Cancer
2016-10-01
Overlap: None 20 90061946 (Drake) Title: Epigenetic Drugs and Immuno Therapy for Prostate Cancer (EDIT-PC) Effort: 1.2 calendar months (10% effort...AWARD NUMBER: W81XWH-15-1-0667 TITLE: Immune-Stimulating Combinatorial Therapy for Prostate Cancer PRINCIPAL INVESTIGATOR: Robert Ivkov...Stimulating Combinatorial Therapy for Prostate Cancer 5a. CONTRACT NUMBER 5b. GRANT NUMBER W81XWH-15-1-0667 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S
Combinatorial Dyson-Schwinger equations and inductive data types
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.
Intrinsic information carriers in combinatorial dynamical systems
Harmer, Russ; Danos, Vincent; Feret, Jérôme; Krivine, Jean; Fontana, Walter
2010-09-01
Many proteins are composed of structural and chemical features—"sites" for short—characterized by definite interaction capabilities, such as noncovalent binding or covalent modification of other proteins. This modularity allows for varying degrees of independence, as the behavior of a site might be controlled by the state of some but not all sites of the ambient protein. Independence quickly generates a startling combinatorial complexity that shapes most biological networks, such as mammalian signaling systems, and effectively prevents their study in terms of kinetic equations—unless the complexity is radically trimmed. Yet, if combinatorial complexity is key to the system's behavior, eliminating it will prevent, not facilitate, understanding. A more adequate representation of a combinatorial system is provided by a graph-based framework of rewrite rules where each rule specifies only the information that an interaction mechanism depends on. Unlike reactions, which deal with molecular species, rules deal with patterns, i.e., multisets of molecular species. Although the stochastic dynamics induced by a collection of rules on a mixture of molecules can be simulated, it appears useful to capture the system's average or deterministic behavior by means of differential equations. However, expansion of the rules into kinetic equations at the level of molecular species is not only impractical, but conceptually indefensible. If rules describe bona fide patterns of interaction, molecular species are unlikely to constitute appropriate units of dynamics. Rather, we must seek aggregate variables reflective of the causal structure laid down by the rules. We call these variables "fragments" and the process of identifying them "fragmentation." Ideally, fragments are aspects of the system's microscopic population that the set of rules can actually distinguish on average; in practice, it may only be feasible to identify an approximation to this. Most importantly, fragments are
Intrinsic information carriers in combinatorial dynamical systems.
Harmer, Russ; Danos, Vincent; Feret, Jérôme; Krivine, Jean; Fontana, Walter
2010-09-01
Many proteins are composed of structural and chemical features--"sites" for short--characterized by definite interaction capabilities, such as noncovalent binding or covalent modification of other proteins. This modularity allows for varying degrees of independence, as the behavior of a site might be controlled by the state of some but not all sites of the ambient protein. Independence quickly generates a startling combinatorial complexity that shapes most biological networks, such as mammalian signaling systems, and effectively prevents their study in terms of kinetic equations-unless the complexity is radically trimmed. Yet, if combinatorial complexity is key to the system's behavior, eliminating it will prevent, not facilitate, understanding. A more adequate representation of a combinatorial system is provided by a graph-based framework of rewrite rules where each rule specifies only the information that an interaction mechanism depends on. Unlike reactions, which deal with molecular species, rules deal with patterns, i.e., multisets of molecular species. Although the stochastic dynamics induced by a collection of rules on a mixture of molecules can be simulated, it appears useful to capture the system's average or deterministic behavior by means of differential equations. However, expansion of the rules into kinetic equations at the level of molecular species is not only impractical, but conceptually indefensible. If rules describe bona fide patterns of interaction, molecular species are unlikely to constitute appropriate units of dynamics. Rather, we must seek aggregate variables reflective of the causal structure laid down by the rules. We call these variables "fragments" and the process of identifying them "fragmentation." Ideally, fragments are aspects of the system's microscopic population that the set of rules can actually distinguish on average; in practice, it may only be feasible to identify an approximation to this. Most importantly, fragments are
Combinatorial set theory with a gentle introduction to forcing
Halbeisen, Lorenz J
2017-01-01
This book, now in a thoroughly revised second edition, provides a comprehensive and accessible introduction to modern set theory. Following an overview of basic notions in combinatorics and first-order logic, the author outlines the main topics of classical set theory in the second part, including Ramsey theory and the axiom of choice. The revised edition contains new permutation models and recent results in set theory without the axiom of choice. The third part explains the sophisticated technique of forcing in great detail, now including a separate chapter on Suslin’s problem. The technique is used to show that certain statements are neither provable nor disprovable from the axioms of set theory. In the final part, some topics of classical set theory are revisited and further developed in light of forcing, with new chapters on Sacks Forcing and Shelah’s astonishing construction of a model with finitely many Ramsey ultrafilters. Written for graduate students in axiomatic set theory, Combinatorial Set Th...
A combinatorial approach to angiosperm pollen morphology.
Mander, Luke
2016-11-30
Angiosperms (flowering plants) are strikingly diverse. This is clearly expressed in the morphology of their pollen grains, which are characterized by enormous variety in their shape and patterning. In this paper, I approach angiosperm pollen morphology from the perspective of enumerative combinatorics. This involves generating angiosperm pollen morphotypes by algorithmically combining character states and enumerating the results of these combinations. I use this approach to generate 3 643 200 pollen morphotypes, which I visualize using a parallel-coordinates plot. This represents a raw morphospace. To compare real-world and theoretical morphologies, I map the pollen of 1008 species of Neotropical angiosperms growing on Barro Colorado Island (BCI), Panama, onto this raw morphospace. This highlights that, in addition to their well-documented taxonomic diversity, Neotropical rainforests also represent an enormous reservoir of morphological diversity. Angiosperm pollen morphospace at BCI has been filled mostly by pollen morphotypes that are unique to single plant species. Repetition of pollen morphotypes among higher taxa at BCI reflects both constraint and convergence. This combinatorial approach to morphology addresses the complexity that results from large numbers of discrete character combinations and could be employed in any situation where organismal form can be captured by discrete morphological characters. © 2016 The Author(s).
Exact combinatorial approach to finite coagulating systems
Fronczak, Agata; Chmiel, Anna; Fronczak, Piotr
2018-02-01
This paper outlines an exact combinatorial approach to finite coagulating systems. In this approach, cluster sizes and time are discrete and the binary aggregation alone governs the time evolution of the systems. By considering the growth histories of all possible clusters, an exact expression is derived for the probability of a coagulating system with an arbitrary kernel being found in a given cluster configuration when monodisperse initial conditions are applied. Then this probability is used to calculate the time-dependent distribution for the number of clusters of a given size, the average number of such clusters, and that average's standard deviation. The correctness of our general expressions is proved based on the (analytical and numerical) results obtained for systems with the constant kernel. In addition, the results obtained are compared with the results arising from the solutions to the mean-field Smoluchowski coagulation equation, indicating its weak points. The paper closes with a brief discussion on the extensibility to other systems of the approach presented herein, emphasizing the issue of arbitrary initial conditions.
Scalable Combinatorial Tools for Health Disparities Research
Directory of Open Access Journals (Sweden)
Michael A. Langston
2014-10-01
Full Text Available Despite staggering investments made in unraveling the human genome, current estimates suggest that as much as 90% of the variance in cancer and chronic diseases can be attributed to factors outside an individual’s genetic endowment, particularly to environmental exposures experienced across his or her life course. New analytical approaches are clearly required as investigators turn to complicated systems theory and ecological, place-based and life-history perspectives in order to understand more clearly the relationships between social determinants, environmental exposures and health disparities. While traditional data analysis techniques remain foundational to health disparities research, they are easily overwhelmed by the ever-increasing size and heterogeneity of available data needed to illuminate latent gene x environment interactions. This has prompted the adaptation and application of scalable combinatorial methods, many from genome science research, to the study of population health. Most of these powerful tools are algorithmically sophisticated, highly automated and mathematically abstract. Their utility motivates the main theme of this paper, which is to describe real applications of innovative transdisciplinary models and analyses in an effort to help move the research community closer toward identifying the causal mechanisms and associated environmental contexts underlying health disparities. The public health exposome is used as a contemporary focus for addressing the complex nature of this subject.
Combinatorial effects of odorants on mouse behavior
Saraiva, Luis R.; Kondoh, Kunio; Ye, Xiaolan; Yoon, Kyoung-hye; Hernandez, Marcus; Buck, Linda B.
2016-01-01
The mechanisms by which odors induce instinctive behaviors are largely unknown. Odor detection in the mouse nose is mediated by >1, 000 different odorant receptors (ORs) and trace amine-associated receptors (TAARs). Odor perceptions are encoded combinatorially by ORs and can be altered by slight changes in the combination of activated receptors. However, the stereotyped nature of instinctive odor responses suggests the involvement of specific receptors and genetically programmed neural circuits relatively immune to extraneous odor stimuli and receptor inputs. Here, we report that, contrary to expectation, innate odor-induced behaviors can be context-dependent. First, different ligands for a given TAAR can vary in behavioral effect. Second, when combined, some attractive and aversive odorants neutralize one another’s behavioral effects. Both a TAAR ligand and a common odorant block aversion to a predator odor, indicating that this ability is not unique to TAARs and can extend to an aversive response of potential importance to survival. In vitro testing of single receptors with binary odorant mixtures indicates that behavioral blocking can occur without receptor antagonism in the nose. Moreover, genetic ablation of a single receptor prevents its cognate ligand from blocking predator odor aversion, indicating that the blocking requires sensory input from the receptor. Together, these findings indicate that innate odor-induced behaviors can depend on context, that signals from a single receptor can block innate odor aversion, and that instinctive behavioral responses to odors can be modulated by interactions in the brain among signals derived from different receptors. PMID:27208093
Analysis of Hard Thin Film Coating
Shen, Dashen
1998-01-01
MSFC is interested in developing hard thin film coating for bearings. The wearing of the bearing is an important problem for space flight engine. Hard thin film coating can drastically improve the surface of the bearing and improve the wear-endurance of the bearing. However, many fundamental problems in surface physics, plasma deposition, etc, need further research. The approach is using electron cyclotron resonance chemical vapor deposition (ECRCVD) to deposit hard thin film an stainless steel bearing. The thin films in consideration include SiC, SiN and other materials. An ECRCVD deposition system is being assembled at MSFC.
Solving the Container Stowage Problem (CSP) using Particle Swarm Optimization (PSO)
Matsaini; Santosa, Budi
2018-04-01
Container Stowage Problem (CSP) is a problem of containers arrangement into ships by considering rules such as: total weight, weight of one stack, destination, equilibrium, and placement of containers on vessel. Container stowage problem is combinatorial problem and hard to solve with enumeration technique. It is an NP-Hard Problem. Therefore, to find a solution, metaheuristics is preferred. The objective of solving the problem is to minimize the amount of shifting such that the unloading time is minimized. Particle Swarm Optimization (PSO) is proposed to solve the problem. The implementation of PSO is combined with some steps which are stack position change rules, stack changes based on destination, and stack changes based on the weight type of the stacks (light, medium, and heavy). The proposed method was applied on five different cases. The results were compared to Bee Swarm Optimization (BSO) and heuristics method. PSO provided mean of 0.87% gap and time gap of 60 second. While BSO provided mean of 2,98% gap and 459,6 second to the heuristcs.
Solid-Phase Synthesis of Small Molecule Libraries using Double Combinatorial Chemistry
DEFF Research Database (Denmark)
Nielsen, John; Jensen, Flemming R.
1997-01-01
The first synthesis of a combinatorial library using double combinatorial chemistry is presented. Coupling of unprotected Fmoc-tyrosine to the solid support was followed by Mitsunobu O-alkylation. Introduction of a diacid linker yields a system in which the double combinatorial step can be demons......The first synthesis of a combinatorial library using double combinatorial chemistry is presented. Coupling of unprotected Fmoc-tyrosine to the solid support was followed by Mitsunobu O-alkylation. Introduction of a diacid linker yields a system in which the double combinatorial step can...
Physical interpretation of the combinatorial hierarchy
International Nuclear Information System (INIS)
Bastin, T.; Noyes, H.P.
1978-01-01
The combinatorial hierarchy model for base particle processes is compared and contrasted with the Ur-theory as developed at the Tutzing Conferences. It agrees with Ur-theory about a finite basis, the ''fixed past--uncertain future'' aspects of physics, and the necessity of dropping Bohr's requirement of reduction to the haptic language of commonsense and classical physics. However, it retains a constructive, hierarchial approach with can yield only an approximate and discrete ''space time'', and introduces the observation metaphysic at the start. Concrete interpretation of the four levels of the hierarchy (with cardinals 3, 7, 127, 2 127 -1 approx. =10 38 ) associates the three levels which map up and down with three absolute conservation laws (charge, baryon number, lepton number) and the spin dichotomy. The first level represents +, -, and +- unit charge. The second has the quantum nubmers of a baryon--antibaryon pair and associated charged meson (e.g., n anti n, p anti n, p anti p, n anti p, π + , π 0 , π - ). The third level associates this pair, now including four spin states as well as four charge states, with a neutral lepton--antilepton pair (e anti e or ν anti ν) in four spin states (total, 64 states): three charged spinless, three charged spin-1, and neutral spin-1 mesons (15 states), and a neutral vector boson associated with the leptons; this gives 3 + 15 + 3 x 15 = 63 possible boson states, so a total correct count of 63 + 64 = 127 states. Something like SU 2 X SU 3 and other indications of quark quantum numbers can occur as substructures at the fourth (unstable) level. A slight extension gives the usual static approximation to the building energy of the hydrogen atom, α 2 m/sub e/c 2 . Cosmological implications of the theory are in accord with current experience. A beginning in the physical interpretation of a theory which could eventually encompass all branches of physics was made. 3 figures, 6 tables
Solving multiconstraint assignment problems using learning automata.
Horn, Geir; Oommen, B John
2010-02-01
This paper considers the NP-hard problem of object assignment with respect to multiple constraints: assigning a set of elements (or objects) into mutually exclusive classes (or groups), where the elements which are "similar" to each other are hopefully located in the same class. The literature reports solutions in which the similarity constraint consists of a single index that is inappropriate for the type of multiconstraint problems considered here and where the constraints could simultaneously be contradictory. This feature, where we permit possibly contradictory constraints, distinguishes this paper from the state of the art. Indeed, we are aware of no learning automata (or other heuristic) solutions which solve this problem in its most general setting. Such a scenario is illustrated with the static mapping problem, which consists of distributing the processes of a parallel application onto a set of computing nodes. This is a classical and yet very important problem within the areas of parallel computing, grid computing, and cloud computing. We have developed four learning-automata (LA)-based algorithms to solve this problem: First, a fixed-structure stochastic automata algorithm is presented, where the processes try to form pairs to go onto the same node. This algorithm solves the problem, although it requires some centralized coordination. As it is desirable to avoid centralized control, we subsequently present three different variable-structure stochastic automata (VSSA) algorithms, which have superior partitioning properties in certain settings, although they forfeit some of the scalability features of the fixed-structure algorithm. All three VSSA algorithms model the processes as automata having first the hosting nodes as possible actions; second, the processes as possible actions; and, third, attempting to estimate the process communication digraph prior to probabilistically mapping the processes. This paper, which, we believe, comprehensively reports the
Morphological Constraints on Cerebellar Granule Cell Combinatorial Diversity.
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
The priming of basic combinatory responses in MEG.
Blanco-Elorrieta, Esti; Ferreira, Victor S; Del Prato, Paul; Pylkkänen, Liina
2018-01-01
Priming has been a powerful tool for the study of human memory and especially the memory representations relevant for language. However, although it is well established that lexical access can be primed, we do not know exactly what types of computations can be primed above the word level. This work took a neurobiological approach and assessed the ways in which the complex representation of a minimal combinatory phrase, such as red boat, can be primed, as evidenced by the spatiotemporal profiles of magnetoencephalography (MEG) signals. Specifically, we built upon recent progress on the neural signatures of phrasal composition and tested whether the brain activities implicated for the basic combination of two words could be primed. In two experiments, MEG was recorded during a picture naming task where the prime trials were designed to replicate previously reported combinatory effects and the target trials to test whether those combinatory effects could be primed. The manipulation of the primes was successful in eliciting larger activity for adjective-noun combinations than single nouns in left anterior temporal and ventromedial prefrontal cortices, replicating prior MEG studies on parallel contrasts. Priming of similarly timed activity was observed during target trials in anterior temporal cortex, but only when the prime and target shared an adjective. No priming in temporal cortex was observed for single word repetition and two control tasks showed that the priming effect was not elicited if the prime pictures were simply viewed but not named. In sum, this work provides evidence that very basic combinatory operations can be primed, with the necessity for some lexical overlap between prime and target suggesting combinatory conceptual, as opposed to syntactic processing. Both our combinatory and priming effects were early, onsetting between 100 and 150ms after picture onset and thus are likely to reflect the very earliest planning stages of a combinatory message
Locating phase transitions in computationally hard problems
Indian Academy of Sciences (India)
New applications of statistical mechanics; analysis of algorithms; heuristics; phase transitions and critical ...... KGaA, Weinheim, 2005). [12] S Zilberstein, AI Magazine 17, 73 (1996) ... versity Press Inc., New York, 1971). [17] F Baras, G Nicolis, ...
Science of consciousness and the hard problem
Energy Technology Data Exchange (ETDEWEB)
Stapp, H.P.
1996-05-22
Quantum theory is essentially a rationally coherent theory of the interaction of mind and matter, and it allows our conscious thoughts to play a causally efficacious and necessary role in brain dynamics. It therefore provides a natural basis, created by scientists, for the science of consciousness. As an illustration it is explained how the interaction of brain and consciousness can speed up brain processing, and thereby enhance the survival prospects of conscious organisms, as compared to similar organisms that lack consciousness. As a second illustration it is explained how, within the quantum framework, the consciously experienced {open_quotes}I{close_quotes} directs the actions of a human being. It is concluded that contemporary science already has an adequate framework for incorporating causally efficacious experimential events into the physical universe in a manner that: (1) puts the neural correlates of consciousness into the theory in a well defined way, (2) explains in principle how the effects of consciousness, per se, can enhance the survival prospects of organisms that possess it, (3) allows this survival effect to feed into phylogenetic development, and (4) explains how the consciously experienced {open_quotes}I{close_quotes} can direct human behaviour.
Hybrid Genetic Algorithm with Multiparents Crossover for Job Shop Scheduling Problems
Directory of Open Access Journals (Sweden)
Noor Hasnah Moin
2015-01-01
Full Text Available The job shop scheduling problem (JSSP is one of the well-known hard combinatorial scheduling problems. This paper proposes a hybrid genetic algorithm with multiparents crossover for JSSP. The multiparents crossover operator known as extended precedence preservative crossover (EPPX is able to recombine more than two parents to generate a single new offspring distinguished from common crossover operators that recombine only two parents. This algorithm also embeds a schedule generation procedure to generate full-active schedule that satisfies precedence constraints in order to reduce the search space. Once a schedule is obtained, a neighborhood search is applied to exploit the search space for better solutions and to enhance the GA. This hybrid genetic algorithm is simulated on a set of benchmarks from the literatures and the results are compared with other approaches to ensure the sustainability of this algorithm in solving JSSP. The results suggest that the implementation of multiparents crossover produces competitive results.
Balancing focused combinatorial libraries based on multiple GPCR ligands
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.
Summation on the basis of combinatorial representation of equal powers
Directory of Open Access Journals (Sweden)
Alexander I. Nikonov
2016-03-01
Full Text Available In the paper the conclusion of combinatorial expressions for the sums of members of several sequences is considered. Conclusion is made on the basis of combinatorial representation of the sum of the weighted equal powers. The weighted members of a geometrical progression, the simple arithmetic-geometrical and combined progressions are subject to summation. One of principal places in the given conclusion occupies representation of members of each of the specified progressions in the form of matrix elements. The row of this matrix is formed with use of a gang of equal powers with the set weight factor. Besides, in work formulas of combinatorial identities with participation of free components of the sums of equal powers, and also separate power-member of sequence of equal powers or a geometrical progression are presented. All presented formulas have the general basis-components of the sums of equal powers.
Combinatorial vector fields and the valley structure of fitness landscapes.
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.
Recent advances in combinatorial biosynthesis for drug discovery
Directory of Open Access Journals (Sweden)
Sun H
2015-02-01
Full Text Available Huihua Sun,1,* Zihe Liu,1,* Huimin Zhao,1,2 Ee Lui Ang1 1Metabolic Engineering Research Laboratory, Institute of Chemical and Engineering Sciences, Agency for Science, Technology and Research, Singapore; 2Department of Chemical and Biomolecular Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, USA *These authors contributed equally to this work Abstract: Because of extraordinary structural diversity and broad biological activities, natural products have played a significant role in drug discovery. These therapeutically important secondary metabolites are assembled and modified by dedicated biosynthetic pathways in their host living organisms. Traditionally, chemists have attempted to synthesize natural product analogs that are important sources of new drugs. However, the extraordinary structural complexity of natural products sometimes makes it challenging for traditional chemical synthesis, which usually involves multiple steps, harsh conditions, toxic organic solvents, and byproduct wastes. In contrast, combinatorial biosynthesis exploits substrate promiscuity and employs engineered enzymes and pathways to produce novel “unnatural” natural products, substantially expanding the structural diversity of natural products with potential pharmaceutical value. Thus, combinatorial biosynthesis provides an environmentally friendly way to produce natural product analogs. Efficient expression of the combinatorial biosynthetic pathway in genetically tractable heterologous hosts can increase the titer of the compound, eventually resulting in less expensive drugs. In this review, we will discuss three major strategies for combinatorial biosynthesis: 1 precursor-directed biosynthesis; 2 enzyme-level modification, which includes swapping of the entire domains, modules and subunits, site-specific mutagenesis, and directed evolution; 3 pathway-level recombination. Recent examples of combinatorial biosynthesis employing these
Combinatorial algebraic geometry selected papers from the 2016 apprenticeship program
Sturmfels, Bernd
2017-01-01
This volume consolidates selected articles from the 2016 Apprenticeship Program at the Fields Institute, part of the larger program on Combinatorial Algebraic Geometry that ran from July through December of 2016. Written primarily by junior mathematicians, the articles cover a range of topics in combinatorial algebraic geometry including curves, surfaces, Grassmannians, convexity, abelian varieties, and moduli spaces. This book bridges the gap between graduate courses and cutting-edge research by connecting historical sources, computation, explicit examples, and new results.
Some results from the combinatorial approach to quantum logic
International Nuclear Information System (INIS)
Greechie, R.J.
1976-01-01
The combinatorial approach to quantum logic focuses on certain interconnections between graphs, combinatorial designs, and convex sets as applied to a quantum logic. This article is concerned only with orthomodular lattices and associated structures. A class of complete atomic irreducible semimodular orthomodular lattices is derived which may not be represented as linear subspaces of a vector space over a division ring. Each of these lattices is a proposition system of dimension three. These proposition systems form orthocomplemented non-Desarguesian projective geometries. (B.R.H.)
Bivium as a Mixed Integer Programming Problem
DEFF Research Database (Denmark)
Borghoff, Julia; Knudsen, Lars Ramkilde; Stolpe, Mathias
2009-01-01
over $GF(2)$ into a combinatorial optimization problem. We convert the Boolean equation system into an equation system over $\\mathbb{R}$ and formulate the problem of finding a $0$-$1$-valued solution for the system as a mixed-integer programming problem. This enables us to make use of several...
Directory of Open Access Journals (Sweden)
R. Berdysheva
1998-03-01
Full Text Available Lower bounds of stability, pseudostability and quasistability radii of lexicographic set in vector combinatorial problem on systems of subsets of finite set with partial criteria of more general kinds have been found.
Solid-Phase Synthesis of Small Molecule Libraries using Double Combinatorial Chemistry
DEFF Research Database (Denmark)
Nielsen, John; Jensen, Flemming R.
1997-01-01
The first synthesis of a combinatorial library using double combinatorial chemistry is presented. Coupling of unprotected Fmoc-tyrosine to the solid support was followed by Mitsunobu O-alkylation. Introduction of a diacid linker yields a system in which the double combinatorial step can be demons...
Hard processes in hadronic interactions
International Nuclear Information System (INIS)
Satz, H.; Wang, X.N.
1995-01-01
Quantum chromodynamics is today accepted as the fundamental theory of strong interactions, even though most hadronic collisions lead to final states for which quantitative QCD predictions are still lacking. It therefore seems worthwhile to take stock of where we stand today and to what extent the presently available data on hard processes in hadronic collisions can be accounted for in terms of QCD. This is one reason for this work. The second reason - and in fact its original trigger - is the search for the quark-gluon plasma in high energy nuclear collisions. The hard processes to be considered here are the production of prompt photons, Drell-Yan dileptons, open charm, quarkonium states, and hard jets. For each of these, we discuss the present theoretical understanding, compare the resulting predictions to available data, and then show what behaviour it leads to at RHIC and LHC energies. All of these processes have the structure mentioned above: they contain a hard partonic interaction, calculable perturbatively, but also the non-perturbative parton distribution within a hadron. These parton distributions, however, can be studied theoretically in terms of counting rule arguments, and they can be checked independently by measurements of the parton structure functions in deep inelastic lepton-hadron scattering. The present volume is the work of Hard Probe Collaboration, a group of theorists who are interested in the problem and were willing to dedicate a considerable amount of their time and work on it. The necessary preparation, planning and coordination of the project were carried out in two workshops of two weeks' duration each, in February 1994 at CERn in Geneva andin July 1994 at LBL in Berkeley
Double hard scattering without double counting
Energy Technology Data Exchange (ETDEWEB)
Diehl, Markus [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Gaunt, Jonathan R. [VU Univ. Amsterdam (Netherlands). NIKHEF Theory Group; Schoenwald, Kay [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany)
2017-02-15
Double parton scattering in proton-proton collisions includes kinematic regions in which two partons inside a proton originate from the perturbative splitting of a single parton. This leads to a double counting problem between single and double hard scattering. We present a solution to this problem, which allows for the definition of double parton distributions as operator matrix elements in a proton, and which can be used at higher orders in perturbation theory. We show how the evaluation of double hard scattering in this framework can provide a rough estimate for the size of the higher-order contributions to single hard scattering that are affected by double counting. In a numeric study, we identify situations in which these higher-order contributions must be explicitly calculated and included if one wants to attain an accuracy at which double hard scattering becomes relevant, and other situations where such contributions may be neglected.
Methane in German hard coal mining
International Nuclear Information System (INIS)
Martens, P.N.; Den Drijver, J.
1995-01-01
Worldwide, hard coal mining is being carried out at ever increasing depth, and has, therefore, to cope with correspondingly increasing methane emissions are caused by coal mining. Beside carbon dioxide, chloro-fluoro-carbons (CFCs) and nitrogen oxides, methane is one of the most significant 'greenhouse' gases. It is mainly through the release of such trace gases that the greenhouse effect is brought about. Reducing methane emissions is therefore an important problem to be solved by the coal mining industry. This paper begins by highlighting some of the fundamental principles of methane in hard coal mining. The methane problem in German hard coal mining and the industry's efforts to reduce methane emissions are presented. The future development in German hard coal mining is illustrated by an example which shows how large methane volumes can be managed, while still maintaining high outputs at increasing depth. (author). 7 tabs., 10 figs., 20 refs
Double hard scattering without double counting
International Nuclear Information System (INIS)
Diehl, Markus; Gaunt, Jonathan R.
2017-02-01
Double parton scattering in proton-proton collisions includes kinematic regions in which two partons inside a proton originate from the perturbative splitting of a single parton. This leads to a double counting problem between single and double hard scattering. We present a solution to this problem, which allows for the definition of double parton distributions as operator matrix elements in a proton, and which can be used at higher orders in perturbation theory. We show how the evaluation of double hard scattering in this framework can provide a rough estimate for the size of the higher-order contributions to single hard scattering that are affected by double counting. In a numeric study, we identify situations in which these higher-order contributions must be explicitly calculated and included if one wants to attain an accuracy at which double hard scattering becomes relevant, and other situations where such contributions may be neglected.
2014-01-01
Comprehensive Hard Materials deals with the production, uses and properties of the carbides, nitrides and borides of these metals and those of titanium, as well as tools of ceramics, the superhard boron nitrides and diamond and related compounds. Articles include the technologies of powder production (including their precursor materials), milling, granulation, cold and hot compaction, sintering, hot isostatic pressing, hot-pressing, injection moulding, as well as on the coating technologies for refractory metals, hard metals and hard materials. The characterization, testing, quality assurance and applications are also covered. Comprehensive Hard Materials provides meaningful insights on materials at the leading edge of technology. It aids continued research and development of these materials and as such it is a critical information resource to academics and industry professionals facing the technological challenges of the future. Hard materials operate at the leading edge of technology, and continued res...
Nonlinear Multidimensional Assignment Problems Efficient Conic Optimization Methods and Applications
2015-06-24
WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Arizona State University School of Mathematical & Statistical Sciences 901 S...SUPPLEMENTARY NOTES 14. ABSTRACT The major goals of this project were completed: the exact solution of previously unsolved challenging combinatorial optimization... combinatorial optimization problem, the Directional Sensor Problem, was solved in two ways. First, heuristically in an engineering fashion and second, exactly
Genetic algorithm parameters tuning for resource-constrained project scheduling problem
Tian, Xingke; Yuan, Shengrui
2018-04-01
Project Scheduling Problem (RCPSP) is a kind of important scheduling problem. To achieve a certain optimal goal such as the shortest duration, the smallest cost, the resource balance and so on, it is required to arrange the start and finish of all tasks under the condition of satisfying project timing constraints and resource constraints. In theory, the problem belongs to the NP-hard problem, and the model is abundant. Many combinatorial optimization problems are special cases of RCPSP, such as job shop scheduling, flow shop scheduling and so on. At present, the genetic algorithm (GA) has been used to deal with the classical RCPSP problem and achieved remarkable results. Vast scholars have also studied the improved genetic algorithm for the RCPSP problem, which makes it to solve the RCPSP problem more efficiently and accurately. However, for the selection of the main parameters of the genetic algorithm, there is no parameter optimization in these studies. Generally, we used the empirical method, but it cannot ensure to meet the optimal parameters. In this paper, the problem was carried out, which is the blind selection of parameters in the process of solving the RCPSP problem. We made sampling analysis, the establishment of proxy model and ultimately solved the optimal parameters.
Polyomino Problems to Confuse Computers
Coffin, Stewart
2009-01-01
Computers are very good at solving certain types combinatorial problems, such as fitting sets of polyomino pieces into square or rectangular trays of a given size. However, most puzzle-solving programs now in use assume orthogonal arrangements. When one departs from the usual square grid layout, complications arise. The author--using a computer,…
Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem.
Rajeswari, M; Amudhavel, J; Pothula, Sujatha; Dhavachelvan, P
2017-01-01
The Nurse Rostering Problem is an NP-hard combinatorial optimization, scheduling problem for assigning a set of nurses to shifts per day by considering both hard and soft constraints. A novel metaheuristic technique is required for solving Nurse Rostering Problem (NRP). This work proposes a metaheuristic technique called Directed Bee Colony Optimization Algorithm using the Modified Nelder-Mead Method for solving the NRP. To solve the NRP, the authors used a multiobjective mathematical programming model and proposed a methodology for the adaptation of a Multiobjective Directed Bee Colony Optimization (MODBCO). MODBCO is used successfully for solving the multiobjective problem of optimizing the scheduling problems. This MODBCO is an integration of deterministic local search, multiagent particle system environment, and honey bee decision-making process. The performance of the algorithm is assessed using the standard dataset INRC2010, and it reflects many real-world cases which vary in size and complexity. The experimental analysis uses statistical tools to show the uniqueness of the algorithm on assessment criteria.
Isocyanide based multi component reactions in combinatorial chemistry.
Dömling, A.
1998-01-01
Although usually regarded as a recent development, the combinatorial approach to the synthesis of libraries of new drug candidates was first described as early as 1961 using the isocyanide-based one-pot multicomponent Ugi reaction. Isocyanide-based multi component reactions (MCR's) markedly differ
Dynamic Combinatorial Chemistry with Diselenides, Disulfides, Imines and Metal Coordination
DEFF Research Database (Denmark)
Sørensen, Anne
combinatorial chemistry, namely the reversible diselenide exchange reaction. The first part of the thesis describes the development of a thermally induced OAr → SeAr migration reaction. Here, it was proven possible to rearrange a variety of substituted O-aryl selenocarbamates into the corresponding Se...
Dynamic combinatorial chemistry at the phospholipid bilayer interface
Mansfeld, Friederike M.; Au-Yeung, Ho Yu; Sanders, Jeremy K.M.; Otto, Sijbren
2010-01-01
Background: Molecular recognition at the environment provided by the phospholipid bilayer interface plays an important role in biology and is subject of intense investigation. Dynamic combinatorial chemistry is a powerful approach for exploring molecular recognition, but has thus far not been
Combinatorial Solid-Phase Synthesis of Balanol Analogues
DEFF Research Database (Denmark)
Nielsen, John; Lyngsø, Lars Ole
1996-01-01
The natural product balanol has served as a template for the design and synthesis of a combinatorial library using solid-phase chemistry. Using a retrosynthetic analysis, the structural analogues have been assembled from three relatively accessible building blocks. The solid-phase chemistry inclu...
Combinatorial algorithms enabling computational science: tales from the front
International Nuclear Information System (INIS)
Bhowmick, Sanjukta; Boman, Erik G; Devine, Karen; Gebremedhin, Assefaw; Hendrickson, Bruce; Hovland, Paul; Munson, Todd; Pothen, Alex
2006-01-01
Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations. The importance of discrete algorithms continues to grow with the demands of new applications and advanced architectures. This paper surveys some recent developments in this rapidly changing and highly interdisciplinary field
Combinatorial structures and processing in neural blackboard architectures
van der Velde, Frank; van der Velde, Frank; de Kamps, Marc; Besold, Tarek R.; d'Avila Garcez, Artur; Marcus, Gary F.; Miikkulainen, Risto
2015-01-01
We discuss and illustrate Neural Blackboard Architectures (NBAs) as the basis for variable binding and combinatorial processing the brain. We focus on the NBA for sentence structure. NBAs are based on the notion that conceptual representations are in situ, hence cannot be copied or transported.
Combinatorial chemistry approach to development of molecular plastic solar cells
Godovsky, Dmitri; Inganäs, Olle; Brabec, Christoph J.; Sariciftci, N. Serdar; Hummelen, Jan C.; Janssen, Rene A.J.; Prato, M.; Maggini, M.; Segura, Jose; Martin, Nazario
1999-01-01
We used a combinatorial chemistry approach to develop the molecular plastic solar cells based on soluble fullerene derivatives or solubilized TCNQ molecules in combination with conjugated polymers. Profiles, formed by the diffusion of low molecular weight component in the spin-cast polymer host were
Angelin, Marcus; Larsson, Rikard; Vongvilai, Pornrapee; Ramstrom, Olof
2010-01-01
In this laboratory experiment, college students are introduced to dynamic combinatorial chemistry (DCC) and apply it to determine the substrate selectivity of acetylcholinesterase (AChE). Initially, the students construct a chemical library of dynamically interchanging thioesters and thiols. Then, AChE is added and allowed to select and hydrolyze…
Dynamic combinatorial libraries based on hydrogen-bonde molecular boxes
Kerckhoffs, J.M.C.A.; Mateos timoneda, Miguel; Reinhoudt, David; Crego Calama, Mercedes
2007-01-01
This article describes two different types of dynamic combinatorial libraries of host and guest molecules. The first part of this article describes the encapsulation of alizarin trimer 2 a3 by dynamic mixtures of up to twenty different self-assembled molecular receptors together with the
Anti-termite efficacy of Capparis decidua and its combinatorial ...
African Journals Online (AJOL)
Michael Horsfall
ABSTRACT: Capparis deciduas and its combinatorial mixtures were evaluated to observe the anti-termite efficacy against Indian white termite Odontotermes obesus. These have shown very high termiticidal activity and wood protection in the soil. It is proved by very low LD50 values i.e. 0.0218mg/g and 0.021mg/g obtained ...
Combinatorial algorithms enabling computational science: tales from the front
Energy Technology Data Exchange (ETDEWEB)
Bhowmick, Sanjukta [Mathematics and Computer Science Division, Argonne National Laboratory (United States); Boman, Erik G [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Devine, Karen [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Gebremedhin, Assefaw [Computer Science Department, Old Dominion University (United States); Hendrickson, Bruce [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Hovland, Paul [Mathematics and Computer Science Division, Argonne National Laboratory (United States); Munson, Todd [Mathematics and Computer Science Division, Argonne National Laboratory (United States); Pothen, Alex [Computer Science Department, Old Dominion University (United States)
2006-09-15
Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations. The importance of discrete algorithms continues to grow with the demands of new applications and advanced architectures. This paper surveys some recent developments in this rapidly changing and highly interdisciplinary field.
Some Combinatorial Interpretations and Applications of Fuss-Catalan Numbers
Lin, Chin-Hung
2011-01-01
Fuss-Catalan number is a family of generalized Catalan numbers. We begin by two definitions of Fuss-Catalan numbers and some basic properties. And we give some combinatorial interpretations different from original Catalan numbers. Finally we generalize the Jonah's theorem as its applications.
A Combinatorial Proof of a Result on Generalized Lucas Polynomials
Directory of Open Access Journals (Sweden)
Laugier Alexandre
2016-09-01
Full Text Available We give a combinatorial proof of an elementary property of generalized Lucas polynomials, inspired by [1]. These polynomials in s and t are defined by the recurrence relation 〈n〉 = s〈n-1〉+t〈n-2〉 for n ≥ 2. The initial values are 〈0〉 = 2; 〈1〉= s, respectively.
A combinatorial approximation algorithm for CDMA downlink rate allocation
Boucherie, Richardus J.; Bumb, A.F.; Endrayanto, A.I.; Woeginger, Gerhard; Raghavan, S.; Anandalingam, G.
2006-01-01
This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system
A combinatorial approximation algorithm for CDMA downlink rate allocation
Boucherie, Richardus J.; Bumb, A.F.; Endrayanto, A.I.; Woeginger, Gerhard
2004-01-01
This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system
Paths and partitions: Combinatorial descriptions of the parafermionic states
Mathieu, Pierre
2009-09-01
The Zk parafermionic conformal field theories, despite the relative complexity of their modes algebra, offer the simplest context for the study of the bases of states and their different combinatorial representations. Three bases are known. The classic one is given by strings of the fundamental parafermionic operators whose sequences of modes are in correspondence with restricted partitions with parts at distance k -1 differing at least by 2. Another basis is expressed in terms of the ordered modes of the k -1 different parafermionic fields, which are in correspondence with the so-called multiple partitions. Both types of partitions have a natural (Bressoud) path representation. Finally, a third basis, formulated in terms of different paths, is inherited from the solution of the restricted solid-on-solid model of Andrews-Baxter-Forrester. The aim of this work is to review, in a unified and pedagogical exposition, these four different combinatorial representations of the states of the Zk parafermionic models. The first part of this article presents the different paths and partitions and their bijective relations; it is purely combinatorial, self-contained, and elementary; it can be read independently of the conformal-field-theory applications. The second part links this combinatorial analysis with the bases of states of the Zk parafermionic theories. With the prototypical example of the parafermionic models worked out in detail, this analysis contributes to fix some foundations for the combinatorial study of more complicated theories. Indeed, as we briefly indicate in ending, generalized versions of both the Bressoud and the Andrews-Baxter-Forrester paths emerge naturally in the description of the minimal models.
Gunnels, John; Lee, Jon; Margulies, Susan
2010-01-01
We provide a first demonstration of the idea that matrix-based algorithms for nonlinear combinatorial optimization problems can be efficiently implemented. Such algorithms were mainly conceived by theoretical computer scientists for proving efficiency. We are able to demonstrate the practicality of our approach by developing an implementation on a massively parallel architecture, and exploiting scalable and efficient parallel implementations of algorithms for ultra high-precision linear algebra. Additionally, we have delineated and implemented the necessary algorithmic and coding changes required in order to address problems several orders of magnitude larger, dealing with the limits of scalability from memory footprint, computational efficiency, reliability, and interconnect perspectives. © Springer and Mathematical Programming Society 2010.
Combinatorial Algorithms for Computing Column Space Bases ThatHave Sparse Inverses
Energy Technology Data Exchange (ETDEWEB)
Pinar, Ali; Chow, Edmond; Pothen, Alex
2005-03-18
This paper presents a combinatorial study on the problem ofconstructing a sparse basis forthe null-space of a sparse, underdetermined, full rank matrix, A. Such a null-space is suitable forsolving solving many saddle point problems. Our approach is to form acolumn space basis of A that has a sparse inverse, by selecting suitablecolumns of A. This basis is then used to form a sparse null-space basisin fundamental form. We investigate three different algorithms forcomputing the column space basis: Two greedy approaches that rely onmatching, and a third employing a divide and conquer strategy implementedwith hypergraph partitioning followed by the greedy approach. We alsodiscuss the complexity of selecting a column basis when it is known thata block diagonal basis exists with a small given block size.
Gunnels, John
2010-06-01
We provide a first demonstration of the idea that matrix-based algorithms for nonlinear combinatorial optimization problems can be efficiently implemented. Such algorithms were mainly conceived by theoretical computer scientists for proving efficiency. We are able to demonstrate the practicality of our approach by developing an implementation on a massively parallel architecture, and exploiting scalable and efficient parallel implementations of algorithms for ultra high-precision linear algebra. Additionally, we have delineated and implemented the necessary algorithmic and coding changes required in order to address problems several orders of magnitude larger, dealing with the limits of scalability from memory footprint, computational efficiency, reliability, and interconnect perspectives. © Springer and Mathematical Programming Society 2010.
Car sequencing is NP-hard: a short proof
B Estellon; F Gardi
2013-01-01
In this note, a new proof is given that the car sequencing (CS) problem is NP-hard. Established from the Hamiltonian Path problem, the reduction is direct while closing some gaps remaining in the previous NP-hardness results. Since CS is studied in many operational research courses, this result and its proof are particularly interesting for teaching purposes.
Resolving combinatorial ambiguities in dilepton t t¯ event topologies with constrained M2 variables
Debnath, Dipsikha; Kim, Doojin; Kim, Jeong Han; Kong, Kyoungchul; Matchev, Konstantin T.
2017-10-01
We advocate the use of on-shell constrained M2 variables in order to mitigate the combinatorial problem in supersymmetry-like events with two invisible particles at the LHC. We show that in comparison to other approaches in the literature, the constrained M2 variables provide superior ansätze for the unmeasured invisible momenta and therefore can be usefully applied to discriminate combinatorial ambiguities. We illustrate our procedure with the example of dilepton t t ¯ events. We critically review the existing methods based on the Cambridge MT 2 variable and MAOS reconstruction of invisible momenta, and show that their algorithm can be simplified without loss of sensitivity, due to a perfect correlation between events with complex solutions for the invisible momenta and events exhibiting a kinematic endpoint violation. Then we demonstrate that the efficiency for selecting the correct partition is further improved by utilizing the M2 variables instead. Finally, we also consider the general case when the underlying mass spectrum is unknown, and no kinematic endpoint information is available.
Directory of Open Access Journals (Sweden)
Gary eMorgan
2014-11-01
Full Text Available Languages are composed of a conventionalized system of parts which allow speakers and signers to compose an infinite number of form-meaning mappings through phonological and morphological combinations. This level of linguistic organization distinguishes language from other communicative acts such as gestures. In contrast to signs, gestures are made up of meaning units that are mostly holistic. Children exposed to signed and spoken languages from early in life develop grammatical structure following similar rates and patterns. This is interesting, because signed languages are perceived and articulated in very different ways to their spoken counterparts with many signs displaying surface resemblances to gestures. The acquisition of forms and meanings in child signers and talkers might thus have been a different process. Yet in one sense both groups are faced with a similar problem: 'how do I make a language with combinatorial structure’? In this paper I argue first language development itself enables this to happen and by broadly similar mechanisms across modalities. Combinatorial structure is the outcome of phonological simplifications and productivity in using verb morphology by children in sign and speech.
Generating an Automated Test Suite by Variable Strength Combinatorial Testing for Web Services
Directory of Open Access Journals (Sweden)
Yin Li
2016-09-01
Full Text Available Testing Web Services has become the spotlight of software engineering as an important means to assure the quality of Web application. Due to lacking of graphic interface and source code, Web services need an automated testing method, which is an important part in efficiently designing and generating test suite. However, the existing testing methods may lead to the redundancy of test suite and the decrease of fault-detecting ability since it cannot handle scenarios where the strengths of the different interactions are not uniform. With the purpose of solving this problem, firstly the formal tree model based on WSDL is constructed and the actual interaction relationship of each node is made sufficient consideration into, then the combinatorial testing is proposed to generate variable strength combinatorial test suite based on One-test-at-a-time strategy. At last test cases are minimized according to constraint rules. The results show that compared with conventional random testing, the proposed approach can detect more errors with the same amount of test cases which turning out to be more ideal than existing ones in size.
Exact combinatorial reliability analysis of dynamic systems with sequence-dependent failures
International Nuclear Information System (INIS)
Xing Liudong; Shrestha, Akhilesh; Dai Yuanshun
2011-01-01
Many real-life fault-tolerant systems are subjected to sequence-dependent failure behavior, in which the order in which the fault events occur is important to the system reliability. Such systems can be modeled by dynamic fault trees (DFT) with priority-AND (pAND) gates. Existing approaches for the reliability analysis of systems subjected to sequence-dependent failures are typically state-space-based, simulation-based or inclusion-exclusion-based methods. Those methods either suffer from the state-space explosion problem or require long computation time especially when results with high degree of accuracy are desired. In this paper, an analytical method based on sequential binary decision diagrams is proposed. The proposed approach can analyze the exact reliability of non-repairable dynamic systems subjected to the sequence-dependent failure behavior. Also, the proposed approach is combinatorial and is applicable for analyzing systems with any arbitrary component time-to-failure distributions. The application and advantages of the proposed approach are illustrated through analysis of several examples. - Highlights: → We analyze the sequence-dependent failure behavior using combinatorial models. → The method has no limitation on the type of time-to-failure distributions. → The method is analytical and based on sequential binary decision diagrams (SBDD). → The method is computationally more efficient than existing methods.
Induced spherococcoid hard wheat
International Nuclear Information System (INIS)
Yanev, Sh.
1981-01-01
A mutant has been obtained - a spheroccocoid line -through irradiation of hard wheat seed with fast neutrons. It is distinguished by semispherical glumes and smaller grain; the plants have low stem with erect leaves but with shorter spikes and with lesser number of spikelets than those of the initial cultivar. Good productive tillering and resistance to lodging contributed to 23.5% higher yield. The line was superior to the standard and the initial cultivars by 14.2% as regards protein content, and by up to 22.8% - as to flour gluten. It has been successfully used in hybridization producing high-yielding hard wheat lines resistant to lodging, with good technological and other indicators. The possibility stated is of obtaining a spherococcoid mutant in tetraploid (hard) wheat out of the D-genome as well as its being suited to hard wheat breeding to enhance protein content, resistance to lodging, etc. (author)
2006-01-01
"The second international conference on hard and electromagnetic probes of high-energy nuclear collisions was held June 9 to 16, 2006 at the Asilomar Conference grounds in Pacific Grove, California" (photo and 1/2 page)
Quantum Adiabatic Optimization and Combinatorial Landscapes
Smelyanskiy, V. N.; Knysh, S.; Morris, R. D.
2003-01-01
In this paper we analyze the performance of the Quantum Adiabatic Evolution (QAE) algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma = M / N. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (verses only energy) is used, and are able to show the existence of a dynamic threshold gamma = gammad, beyond which QAE should take an exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz.
Energy Technology Data Exchange (ETDEWEB)
Loo, Kai van de; Sitte, Andreas-Peter [Gesamtverband Steinkohle e.V., Herne (Germany)
2013-04-01
The year 2012 benefited from a growth of the consumption of hard coal at the national level as well as at the international level. Worldwide, the hard coal still is the number one energy source for power generation. This leads to an increasing demand for power plant coal. In this year, the conversion of hard coal into electricity also increases in this year. In contrast to this, the demand for coking coal as well as for coke of the steel industry is still declining depending on the market conditions. The enhanced utilization of coal for the domestic power generation is due to the reduction of the nuclear power from a relatively bad year for wind power as well as reduced import prices and low CO{sub 2} prices. Both justify a significant price advantage for coal in comparison to the utilisation of natural gas in power plants. This was mainly due to the price erosion of the inexpensive US coal which partly was replaced by the expansion of shale gas on the domestic market. As a result of this, the inexpensive US coal looked for an outlet for sales in Europe. The domestic hard coal has continued the process of adaptation and phase-out as scheduled. Two further hard coal mines were decommissioned in the year 2012. RAG Aktiengesellschaft (Herne, Federal Republic of Germany) running the hard coal mining in this country begins with the preparations for the activities after the time of mining.
A combinatorial framework for map labeling
Wagner, F.; Wolff, A.; Whitesides, S.
1998-01-01
The general map labeling problem consists in labeling a set of sites (points, lines, regions) given a set of candidates (rectangles, circles, ellipses, irregularly shaped labels) for each site. A map can be a classical cartographical map, a diagram, a graph or any other figure that needs to be
Boltzmann machines for travelling salesman problems
Aarts, E.H.L.; Korst, J.H.M.
1989-01-01
Boltzmann machines are proposed as a massively parallel alternative to the (sequential) simulated annealing algorithm. Our approach is tailored to the travelling salesman problem, but it can also be applied to a more general class of combinatorial optimization problems. For two distinct 0–1
ANALYSIS AND PERFORMANCE MEASUREMENT OF EXISTING SOLUTION METHODS OF QUADRATIC ASSIGNMENT PROBLEM
Directory of Open Access Journals (Sweden)
Morteza KARAMI
2014-01-01
Full Text Available Quadratic Assignment Problem (QAP is known as one of the most difficult combinatorial optimization problems that is classified in the category of NP-hard problems. Quadratic Assignment Problem Library (QAPLIB is a full database of QAPs which contains several problems from different authors and different sizes. Many exact and meta-heuristic solution methods have been introduced to solve QAP. In this study we focus on previously introduced solution methods of QAP e.g. Branch and Bound (B&B, Simulated Annealing (SA Algorithm, Greedy Randomized Adaptive Search Procedure (GRASP for dense and sparse QAPs. The codes of FORTRAN for these methods were downloaded from QAPLIB. All problems of QAPLIB were solved by the abovementioned methods. Several results were obtained from the computational experiments part. The Results show that the Branch and Bound method is able to introduce a feasible solution for all problems while Simulated Annealing Algorithm and GRASP methods are not able to find any solution for some problems. On the other hand, Simulated Annealing and GRASP methods have shorter run time comparing to the Branch and Bound method. In addition, the performance of the methods on the objective function value is discussed.
A GPU Implementation of Local Search Operators for Symmetric Travelling Salesman Problem
Directory of Open Access Journals (Sweden)
Juraj Fosin
2013-06-01
Full Text Available The Travelling Salesman Problem (TSP is one of the most studied combinatorial optimization problem which is significant in many practical applications in transportation problems. The TSP problem is NP-hard problem and requires large computation power to be solved by the exact algorithms. In the past few years, fast development of general-purpose Graphics Processing Units (GPUs has brought huge improvement in decreasing the applications’ execution time. In this paper, we implement 2-opt and 3-opt local search operators for solving the TSP on the GPU using CUDA. The novelty presented in this paper is a new parallel iterated local search approach with 2-opt and 3-opt operators for symmetric TSP, optimized for the execution on GPUs. With our implementation large TSP problems (up to 85,900 cities can be solved using the GPU. We will show that our GPU implementation can be up to 20x faster without losing quality for all TSPlib problems as well as for our CRO TSP problem.
Programme for test generation for combinatorial and sequential systems
International Nuclear Information System (INIS)
Tran Huy Hoan
1973-01-01
This research thesis reports the computer-assisted search for tests aimed at failure detection in combinatorial and sequential logic circuits. As he wants to deal with complex circuits with many modules such as those met in large scale integrated circuits (LSI), the author used propagation paths. He reports the development of a method which is valid for combinatorial systems and for several sequential circuits comprising elementary logic modules and JK and RS flip-flops. This method is developed on an IBM 360/91 computer in PL/1 language. The used memory space is limited and adjustable with respect to circuit dimension. Computing time is short when compared to that needed by other programmes. The solution is practical and efficient for failure test and localisation
An Atlas of Combinatorial Transcriptional Regulation in Mouse and Man
Ravasi, Timothy; Suzuki, Harukazu; Cannistraci, Carlo; Katayama, Shintaro; Bajic, Vladimir B.; Tan, Kai; Akalin, Altuna; Schmeier, Sebastian; Kanamori-Katayama, Mutsumi; Bertin, Nicolas; Carninci, Piero; Daub, Carsten O.; Forrest, Alistair R.R.; Gough, Julian; Grimmond, Sean; Han, Jung-Hoon; Hashimoto, Takehiro; Hide, Winston; Hofmann, Oliver; Kamburov, Atanas; Kaur, Mandeep; Kawaji, Hideya; Kubosaki, Atsutaka; Lassmann, Timo; van Nimwegen, Erik; MacPherson, Cameron Ross; Ogawa, Chihiro; Radovanovic, Aleksandar; Schwartz, Ariel; Teasdale, Rohan D.; Tegné r, Jesper; Lenhard, Boris; Teichmann, Sarah A.; Arakawa, Takahiro; Ninomiya, Noriko; Murakami, Kayoko; Tagami, Michihira; Fukuda, Shiro; Imamura, Kengo; Kai, Chikatoshi; Ishihara, Ryoko; Kitazume, Yayoi; Kawai, Jun; Hume, David A.; Ideker, Trey; Hayashizaki, Yoshihide
2010-01-01
Combinatorial interactions among transcription factors are critical to directing tissue-specific gene expression. To build a global atlas of these combinations, we have screened for physical interactions among the majority of human and mouse DNA-binding transcription factors (TFs). The complete networks contain 762 human and 877 mouse interactions. Analysis of the networks reveals that highly connected TFs are broadly expressed across tissues, and that roughly half of the measured interactions are conserved between mouse and human. The data highlight the importance of TF combinations for determining cell fate, and they lead to the identification of a SMAD3/FLI1 complex expressed during development of immunity. The availability of large TF combinatorial networks in both human and mouse will provide many opportunities to study gene regulation, tissue differentiation, and mammalian evolution.
Laguerre-type derivatives: Dobinski relations and combinatorial identities
International Nuclear Information System (INIS)
Penson, K. A.; Blasiak, P.; Horzela, A.; Duchamp, G. H. E.; Solomon, A. I.
2009-01-01
We consider properties of the operators D(r,M)=a r (a † a) M (which we call generalized Laguerre-type derivatives), with r=1,2,..., M=0,1,..., where a and a † are boson annihilation and creation operators, respectively, satisfying [a,a † ]=1. We obtain explicit formulas for the normally ordered form of arbitrary Taylor-expandable functions of D(r,M) with the help of an operator relation that generalizes the Dobinski formula. Coherent state expectation values of certain operator functions of D(r,M) turn out to be generating functions of combinatorial numbers. In many cases the corresponding combinatorial structures can be explicitly identified.
An Atlas of Combinatorial Transcriptional Regulation in Mouse and Man
Ravasi, Timothy
2010-03-01
Combinatorial interactions among transcription factors are critical to directing tissue-specific gene expression. To build a global atlas of these combinations, we have screened for physical interactions among the majority of human and mouse DNA-binding transcription factors (TFs). The complete networks contain 762 human and 877 mouse interactions. Analysis of the networks reveals that highly connected TFs are broadly expressed across tissues, and that roughly half of the measured interactions are conserved between mouse and human. The data highlight the importance of TF combinations for determining cell fate, and they lead to the identification of a SMAD3/FLI1 complex expressed during development of immunity. The availability of large TF combinatorial networks in both human and mouse will provide many opportunities to study gene regulation, tissue differentiation, and mammalian evolution.
Non-unique factorizations algebraic, combinatorial and analytic theory
Geroldinger, Alfred
2006-01-01
From its origins in algebraic number theory, the theory of non-unique factorizations has emerged as an independent branch of algebra and number theory. Focused efforts over the past few decades have wrought a great number and variety of results. However, these remain dispersed throughout the vast literature. For the first time, Non-Unique Factorizations: Algebraic, Combinatorial, and Analytic Theory offers a look at the present state of the theory in a single, unified resource.Taking a broad look at the algebraic, combinatorial, and analytic fundamentals, this book derives factorization results and applies them in concrete arithmetical situations using appropriate transfer principles. It begins with a basic introduction that can be understood with knowledge of standard basic algebra. The authors then move to the algebraic theory of monoids, arithmetic theory of monoids, the structure of sets of lengths, additive group theory, arithmetical invariants, and the arithmetic of Krull monoids. They also provide a s...
Combinatorial nuclear level density by a Monte Carlo method
International Nuclear Information System (INIS)
Cerf, N.
1994-01-01
We present a new combinatorial method for the calculation of the nuclear level density. It is based on a Monte Carlo technique, in order to avoid a direct counting procedure which is generally impracticable for high-A nuclei. The Monte Carlo simulation, making use of the Metropolis sampling scheme, allows a computationally fast estimate of the level density for many fermion systems in large shell model spaces. We emphasize the advantages of this Monte Carlo approach, particularly concerning the prediction of the spin and parity distributions of the excited states,and compare our results with those derived from a traditional combinatorial or a statistical method. Such a Monte Carlo technique seems very promising to determine accurate level densities in a large energy range for nuclear reaction calculations
Obfuscation Framework Based on Functionally Equivalent Combinatorial Logic Families
2008-03-01
of Defense, or the United States Government . AFIT/GCS/ENG/08-12 Obfuscation Framework Based on Functionally Equivalent Combinatorial Logic Families...time, United States policy strongly encourages the sale and transfer of some military equipment to foreign governments and makes it easier for...Proceedings of the International Conference on Availability, Reliability and Security, 2007. 14. McDonald, J. Todd and Alec Yasinsac. “Of unicorns and random
Combinatorial drug screening identifies Ewing sarcoma-specific sensitivities
Radic-Sarikas, Branka; Tsafou, Kalliopi P.; Emdal, Kristina B.; Papamarkou, Theodore; Huber, Kilian V.M.; Mutz, Cornelia; Toretsky, Jeffrey A.; Bennett, Keiryn L.; Olsen, Jesper V.; Brunak, Søren; Kovar, Heinrich; Superti-Furga, Giulio
2017-01-01
Improvements in survival for Ewing sarcoma pediatric and adolescent patients have been modest over the past 20 years. Combinations of anticancer agents endure as an option to overcome resistance to single treatments caused by compensatory pathways. Moreover, combinations are thought to lessen any associated adverse side effects through reduced dosing, which is particularly important in childhood tumors. Using a parallel phenotypic combinatorial screening approach of cells derived from three p...
Rapid mapping of protein functional epitopes by combinatorial alanine scanning
Weiss, GA; Watanabe, CK; Zhong, A; Goddard, A; Sidhu, SS
2000-01-01
A combinatorial alanine-scanning strategy was used to determine simultaneously the functional contributions of 19 side chains buried at the interface between human growth hormone and the extracellular domain of its receptor. A phage-displayed protein library was constructed in which the 19 side chains were preferentially allowed to vary only as the wild type or alanine. The library pool was subjected to binding selections to isolate functional clones, and DNA sequencing was used to determine ...
Combinatorial Models for Assembly and Decomposition of Products
A. N. Bojko
2015-01-01
The paper discusses the most popular combinatorial models that are used for the synthesis of design solutions at the stage of the assembly process flow preparation. It shows that while assembling the product the relations of parts can be represented as a structure of preferences, which is formed on the basis of objective design restrictions put in at the stage of the product design. This structure is a binary preference relation pre-order. Its symmetrical part is equivalence and describes the...
A binary plasmid system for shuffling combinatorial antibody libraries.
Collet, T A; Roben, P; O'Kennedy, R; Barbas, C F; Burton, D R; Lerner, R A
1992-01-01
We have used a binary system of replicon-compatible plasmids to test the potential for promiscuous recombination of heavy and light chains within sets of human Fab fragments isolated from combinatorial antibody libraries. Antibody molecules showed a surprising amount of promiscuity in that a particular heavy chain could recombine with multiple light chains with retention of binding to a protein antigen. The degree to which a given heavy chain productively paired with any light chain to bind a...
View discovery in OLAP databases through statistical combinatorial optimization
Energy Technology Data Exchange (ETDEWEB)
Hengartner, Nick W [Los Alamos National Laboratory; Burke, John [PNNL; Critchlow, Terence [PNNL; Joslyn, Cliff [PNNL; Hogan, Emilie [PNNL
2009-01-01
OnLine Analytical Processing (OLAP) is a relational database technology providing users with rapid access to summary, aggregated views of a single large database, and is widely recognized for knowledge representation and discovery in high-dimensional relational databases. OLAP technologies provide intuitive and graphical access to the massively complex set of possible summary views available in large relational (SQL) structured data repositories. The capability of OLAP database software systems to handle data complexity comes at a high price for analysts, presenting them a combinatorially vast space of views of a relational database. We respond to the need to deploy technologies sufficient to allow users to guide themselves to areas of local structure by casting the space of 'views' of an OLAP database as a combinatorial object of all projections and subsets, and 'view discovery' as an search process over that lattice. We equip the view lattice with statistical information theoretical measures sufficient to support a combinatorial optimization process. We outline 'hop-chaining' as a particular view discovery algorithm over this object, wherein users are guided across a permutation of the dimensions by searching for successive two-dimensional views, pushing seen dimensions into an increasingly large background filter in a 'spiraling' search process. We illustrate this work in the context of data cubes recording summary statistics for radiation portal monitors at US ports.
View Discovery in OLAP Databases through Statistical Combinatorial Optimization
Energy Technology Data Exchange (ETDEWEB)
Joslyn, Cliff A.; Burke, Edward J.; Critchlow, Terence J.
2009-05-01
The capability of OLAP database software systems to handle data complexity comes at a high price for analysts, presenting them a combinatorially vast space of views of a relational database. We respond to the need to deploy technologies sufficient to allow users to guide themselves to areas of local structure by casting the space of ``views'' of an OLAP database as a combinatorial object of all projections and subsets, and ``view discovery'' as an search process over that lattice. We equip the view lattice with statistical information theoretical measures sufficient to support a combinatorial optimization process. We outline ``hop-chaining'' as a particular view discovery algorithm over this object, wherein users are guided across a permutation of the dimensions by searching for successive two-dimensional views, pushing seen dimensions into an increasingly large background filter in a ``spiraling'' search process. We illustrate this work in the context of data cubes recording summary statistics for radiation portal monitors at US ports.
On combinatorial properties of elementary intramolecular operations
Directory of Open Access Journals (Sweden)
Vladimir Rogojin
2014-11-01
Full Text Available Here we tackle a problem from biology in terms of discrete mathematics. We are interested in a complex DNA manipulation process happening in eukaryotic organisms of a subclass of ciliate species called {\\it Stichotrichia} during so-called gene assembly. This process is in particular interesting since one can interpret gene assembly in ciliates as sorting of permutations. We survey here results related to studies on sorting permutations with some specific rewriting rules that formalize elementary intramolecular gene assembly operations. The research question is ``what permutation may be sorted with our operations?"
Energy Technology Data Exchange (ETDEWEB)
Kugler, W.
2007-01-15
Hard exclusive processes in high energy electron proton scattering offer the opportunity to get access to a new generation of parton distributions, the so-called generalized parton distributions (GPDs). This functions provide more detailed informations about the structure of the nucleon than the usual PDFs obtained from DIS. In this work we present a detailed analysis of exclusive processes, especially of hard exclusive meson production. We investigated the influence of exclusive produced mesons on the semi-inclusive production of mesons at fixed target experiments like HERMES. Further we give a detailed analysis of higher order corrections (NLO) for the exclusive production of mesons in a very broad range of kinematics. (orig.)
2003-01-01
CERN will be organizing a special information day on Friday, 27th June, designed to promote the wearing of hard hats and ensure that they are worn correctly. A new prevention campaign will also be launched.The event will take place in the hall of the Main Building from 11.30 a.m. to 2.00 p.m., when you will be able to come and try on various models of hard hat, including some of the very latest innovative designs, ask questions and pass on any comments and suggestions.
Systematic hardness studies on lithium niobate crystals
Indian Academy of Sciences (India)
Unknown
crystals with different growth origins, and a Fe-doped sample. The problem of load ... The true hardness of LiNbO3 is found to be 630 ± 30 kg/mm2. .... Experimental. Pure lithium ... the index of d strikes at this simple and meaningful defini-.
Energy Technology Data Exchange (ETDEWEB)
Grunwald, Markus
2012-10-02
The prices of silicon and solar wafers keep dropping. According to market research specialist IMS research, this is the result of weak traditional solar markets and global overcapacities. While many manufacturers are facing hard times, big producers of silicon are continuing to expand.
Indian Academy of Sciences (India)
First page Back Continue Last page Overview Graphics. Hardness of Clustering. Both k-means and k-medians intractable (when n and d are both inputs even for k =2). The best known deterministic algorithms. are based on Voronoi partitioning that. takes about time. Need for approximation – “close” to optimal.
Muller, M.
2007-01-01
Aircraft jet engines have to be able to withstand infernal conditions. Extreme heat and bitter cold tax coatings to the limit. Materials expert Dr Ir. Wim Sloof fits atoms together to develop rock-hard coatings. The latest invention in this field is known as ceramic matrix composites. Sloof has signed an agreement with a number of parties to investigate this material further.
Muller, M.
2007-01-01
Aircraft jet engines have to be able to withstand infernal conditions. Extreme heat and bitter cold tax coatings to the limit. Materials expert Dr Ir. Wim Sloof fits atoms together to develop rock-hard coatings. The latest invention in this field is known as ceramic matrix composites. Sloof has
Hardness and excitation energy
Indian Academy of Sciences (India)
It is shown that the first excitation energy can be given by the Kohn-Sham hardness (i.e. the energy difference of the ground-state lowest unoccupied and highest occupied levels) plus an extra term coming from the partial derivative of the ensemble exchange-correlation energy with respect to the weighting factor in the ...
Testan, Peter R.
1987-04-01
A number of Color Hard Copy (CHC) market drivers are currently indicating strong growth in the use of CHC technologies for the business graphics marketplace. These market drivers relate to product, software, color monitors and color copiers. The use of color in business graphics allows more information to be relayed than is normally the case in a monochrome format. The communicative powers of full-color computer generated output in the business graphics application area will continue to induce end users to desire and require color in their future applications. A number of color hard copy technologies will be utilized in the presentation graphics arena. Thermal transfer, ink jet, photographic and electrophotographic technologies are all expected to be utilized in the business graphics presentation application area in the future. Since the end of 1984, the availability of color application software packages has grown significantly. Sales revenue generated by business graphics software is expected to grow at a compound annual growth rate of just over 40 percent to 1990. Increased availability of packages to allow the integration of text and graphics is expected. Currently, the latest versions of page description languages such as Postscript, Interpress and DDL all support color output. The use of color monitors will also drive the demand for color hard copy in the business graphics market place. The availability of higher resolution screens is allowing color monitors to be easily used for both text and graphics applications in the office environment. During 1987, the sales of color monitors are expected to surpass the sales of monochrome monitors. Another major color hard copy market driver will be the color copier. In order to take advantage of the communications power of computer generated color output, multiple copies are required for distribution. Product introductions of a new generation of color copiers is now underway with additional introductions expected
Simulated annealing (SA to vehicle routing problems with soft time windows
Directory of Open Access Journals (Sweden)
Suphan Sodsoon
2014-12-01
Full Text Available The researcher has applied and develops the meta-heuristics method to solve Vehicle Routing Problems with Soft Time Windows (VRPSTW. For this case there was only one depot, multi customers which each generally sparse either or demand was different though perceived number of demand and specific period of time to receive them. The Operation Research was representative combinatorial optimization problems and is known to be NP-hard. In this research algorithm, use Simulated Annealing (SA to determine the optimum solutions which rapidly time solving. After developed the algorithms, apply them to examine the factors and the optimum extended time windows and test these factors with vehicle problem routing under specific time windows by Solomon in OR-Library in case of maximum 25 customers. Meanwhile, 6 problems are including of C101, C102, R101, R102, RC101 and RC102 respectively. The result shows the optimum extended time windows at level of 50%. At last, after comparison these answers with the case of vehicle problem routing under specific time windows and flexible time windows, found that percentage errors on number of vehicles approximately by -28.57% and percentage errors on distances approximately by -28.57% which this algorithm spent average processing time on 45.5 sec/problems.
Simulated annealing algorithm for solving chambering student-case assignment problem
Ghazali, Saadiah; Abdul-Rahman, Syariza
2015-12-01
The problem related to project assignment problem is one of popular practical problem that appear nowadays. The challenge of solving the problem raise whenever the complexity related to preferences, the existence of real-world constraints and problem size increased. This study focuses on solving a chambering student-case assignment problem by using a simulated annealing algorithm where this problem is classified under project assignment problem. The project assignment problem is considered as hard combinatorial optimization problem and solving it using a metaheuristic approach is an advantage because it could return a good solution in a reasonable time. The problem of assigning chambering students to cases has never been addressed in the literature before. For the proposed problem, it is essential for law graduates to peruse in chambers before they are qualified to become legal counselor. Thus, assigning the chambering students to cases is a critically needed especially when involving many preferences. Hence, this study presents a preliminary study of the proposed project assignment problem. The objective of the study is to minimize the total completion time for all students in solving the given cases. This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution. The search then is preceded with a simulated annealing algorithm for further improvement of solution quality. The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. Hence, this research has demonstrated the advantages of solving project assignment problem by using metaheuristic techniques.
Development of the PEBLebl Traveling Salesman Problem Computerized Testbed
Mueller, Shane T.; Perelman, Brandon S.; Tan, Yin Yin; Thanasuan, Kejkaew
2015-01-01
The traveling salesman problem (TSP) is a combinatorial optimization problem that requires finding the shortest path through a set of points ("cities") that returns to the starting point. Because humans provide heuristic near-optimal solutions to Euclidean versions of the problem, it has sometimes been used to investigate human visual…
Hard Electromagnetic Processes
International Nuclear Information System (INIS)
Richard, F.
1987-09-01
Among hard electromagnetic processes, I will use the most recent data and focus on quantitative test of QCD. More specifically, I will retain two items: - hadroproduction of direct photons, - Drell-Yan. In addition, I will briefly discuss a recent analysis of ISR data obtained with AFS (Axial Field Spectrometer) which sheds a new light on the e/π puzzle at low P T
Combinatorial interpretations of binomial coefficient analogues related to Lucas sequences
Sagan, Bruce; Savage, Carla
2009-01-01
Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial coefficients by C{n,k}={n}!/({k}!{n-k}!) where {n}!={1}{2}...{n}. It is easy to see that C{n,k} is a polynomial in s and t. The purpose of this note is to give two combinatorial interpretations for this polynomial in terms of statistics on integer partitions in...
First steps in combinatorial optimization on graphons: matchings
Czech Academy of Sciences Publication Activity Database
Doležal, Martin; Hladký, J.; Hu, P.; Piguet, Diana
2017-01-01
Roč. 61, August (2017), s. 359-365 ISSN 1571-0653 R&D Projects: GA ČR GA16-07378S; GA ČR GJ16-07822Y EU Projects: European Commission(XE) 628974 - PAECIDM Institutional support: RVO:67985840 ; RVO:67985807 Keywords : graphon * graph limits * matching * combinatorial optimization Subject RIV: BA - General Mathematics ; BA - General Mathematics (UIVT-O) OBOR OECD: Pure mathematics ; Pure mathematics (UIVT-O) http://www.sciencedirect.com/science/article/pii/S1571065317301452
Combinatorial synthesis of oxazol-thiazole bis-heterocyclic compounds.
Murru, Siva; Nefzi, Adel
2014-01-13
A combinatorial library of novel oxazol-thiazole bis-heterocycles was synthesized in good to excellent overall yields with high purity using a solution and solid-phase parallel synthesis approach. Oxazole amino acids, prepared from serine methyl ester and amino acids via coupling and cyclodehydration, were treated with Fmoc-NCS and α-haloketones for the parallel synthesis of diverse bis-heterocycles. Fmoc-isothiocyanate is used as a traceless reagent for thiazole formation. Oxazole diversity can be achieved by using variety of amino acids, whereas thiazole diversity is produced with various haloketones.
Proceedings of the 8th Nordic Combinatorial Conference
DEFF Research Database (Denmark)
Geil, Olav; Andersen, Lars Døvling
The Nordic Combinatorial Conferences were initiated in 1981 by mathematicians from Stavanger. Held approximately every three years since then, the conferences have been able to sustain the interest from combinatorialists all over the Nordic countries. In 2004 the 8th conference is held in Aalborg......, Denmark. We are pleased that so many people have chosen to attend, and that lectures were offered from more participants than we had originally reserved time for. We asked two mathematicians to give special lectures and are happy that both accepted immediately. Andries Brouwer from the Technical...
Combinatorial interpretation of Haldane-Wu fractional exclusion statistics.
Aringazin, A K; Mazhitov, M I
2002-08-01
Assuming that the maximal allowed number of identical particles in a state is an integer parameter, q, we derive the statistical weight and analyze the associated equation that defines the statistical distribution. The derived distribution covers Fermi-Dirac and Bose-Einstein ones in the particular cases q=1 and q--> infinity (n(i)/q-->1), respectively. We show that the derived statistical weight provides a natural combinatorial interpretation of Haldane-Wu fractional exclusion statistics, and present exact solutions of the distribution equation.
What Diagrams Argue in Late Imperial Chinese Combinatorial Texts.
Bréard, Andrea
2015-01-01
Attitudes towards diagrammatic reasoning and visualization in mathematics were seldom spelled out in texts from pre-modern China, although illustrations figure prominently in mathematical literature since the eleventh century. Taking the sums of finite series and their combinatorial interpretation as a case study, this article investigates the epistemological function of illustrations from the eleventh to the nineteenth century that encode either the mathematical objects themselves or represent their related algorithms. It particularly focuses on the two illustrations given in Wang Lai's (1768-1813) Mathematical Principles of Sequential Combinations, arguing that they reflect a specific mode of nineteenth-century mathematical argumentative practice and served as a heuristic model for later authors.
Design of diversity and focused combinatorial libraries in drug discovery.
Young, S Stanley; Ge, Nanxiang
2004-05-01
Using well-characterized chemical reactions and readily available monomers, chemists are able to create sets of compounds, termed libraries, which are useful in drug discovery processes. The design of combinatorial chemical libraries can be complex and there has been much information recently published offering suggestions on how the design process can be carried out. This review focuses on literature with the goal of organizing current thinking. At this point in time, it is clear that benchmarking of current suggested methods is required as opposed to further new methods.
First steps in combinatorial optimization on graphons: matchings
Czech Academy of Sciences Publication Activity Database
Doležal, Martin; Hladký, J.; Hu, P.; Piguet, Diana
2017-01-01
Roč. 61, August (2017), s. 359-365 ISSN 1571-0653 R&D Projects: GA ČR GA16-07378S; GA ČR GJ16-07822Y EU Projects: European Commission(XE) 628974 - PAECIDM Institutional support: RVO:67985840 ; RVO:67985807 Keywords : graphon * graph limits * matching * combinatorial optimization Subject RIV: BA - General Mathematics; BA - General Mathematics (UIVT-O) OBOR OECD: Pure mathematics; Pure mathematics (UIVT-O) http://www.sciencedirect.com/science/article/pii/S1571065317301452
Complex network problems in physics, computer science and biology
Cojocaru, Radu Ionut
There is a close relation between physics and mathematics and the exchange of ideas between these two sciences are well established. However until few years ago there was no such a close relation between physics and computer science. Even more, only recently biologists started to use methods and tools from statistical physics in order to study the behavior of complex system. In this thesis we concentrate on applying and analyzing several methods borrowed from computer science to biology and also we use methods from statistical physics in solving hard problems from computer science. In recent years physicists have been interested in studying the behavior of complex networks. Physics is an experimental science in which theoretical predictions are compared to experiments. In this definition, the term prediction plays a very important role: although the system is complex, it is still possible to get predictions for its behavior, but these predictions are of a probabilistic nature. Spin glasses, lattice gases or the Potts model are a few examples of complex systems in physics. Spin glasses and many frustrated antiferromagnets map exactly to computer science problems in the NP-hard class defined in Chapter 1. In Chapter 1 we discuss a common result from artificial intelligence (AI) which shows that there are some problems which are NP-complete, with the implication that these problems are difficult to solve. We introduce a few well known hard problems from computer science (Satisfiability, Coloring, Vertex Cover together with Maximum Independent Set and Number Partitioning) and then discuss their mapping to problems from physics. In Chapter 2 we provide a short review of combinatorial optimization algorithms and their applications to ground state problems in disordered systems. We discuss the cavity method initially developed for studying the Sherrington-Kirkpatrick model of spin glasses. We extend this model to the study of a specific case of spin glass on the Bethe
Enumeration of Combinatorial Classes of Single Variable Complex Polynomial Vector Fields
DEFF Research Database (Denmark)
Dias, Kealey
A vector field in the space of degree d monic, centered single variable complex polynomial vector fields has a combinatorial structure which can be fully described by a combinatorial data set consisting of an equivalence relation and a marked subset on the integers mod 2d-2, satisfying certain...
Combinatorial enzyme technology for the conversion of agricultural fibers to functional properties
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...
Validation of an Instrument and Testing Protocol for Measuring the Combinatorial Analysis Schema.
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)
International Nuclear Information System (INIS)
Azmy, Y. Y.
2004-01-01
An approach is developed for solving the neutron diffusion equation on combinatorial geometry computational cells, that is computational cells composed by combinatorial operations involving simple-shaped component cells. The only constraint on the component cells from which the combinatorial cells are assembled is that they possess a legitimate discretization of the underlying diffusion equation. We use the Finite Difference (FD) approximation of the x, y-geometry diffusion equation in this work. Performing the same combinatorial operations involved in composing the combinatorial cell on these discrete-variable equations yields equations that employ new discrete variables defined only on the combinatorial cell's volume and faces. The only approximation involved in this process, beyond the truncation error committed in discretizing the diffusion equation over each component cell, is a consistent-order Legendre series expansion. Preliminary results for simple configurations establish the accuracy of the solution to the combinatorial geometry solution compared to straight FD as the system dimensions decrease. Furthermore numerical results validate the consistent Legendre-series expansion order by illustrating the second order accuracy of the combinatorial geometry solution, the same as standard FD. Nevertheless the magnitude of the error for the new approach is larger than FD's since it incorporates the additional truncated series approximation. (authors)
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.
Directory of Open Access Journals (Sweden)
Hans-Werner Schmidt
2013-04-01
Full Text Available 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.
A combinatorial approach to diffeomorphism invariant quantum gauge theories
International Nuclear Information System (INIS)
Zapata, J.A.
1997-01-01
Quantum gauge theory in the connection representation uses functions of holonomies as configuration observables. Physical observables (gauge and diffeomorphism invariant) are represented in the Hilbert space of physical states; physical states are gauge and diffeomorphism invariant distributions on the space of functions of the holonomies of the edges of a certain family of graphs. Then a family of graphs embedded in the space manifold (satisfying certain properties) induces a representation of the algebra of physical observables. We construct a quantum model from the set of piecewise linear graphs on a piecewise linear manifold, and another manifestly combinatorial model from graphs defined on a sequence of increasingly refined simplicial complexes. Even though the two models are different at the kinematical level, they provide unitarily equivalent representations of the algebra of physical observables in separable Hilbert spaces of physical states (their s-knot basis is countable). Hence, the combinatorial framework is compatible with the usual interpretation of quantum field theory. copyright 1997 American Institute of Physics
Device for preparing combinatorial libraries in powder metallurgy.
Yang, Shoufeng; Evans, Julian R G
2004-01-01
This paper describes a powder-metering, -mixing, and -dispensing mechanism that can be used as a method for producing large numbers of samples for metallurgical evaluation or electrical or mechanical testing from multicomponent metal and cermet powder systems. It is designed to make use of the same commercial powders that are used in powder metallurgy and, therefore, to produce samples that are faithful to the microstructure of finished products. The particle assemblies produced by the device could be consolidated by die pressing, isostatic pressing, laser sintering, or direct melting. The powder metering valve provides both on/off and flow rate control of dry powders in open capillaries using acoustic vibration. The valve is simple and involves no relative movement, avoiding seizure with fine powders. An orchestra of such valves can be arranged on a building platform to prepare multicomponent combinatorial libraries. As with many combinatorial devices, identification and evaluation of sources of mixing error as a function of sample size is mandatory. Such an analysis is presented.
Dissection of combinatorial control by the Met4 transcriptional complex.
Lee, Traci A; Jorgensen, Paul; Bognar, Andrew L; Peyraud, Caroline; Thomas, Dominique; Tyers, Mike
2010-02-01
Met4 is the transcriptional activator of the sulfur metabolic network in Saccharomyces cerevisiae. Lacking DNA-binding ability, Met4 must interact with proteins called Met4 cofactors to target promoters for transcription. Two types of DNA-binding cofactors (Cbf1 and Met31/Met32) recruit Met4 to promoters and one cofactor (Met28) stabilizes the DNA-bound Met4 complexes. To dissect this combinatorial system, we systematically deleted each category of cofactor(s) and analyzed Met4-activated transcription on a genome-wide scale. We defined a core regulon for Met4, consisting of 45 target genes. Deletion of both Met31 and Met32 eliminated activation of the core regulon, whereas loss of Met28 or Cbf1 interfered with only a subset of targets that map to distinct sectors of the sulfur metabolic network. These transcriptional dependencies roughly correlated with the presence of Cbf1 promoter motifs. Quantitative analysis of in vivo promoter binding properties indicated varying levels of cooperativity and interdependency exists between members of this combinatorial system. Cbf1 was the only cofactor to remain fully bound to target promoters under all conditions, whereas other factors exhibited different degrees of regulated binding in a promoter-specific fashion. Taken together, Met4 cofactors use a variety of mechanisms to allow differential transcription of target genes in response to various cues.
A binary plasmid system for shuffling combinatorial antibody libraries.
Collet, T A; Roben, P; O'Kennedy, R; Barbas, C F; Burton, D R; Lerner, R A
1992-11-01
We have used a binary system of replicon-compatible plasmids to test the potential for promiscuous recombination of heavy and light chains within sets of human Fab fragments isolated from combinatorial antibody libraries. Antibody molecules showed a surprising amount of promiscuity in that a particular heavy chain could recombine with multiple light chains with retention of binding to a protein antigen. The degree to which a given heavy chain productively paired with any light chain to bind antigen varied from 43% to 100% and depended strongly on the heavy-chain sequence. Such productive crosses resulted in a set of Fab fragments of similar apparent binding constants, which seemed to differ mainly in the amount of active Fab fragment produced in the bacterial cell. The dominance of the heavy chain in the antibody-antigen interaction was further explored in a set of directed crosses, in which heavy and light chains derived from antigen-specific clones were crossed with nonrelated heavy and light chains. In these crosses, an Fab fragment retained antigen binding only if it contained a heavy chain from an antigen-specific clone. In no case did the light chain confer detectable affinity when paired with indifferent heavy chains. The surprising promiscuity of heavy chains has ramifications for the evaluation of the diversity of combinatorial libraries made against protein antigens and should allow the combination of one such promiscuous heavy chain with an engineered light chain to form an Fab fragment carrying synthetic cofactors to assist in antibody catalysis.
RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM
Umetani, Shunji; Yagiura, Mutsunori; 柳浦, 睦憲
2007-01-01
The set covering problem (SCP) is one of representative combinatorial optimization problems, which has many practical applications. The continuous development of mathematical programming has derived a number of impressive heuristic algorithms as well as exact branch-and-bound algorithms, which can solve huge SCP instances of bus, railway and airline crew scheduling problems. We survey heuristic algorithms for SCP focusing mainly on contributions of mathematical programming techniques to heuri...
Simultaneous Disulfide and Boronic Acid Ester Exchange in Dynamic Combinatorial Libraries
Directory of Open Access Journals (Sweden)
Sanna L. Diemer
2015-09-01
Full Text Available Dynamic combinatorial chemistry has emerged as a promising tool for the discovery of complex receptors in supramolecular chemistry. At the heart of dynamic combinatorial chemistry are the reversible reactions that enable the exchange of building blocks between library members in dynamic combinatorial libraries (DCLs ensuring thermodynamic control over the system. If more than one reversible reaction operates in a single dynamic combinatorial library, the complexity of the system increases dramatically, and so does its possible applications. One can imagine two reversible reactions that operate simultaneously or two reversible reactions that operate independently. Both these scenarios have advantages and disadvantages. In this contribution, we show how disulfide exchange and boronic ester transesterification can function simultaneous in dynamic combinatorial libraries under appropriate conditions. We describe the detailed studies necessary to establish suitable reaction conditions and highlight the analytical techniques appropriate to study this type of system.
An Efficient Combined Meta-Heuristic Algorithm for Solving the Traveling Salesman Problem
Directory of Open Access Journals (Sweden)
Majid Yousefikhoshbakht
2016-08-01
Full Text Available The traveling salesman problem (TSP is one of the most important NP-hard Problems and probably the most famous and extensively studied problem in the field of combinatorial optimization. In this problem, a salesman is required to visit each of n given nodes once and only once, starting from any node and returning to the original place of departure. This paper presents an efficient evolutionary optimization algorithm developed through combining imperialist competitive algorithm and lin-kernighan algorithm called (MICALK in order to solve the TSP. The MICALK is tested on 44 TSP instances involving from 24 to 1655 nodes from the literature so that 26 best known solutions of the benchmark problem are also found by our algorithm. Furthermore, the performance of MICALK is compared with several metaheuristic algorithms, including GA, BA, IBA, ICA, GSAP, ABO, PSO and BCO on 32 instances from TSPLIB. The results indicate that the MICALK performs well and is quite competitive with the above algorithms.
Sampling from a polytope and hard-disk Monte Carlo
International Nuclear Information System (INIS)
Kapfer, Sebastian C; Krauth, Werner
2013-01-01
The hard-disk problem, the statics and the dynamics of equal two-dimensional hard spheres in a periodic box, has had a profound influence on statistical and computational physics. Markov-chain Monte Carlo and molecular dynamics were first discussed for this model. Here we reformulate hard-disk Monte Carlo algorithms in terms of another classic problem, namely the sampling from a polytope. Local Markov-chain Monte Carlo, as proposed by Metropolis et al. in 1953, appears as a sequence of random walks in high-dimensional polytopes, while the moves of the more powerful event-chain algorithm correspond to molecular dynamics evolution. We determine the convergence properties of Monte Carlo methods in a special invariant polytope associated with hard-disk configurations, and the implications for convergence of hard-disk sampling. Finally, we discuss parallelization strategies for event-chain Monte Carlo and present results for a multicore implementation
Non-commutative cryptography and complexity of group-theoretic problems
Myasnikov, Alexei; Ushakov, Alexander
2011-01-01
This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public-key cryptography. It also shows that there is remarkable feedback from cryptography to combinatorial group theory because some of the problems motivated by cryptography appear to be new to group theory, and they open many interesting research avenues within group theory. In particular, a lot of emphasis in the book is put on studying search problems, as compared to decision problems traditionally studied in combinatorial group theory. Then, complexity theory, notably generic-case complexity of algorithms, is employed for cryptanalysis of various cryptographic protocols based on infinite groups, and the ideas and machinery from the theory of generic-case complexity are used to study asymptotically dominant prop...
On a hierarchy of Booleanfunctions hard to compute in constant depth
Directory of Open Access Journals (Sweden)
Anna Bernasconi
2001-12-01
Full Text Available Any attempt to find connections between mathematical properties and complexity has a strong relevance to the field of Complexity Theory. This is due to the lack of mathematical techniques to prove lower bounds for general models of computation. This work represents a step in this direction: we define a combinatorial property that makes Boolean functions `` hard '' to compute in constant depth and show how the harmonic analysis on the hypercube can be applied to derive new lower bounds on the size complexity of previously unclassified Boolean functions.
Potyrailo, Radislav A; Chisholm, Bret J; Morris, William G; Cawse, James N; Flanagan, William P; Hassib, Lamyaa; Molaison, Chris A; Ezbiansky, Karin; Medford, George; Reitz, Hariklia
2003-01-01
Coupling of combinatorial chemistry methods with high-throughput (HT) performance testing and measurements of resulting properties has provided a powerful set of tools for the 10-fold accelerated discovery of new high-performance coating materials for automotive applications. Our approach replaces labor-intensive steps with automated systems for evaluation of adhesion of 8 x 6 arrays of coating elements that are discretely deposited on a single 9 x 12 cm plastic substrate. Performance of coatings is evaluated with respect to their resistance to adhesion loss, because this parameter is one of the primary considerations in end-use automotive applications. Our HT adhesion evaluation provides previously unavailable capabilities of high speed and reproducibility of testing by using a robotic automation, an expanded range of types of tested coatings by using the coating tagging strategy, and an improved quantitation by using high signal-to-noise automatic imaging. Upon testing, the coatings undergo changes that are impossible to quantitatively predict using existing knowledge. Using our HT methodology, we have developed several coatings leads. These HT screening results for the best coating compositions have been validated on the traditional scales of coating formulation and adhesion loss testing. These validation results have confirmed the superb performance of combinatorially developed coatings over conventional coatings on the traditional scale.
Revisiting the definition of local hardness and hardness kernel.
Polanco-Ramírez, Carlos A; Franco-Pérez, Marco; Carmona-Espíndola, Javier; Gázquez, José L; Ayers, Paul W
2017-05-17
An analysis of the hardness kernel and local hardness is performed to propose new definitions for these quantities that follow a similar pattern to the one that characterizes the quantities associated with softness, that is, we have derived new definitions for which the integral of the hardness kernel over the whole space of one of the variables leads to local hardness, and the integral of local hardness over the whole space leads to global hardness. A basic aspect of the present approach is that global hardness keeps its identity as the second derivative of energy with respect to the number of electrons. Local hardness thus obtained depends on the first and second derivatives of energy and electron density with respect to the number of electrons. When these derivatives are approximated by a smooth quadratic interpolation of energy, the expression for local hardness reduces to the one intuitively proposed by Meneses, Tiznado, Contreras and Fuentealba. However, when one combines the first directional derivatives with smooth second derivatives one finds additional terms that allow one to differentiate local hardness for electrophilic attack from the one for nucleophilic attack. Numerical results related to electrophilic attacks on substituted pyridines, substituted benzenes and substituted ethenes are presented to show the overall performance of the new definition.
An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations
Melckenbeeck, Ine; Audenaert, Pieter; Michoel, Tom; Colle, Didier; Pickavet, Mario
2016-01-01
Graphlets are small subgraphs, usually containing up to five vertices, that can be found in a larger graph. Identification of the graphlets that a vertex in an explored graph touches can provide useful information about the local structure of the graph around that vertex. Actually finding all graphlets in a large graph can be time-consuming, however. As the graphlets grow in size, more different graphlets emerge and the time needed to find each graphlet also scales up. If it is not needed to find each instance of each graphlet, but knowing the number of graphlets touching each node of the graph suffices, the problem is less hard. Previous research shows a way to simplify counting the graphlets: instead of looking for the graphlets needed, smaller graphlets are searched, as well as the number of common neighbors of vertices. Solving a system of equations then gives the number of times a vertex is part of each graphlet of the desired size. However, until now, equations only exist to count graphlets with 4 or 5 nodes. In this paper, two new techniques are presented. The first allows to generate the equations needed in an automatic way. This eliminates the tedious work needed to do so manually each time an extra node is added to the graphlets. The technique is independent on the number of nodes in the graphlets and can thus be used to count larger graphlets than previously possible. The second technique gives all graphlets a unique ordering which is easily extended to name graphlets of any size. Both techniques were used to generate equations to count graphlets with 4, 5 and 6 vertices, which extends all previous results. Code can be found at https://github.com/IneMelckenbeeck/equation-generator and https://github.com/IneMelckenbeeck/graphlet-naming. PMID:26797021
DEFF Research Database (Denmark)
Moos, Lejf
2009-01-01
of Denmark, and finally the third layer: the leadership used in Danish schools. The use of 'soft governance' is shifting the focus of governance and leadership from decisions towards influence and power and thus shifting the focus of the processes from the decision-making itself towards more focus......The governance and leadership at transnational, national and school level seem to be converging into a number of isomorphic forms as we see a tendency towards substituting 'hard' forms of governance, that are legally binding, with 'soft' forms based on persuasion and advice. This article analyses...... and discusses governance forms at several levels. The first layer is the global: the methods of 'soft governance' that are being utilised by transnational agencies. The second layer is the national and local: the shift in national and local governance seen in many countries, but here demonstrated in the case...
Zirconium nitride hard coatings
International Nuclear Information System (INIS)
Roman, Daiane; Amorim, Cintia Lugnani Gomes de; Soares, Gabriel Vieira; Figueroa, Carlos Alejandro; Baumvol, Israel Jacob Rabin; Basso, Rodrigo Leonardo de Oliveira
2010-01-01
Zirconium nitride (ZrN) nanometric films were deposited onto different substrates, in order to study the surface crystalline microstructure and also to investigate the electrochemical behavior to obtain a better composition that minimizes corrosion reactions. The coatings were produced by physical vapor deposition (PVD). The influence of the nitrogen partial pressure, deposition time and temperature over the surface properties was studied. Rutherford backscattering spectrometry (RBS), X-ray photoelectron spectroscopy (XPS), X-ray diffraction (XRD), scanning electron microscopy (SEM) and corrosion experiments were performed to characterize the ZrN hard coatings. The ZrN films properties and microstructure changes according to the deposition parameters. The corrosion resistance increases with temperature used in the films deposition. Corrosion tests show that ZrN coating deposited by PVD onto titanium substrate can improve the corrosion resistance. (author)
Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining
Hussain, Shahid
2016-01-01
This thesis is devoted to the development of extensions of dynamic programming to the study of decision trees. The considered extensions allow us to make multi-stage optimization of decision trees relative to a sequence of cost functions, to count the number of optimal trees, and to study relationships: cost vs cost and cost vs uncertainty for decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, improvement of bounds on complexity of decision trees for diagnosis of circuits, study of time and memory trade-off for corner point detection, study of decision rules derived from decision trees, creation of new procedure (multi-pruning) for construction of classifiers, and comparison of heuristics for decision tree construction. Part of these extensions (multi-stage optimization) was generalized to well-known combinatorial optimization problems: matrix chain multiplication, binary search trees, global sequence alignment, and optimal paths in directed graphs.
Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining
Hussain, Shahid
2016-07-10
This thesis is devoted to the development of extensions of dynamic programming to the study of decision trees. The considered extensions allow us to make multi-stage optimization of decision trees relative to a sequence of cost functions, to count the number of optimal trees, and to study relationships: cost vs cost and cost vs uncertainty for decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, improvement of bounds on complexity of decision trees for diagnosis of circuits, study of time and memory trade-off for corner point detection, study of decision rules derived from decision trees, creation of new procedure (multi-pruning) for construction of classifiers, and comparison of heuristics for decision tree construction. Part of these extensions (multi-stage optimization) was generalized to well-known combinatorial optimization problems: matrix chain multiplication, binary search trees, global sequence alignment, and optimal paths in directed graphs.
Combinatorial Drug Screening Identifies Ewing Sarcoma-specific Sensitivities
DEFF Research Database (Denmark)
Radic-Sarikas, Branka; Tsafou, Kalliopi P; Emdal, Kristina B.
2017-01-01
Improvements in survival for Ewing sarcoma pediatric and adolescent patients have been modest over the past 20 years. Combinations of anticancer agents endure as an option to overcome resistance to single treatments caused by compensatory pathways. Moreover, combinations are thought to lessen any...... associated adverse side effects through reduced dosing, which is particularly important in childhood tumors. Using a parallel phenotypic combinatorial screening approach of cells derived from three pediatric tumor types, we identified Ewing sarcoma-specific interactions of a diverse set of targeted agents...... including approved drugs. We were able to retrieve highly synergistic drug combinations specific for Ewing sarcoma and identified signaling processes important for Ewing sarcoma cell proliferation determined by EWS-FLI1 We generated a molecular target profile of PKC412, a multikinase inhibitor with strong...
Combinatorial study of zinc tin oxide thin-film transistors
McDowell, M. G.; Sanderson, R. J.; Hill, I. G.
2008-01-01
Groups of thin-film transistors using a zinc tin oxide semiconductor layer have been fabricated via a combinatorial rf sputtering technique. The ZnO :SnO2 ratio of the film varies as a function of position on the sample, from pure ZnO to SnO2, allowing for a study of zinc tin oxide transistor performance as a function of channel stoichiometry. The devices were found to have mobilities ranging from 2to12cm2/Vs, with two peaks in mobility in devices at ZnO fractions of 0.80±0.03 and 0.25±0.05, and on/off ratios as high as 107. Transistors composed predominantly of SnO2 were found to exhibit light sensitivity which affected both the on/off ratios and threshold voltages of these devices.
A Simple Combinatorial Codon Mutagenesis Method for Targeted Protein Engineering.
Belsare, Ketaki D; Andorfer, Mary C; Cardenas, Frida S; Chael, Julia R; Park, Hyun June; Lewis, Jared C
2017-03-17
Directed evolution is a powerful tool for optimizing enzymes, and mutagenesis methods that improve enzyme library quality can significantly expedite the evolution process. Here, we report a simple method for targeted combinatorial codon mutagenesis (CCM). To demonstrate the utility of this method for protein engineering, CCM libraries were constructed for cytochrome P450 BM3 , pfu prolyl oligopeptidase, and the flavin-dependent halogenase RebH; 10-26 sites were targeted for codon mutagenesis in each of these enzymes, and libraries with a tunable average of 1-7 codon mutations per gene were generated. Each of these libraries provided improved enzymes for their respective transformations, which highlights the generality, simplicity, and tunability of CCM for targeted protein engineering.
Rationally reduced libraries for combinatorial pathway optimization minimizing experimental effort.
Jeschek, Markus; Gerngross, Daniel; Panke, Sven
2016-03-31
Rational flux design in metabolic engineering approaches remains difficult since important pathway information is frequently not available. Therefore empirical methods are applied that randomly change absolute and relative pathway enzyme levels and subsequently screen for variants with improved performance. However, screening is often limited on the analytical side, generating a strong incentive to construct small but smart libraries. Here we introduce RedLibs (Reduced Libraries), an algorithm that allows for the rational design of smart combinatorial libraries for pathway optimization thereby minimizing the use of experimental resources. We demonstrate the utility of RedLibs for the design of ribosome-binding site libraries by in silico and in vivo screening with fluorescent proteins and perform a simple two-step optimization of the product selectivity in the branched multistep pathway for violacein biosynthesis, indicating a general applicability for the algorithm and the proposed heuristics. We expect that RedLibs will substantially simplify the refactoring of synthetic metabolic pathways.
Discovery of DNA repair inhibitors by combinatorial library profiling
Moeller, Benjamin J.; Sidman, Richard L.; Pasqualini, Renata; Arap, Wadih
2011-01-01
Small molecule inhibitors of DNA repair are emerging as potent and selective anti-cancer therapies, but the sheer magnitude of the protein networks involved in DNA repair processes poses obstacles to discovery of effective candidate drugs. To address this challenge, we used a subtractive combinatorial selection approach to identify a panel of peptide ligands that bind DNA repair complexes. Supporting the concept that these ligands have therapeutic potential, we show that one selected peptide specifically binds and non-competitively inactivates DNA-PKcs, a protein kinase critical in double-strand DNA break repair. In doing so, this ligand sensitizes BRCA-deficient tumor cells to genotoxic therapy. Our findings establish a platform for large-scale parallel screening for ligand-directed DNA repair inhibitors, with immediate applicability to cancer therapy. PMID:21343400
A Robust Parallel Algorithm for Combinatorial Compressed Sensing
Mendoza-Smith, Rodrigo; Tanner, Jared W.; Wechsung, Florian
2018-04-01
In previous work two of the authors have shown that a vector $x \\in \\mathbb{R}^n$ with at most $k Parallel-$\\ell_0$ decoding algorithm, where $\\mathrm{nnz}(A)$ denotes the number of nonzero entries in $A \\in \\mathbb{R}^{m \\times n}$. In this paper we present the Robust-$\\ell_0$ decoding algorithm, which robustifies Parallel-$\\ell_0$ when the sketch $Ax$ is corrupted by additive noise. This robustness is achieved by approximating the asymptotic posterior distribution of values in the sketch given its corrupted measurements. We provide analytic expressions that approximate these posteriors under the assumptions that the nonzero entries in the signal and the noise are drawn from continuous distributions. Numerical experiments presented show that Robust-$\\ell_0$ is superior to existing greedy and combinatorial compressed sensing algorithms in the presence of small to moderate signal-to-noise ratios in the setting of Gaussian signals and Gaussian additive noise.
The Complement of Binary Klein Quadric as a Combinatorial Grassmannian
Directory of Open Access Journals (Sweden)
Metod Saniga
2015-06-01
Full Text Available Given a hyperbolic quadric of PG(5, 2, there are 28 points off this quadric and 56 lines skew to it. It is shown that the (286; 563-configuration formed by these points and lines is isomorphic to the combinatorial Grassmannian of type G2(8. It is also pointed out that a set of seven points of G2(8 whose labels share a mark corresponds to a Conwell heptad of PG(5, 2. Gradual removal of Conwell heptads from the (286; 563-configuration yields a nested sequence of binomial configurations identical with part of that found to be associated with Cayley-Dickson algebras (arXiv:1405.6888.
Fabrication and characterization of thin-film phosphor combinatorial libraries
Mordkovich, V. Z.; Jin, Zhengwu; Yamada, Y.; Fukumura, T.; Kawasaki, M.; Koinuma, H.
2002-05-01
The laser molecular beam epitaxy method was employed to fabricate thin-film combinatorial libraries of ZnO-based phosphors on different substrates. Fabrication of both pixel libraries, on the example of Fe-doped ZnO, and spread libraries, on the example of Eu-doped ZnO, has been demonstrated. Screening of the Fe-doped ZnO libraries led to the discovery of weak green cathodoluminescence with the maximum efficiency at the Fe content of 0.58 mol %. Screening of the Eu-doped ZnO libraries led to the discovery of unusual reddish-violet cathodoluminescence which is observed in a broad range of Eu concentration. No photoluminescence was registered in either system.
Ant Colony Optimization and the Minimum Cut Problem
DEFF Research Database (Denmark)
Kötzing, Timo; Lehre, Per Kristian; Neumann, Frank
2010-01-01
Ant Colony Optimization (ACO) is a powerful metaheuristic for solving combinatorial optimization problems. With this paper we contribute to the theoretical understanding of this kind of algorithm by investigating the classical minimum cut problem. An ACO algorithm similar to the one that was prov...
Fast and Efficient Discrimination of Traveling Salesperson Problem Stimulus Difficulty
Dry, Matthew J.; Fontaine, Elizabeth L.
2014-01-01
The Traveling Salesperson Problem (TSP) is a computationally difficult combinatorial optimization problem. In spite of its relative difficulty, human solvers are able to generate close-to-optimal solutions in a close-to-linear time frame, and it has been suggested that this is due to the visual system's inherent sensitivity to certain geometric…
Combinatorial and geometric aspects of Feynman graphs and Feynman integrals
Energy Technology Data Exchange (ETDEWEB)
Bergbauer, Christoph
2009-06-11
The integrals associated to Feynman graphs must have been a source of frustration for particle physicists ever since. Indeed there is a delicate difference between being able to draw a Feynman graph and being able to compute the associated Feynman integral. Although perturbation theory has brought enormous breakthroughs, many physicists turned to more abstract developments in quantum field theory, looked for other ways to produce perturbational results, or left the field entirely. Nonetheless there is a significant number of physicists, computational and theoretical, who pursue the quest for concepts and algorithms to compute and understand those integrals to higher and higher orders. Their motivation is to help test the validity of the underlying physical theory. For a mathematician, Feynman graphs and their integrals provide a rich subject in their own right, independent of their computability. It was only recently though that the work of Bloch, Esnault and Kreimer has brought a growing interest of mathematicians from various disciplines to the subject. In fact it opened up a completely new direction of research: a motivic interpretation of Feynman graphs that unites their combinatorial, geometric and arithmetic aspects. This idea had been in the air for a while, based on computational results of Broadhurst and Kreimer, and on a theorem of Belkale and Brosnan related to a conjecture of Kontsevich about the generality of the underlying motives. A prerequisite for the motivic approach is a profound understanding of renormalization that was established less recently in a modern language by Connes and Kreimer. This dissertation studies the renormalization of Feynman graphs in position space using an adapted resolution of singularities, and makes two other contributions of mostly combinatorial nature to the subject. I hope this may serve as a reference for somebody who feels comfortable with the traditional position space literature and looks for a transition to the
Combinatorial and geometric aspects of Feynman graphs and Feynman integrals
International Nuclear Information System (INIS)
Bergbauer, Christoph
2009-01-01
The integrals associated to Feynman graphs must have been a source of frustration for particle physicists ever since. Indeed there is a delicate difference between being able to draw a Feynman graph and being able to compute the associated Feynman integral. Although perturbation theory has brought enormous breakthroughs, many physicists turned to more abstract developments in quantum field theory, looked for other ways to produce perturbational results, or left the field entirely. Nonetheless there is a significant number of physicists, computational and theoretical, who pursue the quest for concepts and algorithms to compute and understand those integrals to higher and higher orders. Their motivation is to help test the validity of the underlying physical theory. For a mathematician, Feynman graphs and their integrals provide a rich subject in their own right, independent of their computability. It was only recently though that the work of Bloch, Esnault and Kreimer has brought a growing interest of mathematicians from various disciplines to the subject. In fact it opened up a completely new direction of research: a motivic interpretation of Feynman graphs that unites their combinatorial, geometric and arithmetic aspects. This idea had been in the air for a while, based on computational results of Broadhurst and Kreimer, and on a theorem of Belkale and Brosnan related to a conjecture of Kontsevich about the generality of the underlying motives. A prerequisite for the motivic approach is a profound understanding of renormalization that was established less recently in a modern language by Connes and Kreimer. This dissertation studies the renormalization of Feynman graphs in position space using an adapted resolution of singularities, and makes two other contributions of mostly combinatorial nature to the subject. I hope this may serve as a reference for somebody who feels comfortable with the traditional position space literature and looks for a transition to the
Combinatorial Pooling Enables Selective Sequencing of the Barley Gene Space
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.
Directory of Open Access Journals (Sweden)
Stefano Lonardi
2013-04-01
Full Text Available For the vast majority of species - including many economically or ecologically important organisms, progress in biological research is hampered due to the lack of a reference genome sequence. Despite recent advances in sequencing technologies, several factors still limit the availability of such a critical resource. At the same time, many research groups and international consortia have already produced BAC libraries and physical maps and now are in a position to proceed with the development of whole-genome sequences organized around a physical map anchored to a genetic map. We propose a BAC-by-BAC sequencing protocol that combines combinatorial pooling design and second-generation sequencing technology to efficiently approach denovo selective genome sequencing. We show that combinatorial pooling is a cost-effective and practical alternative to exhaustive DNA barcoding when preparing sequencing libraries for hundreds or thousands of DNA samples, such as in this case gene-bearing minimum-tiling-path BAC clones. The novelty of the protocol hinges on the computational ability to efficiently compare hundred millions of short reads and assign them to the correct BAC clones (deconvolution so that the assembly can be carried out clone-by-clone. Experimental results on simulated data for the rice genome show that the deconvolution is very accurate, and the resulting BAC assemblies have high quality. Results on real data for a gene-rich subset of the barley genome confirm that the deconvolution is accurate and the BAC assemblies have good quality. While our method cannot provide the level of completeness that one would achieve with a comprehensive whole-genome sequencing project, we show that it is quite successful in reconstructing the gene sequences within BACs. In the case of plants such as barley, this level of sequence knowledge is sufficient to support critical end-point objectives such as map-based cloning and marker-assisted breeding.
Combinatorial pooling enables selective sequencing of the barley gene space.
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.
International Nuclear Information System (INIS)
Greenman, G.M.; O'Brien, M.J.; Procassini, R.J.; Joy, K.I.
2009-01-01
Two enhancements to the combinatorial geometry (CG) particle tracker in the Mercury Monte Carlo transport code are presented. The first enhancement is a hybrid particle tracker wherein a mesh region is embedded within a CG region. This method permits efficient calculations of problems with contain both large-scale heterogeneous and homogeneous regions. The second enhancement relates to the addition of parallelism within the CG tracker via spatial domain decomposition. This permits calculations of problems with a large degree of geometric complexity, which are not possible through particle parallelism alone. In this method, the cells are decomposed across processors and a particles is communicated to an adjacent processor when it tracks to an interprocessor boundary. Applications that demonstrate the efficacy of these new methods are presented
International Nuclear Information System (INIS)
Azadeh, A.; Maleki Shoja, B.; Ghanei, S.; Sheikhalishahi, M.
2015-01-01
This research investigates a redundancy-scheduling optimization problem for a multi-state series parallel system. The system is a flow shop manufacturing system with multi-state machines. Each manufacturing machine may have different performance rates including perfect performance, decreased performance and complete failure. Moreover, warm standby redundancy is considered for the redundancy allocation problem. Three objectives are considered for the problem: (1) minimizing system purchasing cost, (2) minimizing makespan, and (3) maximizing system reliability. Universal generating function is employed to evaluate system performance and overall reliability of the system. Since the problem is in the NP-hard class of combinatorial problems, genetic algorithm (GA) is used to find optimal/near optimal solutions. Different test problems are generated to evaluate the effectiveness and efficiency of proposed approach and compared to simulated annealing optimization method. The results show the proposed approach is capable of finding optimal/near optimal solution within a very reasonable time. - Highlights: • A redundancy-scheduling optimization problem for a multi-state series parallel system. • A flow shop with multi-state machines and warm standby redundancy. • Objectives are to optimize system purchasing cost, makespan and reliability. • Different test problems are generated and evaluated by a unique genetic algorithm. • It locates optimal/near optimal solution within a very reasonable time
DEFF Research Database (Denmark)
Tong, Glenn; Nielsen, John
1996-01-01
The actinomycin antibiotics bind to nucleic acids via both intercalation and hydrogen bonding. We found this 'double-action attack' mechanism very attractive in our search for a novel class of nucleic acid binders. A highly convergent, solid-phase synthetic strategy has been developed for a class...... with the requirements for combinatorial synthesis and furthermore, the final segment condensation allows, for the first time, double-combinatorial chemistry to be performed where two combinatorial libraries can be reacted with each other. Copyright (C) 1996 Elsevier Science Ltd....
Janka hardness using nonstandard specimens
David W. Green; Marshall Begel; William Nelson
2006-01-01
Janka hardness determined on 1.5- by 3.5-in. specimens (2Ã4s) was found to be equivalent to that determined using the 2- by 2-in. specimen specified in ASTM D 143. Data are presented on the relationship between Janka hardness and the strength of clear wood. Analysis of historical data determined using standard specimens indicated no difference between side hardness...
Hardness and Approximation for Network Flow Interdiction
Chestnut, Stephen R.; Zenklusen, Rico
2015-01-01
In the Network Flow Interdiction problem an adversary attacks a network in order to minimize the maximum s-t-flow. Very little is known about the approximatibility of this problem despite decades of interest in it. We present the first approximation hardness, showing that Network Flow Interdiction and several of its variants cannot be much easier to approximate than Densest k-Subgraph. In particular, any $n^{o(1)}$-approximation algorithm for Network Flow Interdiction would imply an $n^{o(1)}...
Cobalt allergy in hard metal workers
Energy Technology Data Exchange (ETDEWEB)
Fischer, T; Rystedt, I
1983-03-01
Hard metal contains about 10% cobalt. 853 hard metal workers were examined and patch tested with substances from their environment. Initial patch tests with 1% cobalt chloride showed 62 positive reactions. By means of secondary serial dilution tests, allergic reactions to cobalt were reproduced in 9 men and 30 women. Weak reactions could not normally be reproduced. A history of hand eczema was found in 36 of the 39 individuals with reproducible positive test reactions to cobalt, while 21 of 23 with a positive initial patch test but negative serial dilution test had never had any skin problems. Hand etching and hand grinding, mainly female activities and traumatic to the hands, were found to involve the greatest risk of cobalt sensitization. 24 individuals had an isolated cobalt allergy. They had probably been sensitized by hard metal work, while the individuals, all women, who had simultaneous nickel allergy had probably been sensitized to nickel before their employment and then became sensitized to cobalt by hard metal work. A traumatic occupation, which causes irritant contact dermatitis and/or a previous contact allergy or atopy is probably a prerequisite for the development of cobalt allergy.
This particular object was used up until 2012 in the Data Centre. It slots into one of the Disk Server trays. Hard disks were invented in the 1950s. They started as large disks up to 20 inches in diameter holding just a few megabytes (link is external). They were originally called "fixed disks" or "Winchesters" (a code name used for a popular IBM product). They later became known as "hard disks" to distinguish them from "floppy disks (link is external)." Hard disks have a hard platter that holds the magnetic medium, as opposed to the flexible plastic film found in tapes and floppies.
Directory of Open Access Journals (Sweden)
Botond Molnár
Full Text Available There has been a long history of using neural networks for combinatorial optimization and constraint satisfaction problems. Symmetric Hopfield networks and similar approaches use steepest descent dynamics, and they always converge to the closest local minimum of the energy landscape. For finding global minima additional parameter-sensitive techniques are used, such as classical simulated annealing or the so-called chaotic simulated annealing, which induces chaotic dynamics by addition of extra terms to the energy landscape. Here we show that asymmetric continuous-time neural networks can solve constraint satisfaction problems without getting trapped in non-solution attractors. We concentrate on a model solving Boolean satisfiability (k-SAT, which is a quintessential NP-complete problem. There is a one-to-one correspondence between the stable fixed points of the neural network and the k-SAT solutions and we present numerical evidence that limit cycles may also be avoided by appropriately choosing the parameters of the model. This optimal parameter region is fairly independent of the size and hardness of instances, this way parameters can be chosen independently of the properties of problems and no tuning is required during the dynamical process. The model is similar to cellular neural networks already used in CNN computers. On an analog device solving a SAT problem would take a single operation: the connection weights are determined by the k-SAT instance and starting from any initial condition the system searches until finding a solution. In this new approach transient chaotic behavior appears as a natural consequence of optimization hardness and not as an externally induced effect.
International Nuclear Information System (INIS)
Ioffe, B.L.; Khoze, V.A.; Lipatov, L.N.
1984-01-01
Deep inelastic (hard) processes are now at the epicenter of modern high-energy physics. These processes are governed by short-distance dynamics, which reveals the intrinsic structure of elementary particles. The theory of deep inelastic processes is now sufficiently well settled. The authors' aim was to give an effective tool to theoreticians and experimentalists who are engaged in high-energy physics. This book is intended primarily for physicists who are only beginning to study the field. To read the book, one should be acquainted with the Feynman diagram technique and with some particular topics from elementary particle theory (symmetries, dispersion relations, Regge pole theory, etc.). Theoretical consideration of deep inelastic processes is now based on quantum chromodynamics (QCD). At the same time, analysis of relevant physical phenomena demands a synthesis of QCD notions (quarks, gluons) with certain empirical characteristics. Therefore, the phenomenological approaches presented are a necessary stage in a study of this range of phenomena which should undoubtedly be followed by a detailed description based on QCD and electroweak theory. The authors were naturally unable to dwell on experimental data accumulated during the past decade of intensive investigations. Priority was given to results which allow a direct comparison with theoretical predictions. (Auth.)
Energy Technology Data Exchange (ETDEWEB)
Loo, Kai van de; Sitte, Andreas-Peter [Gesamtverband Steinkohle e.V. (GVSt), Herne (Germany)
2015-07-01
International the coal market in 2014 was the first time in a long time in a period of stagnation. In Germany, the coal consumption decreased even significantly, mainly due to the decrease in power generation. Here the national energy transition has now been noticable affected negative for coal use. The political guidances can expect a further significant downward movement for the future. In the present phase-out process of the German hard coal industry with still three active mines there was in 2014 no decommissioning. But the next is at the end of 2015, and the plans for the time after mining have been continued. [German] International war der Markt fuer Steinkohle 2014 erstmals seit langem wieder von einer Stagnation gekennzeichnet. In Deutschland ging der Steinkohlenverbrauch sogar deutlich zurueck, vor allem wegen des Rueckgangs in der Stromerzeugung. Hier hat sich die nationale Energiewende nun spuerbar und fuer die Steinkohlennutzung negativ ausgewirkt. Die politischen Weichenstellungen lassen fuer die Zukunft eine weitere erhebliche Abwaertsbewegung erwarten. Bei dem im Auslaufprozess befindlichen deutschen Steinkohlenbergbau mit noch drei aktiven Bergwerken gab es 2014 keine Stilllegung. Doch die naechste steht zum Jahresende 2015 an, und die Planungen fuer die Zeit nach dem Bergbau sind fortgefuehrt worden.
Zhou, Yikang; Li, Gang; Dong, Junkai; Xing, Xin-Hui; Dai, Junbiao; Zhang, Chong
2018-05-01
Facing boosting ability to construct combinatorial metabolic pathways, how to search the metabolic sweet spot has become the rate-limiting step. We here reported an efficient Machine-learning workflow in conjunction with YeastFab Assembly strategy (MiYA) for combinatorial optimizing the large biosynthetic genotypic space of heterologous metabolic pathways in Saccharomyces cerevisiae. Using β-carotene biosynthetic pathway as example, we first demonstrated that MiYA has the power to search only a small fraction (2-5%) of combinatorial space to precisely tune the expression level of each gene with a machine-learning algorithm of an artificial neural network (ANN) ensemble to avoid over-fitting problem when dealing with a small number of training samples. We then applied MiYA to improve the biosynthesis of violacein. Feed with initial data from a colorimetric plate-based, pre-screened pool of 24 strains producing violacein, MiYA successfully predicted, and verified experimentally, the existence of a strain that showed a 2.42-fold titer improvement in violacein production among 3125 possible designs. Furthermore, MiYA was able to largely avoid the branch pathway of violacein biosynthesis that makes deoxyviolacein, and produces very pure violacein. Together, MiYA combines the advantages of standardized building blocks and machine learning to accelerate the Design-Build-Test-Learn (DBTL) cycle for combinatorial optimization of metabolic pathways, which could significantly accelerate the development of microbial cell factories. Copyright © 2018 International Metabolic Engineering Society. Published by Elsevier Inc. All rights reserved.
Combinatorial thin film materials science: From alloy discovery and optimization to alloy design
Energy Technology Data Exchange (ETDEWEB)
Gebhardt, Thomas, E-mail: gebhardt@mch.rwth-aachen.de; Music, Denis; Takahashi, Tetsuya; Schneider, Jochen M.
2012-06-30
This paper provides an overview of modern alloy development, from discovery and optimization towards alloy design, based on combinatorial thin film materials science. The combinatorial approach, combining combinatorial materials synthesis of thin film composition-spreads with high-throughput property characterization has proven to be a powerful tool to delineate composition-structure-property relationships, and hence to efficiently identify composition windows with enhanced properties. Furthermore, and most importantly for alloy design, theoretical models and hypotheses can be critically appraised. Examples for alloy discovery, optimization, and alloy design of functional as well as structural materials are presented. Using Fe-Mn based alloys as an example, we show that the combination of modern electronic-structure calculations with the highly efficient combinatorial thin film composition-spread method constitutes an effective tool for knowledge-based alloy design.
Capability of focused Ar ion beam sputtering for combinatorial synthesis of metal films
International Nuclear Information System (INIS)
Nagata, T.; Haemori, M.; Chikyow, T.
2009-01-01
The authors examined the use of focused Ar ion beam sputtering (FAIS) for combinatorial synthesis. A Langmuir probe revealed that the electron temperature and density for FAIS of metal film deposition was lower than that of other major combinatorial thin film growth techniques such as pulsed laser deposition. Combining FAIS with the combinatorial method allowed the compositional fraction of the Pt-Ru binary alloy to be systematically controlled. Pt-Ru alloy metal film grew epitaxially on ZnO substrates, and crystal structures changed from the Pt phase (cubic structure) to the Ru phase (hexagonal structure) in the Pt-Ru alloy phase diagram. The alloy film has a smooth surface, with the Ru phase, in particular, showing a clear step-and-terrace structure. The combination of FAIS and the combinatorial method has major potential for the fabrication of high quality composition-spread metal film.
Capability of focused Ar ion beam sputtering for combinatorial synthesis of metal films
Energy Technology Data Exchange (ETDEWEB)
Nagata, T.; Haemori, M.; Chikyow, T. [Advanced Electric Materials Center, National Institute for Materials Science, 1-1 Namiki, Tsukuba, Ibaraki 305-0044 (Japan)
2009-05-15
The authors examined the use of focused Ar ion beam sputtering (FAIS) for combinatorial synthesis. A Langmuir probe revealed that the electron temperature and density for FAIS of metal film deposition was lower than that of other major combinatorial thin film growth techniques such as pulsed laser deposition. Combining FAIS with the combinatorial method allowed the compositional fraction of the Pt-Ru binary alloy to be systematically controlled. Pt-Ru alloy metal film grew epitaxially on ZnO substrates, and crystal structures changed from the Pt phase (cubic structure) to the Ru phase (hexagonal structure) in the Pt-Ru alloy phase diagram. The alloy film has a smooth surface, with the Ru phase, in particular, showing a clear step-and-terrace structure. The combination of FAIS and the combinatorial method has major potential for the fabrication of high quality composition-spread metal film.
Combinatorial computational chemistry approach to the design of metal catalysts for deNOx
International Nuclear Information System (INIS)
Endou, Akira; Jung, Changho; Kusagaya, Tomonori; Kubo, Momoji; Selvam, Parasuraman; Miyamoto, Akira
2004-01-01
Combinatorial chemistry is an efficient technique for the synthesis and screening of a large number of compounds. Recently, we introduced the combinatorial approach to computational chemistry for catalyst design and proposed a new method called ''combinatorial computational chemistry''. In the present study, we have applied this combinatorial computational chemistry approach to the design of precious metal catalysts for deNO x . As the first step of the screening of the metal catalysts, we studied Rh, Pd, Ag, Ir, Pt, and Au clusters regarding the adsorption properties towards NO molecule. It was demonstrated that the energetically most stable adsorption state of NO on Ir model cluster, which was irrespective of both the shape and number of atoms including the model clusters
Solidified self-nanoemulsifying formulation for oral delivery of combinatorial therapeutic regimen
DEFF Research Database (Denmark)
Jain, Amit K; Thanki, Kaushik; Jain, Sanyog
2014-01-01
PURPOSE: The present work reports rationalized development and characterization of solidified self-nanoemulsifying drug delivery system for oral delivery of combinatorial (tamoxifen and quercetin) therapeutic regimen. METHODS: Suitable oil for the preparation of liquid SNEDDS was selected based...
Directory of Open Access Journals (Sweden)
Jean-Louis Dornstetter
2002-12-01
Full Text Available This paper is devoted to the presentation of a combinatorial approach, based on the theory of symmetric functions, for analyzing the performance of a family of demodulation methods used in mobile telecommunications.
INdAM conference "CoMeTA 2013 - Combinatorial Methods in Topology and Algebra"
Delucchi, Emanuele; Moci, Luca
2015-01-01
Combinatorics plays a prominent role in contemporary mathematics, due to the vibrant development it has experienced in the last two decades and its many interactions with other subjects. This book arises from the INdAM conference "CoMeTA 2013 - Combinatorial Methods in Topology and Algebra,'' which was held in Cortona in September 2013. The event brought together emerging and leading researchers at the crossroads of Combinatorics, Topology and Algebra, with a particular focus on new trends in subjects such as: hyperplane arrangements; discrete geometry and combinatorial topology; polytope theory and triangulations of manifolds; combinatorial algebraic geometry and commutative algebra; algebraic combinatorics; and combinatorial representation theory. The book is divided into two parts. The first expands on the topics discussed at the conference by providing additional background and explanations, while the second presents original contributions on new trends in the topics addressed by the conference.
Jean-Louis Dornstetter; Daniel Krob; Jean-Yves Thibon; Ekaterina A. Vassilieva
2002-01-01
This paper is devoted to the presentation of a combinatorial approach, based on the theory of symmetric functions, for analyzing the performance of a family of demodulation methods used in mobile telecommunications.
Combinatorial thin film materials science: From alloy discovery and optimization to alloy design
International Nuclear Information System (INIS)
Gebhardt, Thomas; Music, Denis; Takahashi, Tetsuya; Schneider, Jochen M.
2012-01-01
This paper provides an overview of modern alloy development, from discovery and optimization towards alloy design, based on combinatorial thin film materials science. The combinatorial approach, combining combinatorial materials synthesis of thin film composition-spreads with high-throughput property characterization has proven to be a powerful tool to delineate composition–structure–property relationships, and hence to efficiently identify composition windows with enhanced properties. Furthermore, and most importantly for alloy design, theoretical models and hypotheses can be critically appraised. Examples for alloy discovery, optimization, and alloy design of functional as well as structural materials are presented. Using Fe-Mn based alloys as an example, we show that the combination of modern electronic-structure calculations with the highly efficient combinatorial thin film composition-spread method constitutes an effective tool for knowledge-based alloy design.
DEFF Research Database (Denmark)
T Christensen, Vibeke
This summary presents the results of a study of the impact of reduced hearing in relation to labour-market attachment and working life. Reduced hearing contributes to early retirement. Many people with impaired hearing are not aware of the impact of their hearing problems on their working life an...
Mongelli, Pietro
2011-01-01
The Jacobi-Stirling numbers and the Legendre-Stirling numbers of the first and second kind were first introduced in [6], [7]. In this paper we note that Jacobi-Stirling numbers and Legendre-Stirling numbers are specializations of elementary and complete symmetric functions. We then study combinatorial interpretations of this specialization and obtain new combinatorial interpretations of the Jacobi-Stirling and Legendre-Stirling numbers.
Rivera-Borroto, Oscar Miguel; Marrero-Ponce, Yovani; García-de la Vega, José Manuel; Grau-Ábalo, Ricardo del Corazón
2011-12-27
Cluster algorithms play an important role in diversity related tasks of modern chemoinformatics, with the widest applications being in pharmaceutical industry drug discovery programs. The performance of these grouping strategies depends on various factors such as molecular representation, mathematical method, algorithmical technique, and statistical distribution of data. For this reason, introduction and comparison of new methods are necessary in order to find the model that best fits the problem at hand. Earlier comparative studies report on Ward's algorithm using fingerprints for molecular description as generally superior in this field. However, problems still remain, i.e., other types of numerical descriptions have been little exploited, current descriptors selection strategy is trial and error-driven, and no previous comparative studies considering a broader domain of the combinatorial methods in grouping chemoinformatic data sets have been conducted. In this work, a comparison between combinatorial methods is performed,with five of them being novel in cheminformatics. The experiments are carried out using eight data sets that are well established and validated in the medical chemistry literature. Each drug data set was represented by real molecular descriptors selected by machine learning techniques, which are consistent with the neighborhood principle. Statistical analysis of the results demonstrates that pharmacological activities of the eight data sets can be modeled with a few of families with 2D and 3D molecular descriptors, avoiding classification problems associated with the presence of nonrelevant features. Three out of five of the proposed cluster algorithms show superior performance over most classical algorithms and are similar (or slightly superior in the most optimistic sense) to Ward's algorithm. The usefulness of these algorithms is also assessed in a comparative experiment to potent QSAR and machine learning classifiers, where they perform
Equilibrium problems for Raney densities
Forrester, Peter J.; Liu, Dang-Zheng; Zinn-Justin, Paul
2015-07-01
The Raney numbers are a class of combinatorial numbers generalising the Fuss-Catalan numbers. They are indexed by a pair of positive real numbers (p, r) with p > 1 and 0 0 and similarly use both methods to identify the equilibrium problem for (p, r) = (θ/q + 1, 1/q), θ > 0 and q \\in Z+ . The Wiener-Hopf method is used to extend the latter to parameters (p, r) = (θ/q + 1, m + 1/q) for m a non-negative integer, and also to identify the equilibrium problem for a family of densities with moments given by certain binomial coefficients.
The hardness test: a real mechanical test
International Nuclear Information System (INIS)
Rezakhanlou, R.
1993-02-01
During the service life, the mechanical properties of the PWR components change. It is necessary to determine precisely this evolution, but it is not always possible to draw a sample with the adequate size for the characterization. For this latter case we intend to calculate the stress-strain curve of a material from a hardness test results, because it is appropriate for testing on site and do not need any particular sample shape. This paper is the first bibliographical part of a larger study on the relation between the values measured during a hardness test (applied load, indentation diameter) and the mechanical properties of a solid obtained by a traction test. We have treated the problem within the general setting of two solids in contact. Thus, we expose general elastic, elasto-plastic and plastic models describing the indentation of a solid by a rigid indenter
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.
Tepper, Naama; Shlomi, Tomer
2011-01-21
Combinatorial approaches in metabolic engineering work by generating genetic diversity in a microbial population followed by screening for strains with improved phenotypes. One of the most common goals in this field is the generation of a high rate chemical producing strain. A major hurdle with this approach is that many chemicals do not have easy to recognize attributes, making their screening expensive and time consuming. To address this problem, it was previously suggested to use microbial biosensors to facilitate the detection and quantification of chemicals of interest. Here, we present novel computational methods to: (i) rationally design microbial biosensors for chemicals of interest based on substrate auxotrophy that would enable their high-throughput screening; (ii) predict engineering strategies for coupling the synthesis of a chemical of interest with the production of a proxy metabolite for which high-throughput screening is possible via a designed bio-sensor. The biosensor design method is validated based on known genetic modifications in an array of E. coli strains auxotrophic to various amino-acids. Predicted chemical production rates achievable via the biosensor-based approach are shown to potentially improve upon those predicted by current rational strain design approaches. (A Matlab implementation of the biosensor design method is available via http://www.cs.technion.ac.il/~tomersh/tools).
Utilizing pulsed laser deposition lateral inhomogeneity as a tool in combinatorial material science.
Keller, David A; Ginsburg, Adam; Barad, Hannah-Noa; Shimanovich, Klimentiy; Bouhadana, Yaniv; Rosh-Hodesh, Eli; Takeuchi, Ichiro; Aviv, Hagit; Tischler, Yaakov R; Anderson, Assaf Y; Zaban, Arie
2015-04-13
Pulsed laser deposition (PLD) is widely used in combinatorial material science, as it enables rapid fabrication of different composite materials. Nevertheless, this method was usually limited to small substrates, since PLD deposition on large substrate areas results in severe lateral inhomogeneity. A few technical solutions for this problem have been suggested, including the use of different designs of masks, which were meant to prevent inhomogeneity in the thickness, density, and oxidation state of a layer, while only the composition is allowed to be changed. In this study, a possible way to take advantage of the large scale deposition inhomogeneity is demonstrated, choosing an iron oxide PLD-deposited library with continuous compositional spread (CCS) as a model system. An Fe₂O₃-Nb₂O₅ library was fabricated using PLD, without any mask between the targets and the substrate. The library was measured using high-throughput scanners for electrical, structural, and optical properties. A decrease in electrical resistivity that is several orders of magnitude lower than pure α-Fe₂O₃ was achieved at ∼20% Nb-O (measured at 47 and 267 °C) but only at points that are distanced from the center of the PLD plasma plume. Using hierarchical clustering analysis, we show that the PLD inhomogeneity can be used as an additional degree of freedom, helping, in this case, to achieve iron oxide with much lower resistivity.
Expediting Combinatorial Data Set Analysis by Combining Human and Algorithmic Analysis.
Stein, Helge Sören; Jiao, Sally; Ludwig, Alfred
2017-01-09
A challenge in combinatorial materials science remains the efficient analysis of X-ray diffraction (XRD) data and its correlation to functional properties. Rapid identification of phase-regions and proper assignment of corresponding crystal structures is necessary to keep pace with the improved methods for synthesizing and characterizing materials libraries. Therefore, a new modular software called htAx (high-throughput analysis of X-ray and functional properties data) is presented that couples human intelligence tasks used for "ground-truth" phase-region identification with subsequent unbiased verification by an algorithm to efficiently analyze which phases are present in a materials library. Identified phases and phase-regions may then be correlated to functional properties in an expedited manner. For the functionality of htAx to be proven, two previously published XRD benchmark data sets of the materials systems Al-Cr-Fe-O and Ni-Ti-Cu are analyzed by htAx. The analysis of ∼1000 XRD patterns takes less than 1 day with htAx. The proposed method reliably identifies phase-region boundaries and robustly identifies multiphase structures. The method also addresses the problem of identifying regions with previously unpublished crystal structures using a special daisy ternary plot.
Combinatorial and off-shell effects in new physics cascades
Energy Technology Data Exchange (ETDEWEB)
Wiesler, Daniel
2012-12-15
Up to now, the Standard Model of elementary particle physics is in very good agreement with most data. However, it has various shortcomings which motivate the presence of new physics at the TeV scale. The first major step following a potential discovery of new particles at the Large Hadron Collider (LHC) is the determination of their intrinsic properties, foremost masses and spins. Event topologies of new physics signals with a conserved parity motivated by precision data and the dark matter paradigm require for sophisticated measurement procedures, which have been developed in recent years. These techniques often rely on simplifying assumptions, albeit they need not necessarily be fulfilled. In this thesis we investigate the impact of combinatorial and off-shell effects on new physics cascades in three different contexts. A detailed understanding of these effects is essential for the topic of model parameter determination of new physics signatures at the LHC. First, we study the non-resonant contributions of a broad gluino on mass and spin measurements as a prime example for the importance of off-shell effects. A phenomenological scan over the gluino's width-to-mass ratio yields a severe smearing of invariant mass distributions and as a consequence thereof drastically shifted endpoint positions. Spin determinations, on the other hand, are barely affected and a model discrimination of the two prime candidates SUSY and UED is not at risk. In the second part, we assess the feasibility of the gluino dijet endpoint measurement in three fully inclusive scenarios at the LHC to investigate the impact of combinatorial and SUSY backgrounds on its precise determination. We develop a method to disentangle two major signal contributions and extract their associated edges with good accuracy. For this we use existent kinematic variables and propose new ones to overcome the former's deficiencies. The last part governs the issue of so-called 'fake combinatorics
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 hybrid guided neighborhood search for the disjunctively constrained knapsack problem
Directory of Open Access Journals (Sweden)
Mhand Hifi
2015-12-01
Full Text Available In this paper, we investigate the use of a hybrid guided neighborhood search for solving the disjunctively constrained knapsack problem. The studied problem may be viewed as a combination of two NP-hard combinatorial optimization problems: the weighted-independent set and the classical binary knapsack. The proposed algorithm is a hybrid approach that combines both deterministic and random local searches. The deterministic local search is based on a descent method, where both building and exploring procedures are alternatively used for improving the solution at hand. In order to escape from a local optima, a random local search strategy is introduced which is based on a modified ant colony optimization system. During the search process, the ant colony optimization system tries to diversify and to enhance the solutions using some informations collected from the previous iterations. Finally, the proposed algorithm is computationally analyzed on a set of benchmark instances available in the literature. The provided results are compared to those realized by both the Cplex solver and a recent algorithm of the literature. The computational part shows that the obtained results improve most existing solution values.
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.
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
Hardness variability in commercial technologies
International Nuclear Information System (INIS)
Shaneyfelt, M.R.; Winokur, P.S.; Meisenheimer, T.L.; Sexton, F.W.; Roeske, S.B.; Knoll, M.G.
1994-01-01
The radiation hardness of commercial Floating Gate 256K E 2 PROMs from a single diffusion lot was observed to vary between 5 to 25 krad(Si) when irradiated at a low dose rate of 64 mrad(Si)/s. Additional variations in E 2 PROM hardness were found to depend on bias condition and failure mode (i.e., inability to read or write the memory), as well as the foundry at which the part was manufactured. This variability is related to system requirements, and it is shown that hardness level and variability affect the allowable mode of operation for E 2 PROMs in space applications. The radiation hardness of commercial 1-Mbit CMOS SRAMs from Micron, Hitachi, and Sony irradiated at 147 rad(Si)/s was approximately 12, 13, and 19 krad(Si), respectively. These failure levels appear to be related to increases in leakage current during irradiation. Hardness of SRAMs from each manufacturer varied by less than 20%, but differences between manufacturers are significant. The Qualified Manufacturer's List approach to radiation hardness assurance is suggested as a way to reduce variability and to improve the hardness level of commercial technologies
Photoelectrochemical Hydrogen Production Using New Combinatorial Chemistry Derived Materials
Energy Technology Data Exchange (ETDEWEB)
Jaramillo, Thomas F.; Baeck, Sung-Hyeon; Kleiman-Shwarsctein, Alan; Stucky, Galen D. (PI); McFarland, Eric W. (PI)
2004-10-25
Solar photoelectrochemical water-splitting has long been viewed as one of the “holy grails” of chemistry because of its potential impact as a clean, renewable method of fuel production. Several known photocatalytic semiconductors can be used; however, the fundamental mechanisms of the process remain poorly understood and no known material has the required properties for cost effective hydrogen production. In order to investigate morphological and compositional variations in metal oxides as they relate to opto-electrochemical properties, we have employed a combinatorial methodology using automated, high-throughput, electrochemical synthesis and screening together with conventional solid-state methods. This report discusses a number of novel, high-throughput instruments developed during this project for the expeditious discovery of improved materials for photoelectrochemical hydrogen production. Also described within this report are results from a variety of materials (primarily tungsten oxide, zinc oxide, molybdenum oxide, copper oxide and titanium dioxide) whose properties were modified and improved by either layering, inter-mixing, or doping with one or more transition metals. Furthermore, the morphologies of certain materials were also modified through the use of structure directing agents (SDA) during synthesis to create mesostructures (features 2-50 nm) that increased surface area and improved rates of hydrogen production.
Individualized Pixel Synthesis and Characterization of Combinatorial Materials Chips
Directory of Open Access Journals (Sweden)
Xiao-Dong Xiang
2015-06-01
Full Text Available Conventionally, an experimentally determined phase diagram requires studies of phase formation at a range of temperatures for each composition, which takes years of effort from multiple research groups. Combinatorial materials chip technology, featuring high-throughput synthesis and characterization, is able to determine the phase diagram of an entire composition spread of a binary or ternary system at a single temperature on one materials library, which, though significantly increasing efficiency, still requires many libraries processed at a series of temperatures in order to complete a phase diagram. In this paper, we propose a “one-chip method” to construct a complete phase diagram by individually synthesizing each pixel step by step with a progressive pulse of energy to heat at different temperatures while monitoring the phase evolution on the pixel in situ in real time. Repeating this process pixel by pixel throughout the whole chip allows the entire binary or ternary phase diagram to be mapped on one chip in a single experiment. The feasibility of this methodology is demonstrated in a study of a Ge-Sb-Te ternary alloy system, on which the amorphous-crystalline phase boundary is determined.
A Combinatorial Kin Discrimination System in Bacillus subtilis.
Lyons, Nicholas A; Kraigher, Barbara; Stefanic, Polonca; Mandic-Mulec, Ines; Kolter, Roberto
2016-03-21
Multicellularity inherently involves a number of cooperative behaviors that are potentially susceptible to exploitation but can be protected by mechanisms such as kin discrimination. Discrimination of kin from non-kin has been observed in swarms of the bacterium Bacillus subtilis, but the underlying molecular mechanism has been unknown. We used genetic, transcriptomic, and bioinformatic analyses to uncover kin recognition factors in this organism. Our results identified many molecules involved in cell-surface modification and antimicrobial production and response. These genes varied significantly in expression level and mutation phenotype among B. subtilis strains, suggesting interstrain variation in the exact kin discrimination mechanism used. Genome analyses revealed a substantial diversity of antimicrobial genes present in unique combinations in different strains, with many likely acquired by horizontal gene transfer. The dynamic combinatorial effect derived from this plethora of kin discrimination genes creates a tight relatedness cutoff for cooperation that has likely led to rapid diversification within the species. Our data suggest that genes likely originally selected for competitive purposes also generate preferential interactions among kin, thus stabilizing multicellular lifestyles. Copyright © 2016 Elsevier Ltd. All rights reserved.
Combinatorial Drug Screening Identifies Ewing Sarcoma-specific Sensitivities.
Radic-Sarikas, Branka; Tsafou, Kalliopi P; Emdal, Kristina B; Papamarkou, Theodore; Huber, Kilian V M; Mutz, Cornelia; Toretsky, Jeffrey A; Bennett, Keiryn L; Olsen, Jesper V; Brunak, Søren; Kovar, Heinrich; Superti-Furga, Giulio
2017-01-01
Improvements in survival for Ewing sarcoma pediatric and adolescent patients have been modest over the past 20 years. Combinations of anticancer agents endure as an option to overcome resistance to single treatments caused by compensatory pathways. Moreover, combinations are thought to lessen any associated adverse side effects through reduced dosing, which is particularly important in childhood tumors. Using a parallel phenotypic combinatorial screening approach of cells derived from three pediatric tumor types, we identified Ewing sarcoma-specific interactions of a diverse set of targeted agents including approved drugs. We were able to retrieve highly synergistic drug combinations specific for Ewing sarcoma and identified signaling processes important for Ewing sarcoma cell proliferation determined by EWS-FLI1 We generated a molecular target profile of PKC412, a multikinase inhibitor with strong synergistic propensity in Ewing sarcoma, revealing its targets in critical Ewing sarcoma signaling routes. Using a multilevel experimental approach including quantitative phosphoproteomics, we analyzed the molecular rationale behind the disease-specific synergistic effect of simultaneous application of PKC412 and IGF1R inhibitors. The mechanism of the drug synergy between these inhibitors is different from the sum of the mechanisms of the single agents. The combination effectively inhibited pathway crosstalk and averted feedback loop repression, in EWS-FLI1-dependent manner. Mol Cancer Ther; 16(1); 88-101. ©2016 AACR. ©2016 American Association for Cancer Research.
Combinatorial approaches to evaluate nanodiamond uptake and induced cellular fate
Eldawud, Reem; Reitzig, Manuela; Opitz, Jörg; Rojansakul, Yon; Jiang, Wenjuan; Nangia, Shikha; Zoica Dinu, Cerasela
2016-02-01
Nanodiamonds (NDs) are an emerging class of engineered nanomaterials that hold great promise for the next generation of bionanotechnological products to be used for drug and gene delivery, or for bio-imaging and biosensing. Previous studies have shown that upon their cellular uptake, NDs exhibit high biocompatibility in various in vitro and in vivo set-ups. Herein we hypothesized that the increased NDs biocompatibility is a result of minimum membrane perturbations and their reduced ability to induce disruption or damage during cellular translocation. Using multi-scale combinatorial approaches that simulate ND-membrane interactions, we correlated NDs real-time cellular uptake and kinetics with the ND-induced membrane fluctuations to derive energy requirements for the uptake to occur. Our discrete and real-time analyses showed that the majority of NDs internalization occurs within 2 h of cellular exposure, however, with no effects on cellular viability, proliferation or cellular behavior. Furthermore, our simulation analyses using coarse-grained models identified key changes in the energy profile, membrane deformation and recovery time, all functions of the average ND or ND-based agglomerate size. Understanding the mechanisms responsible for ND-cell membrane interactions could possibly advance their implementation in various biomedical applications.
Combinatorial approaches to evaluate nanodiamond uptake and induced cellular fate
Eldawud, Reem; Reitzig, Manuela; Opitz, Jörg; Rojansakul, Yon; Jiang, Wenjuan; Nangia, Shikha; Dinu, Cerasela Zoica
2016-01-01
Nanodiamonds (NDs) are an emerging class of engineered nanomaterials that hold great promise for the next generation of bionanotechnological products to be used for drug and gene delivery, or for bio-imaging and biosensing. Previous studies have shown that upon their cellular uptake, NDs exhibit high biocompatibility in various in vitro and in vivo set-ups. Herein we hypothesized that the increased NDs biocompatibility is a result of minimum membrane perturbations and their reduced ability to induce disruption or damage during cellular translocation. Using multi-scale combinatorial approaches that simulate ND-membrane interactions, we correlated NDs real-time cellular uptake and kinetics with the ND-induced membrane fluctuations to derive energy requirements for the uptake to occur. Our discrete and real-time analyses showed that the majority of NDs internalization occurs within 2 h of cellular exposure, however, with no effects on cellular viability, proliferation or cellular behavior. Furthermore, our simulation analyses using coarse-grained models identified key changes in the energy profile, membrane deformation and recovery time, all functions of the average ND or ND-based agglomerate size. Understanding the mechanisms responsible for ND-cell membrane interactions could possibly advance their implementation in various biomedical applications. PMID:26820775
Combinatorial Approaches for the Identification of Brain Drug Delivery Targets
Stutz, Charles C.; Zhang, Xiaobin; Shusta, Eric V.
2018-01-01
The blood-brain barrier (BBB) represents a large obstacle for the treatment of central nervous system diseases. Targeting endogenous nutrient transporters that transcytose the BBB is one promising approach to selectively and noninvasively deliver a drug payload to the brain. The main limitations of the currently employed transcytosing receptors are their ubiquitous expression in the peripheral vasculature and the inherent low levels of transcytosis mediated by such systems. In this review, approaches designed to increase the repertoire of transcytosing receptors which can be targeted for the purpose of drug delivery are discussed. In particular, combinatorial protein libraries can be screened on BBB cells in vitro or in vivo to isolate targeting peptides or antibodies that can trigger transcytosis. Once these targeting reagents are discovered, the cognate BBB transcytosis system can be identified using techniques such as expression cloning or immunoprecipitation coupled with mass spectrometry. Continued technological advances in BBB genomics and proteomics, membrane protein manipulation, and in vitro BBB technology promise to further advance the capability to identify and optimize peptides and antibodies capable of mediating drug transport across the BBB. PMID:23789958
Combinatorial MAPLE gradient thin film assemblies signalling to human osteoblasts
International Nuclear Information System (INIS)
Axente, Emanuel; Sima, Felix; Elena Sima, Livia; Serban, Natalia; Ristoscu, Carmen; Mihailescu, Ion N; Erginer, Merve; Toksoy Oner, Ebru; Eroglu, Mehmet S; Petrescu, Stefana M
2014-01-01
There is increased interest in smart bioactive materials to control tissue regeneration for the engineering of cell instructive scaffolds. We introduced combinatorial matrix-assisted pulsed laser evaporation (C-MAPLE) as a new method for the fabrication of organic thin films with a compositional gradient. Synchronized C-MAPLE of levan and oxidized levan was employed to assemble a two-compound biopolymer film structure. The gradient of the film composition was validated by fluorescence microscopy. In this study, we investigated the cell response induced by the compositional gradient using imaging of early osteoblast attachment and analysis of signalling phosphoprotein expression. Cells attached along the gradient in direct proportion to oxidized levan concentration. During this process distinct areas of the binary gradient have been shown to modulate the osteoblasts’ extracellular signal-regulated kinase signalling with different propensity. The proposed fabrication method results in the preparation of a new bioactive material, which could control the cell signalling response. This approach can be extended to screen new bioactive interfaces for tissue regeneration. (papers)
Combinatorial chemoenzymatic synthesis and high-throughput screening of sialosides.
Chokhawala, Harshal A; Huang, Shengshu; Lau, Kam; Yu, Hai; Cheng, Jiansong; Thon, Vireak; Hurtado-Ziola, Nancy; Guerrero, Juan A; Varki, Ajit; Chen, Xi
2008-09-19
Although the vital roles of structures containing sialic acid in biomolecular recognition are well documented, limited information is available on how sialic acid structural modifications, sialyl linkages, and the underlying glycan structures affect the binding or the activity of sialic acid-recognizing proteins and related downstream biological processes. A novel combinatorial chemoenzymatic method has been developed for the highly efficient synthesis of biotinylated sialosides containing different sialic acid structures and different underlying glycans in 96-well plates from biotinylated sialyltransferase acceptors and sialic acid precursors. By transferring the reaction mixtures to NeutrAvidin-coated plates and assaying for the yields of enzymatic reactions using lectins recognizing sialyltransferase acceptors but not the sialylated products, the biotinylated sialoside products can be directly used, without purification, for high-throughput screening to quickly identify the ligand specificity of sialic acid-binding proteins. For a proof-of-principle experiment, 72 biotinylated alpha2,6-linked sialosides were synthesized in 96-well plates from 4 biotinylated sialyltransferase acceptors and 18 sialic acid precursors using a one-pot three-enzyme system. High-throughput screening assays performed in NeutrAvidin-coated microtiter plates show that whereas Sambucus nigra Lectin binds to alpha2,6-linked sialosides with high promiscuity, human Siglec-2 (CD22) is highly selective for a number of sialic acid structures and the underlying glycans in its sialoside ligands.
Directed combinatorial mutagenesis of Escherichia coli for complex phenotype engineering
Energy Technology Data Exchange (ETDEWEB)
Liu, Rongming; Liang, Liya; Garst, Andrew D.; Choudhury, Alaksh; Nogué, Violeta Sànchez i.; Beckham, Gregg T.; Gill, Ryan T.
2018-05-01
Strain engineering for industrial production requires a targeted improvement of multiple complex traits, which range from pathway flux to tolerance to mixed sugar utilization. Here, we report the use of an iterative CRISPR EnAbled Trackable genome Engineering (iCREATE) method to engineer rapid glucose and xylose co-consumption and tolerance to hydrolysate inhibitors in E. coli. Deep mutagenesis libraries were rationally designed, constructed, and screened to target ~40,000 mutations across 30 genes. These libraries included global and high-level regulators that regulate global gene expression, transcription factors that play important roles in genome-level transcription, enzymes that function in the sugar transport system, NAD(P)H metabolism, and the aldehyde reduction system. Specific mutants that conferred increased growth in mixed sugars and hydrolysate tolerance conditions were isolated, confirmed, and evaluated for changes in genome-wide expression levels. We tested the strain with positive combinatorial mutations for 3-hydroxypropionic acid (3HP) production under high furfural and high acetate hydrolysate fermentation, which demonstrated a 7- and 8-fold increase in 3HP productivity relative to the parent strain, respectively.
Combinatorial Models for Assembly and Decomposition of Products
Directory of Open Access Journals (Sweden)
A. N. Bojko
2015-01-01
Full Text Available The paper discusses the most popular combinatorial models that are used for the synthesis of design solutions at the stage of the assembly process flow preparation. It shows that while assembling the product the relations of parts can be represented as a structure of preferences, which is formed on the basis of objective design restrictions put in at the stage of the product design. This structure is a binary preference relation pre-order. Its symmetrical part is equivalence and describes the entry of parts into the assembly unit. The asymmetric part is a partial order. It specifies part- ordering time in in the course of the assembly process. The structure of preferences is a minimal description of the restrictions and constraints in the assembly process. It can serve as a source for generating multiple assembly sequences of a product and its components, which are allowed by design. This multiplicity increases the likelihood of rational choice under uncertainty, unpredictable changes in the properties of technological or industrial systems.Incomplete dominance relation gives grounds for further examination and better understanding of the project situation. Operation field of the study is limited to a set of disparate elements of the partial order. Different strategies for processing the disparate elements may be offered, e.g. selection of the most informative pairs, comparison of which foremost linearizes the original partial order.
Combinatorial neural codes from a mathematical coding theory perspective.
Curto, Carina; Itskov, Vladimir; Morrison, Katherine; Roth, Zachary; Walker, Judy L
2013-07-01
Shannon's seminal 1948 work gave rise to two distinct areas of research: information theory and mathematical coding theory. While information theory has had a strong influence on theoretical neuroscience, ideas from mathematical coding theory have received considerably less attention. Here we take a new look at combinatorial neural codes from a mathematical coding theory perspective, examining the error correction capabilities of familiar receptive field codes (RF codes). We find, perhaps surprisingly, that the high levels of redundancy present in these codes do not support accurate error correction, although the error-correcting performance of receptive field codes catches up to that of random comparison codes when a small tolerance to error is introduced. However, receptive field codes are good at reflecting distances between represented stimuli, while the random comparison codes are not. We suggest that a compromise in error-correcting capability may be a necessary price to pay for a neural code whose structure serves not only error correction, but must also reflect relationships between stimuli.
On Some Algebraic and Combinatorial Properties of Dunkl Elements
Kirillov, Anatol N.
2013-06-01
We introduce and study a certain class of nonhomogeneous quadratic algebras together with the special set of mutually commuting elements inside of each, the so-called Dunkl elements. We describe relations among the Dunkl elements. This result is a further generalization of similar results obtained in [S. Fomin and A. N. Kirillov, Quadratic algebras, Dunkl elements and Schubert calculus, in Advances in Geometry (eds. J.-S. Brylinski, V. Nistor, B. Tsygan and P. Xu), Progress in Math. Vol. 172 (Birkhäuser Boston, Boston, 1995), pp. 147-182, A. Postnikov, On a quantum version of Pieri's formula, in Advances in Geometry (eds. J.-S. Brylinski, R. Brylinski, V. Nistor, B. Tsygan and P. Xu), Progress in Math. Vol. 172 (Birkhäuser Boston, 1995), pp. 371-383 and A. N. Kirillov and T. Maenor, A Note on Quantum K-Theory of Flag Varieties, preprint]. As an application we describe explicitly the set of relations among the Gaudin elements in the group ring of the symmetric group, cf. [E. Mukhin, V. Tarasov and A. Varchenko, Bethe Subalgebras of the Group Algebra of the Symmetric Group, preprint arXiv:1004.4248]. Also we describe a few combinatorial properties of some special elements in the associative quasi-classical Yang-Baxter algebra in a connection with the values of the β-Grothendieck polynomials for some special permutations, and on the other hand, with the Ehrhart polynomial of the Chan-Robbins polytope.
Peptide mimic for influenza vaccination using nonnatural combinatorial chemistry
Miles, John J.; Tan, Mai Ping; Dolton, Garry; Galloway, Sarah A.E.; Laugel, Bruno; Makinde, Julia; Matthews, Katherine K.; Watkins, Thomas S.; Wong, Yide; Clark, Richard J.; Pentier, Johanne M.; Attaf, Meriem; Lissina, Anya; Ager, Ann; Gallimore, Awen; Gras, Stephanie; Rossjohn, Jamie; Burrows, Scott R.; Cole, David K.; Price, David A.
2018-01-01
Polypeptide vaccines effectively activate human T cells but suffer from poor biological stability, which confines both transport logistics and in vivo therapeutic activity. Synthetic biology has the potential to address these limitations through the generation of highly stable antigenic “mimics” using subunits that do not exist in the natural world. We developed a platform based on D–amino acid combinatorial chemistry and used this platform to reverse engineer a fully artificial CD8+ T cell agonist that mirrored the immunogenicity profile of a native epitope blueprint from influenza virus. This nonnatural peptide was highly stable in human serum and gastric acid, reflecting an intrinsic resistance to physical and enzymatic degradation. In vitro, the synthetic agonist stimulated and expanded an archetypal repertoire of polyfunctional human influenza virus–specific CD8+ T cells. In vivo, specific responses were elicited in naive humanized mice by subcutaneous vaccination, conferring protection from subsequent lethal influenza challenge. Moreover, the synthetic agonist was immunogenic after oral administration. This proof-of-concept study highlights the power of synthetic biology to expand the horizons of vaccine design and therapeutic delivery. PMID:29528337
Combinatorial approaches to evaluate nanodiamond uptake and induced cellular fate
International Nuclear Information System (INIS)
Eldawud, Reem; Dinu, Cerasela Zoica; Reitzig, Manuela; Opitz, Jörg; Rojansakul, Yon; Jiang, Wenjuan; Nangia, Shikha
2016-01-01
Nanodiamonds (NDs) are an emerging class of engineered nanomaterials that hold great promise for the next generation of bionanotechnological products to be used for drug and gene delivery, or for bio-imaging and biosensing. Previous studies have shown that upon their cellular uptake, NDs exhibit high biocompatibility in various in vitro and in vivo set-ups. Herein we hypothesized that the increased NDs biocompatibility is a result of minimum membrane perturbations and their reduced ability to induce disruption or damage during cellular translocation. Using multi-scale combinatorial approaches that simulate ND-membrane interactions, we correlated NDs real-time cellular uptake and kinetics with the ND-induced membrane fluctuations to derive energy requirements for the uptake to occur. Our discrete and real-time analyses showed that the majority of NDs internalization occurs within 2 h of cellular exposure, however, with no effects on cellular viability, proliferation or cellular behavior. Furthermore, our simulation analyses using coarse-grained models identified key changes in the energy profile, membrane deformation and recovery time, all functions of the average ND or ND-based agglomerate size. Understanding the mechanisms responsible for ND-cell membrane interactions could possibly advance their implementation in various biomedical applications. (paper)