WorldWideScience

Sample records for continuous length combinatorial

  1. Relativistic length agony continued

    Directory of Open Access Journals (Sweden)

    Redžić D.V.

    2014-01-01

    Full Text Available We made an attempt to remedy recent confusing treatments of some basic relativistic concepts and results. Following the argument presented in an earlier paper (Redžić 2008b, we discussed the misconceptions that are recurrent points in the literature devoted to teaching relativity such as: there is no change in the object in Special Relativity, illusory character of relativistic length contraction, stresses and strains induced by Lorentz contraction, and related issues. We gave several examples of the traps of everyday language that lurk in Special Relativity. To remove a possible conceptual and terminological muddle, we made a distinction between the relativistic length reduction and relativistic FitzGerald-Lorentz contraction, corresponding to a passive and an active aspect of length contraction, respectively; we pointed out that both aspects have fundamental dynamical contents. As an illustration of our considerations, we discussed briefly the Dewan-Beran-Bell spaceship paradox and the ‘pole in a barn’ paradox. [Projekat Ministarstva nauke Republike Srbije, br. 171028

  2. Continuous lengths of oxide superconductors

    Science.gov (United States)

    Kroeger, Donald M.; List, III, Frederick A.

    2000-01-01

    A layered oxide superconductor prepared by depositing a superconductor precursor powder on a continuous length of a first substrate ribbon. A continuous length of a second substrate ribbon is overlaid on the first substrate ribbon. Sufficient pressure is applied to form a bound layered superconductor precursor powder between the first substrate ribbon and the second substrate ribbon. The layered superconductor precursor is then heat treated to establish the oxide superconducting phase. The layered oxide superconductor has a smooth interface between the substrate and the oxide superconductor.

  3. Continuously variable focal length lens

    Science.gov (United States)

    Adams, Bernhard W; Chollet, Matthieu C

    2013-12-17

    A material preferably in crystal form having a low atomic number such as beryllium (Z=4) provides for the focusing of x-rays in a continuously variable manner. The material is provided with plural spaced curvilinear, optically matched slots and/or recesses through which an x-ray beam is directed. The focal length of the material may be decreased or increased by increasing or decreasing, respectively, the number of slots (or recesses) through which the x-ray beam is directed, while fine tuning of the focal length is accomplished by rotation of the material so as to change the path length of the x-ray beam through the aligned cylindrical slows. X-ray analysis of a fixed point in a solid material may be performed by scanning the energy of the x-ray beam while rotating the material to maintain the beam's focal point at a fixed point in the specimen undergoing analysis.

  4. Spatial age-length key modelling using continuation ratio logits

    DEFF Research Database (Denmark)

    Berg, Casper W.; Kristensen, Kasper

    2012-01-01

    -called age-length key (ALK) is then used to obtain the age distribution. Regional differences in ALKs are not uncommon, but stratification is often problematic due to a small number of samples. Here, we combine generalized additive modelling with continuation ratio logits to model the probability of age...

  5. Natural Length Scales Shape Liquid Phase Continuity in Unsaturated Flows

    Science.gov (United States)

    Assouline, S.; Lehmann, P. G.; Or, D.

    2015-12-01

    Unsaturated flows supporting soil evaporation and internal drainage play an important role in various hydrologic and climatic processes manifested at a wide range of scales. We study inherent natural length scales that govern these flow processes and constrain the spatial range of their representation by continuum models. These inherent length scales reflect interactions between intrinsic porous medium properties that affect liquid phase continuity, and the interplay among forces that drive and resist unsaturated flow. We have defined an intrinsic length scale for hydraulic continuity based on pore size distribution that controls soil evaporation dynamics (i.e., stage 1 to stage 2 transition). This simple metric may be used to delineate upper bounds for regional evaporative losses or the depth of soil-atmosphere interactions (in the absence of plants). A similar length scale governs the dynamics of internal redistribution towards attainment of field capacity, again through its effect on hydraulic continuity in the draining porous medium. The study provides a framework for guiding numerical and mathematical models for capillary flows across different scales considering the necessary conditions for coexistence of stationarity (REV), hydraulic continuity and intrinsic capillary gradients.

  6. Combinatorial chemistry

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

  7. The Sensetivity of Flood Frequency Analysis on Record Length in Continuous United States

    Science.gov (United States)

    Hu, L.; Nikolopoulos, E. I.; Anagnostou, E. N.

    2017-12-01

    In flood frequency analysis (FFA), sufficiently long data series are important to get more reliable results. Compared to return periods of interest, at-site FFA usually needs large data sets. Generally, the precision of at site estimators and time-sampling errors are associated with the length of a gauged record. In this work, we quantify the difference with various record lengths. we use generalized extreme value (GEV) and Log Pearson type III (LP3), two traditional methods on annual maximum stream flows to undertake FFA, and propose quantitative ways, relative difference in median and interquartile range (IQR) to compare the flood frequency performances on different record length from selected 350 USGS gauges, which have more than 70 years record length in Continuous United States. Also, we group those gauges into different regions separately based on hydrological unit map and discuss the geometry impacts. The results indicate that long record length can avoid imposing an upper limit on the degree of sophistication. Working with relatively longer record length may lead accurate results than working with shorter record length. Furthermore, the influence of hydrologic unites for the watershed boundary dataset on those gauges also be presented. The California region is the most sensitive to record length, while gauges in the east perform steady.

  8. Matrix continued-fraction calculation of localization length in disordered systems

    International Nuclear Information System (INIS)

    Pastawski, H.M.; Weisz, J.F.

    1983-01-01

    A Matrix Continued-Fraction method is used to study the localization length of the states at the band center of a two dimensional crystals with disorder given by the Anderson model. It is found that exponentially localized states which scale according to the work of Mac Kinnon and Kramer, becomes weakly localized as the disorder becomes weaker, and there is some critical disorder for which the localization length does not saturate with the width of the strips, this confirms the resuts found by Pichard and Sarma. Weakly localized states are also found in one dimension for w/v [pt

  9. Matrix continued-fraction calculation of localization length in disordered systems

    International Nuclear Information System (INIS)

    Pastawski, H.M.; Weisz, J.F.

    1983-01-01

    A Matrix Continued-Fraction method is used to study the localization length of the states at the band center of a two dimensional crystal with disorder given by the Anderson model. It is found that exponentially localized states, which scale according to the work of Mac Kinnon and Kramer, becomes weakly localized as the disorder becomes weaker, and there is some critical disorder for which the localization length does not saturate with the width of the strips, this confirms the results found by Pichard and Sarma. Weakly localized states are also found in one dimension for w/v [pt

  10. Applications of combinatorial optimization

    CERN Document Server

    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.

  11. Combinatorial optimization theory and algorithms

    CERN Document Server

    Korte, Bernhard

    2018-01-01

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

  12. Concepts of combinatorial optimization

    CERN Document Server

    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

  13. Discrete or continuous? the quest for fundamental length in modern physics

    CERN Document Server

    Hagar, Amit

    2014-01-01

    The idea of infinity plays a crucial role in our understanding of the universe, with the infinite spacetime continuum perhaps the best-known example - but is spacetime really continuous? Throughout the history of science, many have felt that the continuum model is an unphysical idealization, and that spacetime should be thought of as 'quantized' at the smallest of scales. Combining novel conceptual analysis, a fresh historical perspective, and concrete physical examples, this unique book tells the story of the search for the fundamental unit of length in modern physics, from early classical electrodynamics to current approaches to quantum gravity. Novel philosophical theses, with direct implications for theoretical physics research, are presented and defended in an accessible format that avoids complex mathematics. Blending history, philosophy, and theoretical physics, this refreshing outlook on the nature of spacetime sheds light on one of the most thought-provoking topics in modern physics.

  14. Continuous correction of differential path length factor in near-infrared spectroscopy.

    Science.gov (United States)

    Talukdar, Tanveer; Moore, Jason H; Diamond, Solomon G

    2013-05-01

    In continuous-wave near-infrared spectroscopy (CW-NIRS), changes in the concentration of oxyhemoglobin and deoxyhemoglobin can be calculated by solving a set of linear equations from the modified Beer-Lambert Law. Cross-talk error in the calculated hemodynamics can arise from inaccurate knowledge of the wavelength-dependent differential path length factor (DPF). We apply the extended Kalman filter (EKF) with a dynamical systems model to calculate relative concentration changes in oxy- and deoxyhemoglobin while simultaneously estimating relative changes in DPF. Results from simulated and experimental CW-NIRS data are compared with results from a weighted least squares (WLSQ) method. The EKF method was found to effectively correct for artificially introduced errors in DPF and to reduce the cross-talk error in simulation. With experimental CW-NIRS data, the hemodynamic estimates from EKF differ significantly from the WLSQ (p EKF method compared to WLSQ in three physiologically relevant spectral bands 0.04 to 0.15 Hz, 0.15 to 0.4 Hz and 0.4 to 2.0 Hz (p EKF method.

  15. Combinatorial Libraries of Bis-Heterocyclic Compounds with Skeletal Diversity

    Science.gov (United States)

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

    2009-01-01

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

  16. Combinatorial Libraries of Bis-Heterocyclic Compounds with Skeletal Diversity

    OpenAIRE

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

    2008-01-01

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

  17. Combinatorial commutative algebra

    CERN Document Server

    Miller, Ezra

    2005-01-01

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

  18. Dynamic combinatorial chemistry

    NARCIS (Netherlands)

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

    2002-01-01

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

  19. Probabilistic methods in combinatorial analysis

    CERN Document Server

    Sachkov, Vladimir N

    2014-01-01

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

  20. Integer and combinatorial optimization

    CERN Document Server

    Nemhauser, George L

    1999-01-01

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

  1. Nonparametric combinatorial sequence models.

    Science.gov (United States)

    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.

  2. The Combinatorial Trace Method in Action

    Science.gov (United States)

    Krebs, Mike; Martinez, Natalie C.

    2013-01-01

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

  3. Combinatorial Hybrid Systems

    DEFF Research Database (Denmark)

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

    2008-01-01

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

  4. Evaluation of performance and maximum length of continuous decks in bridges : part 1.

    Science.gov (United States)

    2011-06-01

    The purpose of this research was to evaluate the performance history of continuous bridge decks in the State of Georgia, to determine why the current design detail works, to recommend a new design detail, and to recommend the maximum and/or optimum l...

  5. Introduction to combinatorial designs

    CERN Document Server

    Wallis, WD

    2007-01-01

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

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

  7. Manipulating Combinatorial Structures.

    Science.gov (United States)

    Labelle, Gilbert

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

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

  9. Model, prediction, and experimental verification of composition and thickness in continuous spread thin film combinatorial libraries grown by pulsed laser deposition

    International Nuclear Information System (INIS)

    Bassim, N. D.; Schenck, P. K.; Otani, M.; Oguchi, H.

    2007-01-01

    Pulsed laser deposition was used to grow continuous spread thin film libraries of continuously varying composition as a function of position on a substrate. The thickness of each component that contributes to a library can be empirically modeled to a bimodal cosine power distribution. We deposited ternary continuous spread thin film libraries from Al 2 O 3 , HfO 2 , and Y 2 O 3 targets, at two different background pressures of O 2 : 1.3 and 13.3 Pa. Prior to library deposition, we deposited single component calibration films at both pressures in order to measure and fit the thickness distribution. Following the deposition and fitting of the single component films, we predict both the compositional coverage and the thickness of the libraries. Then, we map the thickness of the continuous spread libraries using spectroscopic reflectometry and measure the composition of the libraries as a function of position using mapping wavelength-dispersive spectrometry (WDS). We then compare the compositional coverage of the libraries and observe that compositional coverage is enhanced in the case of 13.3 Pa library. Our models demonstrate linear correlation coefficients of 0.98 for 1.3 Pa and 0.98 for 13.3 Pa with the WDS

  10. Bifurcation-based approach reveals synergism and optimal combinatorial perturbation.

    Science.gov (United States)

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

    2016-06-01

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

  11. The combinatorial derivation

    Directory of Open Access Journals (Sweden)

    Igor V. Protasov

    2013-09-01

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

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

  13. Boltzmann Oracle for Combinatorial Systems

    OpenAIRE

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

    2008-01-01

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

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

    Science.gov (United States)

    Li, Jianwei; Nowak, Piotr; Otto, Sijbren

    2013-06-26

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

  15. Combinatorial matrix theory

    CERN Document Server

    Mitjana, Margarida

    2018-01-01

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

  16. Cryptographic Combinatorial Securities Exchanges

    Science.gov (United States)

    Thorpe, Christopher; Parkes, David C.

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

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

  18. Combinatorial Testing for VDM

    DEFF Research Database (Denmark)

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

    2010-01-01

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

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

  20. Combinatorial Nano-Bio Interfaces.

    Science.gov (United States)

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

    2018-06-08

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

  1. Combinatorial designs constructions and analysis

    CERN Document Server

    Stinson, Douglas R

    2004-01-01

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

  2. Combinatorial Mathematics: Research into Practice

    Science.gov (United States)

    Sriraman, Bharath; English, Lyn D.

    2004-01-01

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

  3. Combinatorial methods with computer applications

    CERN Document Server

    Gross, Jonathan L

    2007-01-01

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

  4. Number systems and combinatorial problems

    OpenAIRE

    Yordzhev, Krasimir

    2014-01-01

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

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

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

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

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

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

    Science.gov (United States)

    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…

  10. A vendor managed inventory model using continuous approximations for route length estimates and Markov chain modeling for cost estimates

    DEFF Research Database (Denmark)

    Larsen, Christian; Turkensteen, Marcel

    2014-01-01

    be a two-dimensional area or a one-dimensional line structure (corresponding to e.g. a major traffic artery). The expected travel distances across a given number of retailers can now be estimated analytically, using results from the field of continuous approxim ation for two-dimensional areas, or using our...

  11. Combinatorial optimization networks and matroids

    CERN Document Server

    Lawler, Eugene

    2011-01-01

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

  12. Algorithms in combinatorial design theory

    CERN Document Server

    Colbourn, CJ

    1985-01-01

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

  13. Computational Complexity of Combinatorial Surfaces

    NARCIS (Netherlands)

    Vegter, Gert; Yap, Chee K.

    1990-01-01

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

  14. Combinatorial synthesis of ceramic materials

    Science.gov (United States)

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

    2006-11-14

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

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

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

  17. Combinatorial Speculations and the Combinatorial Conjecture for Mathematics

    OpenAIRE

    Mao, Linfan

    2006-01-01

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

  18. Combinatorial algebra syntax and semantics

    CERN Document Server

    Sapir, Mark V

    2014-01-01

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

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

  20. Foundations of combinatorial topology

    CERN Document Server

    Pontryagin, L S

    2015-01-01

    Hailed by The Mathematical Gazette as ""an extremely valuable addition to the literature of algebraic topology,"" this concise but rigorous introductory treatment focuses on applications to dimension theory and fixed-point theorems. The lucid text examines complexes and their Betti groups, including Euclidean space, application to dimension theory, and decomposition into components; invariance of the Betti groups, with consideration of the cone construction and barycentric subdivisions of a complex; and continuous mappings and fixed points. Proofs are presented in a complete, careful, and eleg

  1. Non-unique factorizations algebraic, combinatorial and analytic theory

    CERN Document Server

    Geroldinger, Alfred

    2006-01-01

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

  2. Dynamic combinatorial libraries : new opportunities in systems chemistry

    NARCIS (Netherlands)

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

    2011-01-01

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

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

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

  5. Combinatorial optimization on a Boltzmann machine

    NARCIS (Netherlands)

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

    1989-01-01

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

  6. Combinatorial Interpretation of General Eulerian Numbers

    OpenAIRE

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

    2014-01-01

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

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

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

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

  10. Tumor-targeting peptides from combinatorial libraries*

    Science.gov (United States)

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

    2018-01-01

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

  11. Combinatorial Micro-Macro Dynamical Systems

    OpenAIRE

    Diaz, Rafael; Villamarin, Sergio

    2015-01-01

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

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

  13. Conferences on Combinatorial and Additive Number Theory

    CERN Document Server

    2014-01-01

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

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

  15. A combinatorial approach to the design of vaccines.

    Science.gov (United States)

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

    2015-05-01

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

  16. Combinatorial stresses kill pathogenic Candida species

    Science.gov (United States)

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

    2012-01-01

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

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

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

  19. Combinatorial explosion in model gene networks

    Science.gov (United States)

    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

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

  1. Combinatorial designs a tribute to Haim Hanani

    CERN Document Server

    Hartman, A

    1989-01-01

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

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

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

  4. A New Approach for Proving or Generating Combinatorial Identities

    Science.gov (United States)

    Gonzalez, Luis

    2010-01-01

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

  5. Asessing for Structural Understanding in Childrens' Combinatorial Problem Solving.

    Science.gov (United States)

    English, Lyn

    1999-01-01

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

  6. Estimating meme fitness in adaptive memetic algorithms for combinatorial problems.

    Science.gov (United States)

    Smith, J E

    2012-01-01

    outperform global reward schemes in combinatorial spaces, unlike in continuous spaces. An analysis of evolving meme behaviour is used to explain these findings.

  7. DPN-Generated Combinatorial Libraries

    Science.gov (United States)

    2012-02-29

    µM final concentration) is added (Fig. 6). Control over deposition parameters was examined for two model proteins, cholera toxin β subunit (CTβ...conjugated anti- cholera toxin beta (anti-CTb). The wells in the mould are inverted pyramids with an average depth of 86 µm, edge length of 120 µm, and...Therapeutics,” (2011). 91. University of New Mexico , Chemistry Department Colloquium, Albuquerque, NM, “The Polyvalent Gold Nanoparticle Conjugate

  8. Combinatorial biosynthesis of medicinal plant secondary metabolites

    NARCIS (Netherlands)

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

    2006-01-01

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

  9. Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies

    NARCIS (Netherlands)

    Ketema, J.; Simonsen, Jakob Grue

    2010-01-01

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

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

  11. Dendrimer-based dynamic combinatorial libraries

    NARCIS (Netherlands)

    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

  12. Gian-Carlos Rota and Combinatorial Math.

    Science.gov (United States)

    Kolata, Gina Bari

    1979-01-01

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

  13. A Model of Students' Combinatorial Thinking

    Science.gov (United States)

    Lockwood, Elise

    2013-01-01

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

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

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

  16. Quantum Resonance Approach to Combinatorial Optimization

    Science.gov (United States)

    Zak, Michail

    1997-01-01

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

  17. Logging to Facilitate Combinatorial System Testing

    NARCIS (Netherlands)

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

    2014-01-01

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

  18. Applying a Numerical Model of the Continuous Steel Casting Process to Control the Length of the Liquid Core in the Strand

    Directory of Open Access Journals (Sweden)

    Miłkowska-Piszczek K.

    2015-04-01

    Full Text Available This paper presents development and the application of a numerical model of the continuous steel casting process to optimise the strand solidification area. The design of the numerical model of the steel continuous casting process was presented and which was developed based on the actual dimensions of the slab continuous casting machine in ArcelorMittal Poland Unit in Kraków. The S235 steel grade and the cast strand format of 220×1280 mm were selected for the tests. Three strand casting speeds were analysed: 0.6, 0.8 and 1 m min-1. An algorithm was presented, allowing the calculation of the heat transfer coefficient values for the secondary cooling zone. In order to verify the results of numerical simulations, additional temperature measurements of the strand surface within the secondary cooling chamber were made. The ProCAST software was used to construct the numerical model of continuous casting of steel.

  19. Combinatorial structures to modeling simple games and applications

    Science.gov (United States)

    Molinero, Xavier

    2017-09-01

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

  20. Fundamental length and relativistic length

    International Nuclear Information System (INIS)

    Strel'tsov, V.N.

    1988-01-01

    It si noted that the introduction of fundamental length contradicts the conventional representations concerning the contraction of the longitudinal size of fast-moving objects. The use of the concept of relativistic length and the following ''elongation formula'' permits one to solve this problem

  1. Flame Length

    Data.gov (United States)

    Earth Data Analysis Center, University of New Mexico — Flame length was modeled using FlamMap, an interagency fire behavior mapping and analysis program that computes potential fire behavior characteristics. The tool...

  2. Quantum fields and processes a combinatorial approach

    CERN Document Server

    Gough, John

    2018-01-01

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

  3. Gems of combinatorial optimization and graph algorithms

    CERN Document Server

    Skutella, Martin; Stiller, Sebastian; Wagner, Dorothea

    2015-01-01

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

  4. Quantum fields and processes a combinatorial approach

    CERN Document Server

    Gough, John

    2018-01-01

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

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

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

  7. DNA-Encoded Dynamic Combinatorial Chemical Libraries.

    Science.gov (United States)

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

    2015-06-26

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

  8. Exploiting Quantum Resonance to Solve Combinatorial Problems

    Science.gov (United States)

    Zak, Michail; Fijany, Amir

    2006-01-01

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

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

  10. A Robust Parallel Algorithm for Combinatorial Compressed Sensing

    Science.gov (United States)

    Mendoza-Smith, Rodrigo; Tanner, Jared W.; Wechsung, Florian

    2018-04-01

    In previous work two of the authors have shown that a vector $x \\in \\mathbb{R}^n$ with at most $k Parallel-$\\ell_0$ decoding algorithm, where $\\mathrm{nnz}(A)$ denotes the number of nonzero entries in $A \\in \\mathbb{R}^{m \\times n}$. In this paper we present the Robust-$\\ell_0$ decoding algorithm, which robustifies Parallel-$\\ell_0$ when the sketch $Ax$ is corrupted by additive noise. This robustness is achieved by approximating the asymptotic posterior distribution of values in the sketch given its corrupted measurements. We provide analytic expressions that approximate these posteriors under the assumptions that the nonzero entries in the signal and the noise are drawn from continuous distributions. Numerical experiments presented show that Robust-$\\ell_0$ is superior to existing greedy and combinatorial compressed sensing algorithms in the presence of small to moderate signal-to-noise ratios in the setting of Gaussian signals and Gaussian additive noise.

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

    Science.gov (United States)

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

    2016-10-10

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

  12. Unifying Pore Network Modeling, Continuous Time Random Walk (CTRW) Theory and Experiment to Describe Impact of Spatial Heterogeneities on Solute Dispersion at Multiple Length-scales

    Science.gov (United States)

    Bijeljic, B.; Blunt, M. J.; Rhodes, M. E.

    2009-04-01

    This talk will describe and highlight the advantages offered by a novel methodology that unifies pore network modeling, CTRW theory and experiment in description of solute dispersion in porous media. Solute transport in a porous medium is characterized by the interplay of advection and diffusion (described by Peclet number, Pe) that cause dispersion of solute particles. Dispersion is traditionally described by dispersion coefficients, D, that are commonly calculated from the spatial moments of the plume. Using a pore-scale network model based on particle tracking, the rich Peclet-number dependence of dispersion coefficient is predicted from first principles and is shown to compare well with experimental data for restricted diffusion, transition, power-law and mechanical dispersion regimes in the asymptotic limit. In the asymptotic limit D is constant and can be used in an averaged advection-dispersion equation. However, it is highly important to recognize that, until the velocity field is fully sampled, the particle transport is non-Gaussian and D possesses temporal or spatial variation. Furthermore, temporal probability density functions (PDF) of tracer particles are studied in pore networks and an excellent agreement for the spectrum of transition times for particles from pore to pore is obtained between network model results and CTRW theory. Based on the truncated power-law interpretation of PDF-s, the physical origin of the power-law scaling of dispersion coefficient vs. Peclet number has been explained for unconsolidated porous media, sands and a number of sandstones, arriving at the same conclusion from numerical network modelling, analytic CTRW theory and experiment. The length traveled by solute plumes before Gaussian behaviour is reached increases with an increase in heterogeneity and/or Pe. This opens up the question on the nature of dispersion in natural systems where the heterogeneities at the larger scales will significantly increase the range of

  13. MIFT: GIFT Combinatorial Geometry Input to VCS Code

    Science.gov (United States)

    1977-03-01

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

  14. Neural Meta-Memes Framework for Combinatorial Optimization

    Science.gov (United States)

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

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

  15. Fundamental length

    International Nuclear Information System (INIS)

    Pradhan, T.

    1975-01-01

    The concept of fundamental length was first put forward by Heisenberg from purely dimensional reasons. From a study of the observed masses of the elementary particles known at that time, it is sumrised that this length should be of the order of magnitude 1 approximately 10 -13 cm. It was Heisenberg's belief that introduction of such a fundamental length would eliminate the divergence difficulties from relativistic quantum field theory by cutting off the high energy regions of the 'proper fields'. Since the divergence difficulties arise primarily due to infinite number of degrees of freedom, one simple remedy would be the introduction of a principle that limits these degrees of freedom by removing the effectiveness of the waves with a frequency exceeding a certain limit without destroying the relativistic invariance of the theory. The principle can be stated as follows: It is in principle impossible to invent an experiment of any kind that will permit a distintion between the positions of two particles at rest, the distance between which is below a certain limit. A more elegant way of introducing fundamental length into quantum theory is through commutation relations between two position operators. In quantum field theory such as quantum electrodynamics, it can be introduced through the commutation relation between two interpolating photon fields (vector potentials). (K.B.)

  16. Use of combinatorial chemistry to speed drug discovery.

    Science.gov (United States)

    Rádl, S

    1998-10-01

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

  17. Advanced Aqueous Phase Catalyst Development using Combinatorial Methods, Phase II

    Data.gov (United States)

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

  18. Effects of Suboptimal Bidding in Combinatorial Auctions

    Science.gov (United States)

    Schneider, Stefan; Shabalin, Pasha; Bichler, Martin

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

  19. Recursive deconvolution of combinatorial chemical libraries.

    OpenAIRE

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

    1994-01-01

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

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

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

  2. Automatic generation of combinatorial test data

    CERN Document Server

    Zhang, Jian; Ma, Feifei

    2014-01-01

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

  3. Method and apparatus for combinatorial chemistry

    Science.gov (United States)

    Foote, Robert S [Oak Ridge, TN

    2012-06-05

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

  4. Development of Combinatorial Methods for Alloy Design and Optimization

    International Nuclear Information System (INIS)

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

    2005-01-01

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

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

  6. Combinatorial Quantum Field Theory and Gluing Formula for Determinants

    NARCIS (Netherlands)

    Reshetikhin, N.; Vertman, B.

    2015-01-01

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

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

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

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

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

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

    International Nuclear Information System (INIS)

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

    1992-01-01

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

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

  13. cDREM: inferring dynamic combinatorial gene regulation.

    Science.gov (United States)

    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.

  14. Characterizing the combinatorial beam angle selection problem

    Science.gov (United States)

    Bangert, Mark; Ziegenhein, Peter; Oelfke, Uwe

    2012-10-01

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

  15. Combinatorial nanomedicines for colon cancer therapy.

    Science.gov (United States)

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

    2016-01-01

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

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

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

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

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

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

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

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

  3. Analysis and design of algorithms for combinatorial problems

    CERN Document Server

    Ausiello, G

    1985-01-01

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

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

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

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

  7. Distributing the computation in combinatorial optimization experiments over the cloud

    OpenAIRE

    Mario Brcic; Nikica Hlupic; Nenad Katanic

    2017-01-01

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

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

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

  10. Immune-Stimulating Combinatorial Therapy for Prostate Cancer

    Science.gov (United States)

    2016-10-01

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

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

  12. Combinatorial Dyson-Schwinger equations and inductive data types

    Science.gov (United States)

    Kock, Joachim

    2016-06-01

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

  13. Geometric differential evolution for combinatorial and programs spaces.

    Science.gov (United States)

    Moraglio, A; Togelius, J; Silva, S

    2013-01-01

    Geometric differential evolution (GDE) is a recently introduced formal generalization of traditional differential evolution (DE) that can be used to derive specific differential evolution algorithms for both continuous and combinatorial spaces retaining the same geometric interpretation of the dynamics of the DE search across representations. In this article, we first review the theory behind the GDE algorithm, then, we use this framework to formally derive specific GDE for search spaces associated with binary strings, permutations, vectors of permutations and genetic programs. The resulting algorithms are representation-specific differential evolution algorithms searching the target spaces by acting directly on their underlying representations. We present experimental results for each of the new algorithms on a number of well-known problems comprising NK-landscapes, TSP, and Sudoku, for binary strings, permutations, and vectors of permutations. We also present results for the regression, artificial ant, parity, and multiplexer problems within the genetic programming domain. Experiments show that overall the new DE algorithms are competitive with well-tuned standard search algorithms.

  14. Combinatorial Approaches for the Identification of Brain Drug Delivery Targets

    Science.gov (United States)

    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

  15. Intrinsic information carriers in combinatorial dynamical systems

    Science.gov (United States)

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

    2010-09-01

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

  16. Intrinsic information carriers in combinatorial dynamical systems.

    Science.gov (United States)

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

    2010-09-01

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

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

    Science.gov (United States)

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

    2018-01-01

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

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

    International Nuclear Information System (INIS)

    Meneses, Anderson Alvarenga de Moura; Schirru, Roberto

    2005-01-01

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

  19. A combinatorial approach to angiosperm pollen morphology.

    Science.gov (United States)

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

  20. Exact combinatorial approach to finite coagulating systems

    Science.gov (United States)

    Fronczak, Agata; Chmiel, Anna; Fronczak, Piotr

    2018-02-01

    This paper outlines an exact combinatorial approach to finite coagulating systems. In this approach, cluster sizes and time are discrete and the binary aggregation alone governs the time evolution of the systems. By considering the growth histories of all possible clusters, an exact expression is derived for the probability of a coagulating system with an arbitrary kernel being found in a given cluster configuration when monodisperse initial conditions are applied. Then this probability is used to calculate the time-dependent distribution for the number of clusters of a given size, the average number of such clusters, and that average's standard deviation. The correctness of our general expressions is proved based on the (analytical and numerical) results obtained for systems with the constant kernel. In addition, the results obtained are compared with the results arising from the solutions to the mean-field Smoluchowski coagulation equation, indicating its weak points. The paper closes with a brief discussion on the extensibility to other systems of the approach presented herein, emphasizing the issue of arbitrary initial conditions.

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

  2. Combinatorial effects of odorants on mouse behavior

    Science.gov (United States)

    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

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

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

    International Nuclear Information System (INIS)

    Murugan, R

    2010-01-01

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

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

  6. Morphological Constraints on Cerebellar Granule Cell Combinatorial Diversity.

    Science.gov (United States)

    Gilmer, Jesse I; Person, Abigail L

    2017-12-13

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

  7. The priming of basic combinatory responses in MEG.

    Science.gov (United States)

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

    2018-01-01

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

  8. discouraged by queue length

    Directory of Open Access Journals (Sweden)

    P. R. Parthasarathy

    2001-01-01

    Full Text Available The transient solution is obtained analytically using continued fractions for a state-dependent birth-death queue in which potential customers are discouraged by the queue length. This queueing system is then compared with the well-known infinite server queueing system which has the same steady state solution as the model under consideration, whereas their transient solutions are different. A natural measure of speed of convergence of the mean number in the system to its stationarity is also computed.

  9. Balancing focused combinatorial libraries based on multiple GPCR ligands

    Science.gov (United States)

    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.

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

  11. Combinatorial vector fields and the valley structure of fitness landscapes.

    Science.gov (United States)

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

    2010-12-01

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

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

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

  14. Combinatorial algebraic geometry selected papers from the 2016 apprenticeship program

    CERN Document Server

    Sturmfels, Bernd

    2017-01-01

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

  15. Combinatorial reasoning an introduction to the art of counting

    CERN Document Server

    DeTemple, Duane

    2014-01-01

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

  16. Mitigation of Control Channel Jamming via Combinatorial Key Distribution

    Science.gov (United States)

    Falahati, Abolfazl; Azarafrooz, Mahdi

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

  17. Polyhedral and semidefinite programming methods in combinatorial optimization

    CERN Document Server

    Tunçel, Levent

    2010-01-01

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

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

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

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

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

    Science.gov (United States)

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

    2008-11-11

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

  2. Integrating Multiple Data Sources for Combinatorial Marker Discovery: A Study in Tumorigenesis.

    Science.gov (United States)

    Bandyopadhyay, Sanghamitra; Mallik, Saurav

    2018-01-01

    Identification of combinatorial markers from multiple data sources is a challenging task in bioinformatics. Here, we propose a novel computational framework for identifying significant combinatorial markers ( s) using both gene expression and methylation data. The gene expression and methylation data are integrated into a single continuous data as well as a (post-discretized) boolean data based on their intrinsic (i.e., inverse) relationship. A novel combined score of methylation and expression data (viz., ) is introduced which is computed on the integrated continuous data for identifying initial non-redundant set of genes. Thereafter, (maximal) frequent closed homogeneous genesets are identified using a well-known biclustering algorithm applied on the integrated boolean data of the determined non-redundant set of genes. A novel sample-based weighted support ( ) is then proposed that is consecutively calculated on the integrated boolean data of the determined non-redundant set of genes in order to identify the non-redundant significant genesets. The top few resulting genesets are identified as potential s. Since our proposed method generates a smaller number of significant non-redundant genesets than those by other popular methods, the method is much faster than the others. Application of the proposed technique on an expression and a methylation data for Uterine tumor or Prostate Carcinoma produces a set of significant combination of markers. We expect that such a combination of markers will produce lower false positives than individual markers.

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

  4. Information-theoretic lengths of Jacobi polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Guerrero, A; Dehesa, J S [Departamento de Fisica Atomica, Molecular y Nuclear, Universidad de Granada, Granada (Spain); Sanchez-Moreno, P, E-mail: agmartinez@ugr.e, E-mail: pablos@ugr.e, E-mail: dehesa@ugr.e [Instituto ' Carlos I' de Fisica Teorica y Computacional, Universidad de Granada, Granada (Spain)

    2010-07-30

    The information-theoretic lengths of the Jacobi polynomials P{sup ({alpha}, {beta})}{sub n}(x), which are information-theoretic measures (Renyi, Shannon and Fisher) of their associated Rakhmanov probability density, are investigated. They quantify the spreading of the polynomials along the orthogonality interval [- 1, 1] in a complementary but different way as the root-mean-square or standard deviation because, contrary to this measure, they do not refer to any specific point of the interval. The explicit expressions of the Fisher length are given. The Renyi lengths are found by the use of the combinatorial multivariable Bell polynomials in terms of the polynomial degree n and the parameters ({alpha}, {beta}). The Shannon length, which cannot be exactly calculated because of its logarithmic functional form, is bounded from below by using sharp upper bounds to general densities on [- 1, +1] given in terms of various expectation values; moreover, its asymptotics is also pointed out. Finally, several computational issues relative to these three quantities are carefully analyzed.

  5. Isocyanide based multi component reactions in combinatorial chemistry.

    NARCIS (Netherlands)

    Dömling, A.

    1998-01-01

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

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

  7. Dynamic combinatorial chemistry at the phospholipid bilayer interface

    NARCIS (Netherlands)

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

    2010-01-01

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

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

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

  10. Combinatorial structures and processing in neural blackboard architectures

    NARCIS (Netherlands)

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

    2015-01-01

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

  11. Combinatorial chemistry approach to development of molecular plastic solar cells

    NARCIS (Netherlands)

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

    1999-01-01

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

  12. Introducing Dynamic Combinatorial Chemistry: Probing the Substrate Selectivity of Acetylcholinesterase

    Science.gov (United States)

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

    2010-01-01

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

  13. Dynamic combinatorial libraries based on hydrogen-bonde molecular boxes

    NARCIS (Netherlands)

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

    2007-01-01

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

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

  15. Some Combinatorial Interpretations and Applications of Fuss-Catalan Numbers

    OpenAIRE

    Lin, Chin-Hung

    2011-01-01

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

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

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

  18. A combinatorial approximation algorithm for CDMA downlink rate allocation

    NARCIS (Netherlands)

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

    2006-01-01

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

  19. A combinatorial approximation algorithm for CDMA downlink rate allocation

    NARCIS (Netherlands)

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

    2004-01-01

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

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

  1. Telomere Length and Mortality

    DEFF Research Database (Denmark)

    Kimura, Masayuki; Hjelmborg, Jacob V B; Gardner, Jeffrey P

    2008-01-01

    Leukocyte telomere length, representing the mean length of all telomeres in leukocytes, is ostensibly a bioindicator of human aging. The authors hypothesized that shorter telomeres might forecast imminent mortality in elderly people better than leukocyte telomere length. They performed mortality...

  2. Overland flow connectivity on planar patchy hillslopes - modified percolation theory approaches and combinatorial model of urns

    Science.gov (United States)

    Nezlobin, David; Pariente, Sarah; Lavee, Hanoch; Sachs, Eyal

    2017-04-01

    effect becomes less prominent if the obstructing capacity decreases, as generally occurs during heavy rainfalls. The plot width have a moderate positive statistical effect on runoff and erosion coefficients, since wider patchy plots have, on average, a greater normalized contributing area and a higher probability to have runoff of a certain length. The effect of plot width depends by itself on the percentage cover, plot length, and compared width scales. The contributing area uncertainty brought about by cover spatial arrangement is examined, including its dependence on the percentage cover and scale. In general, modified percolation theory approaches and combinatorial models of urns with restricted occupancy may link between critical dependence of runoff on percentage cover, cover-related scale effect, and statistical uncertainty of the observed quantities.

  3. Paths and partitions: Combinatorial descriptions of the parafermionic states

    Science.gov (United States)

    Mathieu, Pierre

    2009-09-01

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

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

    International Nuclear Information System (INIS)

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

    2010-01-01

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

  5. Digitally programmable microfluidic automaton for multiscale combinatorial mixing and sample processing†

    Science.gov (United States)

    Jensen, Erik C.; Stockton, Amanda M.; Chiesl, Thomas N.; Kim, Jungkyu; Bera, Abhisek; Mathies, Richard A.

    2013-01-01

    A digitally programmable microfluidic Automaton consisting of a 2-dimensional array of pneumatically actuated microvalves is programmed to perform new multiscale mixing and sample processing operations. Large (µL-scale) volume processing operations are enabled by precise metering of multiple reagents within individual nL-scale valves followed by serial repetitive transfer to programmed locations in the array. A novel process exploiting new combining valve concepts is developed for continuous rapid and complete mixing of reagents in less than 800 ms. Mixing, transfer, storage, and rinsing operations are implemented combinatorially to achieve complex assay automation protocols. The practical utility of this technology is demonstrated by performing automated serial dilution for quantitative analysis as well as the first demonstration of on-chip fluorescent derivatization of biomarker targets (carboxylic acids) for microchip capillary electrophoresis on the Mars Organic Analyzer. A language is developed to describe how unit operations are combined to form a microfluidic program. Finally, this technology is used to develop a novel microfluidic 6-sample processor for combinatorial mixing of large sets (>26 unique combinations) of reagents. The digitally programmable microfluidic Automaton is a versatile programmable sample processor for a wide range of process volumes, for multiple samples, and for different types of analyses. PMID:23172232

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

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

  8. An Atlas of Combinatorial Transcriptional Regulation in Mouse and Man

    KAUST Repository

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

    2010-01-01

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

  9. CUNY Graduate Center Workshops on Combinatorial and Additive Number Theory

    CERN Document Server

    2017-01-01

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

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

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

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

  13. An Atlas of Combinatorial Transcriptional Regulation in Mouse and Man

    KAUST Repository

    Ravasi, Timothy

    2010-03-01

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

  14. Combinatorial Optimization in Project Selection Using Genetic Algorithm

    Science.gov (United States)

    Dewi, Sari; Sawaluddin

    2018-01-01

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

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

  16. A Robust and Versatile Method of Combinatorial Chemical Synthesis of Gene Libraries via Hierarchical Assembly of Partially Randomized Modules

    Science.gov (United States)

    Popova, Blagovesta; Schubert, Steffen; Bulla, Ingo; Buchwald, Daniela; Kramer, Wilfried

    2015-01-01

    A major challenge in gene library generation is to guarantee a large functional size and diversity that significantly increases the chances of selecting different functional protein variants. The use of trinucleotides mixtures for controlled randomization results in superior library diversity and offers the ability to specify the type and distribution of the amino acids at each position. Here we describe the generation of a high diversity gene library using tHisF of the hyperthermophile Thermotoga maritima as a scaffold. Combining various rational criteria with contingency, we targeted 26 selected codons of the thisF gene sequence for randomization at a controlled level. We have developed a novel method of creating full-length gene libraries by combinatorial assembly of smaller sub-libraries. Full-length libraries of high diversity can easily be assembled on demand from smaller and much less diverse sub-libraries, which circumvent the notoriously troublesome long-term archivation and repeated proliferation of high diversity ensembles of phages or plasmids. We developed a generally applicable software tool for sequence analysis of mutated gene sequences that provides efficient assistance for analysis of library diversity. Finally, practical utility of the library was demonstrated in principle by assessment of the conformational stability of library members and isolating protein variants with HisF activity from it. Our approach integrates a number of features of nucleic acids synthetic chemistry, biochemistry and molecular genetics to a coherent, flexible and robust method of combinatorial gene synthesis. PMID:26355961

  17. Obfuscation Framework Based on Functionally Equivalent Combinatorial Logic Families

    Science.gov (United States)

    2008-03-01

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

  18. Combinatorial drug screening identifies Ewing sarcoma-specific sensitivities

    OpenAIRE

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

    2017-01-01

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

  19. Rapid mapping of protein functional epitopes by combinatorial alanine scanning

    OpenAIRE

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

    2000-01-01

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

  20. Combinatorial Models for Assembly and Decomposition of Products

    OpenAIRE

    A. N. Bojko

    2015-01-01

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

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

  2. A binary plasmid system for shuffling combinatorial antibody libraries.

    OpenAIRE

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

    1992-01-01

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

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

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

  5. A combinatorial perspective of the protein inference problem.

    Science.gov (United States)

    Yang, Chao; He, Zengyou; Yu, Weichuan

    2013-01-01

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

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

  7. Combinatorial expressions of the solutions to initial value problems of the discrete and ultradiscrete Toda molecules

    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)

  8. Precise delay measurement through combinatorial logic

    Science.gov (United States)

    Burke, Gary R. (Inventor); Chen, Yuan (Inventor); Sheldon, Douglas J. (Inventor)

    2010-01-01

    A high resolution circuit and method for facilitating precise measurement of on-chip delays for FPGAs for reliability studies. The circuit embeds a pulse generator on an FPGA chip having one or more groups of LUTS (the "LUT delay chain"), also on-chip. The circuit also embeds a pulse width measurement circuit on-chip, and measures the duration of the generated pulse through the delay chain. The pulse width of the output pulse represents the delay through the delay chain without any I/O delay. The pulse width measurement circuit uses an additional asynchronous clock autonomous from the main clock and the FPGA propagation delay can be displayed on a hex display continuously for testing purposes.

  9. Combinatorial description of space and strong interactions

    International Nuclear Information System (INIS)

    Zenczykowski, P.

    1988-01-01

    A reinterpretation is given of a successful phenomenological approach to hadron self-energy effects known as the unitarized quark model. General arguments are given that the proper description of strong interactions may require abandoning the assignment of a primary role to continuous concepts such as position and momentum in favor of discrete ones such as spin or W-spin. The reinterpretation exploits an analogy between the W-spin diagrams occurring in the calculations of hadronic loop effects and the spin network idea of Penrose. A connection between the S-matrix approach to hadron masses and the purely algebraic approach characteristic of the quark model is indicated. Several hadron mass relations generated by a resulting SU(6)/sub w/-group-theoretic expression are presented and discussed. Results of an attempt to generalize the scheme to the description of hadron vertices are reported

  10. Minimal Length, Measurability and Gravity

    Directory of Open Access Journals (Sweden)

    Alexander Shalyt-Margolin

    2016-03-01

    Full Text Available The present work is a continuation of the previous papers written by the author on the subject. In terms of the measurability (or measurable quantities notion introduced in a minimal length theory, first the consideration is given to a quantum theory in the momentum representation. The same terms are used to consider the Markov gravity model that here illustrates the general approach to studies of gravity in terms of measurable quantities.

  11. Combinatorial effects of arginine and fluoride on oral bacteria.

    Science.gov (United States)

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

    2015-02-01

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

  12. Combinatorial interpretations of binomial coefficient analogues related to Lucas sequences

    OpenAIRE

    Sagan, Bruce; Savage, Carla

    2009-01-01

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

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

  14. Combinatorial synthesis of oxazol-thiazole bis-heterocyclic compounds.

    Science.gov (United States)

    Murru, Siva; Nefzi, Adel

    2014-01-13

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

  15. Advances in bio-inspired computing for combinatorial optimization problems

    CERN Document Server

    Pintea, Camelia-Mihaela

    2013-01-01

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

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

  17. Combinatorial interpretation of Haldane-Wu fractional exclusion statistics.

    Science.gov (United States)

    Aringazin, A K; Mazhitov, M I

    2002-08-01

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

  18. What Diagrams Argue in Late Imperial Chinese Combinatorial Texts.

    Science.gov (United States)

    Bréard, Andrea

    2015-01-01

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

  19. Design of diversity and focused combinatorial libraries in drug discovery.

    Science.gov (United States)

    Young, S Stanley; Ge, Nanxiang

    2004-05-01

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

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

  1. Telomere length analysis.

    Science.gov (United States)

    Canela, Andrés; Klatt, Peter; Blasco, María A

    2007-01-01

    Most somatic cells of long-lived species undergo telomere shortening throughout life. Critically short telomeres trigger loss of cell viability in tissues, which has been related to alteration of tissue function and loss of regenerative capabilities in aging and aging-related diseases. Hence, telomere length is an important biomarker for aging and can be used in the prognosis of aging diseases. These facts highlight the importance of developing methods for telomere length determination that can be employed to evaluate telomere length during the human aging process. Telomere length quantification methods have improved greatly in accuracy and sensitivity since the development of the conventional telomeric Southern blot. Here, we describe the different methodologies recently developed for telomere length quantification, as well as their potential applications for human aging studies.

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

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

    Science.gov (United States)

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

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

    Science.gov (United States)

    Staver, John R.; Harty, Harold

    1979-01-01

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

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

    International Nuclear Information System (INIS)

    Azmy, Y. Y.

    2004-01-01

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

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

    Science.gov (United States)

    Bulone, Vincent William

    2017-01-01

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

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

    Science.gov (United States)

    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.

  8. Combinatorial Techniques to Efficiently Investigate and Optimize Organic Thin Film Processing and Properties

    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.

  9. Combinatorial experiment in Ni-Ti thin films by laser interference structuring

    International Nuclear Information System (INIS)

    Liu, K.W.; Gachot, C.; Leibenguth, P.; Muecklich, F.

    2005-01-01

    Combinatorial experiments are achieved on periodically structured Ni-Ti thin film composition spreads by laser interference irradiation using a Nd:YAG laser. Continuous Ni-Ti compositional spreads covering almost the whole binary system are prepared by combining sputter mask, shutter and movement of substrate. The continuous compositional spread is subsequently micro-structured into a sample library consisting of well-defined lines of individual samples by laser interference irradiation. The composition and microstructure effects in continuous spread and sample libraries after laser structuring are explored by scanning electron microscopy (SEM) with energy dispersive spectroscopy (EDS), X-ray diffraction (XRD) and white light interferometry (WLI) microscopy. The sample library consists of individual samples with a distance of about 5 μm and a composition resolution as high as 0.1 at.% in between. Although, there are certain difficulties so far in obtaining the optimized laser fluence for the spread, the laser interference irradiation provides an effective way to prepare thin film libraries with around 200 sample lines within 1 mm

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

  11. Combinatorial therapy discovery using mixed integer linear programming.

    Science.gov (United States)

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

    2014-05-15

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

  12. Causal gene identification using combinatorial V-structure search.

    Science.gov (United States)

    Cai, Ruichu; Zhang, Zhenjie; Hao, Zhifeng

    2013-07-01

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

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

  14. Device for preparing combinatorial libraries in powder metallurgy.

    Science.gov (United States)

    Yang, Shoufeng; Evans, Julian R G

    2004-01-01

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

  15. Dissection of combinatorial control by the Met4 transcriptional complex.

    Science.gov (United States)

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

    2010-02-01

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

  16. A binary plasmid system for shuffling combinatorial antibody libraries.

    Science.gov (United States)

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

    1992-11-01

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

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

  18. Design Implications of Real-Time Feedback in Continuous Combinatorial Auctions: An Experimental Investigation

    Science.gov (United States)

    Sanyal, Pallab

    2009-01-01

    Information Technology (IT) has spawned the growth of novel and innovative market mechanisms (such as online auctions) and associated businesses (such as eBay and Priceline) that were not feasible without the capabilities and reach of these modern information technologies. Previous studies on designing trading mechanisms for online markets…

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

    Science.gov (United States)

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

    2003-01-01

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

  20. Telomere length and depression

    DEFF Research Database (Denmark)

    Wium-Andersen, Marie Kim; Ørsted, David Dynnes; Rode, Line

    2017-01-01

    BACKGROUND: Depression has been cross-sectionally associated with short telomeres as a measure of biological age. However, the direction and nature of the association is currently unclear. AIMS: We examined whether short telomere length is associated with depression cross-sectionally as well...... as prospectively and genetically. METHOD: Telomere length and three polymorphisms, TERT, TERC and OBFC1, were measured in 67 306 individuals aged 20-100 years from the Danish general population and associated with register-based attendance at hospital for depression and purchase of antidepressant medication....... RESULTS: Attendance at hospital for depression was associated with short telomere length cross-sectionally, but not prospectively. Further, purchase of antidepressant medication was not associated with short telomere length cross-sectionally or prospectively. Mean follow-up was 7.6 years (range 0...

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

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

  3. Combinatorial study of zinc tin oxide thin-film transistors

    Science.gov (United States)

    McDowell, M. G.; Sanderson, R. J.; Hill, I. G.

    2008-01-01

    Groups of thin-film transistors using a zinc tin oxide semiconductor layer have been fabricated via a combinatorial rf sputtering technique. The ZnO :SnO2 ratio of the film varies as a function of position on the sample, from pure ZnO to SnO2, allowing for a study of zinc tin oxide transistor performance as a function of channel stoichiometry. The devices were found to have mobilities ranging from 2to12cm2/Vs, with two peaks in mobility in devices at ZnO fractions of 0.80±0.03 and 0.25±0.05, and on/off ratios as high as 107. Transistors composed predominantly of SnO2 were found to exhibit light sensitivity which affected both the on/off ratios and threshold voltages of these devices.

  4. A Simple Combinatorial Codon Mutagenesis Method for Targeted Protein Engineering.

    Science.gov (United States)

    Belsare, Ketaki D; Andorfer, Mary C; Cardenas, Frida S; Chael, Julia R; Park, Hyun June; Lewis, Jared C

    2017-03-17

    Directed evolution is a powerful tool for optimizing enzymes, and mutagenesis methods that improve enzyme library quality can significantly expedite the evolution process. Here, we report a simple method for targeted combinatorial codon mutagenesis (CCM). To demonstrate the utility of this method for protein engineering, CCM libraries were constructed for cytochrome P450 BM3 , pfu prolyl oligopeptidase, and the flavin-dependent halogenase RebH; 10-26 sites were targeted for codon mutagenesis in each of these enzymes, and libraries with a tunable average of 1-7 codon mutations per gene were generated. Each of these libraries provided improved enzymes for their respective transformations, which highlights the generality, simplicity, and tunability of CCM for targeted protein engineering.

  5. Rationally reduced libraries for combinatorial pathway optimization minimizing experimental effort.

    Science.gov (United States)

    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.

  6. Discovery of DNA repair inhibitors by combinatorial library profiling

    Science.gov (United States)

    Moeller, Benjamin J.; Sidman, Richard L.; Pasqualini, Renata; Arap, Wadih

    2011-01-01

    Small molecule inhibitors of DNA repair are emerging as potent and selective anti-cancer therapies, but the sheer magnitude of the protein networks involved in DNA repair processes poses obstacles to discovery of effective candidate drugs. To address this challenge, we used a subtractive combinatorial selection approach to identify a panel of peptide ligands that bind DNA repair complexes. Supporting the concept that these ligands have therapeutic potential, we show that one selected peptide specifically binds and non-competitively inactivates DNA-PKcs, a protein kinase critical in double-strand DNA break repair. In doing so, this ligand sensitizes BRCA-deficient tumor cells to genotoxic therapy. Our findings establish a platform for large-scale parallel screening for ligand-directed DNA repair inhibitors, with immediate applicability to cancer therapy. PMID:21343400

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

  8. Statistical physics of hard combinatorial optimization: Vertex cover problem

    Science.gov (United States)

    Zhao, Jin-Hua; Zhou, Hai-Jun

    2014-07-01

    Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years, the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper, we use the vertex cover problem, a basic nondeterministic-polynomial (NP)-complete combinatorial optimization problem of wide application, as an example to introduce the statistical physical methods and algorithms. We do not go into the technical details but emphasize mainly the intuitive physical meanings of the message-passing equations. A nonfamiliar reader shall be able to understand to a large extent the physics behind the mean field approaches and to adjust the mean field methods in solving other optimization problems.

  9. Fabrication and characterization of thin-film phosphor combinatorial libraries

    Science.gov (United States)

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

    2002-05-01

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

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

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

  12. Combinatorial Pooling Enables Selective Sequencing of the Barley Gene Space

    Science.gov (United States)

    Lonardi, Stefano; Duma, Denisa; Alpert, Matthew; Cordero, Francesca; Beccuti, Marco; Bhat, Prasanna R.; Wu, Yonghui; Ciardo, Gianfranco; Alsaihati, Burair; Ma, Yaqin; Wanamaker, Steve; Resnik, Josh; Bozdag, Serdar; Luo, Ming-Cheng; Close, Timothy J.

    2013-01-01

    For the vast majority of species – including many economically or ecologically important organisms, progress in biological research is hampered due to the lack of a reference genome sequence. Despite recent advances in sequencing technologies, several factors still limit the availability of such a critical resource. At the same time, many research groups and international consortia have already produced BAC libraries and physical maps and now are in a position to proceed with the development of whole-genome sequences organized around a physical map anchored to a genetic map. We propose a BAC-by-BAC sequencing protocol that combines combinatorial pooling design and second-generation sequencing technology to efficiently approach denovo selective genome sequencing. We show that combinatorial pooling is a cost-effective and practical alternative to exhaustive DNA barcoding when preparing sequencing libraries for hundreds or thousands of DNA samples, such as in this case gene-bearing minimum-tiling-path BAC clones. The novelty of the protocol hinges on the computational ability to efficiently compare hundred millions of short reads and assign them to the correct BAC clones (deconvolution) so that the assembly can be carried out clone-by-clone. Experimental results on simulated data for the rice genome show that the deconvolution is very accurate, and the resulting BAC assemblies have high quality. Results on real data for a gene-rich subset of the barley genome confirm that the deconvolution is accurate and the BAC assemblies have good quality. While our method cannot provide the level of completeness that one would achieve with a comprehensive whole-genome sequencing project, we show that it is quite successful in reconstructing the gene sequences within BACs. In the case of plants such as barley, this level of sequence knowledge is sufficient to support critical end-point objectives such as map-based cloning and marker-assisted breeding. PMID:23592960

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

  14. Combinatorial pooling enables selective sequencing of the barley gene space.

    Science.gov (United States)

    Lonardi, Stefano; Duma, Denisa; Alpert, Matthew; Cordero, Francesca; Beccuti, Marco; Bhat, Prasanna R; Wu, Yonghui; Ciardo, Gianfranco; Alsaihati, Burair; Ma, Yaqin; Wanamaker, Steve; Resnik, Josh; Bozdag, Serdar; Luo, Ming-Cheng; Close, Timothy J

    2013-04-01

    For the vast majority of species - including many economically or ecologically important organisms, progress in biological research is hampered due to the lack of a reference genome sequence. Despite recent advances in sequencing technologies, several factors still limit the availability of such a critical resource. At the same time, many research groups and international consortia have already produced BAC libraries and physical maps and now are in a position to proceed with the development of whole-genome sequences organized around a physical map anchored to a genetic map. We propose a BAC-by-BAC sequencing protocol that combines combinatorial pooling design and second-generation sequencing technology to efficiently approach denovo selective genome sequencing. We show that combinatorial pooling is a cost-effective and practical alternative to exhaustive DNA barcoding when preparing sequencing libraries for hundreds or thousands of DNA samples, such as in this case gene-bearing minimum-tiling-path BAC clones. The novelty of the protocol hinges on the computational ability to efficiently compare hundred millions of short reads and assign them to the correct BAC clones (deconvolution) so that the assembly can be carried out clone-by-clone. Experimental results on simulated data for the rice genome show that the deconvolution is very accurate, and the resulting BAC assemblies have high quality. Results on real data for a gene-rich subset of the barley genome confirm that the deconvolution is accurate and the BAC assemblies have good quality. While our method cannot provide the level of completeness that one would achieve with a comprehensive whole-genome sequencing project, we show that it is quite successful in reconstructing the gene sequences within BACs. In the case of plants such as barley, this level of sequence knowledge is sufficient to support critical end-point objectives such as map-based cloning and marker-assisted breeding.

  15. Extended fuel cycle length

    International Nuclear Information System (INIS)

    Bruyere, M.; Vallee, A.; Collette, C.

    1986-09-01

    Extended fuel cycle length and burnup are currently offered by Framatome and Fragema in order to satisfy the needs of the utilities in terms of fuel cycle cost and of overall systems cost optimization. We intend to point out the consequences of an increased fuel cycle length and burnup on reactor safety, in order to determine whether the bounding safety analyses presented in the Safety Analysis Report are applicable and to evaluate the effect on plant licensing. This paper presents the results of this examination. The first part indicates the consequences of increased fuel cycle length and burnup on the nuclear data used in the bounding accident analyses. In the second part of this paper, the required safety reanalyses are presented and the impact on the safety margins of different fuel management strategies is examined. In addition, systems modifications which can be required are indicated

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

    DEFF Research Database (Denmark)

    Tong, Glenn; Nielsen, John

    1996-01-01

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

  17. Relativistic distances, sizes, lengths

    International Nuclear Information System (INIS)

    Strel'tsov, V.N.

    1992-01-01

    Such notion as light or retarded distance, field size, formation way, visible size of a body, relativistic or radar length and wave length of light from a moving atom are considered. The relation between these notions is cleared up, their classification is given. It is stressed that the formation way is defined by the field size of a moving particle. In the case of the electromagnetic field, longitudinal sizes increase proportionally γ 2 with growing charge velocity (γ is the Lorentz-factor). 18 refs

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

    Science.gov (United States)

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

    2015-01-01

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

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

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

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

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Jean-Louis Dornstetter

    2002-12-01

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

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

    CERN Document Server

    Delucchi, Emanuele; Moci, Luca

    2015-01-01

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

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

    OpenAIRE

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

    2002-01-01

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

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

    Science.gov (United States)

    2008-01-01

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

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

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

    CERN Document Server

    Hartmann, Alexander K

    2005-01-01

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

  11. Combinatorial interpretations of particular evaluations of complete and elementary symmetric functions

    OpenAIRE

    Mongelli, Pietro

    2011-01-01

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

  12. Utilizing pulsed laser deposition lateral inhomogeneity as a tool in combinatorial material science.

    Science.gov (United States)

    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.

  13. Quick screening for new flux pinning materials in YBCO films with the combinatorial-PLD method

    International Nuclear Information System (INIS)

    Yoshimura, T.; Ichino, Y.; Yoshida, Y.; Takai, Y.; Kita, R.; Suzuki, K.; Takeuchi, T.

    2011-01-01

    An effective way to improve the superconducting properties in REBa 2 Cu 3 O y (REBCO) films under a magnetic field is to dope artificial pinning centers (APC). The pinning performance depends on the content of the APC materials. Usually, the optimal APC content is explored by preparing films one at a time from the REBCO target using different APC material content, which is an extremely time-consuming process. The combinatorial-PLD (C-PLD) method allowed us to prepare films that continuously changed in composition across a single substrate. In this study, we used the C-PLD method to prepare BaSnO 3 (BSO)-doped YBCO films. The films were deposited on SrTiO 3 substrate using a fourth-harmonic Nd:YAG laser. From the results of the J c -B curves at 77 K and B//c, the film that contained 3.2 vol.% of BSO exhibited the best pinning performance in this study. We showed that the C-PLD method was efficient for quick screening of the optimal APC content with only one deposition. We also used the C-PLD method to explore new APC materials, and proved that it can quickly evaluate the new APC materials Ba 3 Cu 3 In 4 O 12 and BaTbO 3 .

  14. Antigenic variation of Anaplasma marginale msp2 occurs by combinatorial gene conversion.

    Science.gov (United States)

    Brayton, Kelly A; Palmer, Guy H; Lundgren, Anna; Yi, Jooyoung; Barbet, Anthony F

    2002-03-01

    The rickettsial pathogen Anaplasma marginale establishes lifelong persistent infection in the mammalian reservoir host, during which time immune escape variants continually arise in part because of variation in the expressed copy of the immunodominant outer membrane protein MSP2. A key question is how the small 1.2 Mb A. marginale genome generates sufficient variants to allow long-term persistence in an immunocompetent reservoir host. The recombination of whole pseudogenes into the single msp2 expression site has been previously identified as one method of generating variants, but is inadequate to generate the number of variants required for persistent infection. In the present study, we demonstrate that recombination of a whole pseudogene is followed by a second level of variation in which small segments of pseudogenes recombine into the expression site by gene conversion. Evidence for four short sequential changes in the hypervariable region of msp2 coupled with the identification of nine pseudogenes from a single strain of A. marginale provides for a combinatorial number of possible expressed MSP2 variants sufficient for lifelong persistence.

  15. Pion nucleus scattering lengths

    International Nuclear Information System (INIS)

    Huang, W.T.; Levinson, C.A.; Banerjee, M.K.

    1971-09-01

    Soft pion theory and the Fubini-Furlan mass dispersion relations have been used to analyze the pion nucleon scattering lengths and obtain a value for the sigma commutator term. With this value and using the same principles, scattering lengths have been predicted for nuclei with mass number ranging from 6 to 23. Agreement with experiment is very good. For those who believe in the Gell-Mann-Levy sigma model, the evaluation of the commutator yields the value 0.26(m/sub σ//m/sub π/) 2 for the sigma nucleon coupling constant. The large dispersive corrections for the isosymmetric case implies that the basic idea behind many of the soft pion calculations, namely, slow variation of matrix elements from the soft pion limit to the physical pion mass, is not correct. 11 refs., 1 fig., 3 tabs

  16. Gap length distributions by PEPR

    International Nuclear Information System (INIS)

    Warszawer, T.N.

    1980-01-01

    Conditions guaranteeing exponential gap length distributions are formulated and discussed. Exponential gap length distributions of bubble chamber tracks first obtained on a CRT device are presented. Distributions of resulting average gap lengths and their velocity dependence are discussed. (orig.)

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

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

    Science.gov (United States)

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

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

  19. Particle Swarm Optimization applied to combinatorial problem aiming the fuel recharge problem solution in a nuclear reactor; Particle swarm optimization aplicado ao problema combinatorio com vistas a solucao do problema de recarga em um reator nuclear

    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)

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

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

  2. A Combinatorial Kin Discrimination System in Bacillus subtilis.

    Science.gov (United States)

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

    2016-03-21

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

  3. Combinatorial Drug Screening Identifies Ewing Sarcoma-specific Sensitivities.

    Science.gov (United States)

    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.

  4. Combinatorial approaches to evaluate nanodiamond uptake and induced cellular fate

    Science.gov (United States)

    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.

  5. Combinatorial approaches to evaluate nanodiamond uptake and induced cellular fate

    Science.gov (United States)

    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

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

  7. Combinatorial set theory with a gentle introduction to forcing

    CERN Document Server

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

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

  9. Combinatorial chemoenzymatic synthesis and high-throughput screening of sialosides.

    Science.gov (United States)

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

    2008-09-19

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

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

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

  12. Combinatorial neural codes from a mathematical coding theory perspective.

    Science.gov (United States)

    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.

  13. On Some Algebraic and Combinatorial Properties of Dunkl Elements

    Science.gov (United States)

    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.

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

  15. Peptide mimic for influenza vaccination using nonnatural combinatorial chemistry

    Science.gov (United States)

    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

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

  17. Combinatorial quantization of the Hamiltonian Chern-Simons theory

    International Nuclear Information System (INIS)

    Alekseev, A.Yu.; Grosse, H.; Schomerus, V.

    1996-01-01

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

  18. Automated Implanter Endstation for Combinatorial Materials Science with Ion Beams

    International Nuclear Information System (INIS)

    Grosshans, I.; Karl, H.; Stritzker, B.

    2003-01-01

    The discovery, understanding and optimization of new complex functional materials requires combinatorial synthesis techniques and fast screening instrumentation for the measurement of the samples. In this contribution the synthesis of buried II-VI compound semiconductor nanocrystals by ion-implantation in SiO2 on silicon will be presented. For that we constructed a computer controlled implanter target end station, in which a 4-inch wafer can be implanted with a lateral pattern of distinct dose, composition or energy combinations. The chemical reaction of the constituents is initiated either during the implantation process or ex-situ by a rapid thermal process, where a reactive atmosphere can be applied. The resulting optical photoluminescence properties of the individual fields of the pattern can then be screened in rapid succession in an optical cryostat into which the whole wafer is mounted and cooled down. In this way, complex interdependences of the physical parameters can be studied on a single wafer and the technically relevant properties optimized

  19. Combinatorial approaches to evaluate nanodiamond uptake and induced cellular fate.

    Science.gov (United States)

    Eldawud, Reem; Reitzig, Manuela; Opitz, Jörg; Rojansakul, Yon; Jiang, Wenjuan; Nangia, Shikha; Dinu, Cerasela Zoica

    2016-02-26

    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.

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

    Science.gov (United States)

    Su, Zhangli

    2016-01-01

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

  1. Odd Length Contraction

    Science.gov (United States)

    Smarandache, Florentin

    2013-09-01

    Let's denote by VE the speed of the Earth and byVR the speed of the rocket. Both travel in the same direction on parallel trajectories. We consider the Earth as a moving (at a constant speed VE -VR) spacecraft of almost spherical form, whose radius is r and thus the diameter 2r, and the rocket as standing still. The non-proper length of Earth's diameter, as measured by the astronaut is: L = 2 r√{ 1 -|/VE -VR|2 c2 } rocket! Also, let's assume that the astronaut is laying down in the direction of motion. Therefore, he would also shrink, or he would die!

  2. Penile length and circumference: an Indian study.

    Science.gov (United States)

    Promodu, K; Shanmughadas, K V; Bhat, S; Nair, K R

    2007-01-01

    Apprehension about the normal size of penis is a major concern for men. Aim of the present investigation is to estimate the penile length and circumference of Indian males and to compare the results with the data from other countries. Results will help in counseling the patients worried about the penile size and seeking penis enlargement surgery. Penile length in flaccid and stretched conditions and circumference were measured in a group of 301 physically normal men. Erected length and circumference were measured for 93 subjects. Mean flaccid length was found to be 8.21 cm, mean stretched length 10.88 cm and circumference 9.14 cm. Mean erected length was found to be 13.01 cm and erected circumference was 11.46 cm. Penile dimensions are found to be correlated with anthropometric parameters. Insight into the normative data of penile size of Indian males obtained. There are significant differences in the mean penile length and circumference of Indian sample compared to the data reported from other countries. Study need to be continued with a large sample to establish a normative data applicable to the general population.

  3. Continuous auditing & continuous monitoring : Continuous value?

    NARCIS (Netherlands)

    van Hillo, Rutger; Weigand, Hans; Espana, S; Ralyte, J; Souveyet, C

    2016-01-01

    Advancements in information technology, new laws and regulations and rapidly changing business conditions have led to a need for more timely and ongoing assurance with effectively working controls. Continuous Auditing (CA) and Continuous Monitoring (CM) technologies have made this possible by

  4. Combinatorial assembly of small molecules into bivalent antagonists of TrkC or TrkA receptors.

    Directory of Open Access Journals (Sweden)

    Fouad Brahimi

    Full Text Available A library of peptidomimetics was assembled combinatorially into dimers on a triazine-based core. The pharmacophore corresponds to β-turns of the neurotrophin polypeptides neurotrophin-3 (NT-3, nerve growth factor (NGF, or brain-derived neurotrophic factor (BDNF. These are the natural ligands for TrkC, TrkA, and TrkB receptors, respectively. The linker length and the side-chain orientation of each monomer within the bivalent mimics were systematically altered, and the impact of these changes on the function of each ligand was evaluated. While the monovalent peptidomimetics had no detectable binding or bioactivity, four bivalent peptidomimetics (2c, 2d, 2e, 3f are selective TrkC ligands with antagonistic activity, and two bivalent peptidomimetics (1a, 1b are TrkC and TrkA ligands with antagonistic activity. All these bivalent compounds block ligand-dependent receptor activation and cell survival, without affecting neuritogenic differentiation. This work adds to our understanding of how the neurotrophins function through Trk receptors, and demonstrates that peptidomimetics can be designed to selectively disturb specific biological signals, and may be used as pharmacological probes or as therapeutic leads. The concept of altering side-chain, linker length, and sequence orientation of a subunit within a pharmacophore provides an easy modular approach to generate larger libraries with diversified bioactivity.

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

    Science.gov (United States)

    Antolini, Ermete

    2017-02-13

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

  6. Oriented matroids—combinatorial structures underlying loop quantum gravity

    Science.gov (United States)

    Brunnemann, Johannes; Rideout, David

    2010-10-01

    We analyze combinatorial structures which play a central role in determining spectral properties of the volume operator (Ashtekar A and Lewandowski J 1998 Adv. Theor. Math. Phys. 1 388) in loop quantum gravity (LQG). These structures encode geometrical information of the embedding of arbitrary valence vertices of a graph in three-dimensional Riemannian space and can be represented by sign strings containing relative orientations of embedded edges. We demonstrate that these signature factors are a special representation of the general mathematical concept of an oriented matroid (Ziegler G M 1998 Electron. J. Comb.; Björner A et al 1999 Oriented Matroids (Cambridge: Cambridge University Press)). Moreover, we show that oriented matroids can also be used to describe the topology (connectedness) of directed graphs. Hence, the mathematical methods developed for oriented matroids can be applied to the difficult combinatorics of embedded graphs underlying the construction of LQG. As a first application we revisit the analysis of Brunnemann and Rideout (2008 Class. Quantum Grav. 25 065001 and 065002), and find that enumeration of all possible sign configurations used there is equivalent to enumerating all realizable oriented matroids of rank 3 (Ziegler G M 1998 Electron. J. Comb.; Björner A et al 1999 Oriented Matroids (Cambridge: Cambridge University Press)), and thus can be greatly simplified. We find that for 7-valent vertices having no coplanar triples of edge tangents, the smallest non-zero eigenvalue of the volume spectrum does not grow as one increases the maximum spin jmax at the vertex, for any orientation of the edge tangents. This indicates that, in contrast to the area operator, considering large jmax does not necessarily imply large volume eigenvalues. In addition we give an outlook to possible starting points for rewriting the combinatorics of LQG in terms of oriented matroids.

  7. Development of a large peptoid-DOTA combinatorial library.

    Science.gov (United States)

    Singh, Jaspal; Lopes, Daniel; Gomika Udugamasooriya, D

    2016-09-01

    Conventional one-bead one-compound (OBOC) library synthesis is typically used to identify molecules with therapeutic value. The design and synthesis of OBOC libraries that contain molecules with imaging or even potentially therapeutic and diagnostic capacities (e.g. theranostic agents) has been overlooked. The development of a therapeutically active molecule with a built-in imaging component for a certain target is a daunting task, and structure-based rational design might not be the best approach. We hypothesize to develop a combinatorial library with potentially therapeutic and imaging components fused together in each molecule. Such molecules in the library can be used to screen, identify, and validate as direct theranostic candidates against targets of interest. As the first step in achieving that aim, we developed an on-bead library of 153,600 Peptoid-DOTA compounds in which the peptoids are the target-recognizing and potentially therapeutic components and the DOTA is the imaging component. We attached the DOTA scaffold to TentaGel beads using one of the four arms of DOTA, and we built a diversified 6-mer peptoid library on the remaining three arms. We evaluated both the synthesis and the mass spectrometric sequencing capacities of the test compounds and of the final library. The compounds displayed unique ionization patterns including direct breakages of the DOTA scaffold into two units, allowing clear decoding of the sequences. Our approach provides a facile synthesis method for the complete on-bead development of large peptidomimetic-DOTA libraries for screening against biological targets for the identification of potential theranostic agents in the future. © 2016 The Authors. Biopolymers Published by Wiley Periodicals, Inc. Biopolymers (Pept Sci) 106: 673-684, 2016. © 2016 The Authors. Biopolymers Published by Wiley Periodicals, Inc.

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

    Science.gov (United States)

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

    2009-08-01

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

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

    Science.gov (United States)

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

    2016-01-01

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

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

    Science.gov (United States)

    Chen, Hong-Zhang; Liu, Zhi-Hua

    2015-06-01

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

  11. Optimization and Quantization in Gradient Symbol Systems: A Framework for Integrating the Continuous and the Discrete in Cognition

    Science.gov (United States)

    Smolensky, Paul; Goldrick, Matthew; Mathis, Donald

    2014-01-01

    Mental representations have continuous as well as discrete, combinatorial properties. For example, while predominantly discrete, phonological representations also vary continuously; this is reflected by gradient effects in instrumental studies of speech production. Can an integrated theoretical framework address both aspects of structure? The…

  12. Construction of Short-length High-rates Ldpc Codes Using Difference Families

    OpenAIRE

    Deny Hamdani; Ery Safrianti

    2007-01-01

    Low-density parity-check (LDPC) code is linear-block error-correcting code defined by sparse parity-check matrix. It isdecoded using the massage-passing algorithm, and in many cases, capable of outperforming turbo code. This paperpresents a class of low-density parity-check (LDPC) codes showing good performance with low encoding complexity.The code is constructed using difference families from combinatorial design. The resulting code, which is designed tohave short code length and high code r...

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

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

    Science.gov (United States)

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

    2017-06-15

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

  15. Combinatorial pattern discovery approach for the folding trajectory analysis of a beta-hairpin.

    Directory of Open Access Journals (Sweden)

    Laxmi Parida

    2005-06-01

    Full Text Available The study of protein folding mechanisms continues to be one of the most challenging problems in computational biology. Currently, the protein folding mechanism is often characterized by calculating the free energy landscape versus various reaction coordinates, such as the fraction of native contacts, the radius of gyration, RMSD from the native structure, and so on. In this paper, we present a combinatorial pattern discovery approach toward understanding the global state changes during the folding process. This is a first step toward an unsupervised (and perhaps eventually automated approach toward identification of global states. The approach is based on computing biclusters (or patterned clusters-each cluster is a combination of various reaction coordinates, and its signature pattern facilitates the computation of the Z-score for the cluster. For this discovery process, we present an algorithm of time complexity c in RO((N + nm log n, where N is the size of the output patterns and (n x m is the size of the input with n time frames and m reaction coordinates. To date, this is the best time complexity for this problem. We next apply this to a beta-hairpin folding trajectory and demonstrate that this approach extracts crucial information about protein folding intermediate states and mechanism. We make three observations about the approach: (1 The method recovers states previously obtained by visually analyzing free energy surfaces. (2 It also succeeds in extracting meaningful patterns and structures that had been overlooked in previous works, which provides a better understanding of the folding mechanism of the beta-hairpin. These new patterns also interconnect various states in existing free energy surfaces versus different reaction coordinates. (3 The approach does not require calculating the free energy values, yet it offers an analysis comparable to, and sometimes better than, the methods that use free energy landscapes, thus validating the

  16. Combinatorial Pattern Discovery Approach for the Folding Trajectory Analysis of a beta-Hairpin.

    Directory of Open Access Journals (Sweden)

    2005-06-01

    Full Text Available The study of protein folding mechanisms continues to be one of the most challenging problems in computational biology. Currently, the protein folding mechanism is often characterized by calculating the free energy landscape versus various reaction coordinates, such as the fraction of native contacts, the radius of gyration, RMSD from the native structure, and so on. In this paper, we present a combinatorial pattern discovery approach toward understanding the global state changes during the folding process. This is a first step toward an unsupervised (and perhaps eventually automated approach toward identification of global states. The approach is based on computing biclusters (or patterned clusters-each cluster is a combination of various reaction coordinates, and its signature pattern facilitates the computation of the Z-score for the cluster. For this discovery process, we present an algorithm of time complexity cinRO((N + nm log n, where N is the size of the output patterns and (n x m is the size of the input with n time frames and m reaction coordinates. To date, this is the best time complexity for this problem. We next apply this to a beta-hairpin folding trajectory and demonstrate that this approach extracts crucial information about protein folding intermediate states and mechanism. We make three observations about the approach: (1 The method recovers states previously obtained by visually analyzing free energy surfaces. (2 It also succeeds in extracting meaningful patterns and structures that had been overlooked in previous works, which provides a better understanding of the folding mechanism of the beta-hairpin. These new patterns also interconnect various states in existing free energy surfaces versus different reaction coordinates. (3 The approach does not require calculating the free energy values, yet it offers an analysis comparable to, and sometimes better than, the methods that use free energy landscapes, thus validating the

  17. Comparison of dissimilarity measures for cluster analysis of X-ray diffraction data from combinatorial libraries

    Science.gov (United States)

    Iwasaki, Yuma; Kusne, A. Gilad; Takeuchi, Ichiro

    2017-12-01

    Machine learning techniques have proven invaluable to manage the ever growing volume of materials research data produced as developments continue in high-throughput materials simulation, fabrication, and characterization. In particular, machine learning techniques have been demonstrated for their utility in rapidly and automatically identifying potential composition-phase maps from structural data characterization of composition spread libraries, enabling rapid materials fabrication-structure-property analysis and functional materials discovery. A key issue in development of an automated phase-diagram determination method is the choice of dissimilarity measure, or kernel function. The desired measure reduces the impact of confounding structural data issues on analysis performance. The issues include peak height changes and peak shifting due to lattice constant change as a function of composition. In this work, we investigate the choice of dissimilarity measure in X-ray diffraction-based structure analysis and the choice of measure's performance impact on automatic composition-phase map determination. Nine dissimilarity measures are investigated for their impact in analyzing X-ray diffraction patterns for a Fe-Co-Ni ternary alloy composition spread. The cosine, Pearson correlation coefficient, and Jensen-Shannon divergence measures are shown to provide the best performance in the presence of peak height change and peak shifting (due to lattice constant change) when the magnitude of peak shifting is unknown. With prior knowledge of the maximum peak shifting, dynamic time warping in a normalized constrained mode provides the best performance. This work also serves to demonstrate a strategy for rapid analysis of a large number of X-ray diffraction patterns in general beyond data from combinatorial libraries.

  18. Concentration and length dependence of DNA looping in transcriptional regulation.

    Directory of Open Access Journals (Sweden)

    Lin Han

    2009-05-01

    Full Text Available In many cases, transcriptional regulation involves the binding of transcription factors at sites on the DNA that are not immediately adjacent to the promoter of interest. This action at a distance is often mediated by the formation of DNA loops: Binding at two or more sites on the DNA results in the formation of a loop, which can bring the transcription factor into the immediate neighborhood of the relevant promoter. These processes are important in settings ranging from the historic bacterial examples (bacterial metabolism and the lytic-lysogeny decision in bacteriophage, to the modern concept of gene regulation to regulatory processes central to pattern formation during development of multicellular organisms. Though there have been a variety of insights into the combinatorial aspects of transcriptional control, the mechanism of DNA looping as an agent of combinatorial control in both prokaryotes and eukaryotes remains unclear. We use single-molecule techniques to dissect DNA looping in the lac operon. In particular, we measure the propensity for DNA looping by the Lac repressor as a function of the concentration of repressor protein and as a function of the distance between repressor binding sites. As with earlier single-molecule studies, we find (at least two distinct looped states and demonstrate that the presence of these two states depends both upon the concentration of repressor protein and the distance between the two repressor binding sites. We find that loops form even at interoperator spacings considerably shorter than the DNA persistence length, without the intervention of any other proteins to prebend the DNA. The concentration measurements also permit us to use a simple statistical mechanical model of DNA loop formation to determine the free energy of DNA looping, or equivalently, the for looping.

  19. Continuous Problem of Function Continuity

    Science.gov (United States)

    Jayakody, Gaya; Zazkis, Rina

    2015-01-01

    We examine different definitions presented in textbooks and other mathematical sources for "continuity of a function at a point" and "continuous function" in the context of introductory level Calculus. We then identify problematic issues related to definitions of continuity and discontinuity: inconsistency and absence of…

  20. Counting in Lattices: Combinatorial Problems from Statistical Mechanics.

    Science.gov (United States)

    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

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

    International Nuclear Information System (INIS)

    Burns, T.J.

    1992-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Iman Yousefi

    2015-01-01

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

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

    International Nuclear Information System (INIS)

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

    2006-01-01

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

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

    Science.gov (United States)

    Amato, Michael S; MacDonald, Maryellen C

    2010-07-01

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

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

    CERN Document Server

    DeTemple, Duane

    2014-01-01

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

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

    Science.gov (United States)

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

    2017-11-13

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

  7. Functional completeness of the mixed λ-calculus and combinatory logic

    DEFF Research Database (Denmark)

    Nielson, Hanne Riis; Nielson, Flemming

    1990-01-01

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

  8. Length expectation values in quantum Regge calculus

    International Nuclear Information System (INIS)

    Khatsymovsky, V.M.

    2004-01-01

    Regge calculus configuration superspace can be embedded into a more general superspace where the length of any edge is defined ambiguously depending on the 4-tetrahedron containing the edge. Moreover, the latter superspace can be extended further so that even edge lengths in each the 4-tetrahedron are not defined, only area tensors of the 2-faces in it are. We make use of our previous result concerning quantization of the area tensor Regge calculus which gives finite expectation values for areas. Also our result is used showing that quantum measure in the Regge calculus can be uniquely fixed once we know quantum measure on (the space of the functionals on) the superspace of the theory with ambiguously defined edge lengths. We find that in this framework quantization of the usual Regge calculus is defined up to a parameter. The theory may possess nonzero (of the order of Planck scale) or zero length expectation values depending on whether this parameter is larger or smaller than a certain value. Vanishing length expectation values means that the theory is becoming continuous, here dynamically in the originally discrete framework

  9. Automated path length and M56 measurements at Jefferson Lab

    International Nuclear Information System (INIS)

    Hardy, D.; Tang, J.; Legg, R.

    1997-01-01

    Accurate measurement of path length and path length changes versus momentum (M 56 ) are critical for maintaining minimum beam energy spread in the CEBAF (Continuous Electron Beam Accelerator Facility) accelerator at the Thomas Jefferson National Accelerator Facility (Jefferson Lab). The relative path length for each circuit of the beam (1256m) must be equal within 1.5 degrees of 1497 MHz RF phase. A relative path length measurement is made by measuring the relative phases of RF signals from a cavity that is separately excited for each pass of a 4.2 μs pulsed beam. This method distinguishes the path length to less than 0.5 path length error. The development of a VME based automated measurement system for path length and M 56 has contributed to faster machine setup time and has the potential for use as a feedback parameter for automated control

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

    Czech Academy of Sciences Publication Activity Database

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

    2011-01-01

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

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

    Science.gov (United States)

    Amato, Michael S.; MacDonald, Maryellen C.

    2010-01-01

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

  12. Combinatorial Integer Labeling Thorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations

    NARCIS (Netherlands)

    van der Laan, G.; Talman, A.J.J.; Yang, Z.F.

    2007-01-01

    Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set f§1;§2; ¢ ¢ ¢ ;§ng with the property that antipodal vertices on the boundary of

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

    Directory of Open Access Journals (Sweden)

    Adel Tabchy

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

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

    Science.gov (United States)

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

    2013-01-01

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

  15. Efficient Discovery of Nonlinear Dependencies in a Combinatorial Catalyst Data Set

    Czech Academy of Sciences Publication Activity Database

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

    2004-01-01

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

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

    Science.gov (United States)

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

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

    NARCIS (Netherlands)

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

    2016-01-01

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

  18. Design and spectroscopic reflectometry characterization of pulsed laser deposition combinatorial libraries

    International Nuclear Information System (INIS)

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

    2007-01-01

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

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

    NARCIS (Netherlands)

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

    2018-01-01

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

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

    NARCIS (Netherlands)

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

    2003-01-01

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

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

    DEFF Research Database (Denmark)

    Bundgaard, Peer

    2006-01-01

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

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

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

    NARCIS (Netherlands)

    Faigle, U.; Hurink, Johann L.

    2010-01-01

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

  4. Using Combinatorial Approach to Improve Students' Learning of the Distributive Law and Multiplicative Identities

    Science.gov (United States)

    Tsai, Yu-Ling; Chang, Ching-Kuch

    2009-01-01

    This article reports an alternative approach, called the combinatorial model, to learning multiplicative identities, and investigates the effects of implementing results for this alternative approach. Based on realistic mathematics education theory, the new instructional materials or modules of the new approach were developed by the authors. From…

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

    Science.gov (United States)

    Prodromou, Theodosia

    2012-01-01

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

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

    OpenAIRE

    Seo, Seunghyun

    2004-01-01

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

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

    Science.gov (United States)

    Bøhn, Thomas

    2018-01-01

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

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

    NARCIS (Netherlands)

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

    2014-01-01

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

  9. Business continuity

    International Nuclear Information System (INIS)

    Breunhoelder, Gert

    2002-01-01

    This presentation deals with the following keypoints: Information Technology (IT) Business Continuity and Recovery essential for any business; lessons learned after Sept. 11 event; Detailed planning, redundancy and testing being the key elements for probability estimation of disasters

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

    Science.gov (United States)

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

    2018-01-01

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

  11. Continuous tokamaks

    International Nuclear Information System (INIS)

    Peng, Y.K.M.

    1978-04-01

    A tokamak configuration is proposed that permits the rapid replacement of a plasma discharge in a ''burn'' chamber by another one in a time scale much shorter than the elementary thermal time constant of the chamber first wall. With respect to the chamber, the effective duty cycle factor can thus be made arbitrarily close to unity minimizing the cyclic thermal stress in the first wall. At least one plasma discharge always exists in the new tokamak configuration, hence, a continuous tokamak. By incorporating adiabatic toroidal compression, configurations of continuous tokamak compressors are introduced. To operate continuous tokamaks, it is necessary to introduce the concept of mixed poloidal field coils, which spatially groups all the poloidal field coils into three sets, all contributing simultaneously to inducing the plasma current and maintaining the proper plasma shape and position. Preliminary numerical calculations of axisymmetric MHD equilibria in continuous tokamaks indicate the feasibility of their continued plasma operation. Advanced concepts of continuous tokamaks to reduce the topological complexity and to allow the burn plasma aspect ratio to decrease for increased beta are then suggested

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

    Science.gov (United States)

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

    2010-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Arnoldo J Müller-Molina

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

  14. Length Contraction Should not be Independent of Time

    Science.gov (United States)

    Smarandache, Florentin

    2013-10-01

    In Special Theory of Relativity it looks that the length contraction along the direction of the motion is independent of time, i.e. if a rocket flies one second, or the rocket flies one year the rocket's along-the-motion length contraction is the same, since the contraction factor C (v) =√{ 1 -v2/c2 } depends on the rocket's relativistic speed (v) and on the light speed in vacuum (c) only. We find this as unrealistic, incomplete. It is logical that flying more and more it should increase the length contraction. What about the cosmic bodies that continuously travel, do they contract only once or are they continuously contracting?

  15. Continuous Dropout.

    Science.gov (United States)

    Shen, Xu; Tian, Xinmei; Liu, Tongliang; Xu, Fang; Tao, Dacheng

    2017-10-03

    Dropout has been proven to be an effective algorithm for training robust deep networks because of its ability to prevent overfitting by avoiding the co-adaptation of feature detectors. Current explanations of dropout include bagging, naive Bayes, regularization, and sex in evolution. According to the activation patterns of neurons in the human brain, when faced with different situations, the firing rates of neurons are random and continuous, not binary as current dropout does. Inspired by this phenomenon, we extend the traditional binary dropout to continuous dropout. On the one hand, continuous dropout is considerably closer to the activation characteristics of neurons in the human brain than traditional binary dropout. On the other hand, we demonstrate that continuous dropout has the property of avoiding the co-adaptation of feature detectors, which suggests that we can extract more independent feature detectors for model averaging in the test stage. We introduce the proposed continuous dropout to a feedforward neural network and comprehensively compare it with binary dropout, adaptive dropout, and DropConnect on Modified National Institute of Standards and Technology, Canadian Institute for Advanced Research-10, Street View House Numbers, NORB, and ImageNet large scale visual recognition competition-12. Thorough experiments demonstrate that our method performs better in preventing the co-adaptation of feature detectors and improves test performance.

  16. Continuity theory

    CERN Document Server

    Nel, Louis

    2016-01-01

    This book presents a detailed, self-contained theory of continuous mappings. It is mainly addressed to students who have already studied these mappings in the setting of metric spaces, as well as multidimensional differential calculus. The needed background facts about sets, metric spaces and linear algebra are developed in detail, so as to provide a seamless transition between students' previous studies and new material. In view of its many novel features, this book will be of interest also to mature readers who have studied continuous mappings from the subject's classical texts and wish to become acquainted with a new approach. The theory of continuous mappings serves as infrastructure for more specialized mathematical theories like differential equations, integral equations, operator theory, dynamical systems, global analysis, topological groups, topological rings and many more. In light of the centrality of the topic, a book of this kind fits a variety of applications, especially those that contribute to ...

  17. Continuation calculus

    NARCIS (Netherlands)

    Geron, B.; Geuvers, J.H.; de'Liguoro, U.; Saurin, A.

    2013-01-01

    Programs with control are usually modeled using lambda calculus extended with control operators. Instead of modifying lambda calculus, we consider a different model of computation. We introduce continuation calculus, or CC, a deterministic model of computation that is evaluated using only head

  18. Combinatorial Vector Fields for Piecewise Affine Control Systems

    DEFF Research Database (Denmark)

    Wisniewski, Rafal; Larsen, Jesper Abildgaard

    2008-01-01

    This paper is intended to be a continuation of Habets and van Schuppen (2004) and Habets, Collins and van Schuppen (2006), which address the control problem for piecewise-affine systems on an arbitrary polytope or a family of these. Our work deals with the underlying combinatorics of the underlyi...

  19. Distance and Cable Length Measurement System

    Science.gov (United States)

    Hernández, Sergio Elias; Acosta, Leopoldo; Toledo, Jonay

    2009-01-01

    A simple, economic and successful design for distance and cable length detection is presented. The measurement system is based on the continuous repetition of a pulse that endlessly travels along the distance to be detected. There is a pulse repeater at both ends of the distance or cable to be measured. The endless repetition of the pulse generates a frequency that varies almost inversely with the distance to be measured. The resolution and distance or cable length range could be adjusted by varying the repetition time delay introduced at both ends and the measurement time. With this design a distance can be measured with centimeter resolution using electronic system with microsecond resolution, simplifying classical time of flight designs which require electronics with picosecond resolution. This design was also applied to position measurement. PMID:22303169

  20. Length-Weight relationships of mangrove oyster, Crassostrea gasar ...

    African Journals Online (AJOL)

    The length-weight relationships (LWRs) of mangrove oyster, Crassostrea gasar, cultured under continuous and periodic submergence in tidal ponds, for a period of seven months, February to August 2010 were determined. A total of 375 individuals each of pond A (continuous submergence) and B (periodic submergence) ...

  1. Continuation calculus

    Directory of Open Access Journals (Sweden)

    Bram Geron

    2013-09-01

    Full Text Available Programs with control are usually modeled using lambda calculus extended with control operators. Instead of modifying lambda calculus, we consider a different model of computation. We introduce continuation calculus, or CC, a deterministic model of computation that is evaluated using only head reduction, and argue that it is suitable for modeling programs with control. It is demonstrated how to define programs, specify them, and prove them correct. This is shown in detail by presenting in CC a list multiplication program that prematurely returns when it encounters a zero. The correctness proof includes termination of the program. In continuation calculus we can model both call-by-name and call-by-value. In addition, call-by-name functions can be applied to call-by-value results, and conversely.

  2. Combinatorial Alanine Substitution Enables Rapid Optimization of Cytochrome P450BM3 for Selective Hydroxylation of Large Substrates

    KAUST Repository

    Lewis, Jared C.; Mantovani, Simone M.; Fu, Yu; Snow, Christopher D.; Komor, Russell S.; Wong , Chi-Huey; Arnold, Frances H.

    2010-01-01

    Made for each other: Combinatorial alanine substitution of active site residues in a thermostable cytochrome P450BM3 variant was used to generate an enzyme that is active with large substrates. Selective hydroxylation of methoxymethylated

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

    NARCIS (Netherlands)

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

    2008-01-01

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

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

    Science.gov (United States)

    Hartmann, Alexander K.; Weigt, Martin

    2005-10-01

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

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

    KAUST Repository

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

    2017-01-01

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

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

    CERN Document Server

    Quaintance, Jocelyn

    2016-01-01

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

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

    Science.gov (United States)

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

    2014-01-01

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

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

    Science.gov (United States)

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

    2015-01-01

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

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

    Science.gov (United States)

    Chen, Sheng-Hong; Lahav, Galit

    2016-12-01

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

  10. Development of automatic combinatorial system for synthesis of nanoparticles using microreactors

    Energy Technology Data Exchange (ETDEWEB)

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

    2011-10-29

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

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

    KAUST Repository

    Kuwahara, Hiroyuki

    2017-03-01

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

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

    Science.gov (United States)

    Sáfrán, György

    2018-04-01

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

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

    Science.gov (United States)

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

    2017-07-10

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

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

    OpenAIRE

    Wang, Qi

    2017-01-01

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

  15. The World of Combinatorial Fuzzy Problems and the Efficiency of Fuzzy Approximation Algorithms

    OpenAIRE

    Yamakami, Tomoyuki

    2015-01-01

    We re-examine a practical aspect of combinatorial fuzzy problems of various types, including search, counting, optimization, and decision problems. We are focused only on those fuzzy problems that take series of fuzzy input objects and produce fuzzy values. To solve such problems efficiently, we design fast fuzzy algorithms, which are modeled by polynomial-time deterministic fuzzy Turing machines equipped with read-only auxiliary tapes and write-only output tapes and also modeled by polynomia...

  16. Novel Combinatory Approaches to Repair Visual System after Optic Nerve Damage

    Science.gov (United States)

    2014-09-01

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

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

    Science.gov (United States)

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

    2011-02-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2007-09-01

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

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

    Directory of Open Access Journals (Sweden)

    Arindam Deb

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

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

  1. Gas-Foamed Scaffold Gradients for Combinatorial Screening in 3D

    Directory of Open Access Journals (Sweden)

    Joachim Kohn

    2012-03-01

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

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

    Directory of Open Access Journals (Sweden)

    Nannan Zhou

    2015-06-01

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

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

    International Nuclear Information System (INIS)

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

    2004-01-01

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

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

    Science.gov (United States)

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

    2017-07-19

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

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

    Science.gov (United States)

    Ye, Yusen; Gao, Lin; Zhang, Shihua

    2017-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Jenny Rivers

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

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

    Science.gov (United States)

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

    2018-05-01

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

  8. Combinatorial materials synthesis and high-throughput screening: an integrated materials chip approach to mapping phase diagrams and discovery and optimization of functional materials.

    Science.gov (United States)

    Xiang, X D

    Combinatorial materials synthesis methods and high-throughput evaluation techniques have been developed to accelerate the process of materials discovery and optimization and phase-diagram mapping. Analogous to integrated circuit chips, integrated materials chips containing thousands of discrete different compositions or continuous phase diagrams, often in the form of high-quality epitaxial thin films, can be fabricated and screened for interesting properties. Microspot x-ray method, various optical measurement techniques, and a novel evanescent microwave microscope have been used to characterize the structural, optical, magnetic, and electrical properties of samples on the materials chips. These techniques are routinely used to discover/optimize and map phase diagrams of ferroelectric, dielectric, optical, magnetic, and superconducting materials.

  9. Does length or neighborhood size cause the word length effect?

    Science.gov (United States)

    Jalbert, Annie; Neath, Ian; Surprenant, Aimée M

    2011-10-01

    Jalbert, Neath, Bireta, and Surprenant (2011) suggested that past demonstrations of the word length effect, the finding that words with fewer syllables are recalled better than words with more syllables, included a confound: The short words had more orthographic neighbors than the long words. The experiments reported here test two predictions that would follow if neighborhood size is a more important factor than word length. In Experiment 1, we found that concurrent articulation removed the effect of neighborhood size, just as it removes the effect of word length. Experiment 2 demonstrated that this pattern is also found with nonwords. For Experiment 3, we factorially manipulated length and neighborhood size, and found only effects of the latter. These results are problematic for any theory of memory that includes decay offset by rehearsal, but they are consistent with accounts that include a redintegrative stage that is susceptible to disruption by noise. The results also confirm the importance of lexical and linguistic factors on memory tasks thought to tap short-term memory.

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

  11. Keeping disease at arm's length

    DEFF Research Database (Denmark)

    Lassen, Aske Juul

    2015-01-01

    active ageing change everyday life with chronic disease, and how do older people combine an active life with a range of chronic diseases? The participants in the study use activities to keep their diseases at arm’s length, and this distancing of disease at the same time enables them to engage in social...... and physical activities at the activity centre. In this way, keeping disease at arm’s length is analysed as an ambiguous health strategy. The article shows the importance of looking into how active ageing is practised, as active ageing seems to work well in the everyday life of the older people by not giving...... emphasis to disease. The article is based on ethnographic fieldwork and uses vignettes of four participants to show how they each keep diseases at arm’s length....

  12. CEBAF Upgrade Bunch Length Measurements

    Energy Technology Data Exchange (ETDEWEB)

    Ahmad, Mahmoud [Old Dominion Univ., Norfolk, VA (United States)

    2016-05-01

    Many accelerators use short electron bunches and measuring the bunch length is important for efficient operations. CEBAF needs a suitable bunch length because bunches that are too long will result in beam interruption to the halls due to excessive energy spread and beam loss. In this work, bunch length is measured by invasive and non-invasive techniques at different beam energies. Two new measurement techniques have been commissioned; a harmonic cavity showed good results compared to expectations from simulation, and a real time interferometer is commissioned and first checkouts were performed. Three other techniques were used for measurements and comparison purposes without modifying the old procedures. Two of them can be used when the beam is not compressed longitudinally while the other one, the synchrotron light monitor, can be used with compressed or uncompressed beam.

  13. Kondo length in bosonic lattices

    Science.gov (United States)

    Giuliano, Domenico; Sodano, Pasquale; Trombettoni, Andrea

    2017-09-01

    Motivated by the fact that the low-energy properties of the Kondo model can be effectively simulated in spin chains, we study the realization of the effect with bond impurities in ultracold bosonic lattices at half filling. After presenting a discussion of the effective theory and of the mapping of the bosonic chain onto a lattice spin Hamiltonian, we provide estimates for the Kondo length as a function of the parameters of the bosonic model. We point out that the Kondo length can be extracted from the integrated real-space correlation functions, which are experimentally accessible quantities in experiments with cold atoms.

  14. Summary of neutron scattering lengths

    International Nuclear Information System (INIS)

    Koester, L.

    1981-12-01

    All available neutron-nuclei scattering lengths are collected together with their error bars in a uniform way. Bound scattering lengths are given for the elements, the isotopes, and the various spin-states. They are discussed in the sense of their use as basic parameters for many investigations in the field of nuclear and solid state physics. The data bank is available on magnetic tape, too. Recommended values and a map of these data serve for an uncomplicated use of these quantities. (orig.)

  15. Overview of bunch length measurements

    International Nuclear Information System (INIS)

    Lumpkin, A. H.

    1999-01-01

    An overview of particle and photon beam bunch length measurements is presented in the context of free-electron laser (FEL) challenges. Particle-beam peak current is a critical factor in obtaining adequate FEL gain for both oscillators and self-amplified spontaneous emission (SASE) devices. Since measurement of charge is a standard measurement, the bunch length becomes the key issue for ultrashort bunches. Both time-domain and frequency-domain techniques are presented in the context of using electromagnetic radiation over eight orders of magnitude in wavelength. In addition, the measurement of microbunching in a micropulse is addressed

  16. Markov chain aggregation and its applications to combinatorial reaction networks.

    Science.gov (United States)

    Ganguly, Arnab; Petrov, Tatjana; Koeppl, Heinz

    2014-09-01

    We consider a continuous-time Markov chain (CTMC) whose state space is partitioned into aggregates, and each aggregate is assigned a probability measure. A sufficient condition for defining a CTMC over the aggregates is presented as a variant of weak lumpability, which also characterizes that the measure over the original process can be recovered from that of the aggregated one. We show how the applicability of de-aggregation depends on the initial distribution. The application section is devoted to illustrate how the developed theory aids in reducing CTMC models of biochemical systems particularly in connection to protein-protein interactions. We assume that the model is written by a biologist in form of site-graph-rewrite rules. Site-graph-rewrite rules compactly express that, often, only a local context of a protein (instead of a full molecular species) needs to be in a certain configuration in order to trigger a reaction event. This observation leads to suitable aggregate Markov chains with smaller state spaces, thereby providing sufficient reduction in computational complexity. This is further exemplified in two case studies: simple unbounded polymerization and early EGFR/insulin crosstalk.

  17. Diet, nutrition and telomere length.

    Science.gov (United States)

    Paul, Ligi

    2011-10-01

    The ends of human chromosomes are protected by DNA-protein complexes termed telomeres, which prevent the chromosomes from fusing with each other and from being recognized as a double-strand break by DNA repair proteins. Due to the incomplete replication of linear chromosomes by DNA polymerase, telomeric DNA shortens with repeated cell divisions until the telomeres reach a critical length, at which point the cells enter senescence. Telomere length is an indicator of biological aging, and dysfunction of telomeres is linked to age-related pathologies like cardiovascular disease, Parkinson disease, Alzheimer disease and cancer. Telomere length has been shown to be positively associated with nutritional status in human and animal studies. Various nutrients influence telomere length potentially through mechanisms that reflect their role in cellular functions including inflammation, oxidative stress, DNA integrity, DNA methylation and activity of telomerase, the enzyme that adds the telomeric repeats to the ends of the newly synthesized DNA. Copyright © 2011 Elsevier Inc. All rights reserved.

  18. Tube Length and Water Flow

    Directory of Open Access Journals (Sweden)

    Ben Ruktantichoke

    2011-06-01

    Full Text Available In this study water flowed through a straight horizontal plastic tube placed at the bottom of a large tank of water. The effect of changing the length of tubing on the velocity of flow was investigated. It was found that the Hagen-Poiseuille Equation is valid when the effect of water entering the tube is accounted for.

  19. Finite length Taylor Couette flow

    Science.gov (United States)

    Streett, C. L.; Hussaini, M. Y.

    1987-01-01

    Axisymmetric numerical solutions of the unsteady Navier-Stokes equations for flow between concentric rotating cylinders of finite length are obtained by a spectral collocation method. These representative results pertain to two-cell/one-cell exchange process, and are compared with recent experiments.

  20. Fuzzy extractors for continuous distributions

    OpenAIRE

    Buhan, I.R.; Doumen, J.M.; Hartel, Pieter H.; Veldhuis, Raymond N.J.

    2006-01-01

    We show that there is a direct relation between the maximum length of the keys extracted from biometric data and the error rates of the biometric system. The length of the bio-key depends on the amount of distinguishing information that can be extracted from the source data. This information can be used a-priori to evaluate the potential of the biometric data in the context of a specific cryptographic application. We model the biometric data more naturally as a continuous distribution and we ...

  1. Length of a Hanging Cable

    Directory of Open Access Journals (Sweden)

    Eric Costello

    2011-01-01

    Full Text Available The shape of a cable hanging under its own weight and uniform horizontal tension between two power poles is a catenary. The catenary is a curve which has an equation defined by a hyperbolic cosine function and a scaling factor. The scaling factor for power cables hanging under their own weight is equal to the horizontal tension on the cable divided by the weight of the cable. Both of these values are unknown for this problem. Newton's method was used to approximate the scaling factor and the arc length function to determine the length of the cable. A script was written using the Python programming language in order to quickly perform several iterations of Newton's method to get a good approximation for the scaling factor.

  2. Construction of Short-Length High-Rates LDPC Codes Using Difference Families

    Directory of Open Access Journals (Sweden)

    Deny Hamdani

    2010-10-01

    Full Text Available Low-density parity-check (LDPC code is linear-block error-correcting code defined by sparse parity-check matrix. It is decoded using the massage-passing algorithm, and in many cases, capable of outperforming turbo code. This paper presents a class of low-density parity-check (LDPC codes showing good performance with low encoding complexity. The code is constructed using difference families from  combinatorial design. The resulting code, which is designed to have short code length and high code rate, can be encoded with low complexity due to its quasi-cyclic structure, and performs well when it is iteratively decoded with the sum-product algorithm. These properties of LDPC code are quite suitable for applications in future wireless local area network.

  3. πK-scattering lengths

    International Nuclear Information System (INIS)

    Volkov, M.K.; Osipov, A.A.

    1983-01-01

    The msub(π)asub(0)sup(1/2)=0.1, msub(π)asub(0)sup(3/2)=-0.1, msub(π)asub(0)sup((-))=0.07, msub(π)sup(3)asub(1)sup(1/2)=0.018, msub(π)sup(3)asub(1)aup(3/2)=0.002, msub(π)sup(3)asub(1)sup((-))=0.0044, msub(π)sup(5)asub(2)sup(1/2)=2.4x10sup(-4) and msub(π)sup(5)asub(2)sup(3/2)=-1.2x10sup(-4) scattering lengths are calculated in the framework of the composite meson model which is based on four-quark interaction. The decay form factors of (rho, epsilon, S*) → 2π, (K tilde, K*) → Kπ are used. The q 2 -terms of the quark box diagrams are taken into account. It is shown that the q 2 -terms of the box diagrams give the main contribution to the s-wave scattering lengths. The diagrams with the intermediate vector mesons begin to play the essential role at calculation of the p- and d-wave scattering lengths

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

    Science.gov (United States)

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

    2017-09-26

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

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

    International Nuclear Information System (INIS)

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

    2011-01-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    1998-08-22

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

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

    Directory of Open Access Journals (Sweden)

    Fushing Hsieh

    2016-11-01

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

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

    Directory of Open Access Journals (Sweden)

    Claudia Coronnello

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

  9. A fast combinatorial enhancement technique for earthquake damage identification based on remote sensing image

    Science.gov (United States)

    Dou, Aixia; Wang, Xiaoqing; Ding, Xiang; Du, Zecheng

    2010-11-01

    On the basis of the study on the enhancement methods of remote sensing images obtained after several earthquakes, the paper designed a new and optimized image enhancement model which was implemented by combining different single methods. The patterns of elementary model units and combined types of model were defined. Based on the enhancement model database, the algorithm of combinatorial model was brought out via C++ programming. The combined model was tested by processing the aerial remote sensing images obtained after 1976 Tangshan earthquake. It was proved that the definition and implementation of combined enhancement model can efficiently improve the ability and flexibility of image enhancement algorithm.

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

    Science.gov (United States)

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

    2016-01-01

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

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

    Science.gov (United States)

    Rich, Joseph O; Budde, Cheryl L; McConeghey, Luke D; Cotterill, Ian C; Mozhaev, Vadim V; Singh, Sheo B; Goetz, Michael A; Zhao, Annie; Michels, Peter C; Khmelnitsky, Yuri L

    2009-06-01

    Combinatorial biocatalysis was applied to generate a diverse set of dihydroxymethylzearalenone analogs with modified ring structure. In one representative chemoenzymatic reaction sequence, dihydroxymethylzearalenone was first subjected to a unique enzyme-catalyzed oxidative ring opening reaction that creates two new carboxylic groups on the molecule. These groups served as reaction sites for further derivatization involving biocatalytic ring closure reactions with structurally diverse bifunctional reagents, including different diols and diamines. As a result, a library of cyclic bislactones and bislactams was created, with modified ring structures covering chemical space and structure activity relationships unattainable by conventional synthetic means.

  12. Solar proton exposure of an ICRU sphere within a complex structure Part I: Combinatorial geometry.

    Science.gov (United States)

    Wilson, John W; Slaba, Tony C; Badavi, Francis F; Reddell, Brandon D; Bahadori, Amir A

    2016-06-01

    The 3DHZETRN code, with improved neutron and light ion (Z≤2) transport procedures, was recently developed and compared to Monte Carlo (MC) simulations using simplified spherical geometries. It was shown that 3DHZETRN agrees with the MC codes to the extent they agree with each other. In the present report, the 3DHZETRN code is extended to enable analysis in general combinatorial geometry. A more complex shielding structure with internal parts surrounding a tissue sphere is considered and compared against MC simulations. It is shown that even in the more complex geometry, 3DHZETRN agrees well with the MC codes and maintains a high degree of computational efficiency. Published by Elsevier Ltd.

  13. Solar Proton Transport within an ICRU Sphere Surrounded by a Complex Shield: Combinatorial Geometry

    Science.gov (United States)

    Wilson, John W.; Slaba, Tony C.; Badavi, Francis F.; Reddell, Brandon D.; Bahadori, Amir A.

    2015-01-01

    The 3DHZETRN code, with improved neutron and light ion (Z (is) less than 2) transport procedures, was recently developed and compared to Monte Carlo (MC) simulations using simplified spherical geometries. It was shown that 3DHZETRN agrees with the MC codes to the extent they agree with each other. In the present report, the 3DHZETRN code is extended to enable analysis in general combinatorial geometry. A more complex shielding structure with internal parts surrounding a tissue sphere is considered and compared against MC simulations. It is shown that even in the more complex geometry, 3DHZETRN agrees well with the MC codes and maintains a high degree of computational efficiency.

  14. Perspective: Extremely fine tuning of doping enabled by combinatorial molecular-beam epitaxy

    Directory of Open Access Journals (Sweden)

    J. Wu

    2015-06-01

    Full Text Available Chemical doping provides an effective method to control the electric properties of complex oxides. However, the state-of-art accuracy in controlling doping is limited to about 1%. This hampers elucidation of the precise doping dependences of physical properties and phenomena of interest, such as quantum phase transitions. Using the combinatorial molecular beam epitaxy, we improve the accuracy in tuning the doping level by two orders of magnitude. We illustrate this novel method by two examples: a systematic investigation of the doping dependence of interface superconductivity, and a study of the competing ground states in the vicinity of the insulator-to-superconductor transition.

  15. Combinatorial theory of the semiclassical evaluation of transport moments II: Algorithmic approach for moment generating functions

    Energy Technology Data Exchange (ETDEWEB)

    Berkolaiko, G. [Department of Mathematics, Texas A and M University, College Station, Texas 77843-3368 (United States); Kuipers, J. [Institut für Theoretische Physik, Universität Regensburg, D-93040 Regensburg (Germany)

    2013-12-15

    Electronic transport through chaotic quantum dots exhibits universal behaviour which can be understood through the semiclassical approximation. Within the approximation, calculation of transport moments reduces to codifying classical correlations between scattering trajectories. These can be represented as ribbon graphs and we develop an algorithmic combinatorial method to generate all such graphs with a given genus. This provides an expansion of the linear transport moments for systems both with and without time reversal symmetry. The computational implementation is then able to progress several orders further than previous semiclassical formulae as well as those derived from an asymptotic expansion of random matrix results. The patterns observed also suggest a general form for the higher orders.

  16. Using animal models to overcome temporal, spatial and combinatorial challenges in HIV persistence research

    DEFF Research Database (Denmark)

    Denton, Paul W.; Søgaard, Ole Schmeltz; Tolstrup, Martin

    2016-01-01

    Research challenges associated with understanding HIV persistence during antiretroviral therapy can be categorized as temporal, spatial and combinatorial. Temporal research challenges relate to the timing of events during establishment and maintenance of HIV persistence. Spatial research challeng...... for directly addressing these research challenges. The aim of this manuscript is to provide a comprehensive review of these recent translational advances made in animal models of HIV persistence....... will improve our understanding of HIV persistence and move the field closer to achieving eradication of persistent HIV. Given that humanized mice and non-human primate HIV models permit rigorous control of experimental conditions, these models have been used extensively as in vivo research platforms...

  17. Capacity Allocation and Revenue Sharing in Airline Alliances: A Combinatorial Auction-Based Modeling

    Directory of Open Access Journals (Sweden)

    Ying-jing Gu

    2017-01-01

    Full Text Available This paper attempts to establish a framework to help airline alliances effectively allocate their seat capacity with the purpose of maximizing alliances’ revenue. By assuming the airline alliance as the auctioneer and seat capacity in an itinerary as lots, the combinatorial auction model is constructed to optimize the allocation of the seat, and the revenue sharing method is established to share revenue between partners by Vickrey-Clarke-Groves (VCG mechanism. The result of the numerical study shows that the seat capacity allocation is effective even without information exchanging completely and the twofold revenue shares method shows more excitation for the airlines.

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

    DEFF Research Database (Denmark)

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

    2009-01-01

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

  19. Program for generating tests for the detection of failures in combinatorial logic systems

    International Nuclear Information System (INIS)

    Mansour, Mounir

    1972-01-01

    A method for generating test sequences for detecting failures in combinatorial logic systems, is described. It relies on: the splitting of these systems into elements of NOR and NAND circuits, the propagation of the failure state from the input to the output. Test sequences generation is achieved in two steps: a first one called chaining during which are investigated the propagation paths of an input state able to show off failures, a second one called consistency during which the global state of the circuit related to this input configuration is held to the wanted state so that the propagation takes place. (author) [fr

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

    Energy Technology Data Exchange (ETDEWEB)

    Keller, Mitchel T.; Young, Stephen J.

    2017-09-07

    We develop combinatorial tools to study the realtionship between the Stanley depth of a monomial ideal I and the Stanley depth of its compliment S/I. Using these results we prove that if S is a polynomial ring with at most 5 indeterminates and I is a square-free monomial ideal, then the Stanley depth of I is strictly larger than the Stanley depth of S/I. Using a computer search, we extend the strict inequality to the case of polynomial rings with at most 7 indeterminates. This partially answers questinos asked by Proescu and Qureshi as well as Herzog.

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

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

    Science.gov (United States)

    Chang, Yi-Pin; Chu, Yen-Ho

    2014-05-16

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

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

    Science.gov (United States)

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

    2005-07-01

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

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

    International Nuclear Information System (INIS)

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

    1998-01-01

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

  5. Spontaneous Emission Enhancement at Finite-length Metal

    DEFF Research Database (Denmark)

    Filonenko, K.; Willatzen, Morten; Bordo, V.

    2013-01-01

    We study spontaneous emission enhancement of a two-level atomic emitter placed in a dielectric medium near a finite-length cylindrical metal nanowire. We calculate the dependence of the Purcell factor and the normalized decay rate to a continuous spectrum on the nanowire radius for several emitter...

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

    NARCIS (Netherlands)

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

    2017-01-01

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

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

    DEFF Research Database (Denmark)

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

    2013-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Daniel Khoshnoudirad

    2015-11-01

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

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

    Directory of Open Access Journals (Sweden)

    Yoichiro Ito

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

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

    Science.gov (United States)

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

    2017-10-01

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

  11. Electricity price forecast using Combinatorial Neural Network trained by a new stochastic search method

    International Nuclear Information System (INIS)

    Abedinia, O.; Amjady, N.; Shafie-khah, M.; Catalão, J.P.S.

    2015-01-01

    Highlights: • Presenting a Combinatorial Neural Network. • Suggesting a new stochastic search method. • Adapting the suggested method as a training mechanism. • Proposing a new forecast strategy. • Testing the proposed strategy on real-world electricity markets. - Abstract: Electricity price forecast is key information for successful operation of electricity market participants. However, the time series of electricity price has nonlinear, non-stationary and volatile behaviour and so its forecast method should have high learning capability to extract the complex input/output mapping function of electricity price. In this paper, a Combinatorial Neural Network (CNN) based forecasting engine is proposed to predict the future values of price data. The CNN-based forecasting engine is equipped with a new training mechanism for optimizing the weights of the CNN. This training mechanism is based on an efficient stochastic search method, which is a modified version of chemical reaction optimization algorithm, giving high learning ability to the CNN. The proposed price forecast strategy is tested on the real-world electricity markets of Pennsylvania–New Jersey–Maryland (PJM) and mainland Spain and its obtained results are extensively compared with the results obtained from several other forecast methods. These comparisons illustrate effectiveness of the proposed strategy.

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

    Directory of Open Access Journals (Sweden)

    Gary eMorgan

    2014-11-01

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

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

    Science.gov (United States)

    Latimer, Luke N; Dueber, John E

    2017-06-01

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

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

    Science.gov (United States)

    Kajiwara, Shota; Yamada, Ryosuke; Ogino, Hiroyasu

    2018-04-10

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

  15. Ranked solutions to a class of combinatorial optimizations - with applications in mass spectrometry based peptide sequencing

    Science.gov (United States)

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

    2006-03-01

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

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

  17. Evolution in quantum leaps: multiple combinatorial transfers of HPI and other genetic modules in Enterobacteriaceae.

    Directory of Open Access Journals (Sweden)

    Armand Paauw

    Full Text Available Horizontal gene transfer is a key step in the evolution of Enterobacteriaceae. By acquiring virulence determinants of foreign origin, commensals can evolve into pathogens. In Enterobacteriaceae, horizontal transfer of these virulence determinants is largely dependent on transfer by plasmids, phages, genomic islands (GIs and genomic modules (GMs. The High Pathogenicity Island (HPI is a GI encoding virulence genes that can be transferred between different Enterobacteriaceae. We investigated the HPI because it was present in an Enterobacter hormaechei outbreak strain (EHOS. Genome sequence analysis showed that the EHOS contained an integration site for mobile elements and harbored two GIs and three putative GMs, including a new variant of the HPI (HPI-ICEEh1. We demonstrate, for the first time, that combinatorial transfers of GIs and GMs between Enterobacter cloacae complex isolates must have occurred. Furthermore, the excision and circularization of several combinations of the GIs and GMs was demonstrated. Because of its flexibility, the multiple integration site of mobile DNA can be considered an integration hotspot (IHS that increases the genomic plasticity of the bacterium. Multiple combinatorial transfers of diverse combinations of the HPI and other genomic elements among Enterobacteriaceae may accelerate the generation of new pathogenic strains.

  18. Radical scavenging potentials of single and combinatorial herbal formulations in vitro

    Directory of Open Access Journals (Sweden)

    Okey A. Ojiako

    2016-04-01

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

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

    Science.gov (United States)

    Hartenfeller, Markus; Proschak, Ewgenij; Schüller, Andreas; Schneider, Gisbert

    2008-07-01

    We present a fast stochastic optimization algorithm for fragment-based molecular de novo design (COLIBREE, Combinatorial Library Breeding). The search strategy is based on a discrete version of particle swarm optimization. Molecules are represented by a scaffold, which remains constant during optimization, and variable linkers and side chains. Different linkers represent virtual chemical reactions. Side-chain building blocks were obtained from pseudo-retrosynthetic dissection of large compound databases. Here, ligand-based design was performed using chemically advanced template search (CATS) topological pharmacophore similarity to reference ligands as fitness function. A weighting scheme was included for particle swarm optimization-based molecular design, which permits the use of many reference ligands and allows for positive and negative design to be performed simultaneously. In a case study, the approach was applied to the de novo design of potential peroxisome proliferator-activated receptor subtype-selective agonists. The results demonstrate the ability of the technique to cope with large combinatorial chemistry spaces and its applicability to focused library design. The technique was able to perform exploitation of a known scheme and at the same time explorative search for novel ligands within the framework of a given molecular core structure. It thereby represents a practical solution for compound screening in the early hit and lead finding phase of a drug discovery project.

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

    Science.gov (United States)

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

    2008-04-24

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

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

    Science.gov (United States)

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

    2015-01-01

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

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

    Science.gov (United States)

    Sud, Manish; Fahy, Eoin; Subramaniam, Shankar

    2012-09-25

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

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

    Science.gov (United States)

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

    2017-07-01

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

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

    Science.gov (United States)

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

    2002-02-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    1996-04-01

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

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

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

    Science.gov (United States)

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

    2017-11-02

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

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

    International Nuclear Information System (INIS)

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

    2016-01-01

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

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

    Science.gov (United States)

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

    2007-01-01

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

  10. Combinatorial Libraries on Rigid Scaffolds: Solid Phase Synthesis of Variably Substituted Pyrazoles and Isoxazoles

    Directory of Open Access Journals (Sweden)

    Eduard R. Felder

    1997-01-01

    Full Text Available The synthesis of combinatorial compound libraries has become a powerful lead finding tool in modern drug discovery. The ability to synthesize rapidly, in high yield, new chemical entities with low molecular weight on a solid support has a recognized strategic relevance (“small molecule libraries”. We designed and validated a novel solid phase synthesis scheme, suitable to generate diversity on small heterocycles of the pyrazole and isoxazole type. Appropriate conditions were worked out for each reaction, and a variety of more or less reactive agents (building blocks was utilized for discrete conversions, in order to exploit the system’s breadth of applicability. Four sequential reaction steps were validated, including the loading of the support with an acetyl bearing moiety, a Claisen condensation, an a-alkylation and a cyclization of a b-diketone with monosubstituted hydrazines. In a second stage, the reaction sequence was applied in a split and mix approach, in order to prepare a combinatorial library built-up from 4 acetyl carboxylic acids (R1, 35 carboxylic esters (R2 and 41 hydrazines (R4 (and 1 hydroxylamine to yield a total of 11,760 compounds divided into 41 pyrazole sublibraries with 140 pairs of regioisomers and 1 isoxazole sublibrary of equal size.

  11. Tagging charm with decay lengths

    International Nuclear Information System (INIS)

    Reay, N.W.

    1982-01-01

    With much detail, the author of this selection discusses two experiments which use the same physics but in different ways to obtain one same goala background - free sample of charm decays. One of the major purposes of gaining this sample is to measure one lifetime for charmed particles and to locate new particles. Continuing to discuss the first experiment, the Fermilab Experiment + 531, the author describes its methods, philosophy and two unexpected effects of the experiment. He turns then to discuss the CERN NA-15 experiment, describing its methods, findings and difficulties. Concluding his discussion on a positive note, the author is hopeful for the plans to continue more experimentation

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

    Science.gov (United States)

    Lee, M L; Schneider, G

    2001-01-01

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

  13. Combinatorial Theory

    CERN Document Server

    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.

  14. Combinatorial microelectrochemistry

    International Nuclear Information System (INIS)

    Maerkle, Wolfgang; Speiser, Bernd

    2005-01-01

    Microelectrode steady-state voltammetry is used to monitor on-line the progress of preparative electrolyses. This allows to follow educt and product concentrations as a function of the advance of the electrolysis, end-point detection, calculation of the number of electrons transferred per molecule, and determination of diffusion coefficient ratios for redox couples. The technique is demonstrated by numerical simulation, experiments with mixtures of redox partners, electrolyses in macrocells, and miniaturized electrolyses in vials or the wells of microtiter plates

  15. Combinatorial algorithms

    CERN Document Server

    Hu, T C

    2002-01-01

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

  16. Combinatorial techniques

    CERN Document Server

    Sane, Sharad S

    2013-01-01

    This is a basic text on combinatorics that deals with all the three aspects of the discipline: tricks, techniques and theory, and attempts to blend them. The book has several distinctive features. Probability and random variables with their interconnections to permutations are discussed. The theme of parity has been specially included and it covers applications ranging from solving the Nim game to the quadratic reciprocity law. Chapters related to geometry include triangulations and Sperner's theorem, classification of regular polytopes, tilings and an introduction to the Eulcidean Ramsey theory. Material on group actions covers Sylow theory, automorphism groups and a classification of finite subgroups of orthogonal groups. All chapters have a large number of exercises with varying degrees of difficulty, ranging from material suitable for Mathematical Olympiads to research.

  17. Continuous carbon nanotube reinforced composites.

    Science.gov (United States)

    Ci, L; Suhr, J; Pushparaj, V; Zhang, X; Ajayan, P M

    2008-09-01

    Carbon nanotubes are considered short fibers, and polymer composites with nanotube fillers are always analogues of random, short fiber composites. The real structural carbon fiber composites, on the other hand, always contain carbon fiber reinforcements where fibers run continuously through the composite matrix. With the recent optimization in aligned nanotube growth, samples of nanotubes in macroscopic lengths have become available, and this allows the creation of composites that are similar to the continuous fiber composites with individual nanotubes running continuously through the composite body. This allows the proper utilization of the extreme high modulus and strength predicted for nanotubes in structural composites. Here, we fabricate such continuous nanotube polymer composites with continuous nanotube reinforcements and report that under compressive loadings, the nanotube composites can generate more than an order of magnitude improvement in the longitudinal modulus (up to 3,300%) as well as damping capability (up to 2,100%). It is also observed that composites with a random distribution of nanotubes of same length and similar filler fraction provide three times less effective reinforcement in composites.

  18. Isolation of scFv antibody fragments against HER2 and CEA tumor antigens from combinatorial antibody libraries derived from cancer patients.

    Science.gov (United States)

    Ayat, Hoda; Burrone, Oscar R; Sadghizadeh, Majid; Jahanzad, Eissa; Rastgou, Nasrin; Moghadasi, Sarrira; Arbabi, Mehdi

    2013-11-01

    Tumor cells expressing HER-2/neu and CEA antigens are potentially ideal targets for antibody-targeted therapy. In this study, two large human combinatorial libraries have been generated from the lymph nodes of breast cancer patients that express HER2 and CEA antigens in their tumors. These 'immune' libraries have been constructed in two different formats of scFv, differing in the length of the peptide linker connecting the two variable VH and VL domains. Libraries derived from these patients may contain a larger pool of anti-tumor antigen antibodies and are useful repertoire for isolating scFvs against any tumor markers. The results of this study showed that we were successful in obtaining human scFvs against HER-2/neu and CEA. For HER-2, cell-panning strategy was performed and resulted in two scFv binders that detected the complete HER-2 receptor on the cell membrane and internalized to the cells. Also, preliminary ELISA data showed that several anti-CEA scFv binders were isolated by panning. Copyright © 2013 The International Alliance for Biological Standardization. All rights reserved.

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

    DEFF Research Database (Denmark)

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

    2014-01-01

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

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

    Science.gov (United States)

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

    2014-10-01

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

  1. Two-dimensional combinatorial screening enables the bottom-up design of a microRNA-10b inhibitor.

    Science.gov (United States)

    Velagapudi, Sai Pradeep; Disney, Matthew D

    2014-03-21

    The RNA motifs that bind guanidinylated kanamycin A (G Kan A) and guanidinylated neomycin B (G Neo B) were identified via two-dimensional combinatorial screening (2DCS). The results of these studies enabled the "bottom-up" design of a small molecule inhibitor of oncogenic microRNA-10b.

  2. Reducing Length of Stay in Total Joint Arthroplasty Care.

    Science.gov (United States)

    Walters, Megan; Chambers, Monique C; Sayeed, Zain; Anoushiravani, Afshin A; El-Othmani, Mouhanad M; Saleh, Khaled J

    2016-10-01

    As health care reforms continue to improve quality of care, significant emphasis will be placed on evaluation of orthopedic patient outcomes. Total joint arthroplasty (TJA) has a proven track record of enhancing patient quality of life and are easily replicable. The outcomes of these procedures serve as a measure of health care initiative success. Specifically, length of stay, will be targeted as a marker of quality of surgical care delivered to TJA patients. Within this review, we will discuss preoperative and postoperative methods by which orthopedic surgeons may enhance TJA outcomes and effectively reduce length of stay. Copyright © 2016 Elsevier Inc. All rights reserved.

  3. Chemical theory and modelling through density across length scales

    International Nuclear Information System (INIS)

    Ghosh, Swapan K.

    2016-01-01

    One of the concepts that has played a major role in the conceptual as well as computational developments covering all the length scales of interest in a number of areas of chemistry, physics, chemical engineering and materials science is the concept of single-particle density. Density functional theory has been a versatile tool for the description of many-particle systems across length scales. Thus, in the microscopic length scale, an electron density based description has played a major role in providing a deeper understanding of chemical binding in atoms, molecules and solids. Density concept has been used in the form of single particle number density in the intermediate mesoscopic length scale to obtain an appropriate picture of the equilibrium and dynamical processes, dealing with a wide class of problems involving interfacial science and soft condensed matter. In the macroscopic length scale, however, matter is usually treated as a continuous medium and a description using local mass density, energy density and other related property density functions has been found to be quite appropriate. The basic ideas underlying the versatile uses of the concept of density in the theory and modelling of materials and phenomena, as visualized across length scales, along with selected illustrative applications to some recent areas of research on hydrogen energy, soft matter, nucleation phenomena, isotope separation, and separation of mixture in condensed phase, will form the subject matter of the talk. (author)

  4. Between strong continuity and almost continuity

    Directory of Open Access Journals (Sweden)

    J.K. Kohli

    2010-04-01

    Full Text Available As embodied in the title of the paper strong and weak variants of continuity that lie strictly between strong continuity of Levine and almost continuity due to Singal and Singal are considered. Basic properties of almost completely continuous functions (≡ R-maps and δ-continuous functions are studied. Direct and inverse transfer of topological properties under almost completely continuous functions and δ-continuous functions are investigated and their place in the hier- archy of variants of continuity that already exist in the literature is out- lined. The class of almost completely continuous functions lies strictly between the class of completely continuous functions studied by Arya and Gupta (Kyungpook Math. J. 14 (1974, 131-143 and δ-continuous functions defined by Noiri (J. Korean Math. Soc. 16, (1980, 161-166. The class of almost completely continuous functions properly contains each of the classes of (1 completely continuous functions, and (2 al- most perfectly continuous (≡ regular set connected functions defined by Dontchev, Ganster and Reilly (Indian J. Math. 41 (1999, 139-146 and further studied by Singh (Quaestiones Mathematicae 33(2(2010, 1–11 which in turn include all δ-perfectly continuous functions initi- ated by Kohli and Singh (Demonstratio Math. 42(1, (2009, 221-231 and so include all perfectly continuous functions introduced by Noiri (Indian J. Pure Appl. Math. 15(3 (1984, 241-250.

  5. Isolation of Osteosarcoma-Associated Human Antibodies from a Combinatorial Fab Phage Display Library

    Directory of Open Access Journals (Sweden)

    Carmela Dantas-Barbosa

    2009-01-01

    Full Text Available Osteosarcoma, a highly malignant disease, is the most common primary bone tumor and is frequently found in children and adolescents. In order to isolate antibodies against osteosarcoma antigens, a combinatorial osteosarcoma Fab library displayed on the surface of phages was used. After three rounds of selection on the surface of tumor cells, several osteosarcoma-reactive Fabs were detected. From these Fabs, five were better characterized, and despite having differences in their VH (heavy chain variable domain and Vκ (kappa chain variable domain regions, they all bound to a protein with the same molecular mass. Further analysis by cell ELISA and immunocytochemistry suggested that the Fabs recognize a membrane-associated tumor antigen expressed in higher amounts in neoplasic cells than in normal tissue. These results suggest that the human Fabs selected in this work are a valuable tool for the study of this neoplasia.

  6. A combinatorial interpretation of the $κ^{\\star}_{g}(n)$ coefficients

    DEFF Research Database (Denmark)

    Li, Thomas Jiaxian; M. Reidys, Christian

    2014-01-01

    Studying the virtual Euler characteristic of the moduli space of curves, Harer and Zagier compute the generating function $C_g(z)$ of unicellular maps of genus $g$. They furthermore identify coefficients, $\\kappa^{\\star}_{g}(n)$, which fully determine the series $C_g(z)$. The main result of this ......Studying the virtual Euler characteristic of the moduli space of curves, Harer and Zagier compute the generating function $C_g(z)$ of unicellular maps of genus $g$. They furthermore identify coefficients, $\\kappa^{\\star}_{g}(n)$, which fully determine the series $C_g(z)$. The main result...... of this paper is a combinatorial interpretation of $\\kappa^{\\star}_{g}(n)$. We show that these enumerate a class of unicellular maps, which correspond $1$-to-$2^{2g}$ to a specific type of trees, referred to as O-trees. We furthermore prove a two term recursion for $\\kappa^{\\star}_{g}(n)$ and that for any fixed...

  7. The generalized Pell (p, i)-numbers and their Binet formulas, combinatorial representations, sums

    Energy Technology Data Exchange (ETDEWEB)

    Kilic, Emrah [TOBB University of Economics and Technology, Mathematics Department, 06560 Sogutozu, Ankara (Turkey)], E-mail: ekilic@etu.edu.tr

    2009-05-30

    The theory of generalized Pell p-numbers was introduced by Stakhov and then have been studied by several authors. In this paper, we consider the usual Pell numbers and as similar to the Fibonacci p-numbers, we give fair generalization of the Pell numbers, which we call the generalized Pell (p, i)-numbers for 0 {<=} i {<=} p. First we give relationships between the generalized Pell (p, i)-numbers and give the generating matrices for these numbers. Also we derive the generalized Binet formulas, sums, combinatorial representations and generating function of the generalized Pell p-numbers. Also using matrix methods, we derive an explicit formula for the sums of the generalized Fibonacci p-numbers. Finally, we derive relationships between generalized Pell (p, i)-numbers and their sums and permanents of certain matrices.

  8. Extending double modulation: combinatorial rules for identifying the modulations necessary for determining elasticities in metabolic pathways.

    Science.gov (United States)

    Giersch, C; Cornish-Bowden, A

    1996-10-07

    The double modulation method for determining the elasticities of pathway enzymes, originally devised by Kacser & Burns (Biochem. Soc. Trans. 7, 1149-1160, 1979), is extended to pathways of complex topological structure, including branching and feedback loops. An explicit system of linear equations for the unknown elasticities is derived. The constraints imposed on this linear system imply that modulations of more than one enzyme are not necessarily independent. Simple combinatorial rules are described for identifying without using any algebra the set of independent modulations that allow the determination of the elasticities of any enzyme. By repeated application, the minimum numbers of modulations required to determine the elasticities of all enzymes of a given pathway can be determined. The procedure is illustrated with numerous examples.

  9. Application of visual basic in high-throughput mass spectrometry-directed purification of combinatorial libraries.

    Science.gov (United States)

    Li, B; Chan, E C Y

    2003-01-01

    We present an approach to customize the sample submission process for high-throughput purification (HTP) of combinatorial parallel libraries using preparative liquid chromatography electrospray ionization mass spectrometry. In this study, Visual Basic and Visual Basic for Applications programs were developed using Microsoft Visual Basic 6 and Microsoft Excel 2000, respectively. These programs are subsequently applied for the seamless electronic submission and handling of data for HTP. Functions were incorporated into these programs where medicinal chemists can perform on-line verification of the purification status and on-line retrieval of postpurification data. The application of these user friendly and cost effective programs in our HTP technology has greatly increased our work efficiency by reducing paper work and manual manipulation of data.

  10. The generalized Pell (p, i)-numbers and their Binet formulas, combinatorial representations, sums

    International Nuclear Information System (INIS)

    Kilic, Emrah

    2009-01-01

    The theory of generalized Pell p-numbers was introduced by Stakhov and then have been studied by several authors. In this paper, we consider the usual Pell numbers and as similar to the Fibonacci p-numbers, we give fair generalization of the Pell numbers, which we call the generalized Pell (p, i)-numbers for 0 ≤ i ≤ p. First we give relationships between the generalized Pell (p, i)-numbers and give the generating matrices for these numbers. Also we derive the generalized Binet formulas, sums, combinatorial representations and generating function of the generalized Pell p-numbers. Also using matrix methods, we derive an explicit formula for the sums of the generalized Fibonacci p-numbers. Finally, we derive relationships between generalized Pell (p, i)-numbers and their sums and permanents of certain matrices.

  11. Random Combinatorial Gradient Metasurface for Broadband, Wide-Angle and Polarization-Independent Diffusion Scattering.

    Science.gov (United States)

    Zhuang, Yaqiang; Wang, Guangming; Liang, Jiangang; Cai, Tong; Tang, Xiao-Lan; Guo, Tongfeng; Zhang, Qingfeng

    2017-11-29

    This paper proposes an easy, efficient strategy for designing broadband, wide-angle and polarization-independent diffusion metasurface for radar cross section (RCS) reduction. A dual-resonance unit cell, composed of a cross wire and cross loop (CWCL), is employed to enhance the phase bandwidth covering the 2π range. Both oblique-gradient and horizontal-gradient phase supercells are designed for illustration. The numerical results agree well with the theoretical ones. To significantly reduce backward scattering, the random combinatorial gradient metasurface (RCGM) is subsequently constructed by collecting eight supercells with randomly distributed gradient directions. The proposed metasurface features an enhanced specular RCS reduction performance and less design complexity compared to other candidates. Both simulated and measured results show that the proposed RCGM can significantly suppress RCS and exhibits broadband, wide-angle and polarization independence features.

  12. Combinatorial hexapeptide ligand libraries (ProteoMiner): an innovative fractionation tool for differential quantitative clinical proteomics.

    Science.gov (United States)

    Hartwig, Sonja; Czibere, Akos; Kotzka, Jorg; Passlack, Waltraud; Haas, Rainer; Eckel, Jürgen; Lehr, Stefan

    2009-07-01

    Blood serum samples are the major source for clinical proteomics approaches, which aim to identify diagnostically relevant or treatment-response related proteins. But, the presence of very high-abundance proteins and the enormous dynamic range of protein distribution hinders whole serum analysis. An innovative tool to overcome these limitations, utilizes combinatorial hexapeptide ligand libraries (ProteoMiner). Here, we demonstrate that ProteoMiner can be used for comparative and quantitative analysis of complex proteomes. We spiked serum samples with increasing amounts (3 microg to 300 microg) of whole E. coli lysate, processed it with ProteoMiner and performed quantitative analyses of 2D-gels. We found, that the concentration of the spiked bacteria proteome, reflected by the maintained proportional spot intensities, was not altered by ProteoMiner treatment. Therefore, we conclude that the ProteoMiner technology can be used for quantitative analysis of low abundant proteins in complex biological samples.

  13. Multi-line split DNA synthesis: a novel combinatorial method to make high quality peptide libraries

    Directory of Open Access Journals (Sweden)

    Ueno Shingo

    2004-09-01

    Full Text Available Abstract Background We developed a method to make a various high quality random peptide libraries for evolutionary protein engineering based on a combinatorial DNA synthesis. Results A split synthesis in codon units was performed with mixtures of bases optimally designed by using a Genetic Algorithm program. It required only standard DNA synthetic reagents and standard DNA synthesizers in three lines. This multi-line split DNA synthesis (MLSDS is simply realized by adding a mix-and-split process to normal DNA synthesis protocol. Superiority of MLSDS method over other methods was shown. We demonstrated the synthesis of oligonucleotide libraries with 1016 diversity, and the construction of a library with random sequence coding 120 amino acids containing few stop codons. Conclusions Owing to the flexibility of the MLSDS method, it will be able to design various "rational" libraries by using bioinformatics databases.

  14. Virtual screening of combinatorial library of novel benzenesulfonamides on mycobacterial carbonic anhydrase II

    Directory of Open Access Journals (Sweden)

    Dikant F.

    2016-12-01

    Full Text Available Combinatorial library of novel benzenesulfonamides was docked (Schrodinger Glide into mycobacterial carbonic anhydrase (mtCA II and human (hCA II isoforms with an aim to find drug candidates with selective activity on mtCA II. The predicted selectivity was calculated based on optimized MM-GBSA free energies for ligand enzyme interactions. Selectivity, LogP (o/w and interaction energy were used to calculate the selection index which determined the subset of best scoring molecules selected for further evaluation. Structure-activity relationship was found for fragment subsets, showing us the possible way regarding how to influence lipophilicity without affecting ligand-enzyme binding properties.

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

  16. Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization

    KAUST Repository

    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.

  17. Generation of a Multicomponent Library of Disulfide Donor-Acceptor Architectures Using Dynamic Combinatorial Chemistry.

    Science.gov (United States)

    Drożdż, Wojciech; Kołodziejski, Michał; Markiewicz, Grzegorz; Jenczak, Anna; Stefankiewicz, Artur R

    2015-07-17

    We describe here the generation of new donor-acceptor disulfide architectures obtained in aqueous solution at physiological pH. The application of a dynamic combinatorial chemistry approach allowed us to generate a large number of new disulfide macrocyclic architectures together with a new type of [2]catenanes consisting of four distinct components. Up to fifteen types of structurally-distinct dynamic architectures have been generated through one-pot disulfide exchange reactions between four thiol-functionalized aqueous components. The distribution of disulfide products formed was found to be strongly dependent on the structural features of the thiol components employed. This work not only constitutes a success in the synthesis of topologically- and morphologically-complex targets, but it may also open new horizons for the use of this methodology in the construction of molecular machines.

  18. Workshop on Strategic Behavior and Phase Transitions in Random and Complex Combinatorial Structures : Extended Abstracts

    CERN Document Server

    Kirousis, Lefteris; Ortiz-Gracia, Luis; Serna, Maria

    2017-01-01

    This book is divided into two parts, the first of which seeks to connect the phase transitions of various disciplines, including game theory, and to explore the synergies between statistical physics and combinatorics. Phase Transitions has been an active multidisciplinary field of research, bringing together physicists, computer scientists and mathematicians. The main research theme explores how atomic agents that act locally and microscopically lead to discontinuous macroscopic changes. Adopting this perspective has proven to be especially useful in studying the evolution of random and usually complex or large combinatorial objects (like networks or logic formulas) with respect to discontinuous changes in global parameters like connectivity, satisfiability etc. There is, of course, an obvious strategic element in the formation of a transition: the atomic agents “selfishly” seek to optimize a local parameter. However, up to now this game-theoretic aspect of abrupt, locally triggered changes had not been e...

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

  20. Fabrication of combinatorial nm-planar electrode array for high throughput evaluation of organic semiconductors

    International Nuclear Information System (INIS)

    Haemori, M.; Edura, T.; Tsutsui, K.; Itaka, K.; Wada, Y.; Koinuma, H.

    2006-01-01

    We have fabricated a combinatorial nm-planar electrode array by using photolithography and chemical mechanical polishing processes for high throughput electrical evaluation of organic devices. Sub-nm precision was achieved with respect to the average level difference between each pair of electrodes and a dielectric layer. The insulating property between the electrodes is high enough to measure I-V characteristics of organic semiconductors. Bottom-contact field-effect-transistors (FETs) of pentacene were fabricated on this electrode array by use of molecular beam epitaxy. It was demonstrated that the array could be used as a pre-patterned device substrate for high throughput screening of the electrical properties of organic semiconductors