Lectures on discrete geometry

CERN Document Server

2002-01-01

Discrete geometry investigates combinatorial properties of configurations of geometric objects. To a working mathematician or computer scientist, it offers sophisticated results and techniques of great diversity and it is a foundation for fields such as computational geometry or combinatorial optimization. This book is primarily a textbook introduction to various areas of discrete geometry. In each area, it explains several key results and methods, in an accessible and concrete manner. It also contains more advanced material in separate sections and thus it can serve as a collection of surveys in several narrower subfields. The main topics include: basics on convex sets, convex polytopes, and hyperplane arrangements; combinatorial complexity of geometric configurations; intersection patterns and transversals of convex sets; geometric Ramsey-type results; polyhedral combinatorics and high-dimensional convexity; and lastly, embeddings of finite metric spaces into normed spaces. Jiri Matousek is Professor of Com...

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

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.

Combinatorial geometry in the plane

CERN Document Server

Hadwiger, Hugo; Klee, Victor

2014-01-01

Geared toward advanced undergraduates familiar with analysis and college geometry, this concise book discusses theorems on topics restricted to the plane such as convexity, coverings, and graphs. In addition to helping students cultivate rigorous thought, the text encourages the development of mathematical intuition and clarifies the nature of mathematical research.The two-part treatment begins with specific topics including integral distances, covering problems, point set geometry and convexity, simple paradoxes involving point sets, and pure combinatorics, among other subjects. The second pa

Spectral dimension of quantum geometries

International Nuclear Information System (INIS)

Calcagni, Gianluca; Oriti, Daniele; Thürigen, Johannes

2014-01-01

The spectral dimension is an indicator of geometry and topology of spacetime and a tool to compare the description of quantum geometry in various approaches to quantum gravity. This is possible because it can be defined not only on smooth geometries but also on discrete (e.g., simplicial) ones. In this paper, we consider the spectral dimension of quantum states of spatial geometry defined on combinatorial complexes endowed with additional algebraic data: the kinematical quantum states of loop quantum gravity (LQG). Preliminarily, the effects of topology and discreteness of classical discrete geometries are studied in a systematic manner. We look for states reproducing the spectral dimension of a classical space in the appropriate regime. We also test the hypothesis that in LQG, as in other approaches, there is a scale dependence of the spectral dimension, which runs from the topological dimension at large scales to a smaller one at short distances. While our results do not give any strong support to this hypothesis, we can however pinpoint when the topological dimension is reproduced by LQG quantum states. Overall, by exploring the interplay of combinatorial, topological and geometrical effects, and by considering various kinds of quantum states such as coherent states and their superpositions, we find that the spectral dimension of discrete quantum geometries is more sensitive to the underlying combinatorial structures than to the details of the additional data associated with them. (paper)

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

CERN Document Server

Delucchi, Emanuele; Moci, Luca

2015-01-01

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

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

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.

Parameterized combinatorial geometry modeling in Moritz

International Nuclear Information System (INIS)

Van Riper, K.A.

2005-01-01

We describe the use of named variables as surface and solid body coefficients in the Moritz geometry editing program. Variables can also be used as material numbers, cell densities, and transformation values. A variable is defined as a constant or an arithmetic combination of constants and other variables. A variable reference, such as in a surface coefficient, can be a single variable or an expression containing variables and constants. Moritz can read and write geometry models in MCNP and ITS ACCEPT format; support for other codes will be added. The geometry can be saved with either the variables in place, for modifying the models in Moritz, or with the variables evaluated for use in the transport codes. A program window shows a list of variables and provides fields for editing them. Surface coefficients and other values that use a variable reference are shown in a distinctive style on object property dialogs; associated buttons show fields for editing the reference. We discuss our use of variables in defining geometry models for shielding studies in PET clinics. When a model is parameterized through the use of variables, changes such as room dimensions, shielding layer widths, and cell compositions can be quickly achieved by changing a few numbers without requiring knowledge of the input syntax for the transport code or the tedious and error prone work of recalculating many surface or solid body coefficients. (author)

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

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

Discrete quantum geometries and their effective dimension

International Nuclear Information System (INIS)

Thuerigen, Johannes

2015-01-01

In several approaches towards a quantum theory of gravity, such as group field theory and loop quantum gravity, quantum states and histories of the geometric degrees of freedom turn out to be based on discrete spacetime. The most pressing issue is then how the smooth geometries of general relativity, expressed in terms of suitable geometric observables, arise from such discrete quantum geometries in some semiclassical and continuum limit. In this thesis I tackle the question of suitable observables focusing on the effective dimension of discrete quantum geometries. For this purpose I give a purely combinatorial description of the discrete structures which these geometries have support on. As a side topic, this allows to present an extension of group field theory to cover the combinatorially larger kinematical state space of loop quantum gravity. Moreover, I introduce a discrete calculus for fields on such fundamentally discrete geometries with a particular focus on the Laplacian. This permits to define the effective-dimension observables for quantum geometries. Analysing various classes of quantum geometries, I find as a general result that the spectral dimension is more sensitive to the underlying combinatorial structure than to the details of the additional geometric data thereon. Semiclassical states in loop quantum gravity approximate the classical geometries they are peaking on rather well and there are no indications for stronger quantum effects. On the other hand, in the context of a more general model of states which are superposition over a large number of complexes, based on analytic solutions, there is a flow of the spectral dimension from the topological dimension d on low energy scales to a real number between 0 and d on high energy scales. In the particular case of 1 these results allow to understand the quantum geometry as effectively fractal.

Enhancements to the Combinatorial Geometry Particle Tracker in the Mercury Monte Carlo Transport Code: Embedded Meshes and Domain Decomposition

International Nuclear Information System (INIS)

Greenman, G.M.; O'Brien, M.J.; Procassini, R.J.; Joy, K.I.

2009-01-01

Two enhancements to the combinatorial geometry (CG) particle tracker in the Mercury Monte Carlo transport code are presented. The first enhancement is a hybrid particle tracker wherein a mesh region is embedded within a CG region. This method permits efficient calculations of problems with contain both large-scale heterogeneous and homogeneous regions. The second enhancement relates to the addition of parallelism within the CG tracker via spatial domain decomposition. This permits calculations of problems with a large degree of geometric complexity, which are not possible through particle parallelism alone. In this method, the cells are decomposed across processors and a particles is communicated to an adjacent processor when it tracks to an interprocessor boundary. Applications that demonstrate the efficacy of these new methods are presented

Semiclassical quantum gravity: statistics of combinatorial Riemannian geometries

International Nuclear Information System (INIS)

Bombelli, L.; Corichi, A.; Winkler, O.

2005-01-01

This paper is a contribution to the development of a framework, to be used in the context of semiclassical canonical quantum gravity, in which to frame questions about the correspondence between discrete spacetime structures at ''quantum scales'' and continuum, classical geometries at large scales. Such a correspondence can be meaningfully established when one has a ''semiclassical'' state in the underlying quantum gravity theory, and the uncertainties in the correspondence arise both from quantum fluctuations in this state and from the kinematical procedure of matching a smooth geometry to a discrete one. We focus on the latter type of uncertainty, and suggest the use of statistical geometry as a way to quantify it. With a cell complex as an example of discrete structure, we discuss how to construct quantities that define a smooth geometry, and how to estimate the associated uncertainties. We also comment briefly on how to combine our results with uncertainties in the underlying quantum state, and on their use when considering phenomenological aspects of quantum gravity. (Abstract Copyright [2005], Wiley Periodicals, Inc.)

Architectural geometry

KAUST Repository

Pottmann, Helmut

2014-11-26

Around 2005 it became apparent in the geometry processing community that freeform architecture contains many problems of a geometric nature to be solved, and many opportunities for optimization which however require geometric understanding. This area of research, which has been called architectural geometry, meanwhile contains a great wealth of individual contributions which are relevant in various fields. For mathematicians, the relation to discrete differential geometry is significant, in particular the integrable system viewpoint. Besides, new application contexts have become available for quite some old-established concepts. Regarding graphics and geometry processing, architectural geometry yields interesting new questions but also new objects, e.g. replacing meshes by other combinatorial arrangements. Numerical optimization plays a major role but in itself would be powerless without geometric understanding. Summing up, architectural geometry has become a rewarding field of study. We here survey the main directions which have been pursued, we show real projects where geometric considerations have played a role, and we outline open problems which we think are significant for the future development of both theory and practice of architectural geometry.

Architectural geometry

KAUST Repository

Pottmann, Helmut; Eigensatz, Michael; Vaxman, Amir; Wallner, Johannes

2014-01-01

Around 2005 it became apparent in the geometry processing community that freeform architecture contains many problems of a geometric nature to be solved, and many opportunities for optimization which however require geometric understanding. This area of research, which has been called architectural geometry, meanwhile contains a great wealth of individual contributions which are relevant in various fields. For mathematicians, the relation to discrete differential geometry is significant, in particular the integrable system viewpoint. Besides, new application contexts have become available for quite some old-established concepts. Regarding graphics and geometry processing, architectural geometry yields interesting new questions but also new objects, e.g. replacing meshes by other combinatorial arrangements. Numerical optimization plays a major role but in itself would be powerless without geometric understanding. Summing up, architectural geometry has become a rewarding field of study. We here survey the main directions which have been pursued, we show real projects where geometric considerations have played a role, and we outline open problems which we think are significant for the future development of both theory and practice of architectural geometry.

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

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

Laplacians on discrete and quantum geometries

International Nuclear Information System (INIS)

Calcagni, Gianluca; Oriti, Daniele; Thürigen, Johannes

2013-01-01

We extend discrete calculus for arbitrary (p-form) fields on embedded lattices to abstract discrete geometries based on combinatorial complexes. We then provide a general definition of discrete Laplacian using both the primal cellular complex and its combinatorial dual. The precise implementation of geometric volume factors is not unique and, comparing the definition with a circumcentric and a barycentric dual, we argue that the latter is, in general, more appropriate because it induces a Laplacian with more desirable properties. We give the expression of the discrete Laplacian in several different sets of geometric variables, suitable for computations in different quantum gravity formalisms. Furthermore, we investigate the possibility of transforming from position to momentum space for scalar fields, thus setting the stage for the calculation of heat kernel and spectral dimension in discrete quantum geometries. (paper)

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.

Graphical debugging of combinational geometry

International Nuclear Information System (INIS)

Burns, T.J.; Smith, M.S.

1992-01-01

A graphical debugger for combinatorial geometry being developed at Oak Ridge National Laboratory is described. The prototype 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

SABRINA, Geometry Plot Program for MCNP

International Nuclear Information System (INIS)

SEIDL, Marcus

2003-01-01

1 - Description of program or function: SABRINA is an interactive, three-dimensional, geometry-modeling code system, primarily for use with CCC-200/MCNP. SABRINA's capabilities include creation, visualization, and verification of three-dimensional geometries specified by either surface- or body-base combinatorial geometry; display of particle tracks are calculated by MCNP; and volume fraction generation. 2 - Method of solution: Rendering is performed by ray tracing or an edge and intersection algorithm. Volume fraction calculations are made by ray tracing. 3 - Restrictions on the complexity of the problem: A graphics display with X Window capability is required

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.

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

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

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…

Ruler of the plane - Games of geometry

NARCIS (Netherlands)

Beekhuis, S.; Buchin, K.; Castermans, T.; Hurks, T.; Sonke, W.; Aronov, B.; Katz, M.J.

2017-01-01

Ruler of the Plane is a set of games illustrating concepts from combinatorial and computational geometry. The games are based on the art gallery problem, ham-sandwich cuts, the Voronoi game, and geometric network connectivity problems like the Euclidean minimum spanning tree and traveling

Introduction to tropical geometry

CERN Document Server

Maclagan, Diane

2015-01-01

Tropical geometry is a combinatorial shadow of algebraic geometry, offering new polyhedral tools to compute invariants of algebraic varieties. It is based on tropical algebra, where the sum of two numbers is their minimum and the product is their sum. This turns polynomials into piecewise-linear functions, and their zero sets into polyhedral complexes. These tropical varieties retain a surprising amount of information about their classical counterparts. Tropical geometry is a young subject that has undergone a rapid development since the beginning of the 21st century. While establishing itself as an area in its own right, deep connections have been made to many branches of pure and applied mathematics. This book offers a self-contained introduction to tropical geometry, suitable as a course text for beginning graduate students. Proofs are provided for the main results, such as the Fundamental Theorem and the Structure Theorem. Numerous examples and explicit computations illustrate the main concepts. Each of t...

Solar Proton Transport Within an ICRU Sphere Surrounded by a Complex Shield: Ray-trace Geometry

Science.gov (United States)

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

2015-01-01

A computationally efficient 3DHZETRN code with enhanced neutron and light ion (Z is less than or equal to 2) propagation was recently developed for complex, inhomogeneous shield geometry described by combinatorial objects. Comparisons were made between 3DHZETRN results and Monte Carlo (MC) simulations at locations within the combinatorial geometry, and 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 ray-trace geometry. This latest extension enables the code to be used within current engineering design practices utilizing fully detailed vehicle and habitat geometries. Through convergence testing, it is shown that fidelity in an actual shield geometry can be maintained in the discrete ray-trace description by systematically increasing the number of discrete rays used. It is also shown that this fidelity is carried into transport procedures and resulting exposure quantities without sacrificing computational efficiency.

Solar proton exposure of an ICRU sphere within a complex structure part II: Ray-trace geometry.

Science.gov (United States)

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

2016-06-01

A computationally efficient 3DHZETRN code with enhanced neutron and light ion (Z ≤ 2) propagation was recently developed for complex, inhomogeneous shield geometry described by combinatorial objects. Comparisons were made between 3DHZETRN results and Monte Carlo (MC) simulations at locations within the combinatorial geometry, and 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 ray-trace geometry. This latest extension enables the code to be used within current engineering design practices utilizing fully detailed vehicle and habitat geometries. Through convergence testing, it is shown that fidelity in an actual shield geometry can be maintained in the discrete ray-trace description by systematically increasing the number of discrete rays used. It is also shown that this fidelity is carried into transport procedures and resulting exposure quantities without sacrificing computational efficiency. Published by Elsevier Ltd.

Combinatorial commutative algebra

CERN Document Server

Miller, Ezra

2005-01-01

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

Dynamic combinatorial chemistry

NARCIS (Netherlands)

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

2002-01-01

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

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

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

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.

The Cherenkov correlated timing detector: materials, geometry and timing constraints

International Nuclear Information System (INIS)

Aronstein, D.; Bergfeld, T.; Horton, D.; Palmer, M.; Selen, M.; Thayer, G.; Boyer, V.; Honscheid, K.; Kichimi, H.; Sugaya, Y.; Yamaguchi, H.; Yoshimura, Y.; Kanda, S.; Olsen, S.; Ueno, K.; Tamura, N.; Yoshimura, K.; Lu, C.; Marlow, D.; Mindas, C.; Prebys, E.; Pomianowski, P.

1996-01-01

The key parameters of Cherenkov correlated timing (CCT) detectors are discussed. Measurements of radiator geometry, optical properties of radiator and coupling materials, and photon detector timing performance are presented. (orig.)

Interactions between Digital Geometry and Combinatorics on Words

Directory of Open Access Journals (Sweden)

Srečko Brlek

2011-08-01

Full Text Available We review some recent results in digital geometry obtained by using a combinatorics on words approach to discrete geometry. Motivated on the one hand by the well-known theory of Sturmian words which model conveniently discrete lines in the plane, and on the other hand by the development of digital geometry, this study reveals strong links between the two fields. Discrete figures are identified with polyominoes encoded by words. The combinatorial tools lead to elegant descriptions of geometrical features and efficient algorithms. Among these, radix-trees are useful for efficiently detecting path intersection, Lyndon and Christoffel words appear as the main tools for describing digital convexity; equations on words allow to better understand tilings by translations.

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

Configuration spaces geometry, topology and representation theory

CERN Document Server

Cohen, Frederick; Concini, Corrado; Feichtner, Eva; Gaiffi, Giovanni; Salvetti, Mario

2016-01-01

This book collects the scientific contributions of a group of leading experts who took part in the INdAM Meeting held in Cortona in September 2014. With combinatorial techniques as the central theme, it focuses on recent developments in configuration spaces from various perspectives. It also discusses their applications in areas ranging from representation theory, toric geometry and geometric group theory to applied algebraic topology.

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.

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

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.

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

International Nuclear Information System (INIS)

Itoh, Yoshiaki

2009-01-01

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

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

Interacting particle systems in time-dependent geometries

Science.gov (United States)

Ali, A.; Ball, R. C.; Grosskinsky, S.; Somfai, E.

2013-09-01

Many complex structures and stochastic patterns emerge from simple kinetic rules and local interactions, and are governed by scale invariance properties in combination with effects of the global geometry. We consider systems that can be described effectively by space-time trajectories of interacting particles, such as domain boundaries in two-dimensional growth or river networks. We study trajectories embedded in time-dependent geometries, and the main focus is on uniformly expanding or decreasing domains for which we obtain an exact mapping to simple fixed domain systems while preserving the local scale invariance properties. This approach was recently introduced in Ali et al (2013 Phys. Rev. E 87 020102(R)) and here we provide a detailed discussion on its applicability for self-affine Markovian models, and how it can be adapted to self-affine models with memory or explicit time dependence. The mapping corresponds to a nonlinear time transformation which converges to a finite value for a large class of trajectories, enabling an exact analysis of asymptotic properties in expanding domains. We further provide a detailed discussion of different particle interactions and generalized geometries. All our findings are based on exact computations and are illustrated numerically for various examples, including Lévy processes and fractional Brownian motion.

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

Statistical geometry and space-time

International Nuclear Information System (INIS)

Grauert, H.

1976-01-01

In this paper I try to construct a mathematical tool by which the full structure of Lorentz geometry to space time can be given, but beyond that the background - to speak pictorially - the subsoil for electromagnetic and matter waves, too. The tool could be useful to describe the connections between various particles, electromagnetism and gravity and to compute observables which were not theoretically related, up to now. Moreover, the tool is simpler than the Riemann tensor: it consists just of a set S of line segments in space time, briefly speaking. (orig.) [de

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

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.

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

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

Grassmannian geometry of scattering amplitudes

CERN Document Server

Arkani-Hamed, Nima; Cachazo, Freddy; Goncharov, Alexander; Postnikov, Alexander; Trnka, Jaroslav

2016-01-01

Outlining a revolutionary reformulation of the foundations of perturbative quantum field theory, this book is a self-contained and authoritative analysis of the application of this new formulation to the case of planar, maximally supersymmetric Yang–Mills theory. The book begins by deriving connections between scattering amplitudes and Grassmannian geometry from first principles before introducing novel physical and mathematical ideas in a systematic manner accessible to both physicists and mathematicians. The principle players in this process are on-shell functions which are closely related to certain sub-strata of Grassmannian manifolds called positroids - in terms of which the classification of on-shell functions and their relations becomes combinatorially manifest. This is an essential introduction to the geometry and combinatorics of the positroid stratification of the Grassmannian and an ideal text for advanced students and researchers working in the areas of field theory, high energy physics, and the...

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.

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.

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.

Geometry Helps to Compare Persistence Diagrams

Energy Technology Data Exchange (ETDEWEB)

Kerber, Michael; Morozov, Dmitriy; Nigmetov, Arnur

2015-11-16

Exploiting geometric structure to improve the asymptotic complexity of discrete assignment problems is a well-studied subject. In contrast, the practical advantages of using geometry for such problems have not been explored. We implement geometric variants of the Hopcroft--Karp algorithm for bottleneck matching (based on previous work by Efrat el al.), and of the auction algorithm by Bertsekas for Wasserstein distance computation. Both implementations use k-d trees to replace a linear scan with a geometric proximity query. Our interest in this problem stems from the desire to compute distances between persistence diagrams, a problem that comes up frequently in topological data analysis. We show that our geometric matching algorithms lead to a substantial performance gain, both in running time and in memory consumption, over their purely combinatorial counterparts. Moreover, our implementation significantly outperforms the only other implementation available for comparing persistence diagrams.

Dynamic combinatorial libraries : new opportunities in systems chemistry

NARCIS (Netherlands)

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

2011-01-01

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

Boltzmann Oracle for Combinatorial Systems

OpenAIRE

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

2008-01-01

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

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.

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

Groups and Geometries : Siena Conference

CERN Document Server

Kantor, William; Lunardon, Guglielmo; Pasini, Antonio; Tamburini, Maria

1998-01-01

On September 1-7, 1996 a conference on Groups and Geometries took place in lovely Siena, Italy. It brought together experts and interested mathematicians from numerous countries. The scientific program centered around invited exposi­ tory lectures; there also were shorter research announcements, including talks by younger researchers. The conference concerned a broad range of topics in group theory and geometry, with emphasis on recent results and open problems. Special attention was drawn to the interplay between group-theoretic methods and geometric and combinatorial ones. Expanded versions of many of the talks appear in these Proceedings. This volume is intended to provide a stimulating collection of themes for a broad range of algebraists and geometers. Among those themes, represented within the conference or these Proceedings, are aspects of the following: 1. the classification of finite simple groups, 2. the structure and properties of groups of Lie type over finite and algebraically closed fields of f...

Combinatorial optimization on a Boltzmann machine

NARCIS (Netherlands)

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

1989-01-01

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

Combinatorial synthesis of natural products

DEFF Research Database (Denmark)

Nielsen, John

2002-01-01

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

Tumor-targeting peptides from combinatorial libraries*

Science.gov (United States)

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

2018-01-01

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

Empirical intrinsic geometry for nonlinear modeling and time series filtering.

Science.gov (United States)

Talmon, Ronen; Coifman, Ronald R

2013-07-30

In this paper, we present a method for time series analysis based on empirical intrinsic geometry (EIG). EIG enables one to reveal the low-dimensional parametric manifold as well as to infer the underlying dynamics of high-dimensional time series. By incorporating concepts of information geometry, this method extends existing geometric analysis tools to support stochastic settings and parametrizes the geometry of empirical distributions. However, the statistical models are not required as priors; hence, EIG may be applied to a wide range of real signals without existing definitive models. We show that the inferred model is noise-resilient and invariant under different observation and instrumental modalities. In addition, we show that it can be extended efficiently to newly acquired measurements in a sequential manner. These two advantages enable us to revisit the Bayesian approach and incorporate empirical dynamics and intrinsic geometry into a nonlinear filtering framework. We show applications to nonlinear and non-Gaussian tracking problems as well as to acoustic signal localization.

Neural Meta-Memes Framework for Combinatorial Optimization

Science.gov (United States)

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

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

Number systems and combinatorial problems

OpenAIRE

Yordzhev, Krasimir

2014-01-01

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

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

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.

Asessing for Structural Understanding in Childrens' Combinatorial Problem Solving.

Science.gov (United States)

English, Lyn

1999-01-01

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

Dynamic combinatorial chemistry with diselenides and disulfides in water

DEFF Research Database (Denmark)

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

2014-01-01

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

Fourier analysis in combinatorial number theory

International Nuclear Information System (INIS)

Shkredov, Il'ya D

2010-01-01

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

Fourier analysis in combinatorial number theory

Energy Technology Data Exchange (ETDEWEB)

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

2010-09-16

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

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

DEFF Research Database (Denmark)

Nielsen, John; Jensen, Flemming R.

1997-01-01

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

Local formulae for combinatorial Pontryagin classes

International Nuclear Information System (INIS)

Gaifullin, Alexander A

2004-01-01

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

Heterogenous phase as a mean in combinatorial chemistry

International Nuclear Information System (INIS)

Abdel-Hamid, S.G.

2007-01-01

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

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

Movable geometry and eigenvalue search capability in the MC21 Monte Carlo code

International Nuclear Information System (INIS)

Gill, D. F.; Nease, B. R.; Griesheimer, D. P.

2013-01-01

A description of a robust and flexible movable geometry implementation in the Monte Carlo code MC21 is described along with a search algorithm that can be used in conjunction with the movable geometry capability to perform eigenvalue searches based on the position of some geometric component. The natural use of the combined movement and search capability is searching to critical through variation of control rod (or control drum) position. The movable geometry discussion provides the mathematical framework for moving surfaces in the MC21 combinatorial solid geometry description. A discussion of the interface between the movable geometry system and the user is also described, particularly the ability to create a hierarchy of movable groups. Combined with the hierarchical geometry description in MC21 the movable group framework provides a very powerful system for inline geometry modification. The eigenvalue search algorithm implemented in MC21 is also described. The foundations of this algorithm are a regula falsi search though several considerations are made in an effort to increase the efficiency of the algorithm for use with Monte Carlo. Specifically, criteria are developed to determine after each batch whether the Monte Carlo calculation should be continued, the search iteration can be rejected, or the search iteration has converged. These criteria seek to minimize the amount of time spent per iteration. Results for the regula falsi method are shown, illustrating that the method as implemented is indeed convergent and that the optimizations made ultimately reduce the total computational expense. (authors)

Movable geometry and eigenvalue search capability in the MC21 Monte Carlo code

Energy Technology Data Exchange (ETDEWEB)

Gill, D. F.; Nease, B. R.; Griesheimer, D. P. [Bettis Atomic Power Laboratory, PO Box 79, West Mifflin, PA 15122 (United States)

2013-07-01

A description of a robust and flexible movable geometry implementation in the Monte Carlo code MC21 is described along with a search algorithm that can be used in conjunction with the movable geometry capability to perform eigenvalue searches based on the position of some geometric component. The natural use of the combined movement and search capability is searching to critical through variation of control rod (or control drum) position. The movable geometry discussion provides the mathematical framework for moving surfaces in the MC21 combinatorial solid geometry description. A discussion of the interface between the movable geometry system and the user is also described, particularly the ability to create a hierarchy of movable groups. Combined with the hierarchical geometry description in MC21 the movable group framework provides a very powerful system for inline geometry modification. The eigenvalue search algorithm implemented in MC21 is also described. The foundations of this algorithm are a regula falsi search though several considerations are made in an effort to increase the efficiency of the algorithm for use with Monte Carlo. Specifically, criteria are developed to determine after each batch whether the Monte Carlo calculation should be continued, the search iteration can be rejected, or the search iteration has converged. These criteria seek to minimize the amount of time spent per iteration. Results for the regula falsi method are shown, illustrating that the method as implemented is indeed convergent and that the optimizations made ultimately reduce the total computational expense. (authors)

Toward Chemical Implementation of Encoded Combinatorial Libraries

DEFF Research Database (Denmark)

Nielsen, John; Janda, Kim D.

1994-01-01

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

A New Approach for Proving or Generating Combinatorial Identities

Science.gov (United States)

Gonzalez, Luis

2010-01-01

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

Quantum mechanical energy-based screening of combinatorially generated library of tautomers. TauTGen: a tautomer generator program.

Science.gov (United States)

Harańczyk, Maciej; Gutowski, Maciej

2007-01-01

We describe a procedure of finding low-energy tautomers of a molecule. The procedure consists of (i) combinatorial generation of a library of tautomers, (ii) screening based on the results of geometry optimization of initial structures performed at the density functional level of theory, and (iii) final refinement of geometry for the top hits at the second-order Möller-Plesset level of theory followed by single-point energy calculations at the coupled cluster level of theory with single, double, and perturbative triple excitations. The library of initial structures of various tautomers is generated with TauTGen, a tautomer generator program. The procedure proved to be successful for these molecular systems for which common chemical knowledge had not been sufficient to predict the most stable structures.

Sums over geometries and improvements on the mean field approximation

International Nuclear Information System (INIS)

Sacksteder, Vincent E. IV

2007-01-01

The saddle points of a Lagrangian due to Efetov are analyzed. This Lagrangian was originally proposed as a tool for calculating systematic corrections to the Bethe approximation, a mean-field approximation which is important in statistical mechanics, glasses, coding theory, and combinatorial optimization. Detailed analysis shows that the trivial saddle point generates a sum over geometries reminiscent of dynamically triangulated quantum gravity, which suggests new possibilities to design sums over geometries for the specific purpose of obtaining improved mean-field approximations to D-dimensional theories. In the case of the Efetov theory, the dominant geometries are locally treelike, and the sum over geometries diverges in a way that is similar to quantum gravity's divergence when all topologies are included. Expertise from the field of dynamically triangulated quantum gravity about sums over geometries may be able to remedy these defects and fulfill the Efetov theory's original promise. The other saddle points of the Efetov Lagrangian are also analyzed; the Hessian at these points is nonnormal and pseudo-Hermitian, which is unusual for bosonic theories. The standard formula for Gaussian integrals is generalized to nonnormal kernels

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.

Analysis and design of algorithms for combinatorial problems

CERN Document Server

Ausiello, G

1985-01-01

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

Bifurcation-based approach reveals synergism and optimal combinatorial perturbation.

Science.gov (United States)

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

2016-06-01

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

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

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.

Jack superpolynomials: physical and combinatorial definitions

International Nuclear Information System (INIS)

Desrosiers, P.; Mathieu, P.; Lapointe, L.

2004-01-01

Jack superpolynomials are eigenfunctions of the supersymmetric extension of the quantum trigonometric Calogero-Moser-Sutherland Hamiltonian. They are orthogonal with respect to the scalar product, dubbed physical, that is naturally induced by this quantum-mechanical problem. But Jack superpolynomials can also be defined more combinatorially, starting from the multiplicative bases of symmetric superpolynomials, enforcing orthogonality with respect to a one-parameter deformation of the combinatorial scalar product. Both constructions turn out to be equivalent. (author)

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

Biogeography-based combinatorial strategy for efficient autonomous underwater vehicle motion planning and task-time management

Science.gov (United States)

Zadeh, S. M.; Powers, D. M. W.; Sammut, K.; Yazdani, A. M.

2016-12-01

Autonomous Underwater Vehicles (AUVs) are capable of spending long periods of time for carrying out various underwater missions and marine tasks. In this paper, a novel conflict-free motion planning framework is introduced to enhance underwater vehicle's mission performance by completing maximum number of highest priority tasks in a limited time through a large scale waypoint cluttered operating field, and ensuring safe deployment during the mission. The proposed combinatorial route-path planner model takes the advantages of the Biogeography-Based Optimization (BBO) algorithm toward satisfying objectives of both higher-lower level motion planners and guarantees maximization of the mission productivity for a single vehicle operation. The performance of the model is investigated under different scenarios including the particular cost constraints in time-varying operating fields. To show the reliability of the proposed model, performance of each motion planner assessed separately and then statistical analysis is undertaken to evaluate the total performance of the entire model. The simulation results indicate the stability of the contributed model and its feasible application for real experiments.

Combinatorial matrix theory

CERN Document Server

Mitjana, Margarida

2018-01-01

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

Combinatorial identities for tenth order mock theta functions

Indian Academy of Sciences (India)

44

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

MONTE CARLO ANALYSES OF THE YALINA THERMAL FACILITY WITH SERPENT STEREOLITHOGRAPHY GEOMETRY MODEL

Energy Technology Data Exchange (ETDEWEB)

Talamo, A.; Gohar, Y.

2015-01-01

This paper analyzes the YALINA Thermal subcritical assembly of Belarus using two different Monte Carlo transport programs, SERPENT and MCNP. The MCNP model is based on combinatorial geometry and universes hierarchy, while the SERPENT model is based on Stereolithography geometry. The latter consists of unstructured triangulated surfaces defined by the normal and vertices. This geometry format is used by 3D printers and it has been created by: the CUBIT software, MATLAB scripts, and C coding. All the Monte Carlo simulations have been performed using the ENDF/B-VII.0 nuclear data library. Both MCNP and SERPENT share the same geometry specifications, which describe the facility details without using any material homogenization. Three different configurations have been studied with different number of fuel rods. The three fuel configurations use 216, 245, or 280 fuel rods, respectively. The numerical simulations show that the agreement between SERPENT and MCNP results is within few tens of pcms.

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.

On the combinatorial foundations of Regge-calculus

International Nuclear Information System (INIS)

Budach, L.

1989-01-01

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

Combinatorial Speculations and the Combinatorial Conjecture for Mathematics

OpenAIRE

Mao, Linfan

2006-01-01

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

Manipulating Combinatorial Structures.

Science.gov (United States)

Labelle, Gilbert

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

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.

Some experience of shielding calculations by combinatorial method

International Nuclear Information System (INIS)

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

1996-01-01

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

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

DEFF Research Database (Denmark)

Nielsen, John; Jensen, Flemming R.

1997-01-01

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

Development of GIFT-PC: the software with multi-drawing functions of three dimensional geometries

International Nuclear Information System (INIS)

Tsuda, Shuichi; Yamaguchi, Yasuhiro

2001-05-01

The Combinatorial Geometry (CG) is a general-purpose geometry package used on radiation transport simulation codes. It is quite useful to illustrate the CG geometries on a simulation code because the visible information of the CG geometries used in a calculation can avoid some mistakes in the case of complicated data, and make it easier to understand the calculation models in the case of presentations. GIFT code (Geographic Information For Target) hsa been developed at Ballistic Research Laboratory, US, for the purpose of illustrating the components of a target from any point of view, calculating a projected area or volume and checking the correctness of the geometry description. Using the drawing functions of GIFT code, perspective or isometric views of a target can be obtained from various points of view. The present report describes the overview of GIFT code and the development of GIFT-PC. GIFT-PC, based on GIFT code, has been developed for easier drawings of three-dimensional geometries using the GUI (Graphical User Interface) system of personal computers, and can be used in various fields as a useful drawing tool for CG geometries. (author)

Accessing Specific Peptide Recognition by Combinatorial Chemistry

DEFF Research Database (Denmark)

Li, Ming

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

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

SAM-CE, Time-Dependent 3-D Neutron Transport, Gamma Transport in Complex Geometry by Monte-Carlo

International Nuclear Information System (INIS)

2003-01-01

1 - Nature of physical problem solved: The SAM-CE system comprises two Monte Carlo codes, SAM-F and SAM-A. SAM-F supersedes the forward Monte Carlo code, SAM-C. SAM-A is an adjoint Monte Carlo code designed to calculate the response due to fields of primary and secondary gamma radiation. The SAM-CE system is a FORTRAN Monte Carlo computer code designed to solve the time-dependent neutron and gamma-ray transport equations in complex three-dimensional geometries. SAM-CE is applicable for forward neutron calculations and for forward as well as adjoint primary gamma-ray calculations. In addition, SAM-CE is applicable for the gamma-ray stage of the coupled neutron-secondary gamma ray problem, which may be solved in either the forward or the adjoint mode. Time-dependent fluxes, and flux functionals such as dose, heating, count rates, etc., are calculated as functions of energy, time and position. Multiple scoring regions are permitted and these may be either finite volume regions or point detectors or both. Other scores of interest, e.g., collision and absorption densities, etc., are also made. 2 - Method of solution: A special feature of SAM-CE is its use of the 'combinatorial geometry' technique which affords the user geometric capabilities exceeding those available with other commonly used geometric packages. All nuclear interaction cross section data (derived from the ENDF for neutrons and from the UNC-format library for gamma-rays) are tabulated in point energy meshes. The energy meshes for neutrons are internally derived, based on built-in convergence criteria and user- supplied tolerances. Tabulated neutron data for each distinct nuclide are in unique and appropriate energy meshes. Both resolved and unresolved resonance parameters from ENDF data files are treated automatically, and extremely precise and detailed descriptions of cross section behaviour is permitted. Such treatment avoids the ambiguities usually associated with multi-group codes, which use flux

Immune-Stimulating Combinatorial Therapy for Prostate Cancer

Science.gov (United States)

2016-10-01

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

On the Cut-off Point for Combinatorial Group Testing

DEFF Research Database (Denmark)

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

1999-01-01

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

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

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

Infinitary Combinatory Reduction Systems

DEFF Research Database (Denmark)

Ketema, Jeroen; Simonsen, Jakob Grue

2011-01-01

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

Combinatorial Libraries of Bis-Heterocyclic Compounds with Skeletal Diversity

OpenAIRE

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

2008-01-01

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

Combinatorial Quantum Field Theory and Gluing Formula for Determinants

NARCIS (Netherlands)

Reshetikhin, N.; Vertman, B.

2015-01-01

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

Combinatorial Libraries of Bis-Heterocyclic Compounds with Skeletal Diversity

Science.gov (United States)

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

2009-01-01

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

Combinatorial Cis-regulation in Saccharomyces Species

Directory of Open Access Journals (Sweden)

Aaron T. Spivak

2016-03-01

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

Conferences on Combinatorial and Additive Number Theory

CERN Document Server

2014-01-01

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

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

Science.gov (United States)

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

2008-11-11

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

Cosmological solutions and finite time singularities in Finslerian geometry

Science.gov (United States)

Paul, Nupur; de, S. S.; Rahaman, Farook

2018-03-01

We consider a very general scenario of our universe where its geometry is characterized by the Finslerian structure on the underlying spacetime manifold, a generalization of the Riemannian geometry. Now considering a general energy-momentum tensor for matter sector, we derive the gravitational field equations in such spacetime. Further, to depict the cosmological dynamics in such spacetime proposing an interesting equation of state identified by a sole parameter γ which for isotropic limit is simply the barotropic equation of state p = (γ ‑ 1)ρ (γ ∈ ℝ being the barotropic index), we solve the background dynamics. The dynamics offers several possibilities depending on this sole parameter as follows: (i) only an exponential expansion, or (ii) a finite time past singularity (big bang) with late accelerating phase, or (iii) a nonsingular universe exhibiting an accelerating scenario at late time which finally predicts a big rip type singularity. We also discuss several energy conditions and the possibility of cosmic bounce. Finally, we establish the first law of thermodynamics in such spacetime.

Simultaneous Disulfide and Boronic Acid Ester Exchange in Dynamic Combinatorial Libraries

Directory of Open Access Journals (Sweden)

Sanna L. Diemer

2015-09-01

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

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

Science.gov (United States)

Li, Jianwei; Nowak, Piotr; Otto, Sijbren

2013-06-26

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

Combinatorial Micro-Macro Dynamical Systems

OpenAIRE

Diaz, Rafael; Villamarin, Sergio

2015-01-01

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

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

Flag varieties an interplay of geometry, combinatorics, and representation theory

CERN Document Server

Lakshmibai, V

2009-01-01

Flag varieties are important geometric objects and their study involves an interplay of geometry, combinatorics, and representation theory. This book is detailed account of this interplay. In the area of representation theory, the book presents a discussion of complex semisimple Lie algebras and of semisimple algebraic groups; in addition, the representation theory of symmetric groups is also discussed. In the area of algebraic geometry, the book gives a detailed account of the Grassmannian varieties, flag varieties, and their Schubert subvarieties. Because of the connections with root systems, many of the geometric results admit elegant combinatorial description, a typical example being the description of the singular locus of a Schubert variety. This is shown to be a consequence of standard monomial theory (abbreviated SMT). Thus the book includes SMT and some important applications - singular loci of Schubert varieties, toric degenerations of Schubert varieties, and the relationship between Schubert variet...

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

Geometry of the Universe

International Nuclear Information System (INIS)

Gurevich, L.Eh.; Gliner, Eh.B.

1978-01-01

Problems of investigating the Universe space-time geometry are described on a popular level. Immediate space-time geometries, corresponding to three cosmologic models are considered. Space-time geometry of a closed model is the spherical Riemann geonetry, of an open model - is the Lobachevskij geometry; and of a plane model - is the Euclidean geometry. The Universe real geometry in the contemporary epoch of development is based on the data testifying to the fact that the Universe is infinitely expanding

The algebraic approach to space-time geometry

International Nuclear Information System (INIS)

Heller, M.; Multarzynski, P.; Sasin, W.

1989-01-01

A differential manifold can be defined in terms of smooth real functions carried by it. By rejecting the postulate, in such a definition, demanding the local diffeomorphism of a manifold to the Euclidean space, one obtains the so-called differential space concept. Every subset of R n turns out to be a differential space. Extensive parts of differential geometry on differential spaces, developed by Sikorski, are reviewed and adapted to relativistic purposes. Differential space as a new model of space-time is proposed. The Lorentz structure and Einstein's field equations on differential spaces are discussed. 20 refs. (author)

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

Space-Time Geometry of Quark and Strange Quark Matter

Institute of Scientific and Technical Information of China (English)

无

2007-01-01

We study quark and strange quark matter in the context of general relativity. For this purpose, we solve Einstein's field equations for quark and strange quark matter in spherical symmetric space-times. We analyze strange quark matter for the different equations of state (EOS) in the spherical symmetric space-times, thus we are able to obtain the space-time geometries of quark and strange quark matter. Also, we discuss die features of the obtained solutions. The obtained solutions are consistent with the results of Brookhaven Laboratory, i.e. the quark-gluon plasma has a vanishing shear (i.e. quark-gluon plasma is perfect).

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.

Enabling high performance computational science through combinatorial algorithms

International Nuclear Information System (INIS)

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

2007-01-01

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

Enabling high performance computational science through combinatorial algorithms

Energy Technology Data Exchange (ETDEWEB)

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

2007-07-15

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

Combinatorial Mathematics: Research into Practice

Science.gov (United States)

Sriraman, Bharath; English, Lyn D.

2004-01-01

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

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

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

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.

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)

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.

Topological network entanglement as order parameter for the emergence of geometry

International Nuclear Information System (INIS)

Diamantini, M Cristina; Trugenberger, Carlo A

2017-01-01

We show that, in discrete models of quantum gravity, emergent geometric space can be viewed as the entanglement pattern in a mixed quantum state of the ‘universe’, characterized by a universal topological network entanglement. As a concrete example we analyze the recently proposed model in which geometry emerges due to the condensation of 4-cycles in random regular bipartite graphs, driven by the combinatorial Ollivier–Ricci curvature. Using this model we show that the emergence of geometric order decreases the entanglement entropy of random configurations. The lowest geometric entanglement entropy is realized in four dimensions. (paper)

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.

Check and visualization of input geometry data using the geometrical module of the Monte Carlo code MCU: WWER-440 pressure vessel dosimetry benchmarks

International Nuclear Information System (INIS)

Gurevich, M.; Zaritsky, S.; Osmera, B.; Mikus, J.

1997-01-01

The Monte Carlo method gives the opportunity to conduct the calculations of neutron and photon flux without any simplifications of the 3-D geometry of the nuclear power and experimental devices. So, each graduated Monte Carlo code includes the combinatorial geometry module and tools for the geometry description giving a possibility to describe very complex systems with a number of hierarchy levels of the geometrical objects. Such codes as usual have special modules for the visual checking of geometry input information. These geometry opportunities could be used for all cases when the accurate 3-D description of the complex geometry becomes a necessity. The description (specification) of benchmark experiments is one of the such cases. Such accurate and uniform description detects all mistakes and ambiguities in the starting information of various kinds (drawings, reports etc.). Usually the quality of different parts of the starting information (generally produced by different persons during the different stages of the device elaboration and operation) is different. After using the above mentioned modules and tools, the resultant geometry description can be used as a standard for this device. One can automatically produce any type of the device figure. The detail geometry description can be used as input for different calculation models carrying out (not only for Monte Carlo). The application of that method to the description of the WWER-440 mock-ups is represented in the report. The mock-ups were created on the reactor LR-O (NRI) and the reactor vessel dosimetry benchmarks were developed on the basis of these mock-up experiments. The NCG-8 module of the Russian Monte Carlo code MCU was used. It is the combinatorial multilingual universal geometrical module. The MCU code was certified by Russian Nuclear Regulatory Body. Almost all figures for mentioned benchmarks specifications were made by the MCU visualization code. The problem of the automatic generation of the

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.

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.

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

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

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

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

Combinatorial auctions for electronic business

Indian Academy of Sciences (India)

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

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

Combinatorial Proofs and Algebraic Proofs

Indian Academy of Sciences (India)

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

Effects of generation time on spray aerosol transport and deposition in models of the mouth-throat geometry.

Science.gov (United States)

Worth Longest, P; Hindle, Michael; Das Choudhuri, Suparna

2009-06-01

For most newly developed spray aerosol inhalers, the generation time is a potentially important variable that can be fully controlled. The objective of this study was to determine the effects of spray aerosol generation time on transport and deposition in a standard induction port (IP) and more realistic mouth-throat (MT) geometry. Capillary aerosol generation (CAG) was selected as a representative system in which spray momentum was expected to significantly impact deposition. Sectional and total depositions in the IP and MT geometries were assessed at a constant CAG flow rate of 25 mg/sec for aerosol generation times of 1, 2, and 4 sec using both in vitro experiments and a previously developed computational fluid dynamics (CFD) model. Both the in vitro and numerical results indicated that extending the generation time of the spray aerosol, delivered at a constant mass flow rate, significantly reduced deposition in the IP and more realistic MT geometry. Specifically, increasing the generation time of the CAG system from 1 to 4 sec reduced the deposition fraction in the IP and MT geometries by approximately 60 and 33%, respectively. Furthermore, the CFD predictions of deposition fraction were found to be in good agreement with the in vitro results for all times considered in both the IP and MT geometries. The numerical results indicated that the reduction in deposition fraction over time was associated with temporal dissipation of what was termed the spray aerosol "burst effect." Based on these results, increasing the spray aerosol generation time, at a constant mass flow rate, may be an effective strategy for reducing deposition in the standard IP and in more realistic MT geometries.

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

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.

Combinatorial algebra syntax and semantics

CERN Document Server

Sapir, Mark V

2014-01-01

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

Combinatorial methods for advanced materials research and development

Energy Technology Data Exchange (ETDEWEB)

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

2001-10-01

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

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…

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

A new evolutionary algorithm with LQV learning for combinatorial problems optimization

International Nuclear Information System (INIS)

Machado, Marcelo Dornellas; Schirru, Roberto

2000-01-01

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

Enumeration of Combinatorial Classes of Single Variable Complex Polynomial Vector Fields

DEFF Research Database (Denmark)

Dias, Kealey

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

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

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.

Moritz enhancements for visualization of complicated geometry models

International Nuclear Information System (INIS)

Van Riper, K. A.

2009-01-01

We describe new features implemented in the Moritz geometry editing and visualization program to enhance the accuracy and efficiency of viewing complex geometry models. The 3D display is based on OpenGL and requires conversion of the combinatorial surface and solid body geometry used by MCNP and other transport codes to a set of polygons. Calculation of those polygons can take many minutes for complex models. Once calculated, the polygons can be saved to a file and reused when the same or a derivative model is loaded; the file can be read and processed in under a second. A cell can be filled with a collection of other cells constituting a universe. A new option bypasses use of the filled cell's boundaries when calculating the polygons for the filling universe. This option, when applicable, speeds processing, improves the 3D image, and permits reuse of the universe's polygons when other cells are filled with transformed instances of the universe. Surfaces and solid bodies used in a cell description must be converted to polygons before calculating the polygonal representation of a cell; this conversion requires truncation of infinite surfaces. A new method for truncating transformed surfaces ensures the finite surface intersects the entire model. When a surface or solid body is processed in a cell description, an optional test detects when that object does not contribute additional polygons; if so, that object May be extraneous for the cell description. (authors)

Combinatorial vector fields and the valley structure of fitness landscapes.

Science.gov (United States)

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

2010-12-01

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

Logging to Facilitate Combinatorial System Testing

NARCIS (Netherlands)

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

2014-01-01

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

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

International Nuclear Information System (INIS)

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

2004-01-01

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

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.

The combinatorial derivation

Directory of Open Access Journals (Sweden)

Igor V. Protasov

2013-09-01

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

Dynamic Combinatorial Chemistry

DEFF Research Database (Denmark)

Lisbjerg, Micke

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

The geometry of on-shell diagrams

Science.gov (United States)

Franco, Sebastián; Galloni, Daniele; Mariotti, Alberto

2014-08-01

The fundamental role of on-shell diagrams in quantum field theory has been recently recognized. On-shell diagrams, or equivalently bipartite graphs, provide a natural bridge connecting gauge theory to powerful mathematical structures such as the Grassmannian. We perform a detailed investigation of the combinatorial and geometric objects associated to these graphs. We mainly focus on their relation to polytopes and toric geometry, the Grassmannian and its stratification. Our work extends the current understanding of these connections along several important fronts, most notably eliminating restrictions imposed by planarity, positivity, reducibility and edge removability. We illustrate our ideas with several explicit examples and introduce concrete methods that considerably simplify computations. We consider it highly likely that the structures unveiled in this article will arise in the on-shell study of scattering amplitudes beyond the planar limit. Our results can be conversely regarded as an expansion in the understanding of the Grassmannian in terms of bipartite graphs.

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

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

Directory of Open Access Journals (Sweden)

Adel Tabchy

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

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

Science.gov (United States)

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

2013-01-01

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

Geometry of time-spaces non-commutative algebraic geometry, applied to quantum theory

CERN Document Server

Landau, Olav Arnfinn

2011-01-01

This is a monograph about non-commutative algebraic geometry, and its application to physics. The main mathematical inputs are the non-commutative deformation theory, moduli theory of representations of associative algebras, a new non-commutative theory o

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

Science.gov (United States)

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

DNA-Encoded Dynamic Combinatorial Chemical Libraries.

Science.gov (United States)

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

2015-06-26

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

Motivation for Using Generalized Geometry in the Time Dependent Transport Code TDKENO

Energy Technology Data Exchange (ETDEWEB)

Dustin Popp; Zander Mausolff; Sedat Goluoglu

2016-04-01

We are proposing to use the code, TDKENO, to model TREAT. TDKENO solves the time dependent, three dimensional Boltzmann transport equation with explicit representation of delayed neutrons. Instead of directly integrating this equation, the neutron flux is factored into two components – a rapidly varying amplitude equation and a slowly varying shape equation and each is solved separately on different time scales. The shape equation is solved using the 3D Monte Carlo transport code KENO, from Oak Ridge National Laboratory’s SCALE code package. Using the Monte Carlo method to solve the shape equation is still computationally intensive, but the operation is only performed when needed. The amplitude equation is solved deterministically and frequently, so the solution gives an accurate time-dependent solution without having to repeatedly We have modified TDKENO to incorporate KENO-VI so that we may accurately represent the geometries within TREAT. This paper explains the motivation behind using generalized geometry, and provides the results of our modifications. TDKENO uses the Improved Quasi-Static method to accomplish this. In this method, the neutron flux is factored into two components. One component is a purely time-dependent and rapidly varying amplitude function, which is solved deterministically and very frequently (small time steps). The other is a slowly varying flux shape function that weakly depends on time and is only solved when needed (significantly larger time steps).

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.

Founding Gravitation in 4D Euclidean Space-Time Geometry

International Nuclear Information System (INIS)

Winkler, Franz-Guenter

2010-01-01

The Euclidean interpretation of special relativity which has been suggested by the author is a formulation of special relativity in ordinary 4D Euclidean space-time geometry. The natural and geometrically intuitive generalization of this view involves variations of the speed of light (depending on location and direction) and a Euclidean principle of general covariance. In this article, a gravitation model by Jan Broekaert, which implements a view of relativity theory in the spirit of Lorentz and Poincare, is reconstructed and shown to fulfill the principles of the Euclidean approach after an appropriate reinterpretation.

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

Energy Technology Data Exchange (ETDEWEB)

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

2012-06-30

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

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

International Nuclear Information System (INIS)

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

2012-01-01

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

Laguerre-type derivatives: Dobinski relations and combinatorial identities

International Nuclear Information System (INIS)

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

2009-01-01

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

Distributing the computation in combinatorial optimization experiments over the cloud

OpenAIRE

Mario Brcic; Nikica Hlupic; Nenad Katanic

2017-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2010-10-15

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

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

GRAVE: An Interactive Geometry Construction and Visualization Software System for the TORT Nuclear Radiation Transport Code

International Nuclear Information System (INIS)

Blakeman, E.D.

2000-01-01

A software system, GRAVE (Geometry Rendering and Visual Editor), has been developed at the Oak Ridge National Laboratory (ORNL) to perform interactive visualization and development of models used as input to the TORT three-dimensional discrete ordinates radiation transport code. Three-dimensional and two-dimensional visualization displays are included. Display capabilities include image rotation, zoom, translation, wire-frame and translucent display, geometry cuts and slices, and display of individual component bodies and material zones. The geometry can be interactively edited and saved in TORT input file format. This system is an advancement over the current, non-interactive, two-dimensional display software. GRAVE is programmed in the Java programming language and can be implemented on a variety of computer platforms. Three- dimensional visualization is enabled through the Visualization Toolkit (VTK), a free-ware C++ software library developed for geometric and data visual display. Future plans include an extension of the system to read inputs using binary zone maps and combinatorial geometry models containing curved surfaces, such as those used for Monte Carlo code inputs. Also GRAVE will be extended to geometry visualization/editing for the DORT two-dimensional transport code and will be integrated into a single GUI-based system for all of the ORNL discrete ordinates transport codes

Combinatorial reasoning an introduction to the art of counting

CERN Document Server

DeTemple, Duane

2014-01-01

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

Combinatorial interpretations of particular evaluations of complete and elementary symmetric functions

OpenAIRE

Mongelli, Pietro

2011-01-01

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

Gian-Carlos Rota and Combinatorial Math.

Science.gov (United States)

Kolata, Gina Bari

1979-01-01

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

A Model of Students' Combinatorial Thinking

Science.gov (United States)

Lockwood, Elise

2013-01-01

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

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

International Nuclear Information System (INIS)

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

2009-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2009-05-15

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

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.

Performance evaluation of novel LaBr3(Ce) scintillator geometries for fast-timing applications

International Nuclear Information System (INIS)

Vedia, V.; Carmona-Gallardo, M.; Fraile, L.M.; Mach, H.; Udías, J.M.

2017-01-01

We evaluate the performance of two LaBr 3 (Ce) crystals that were produced with special geometries, aimed at enhancing the scintillation light collection and thus the time resolution. Their design was motivated by the construction of high-performance fast-timing arrays like the FAst TIMing array for DESPEC (FATIMA), which demands a high packing factor in addition to good time and energy resolutions. Energy resolution and efficiency were measured using standard calibration sources. Timing measurements were performed at 60 Co and 22 Na γ-energies against a fast BaF 2 reference detector. The time resolution was optimized by the choice of the photomultiplier bias voltage and the fine tuning of the constant fraction discriminator parameters. Monte Carlo simulations using the Geant4 toolkit were performed in order to achieve a better understanding of how the new geometries affect the light transport and thus the performance of the crystals. It is found that the conical-shaped LaBr 3 (Ce) crystals are optimal for fast-timing applications and for the construction of arrays such as FATIMA.

Summation on the basis of combinatorial representation of equal powers

Directory of Open Access Journals (Sweden)

Alexander I. Nikonov

2016-03-01

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

View Discovery in OLAP Databases through Statistical Combinatorial Optimization

Energy Technology Data Exchange (ETDEWEB)

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

2009-05-01

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

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

Science.gov (United States)

Staver, John R.; Harty, Harold

1979-01-01

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

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

Space–time and spatial geodesic orbits in Schwarzschild geometry

Science.gov (United States)

Resca, Lorenzo

2018-05-01

Geodesic orbit equations in the Schwarzschild geometry of general relativity reduce to ordinary conic sections of Newtonian mechanics and gravity for material particles in the non-relativistic limit. On the contrary, geodesic orbit equations for a proper spatial submanifold of Schwarzschild metric at any given coordinate-time correspond to an unphysical gravitational repulsion in the non-relativistic limit. This demonstrates at a basic level the centrality and critical role of relativistic time and its intimate pseudo-Riemannian connection with space. Correspondingly, a commonly popularised depiction of geodesic orbits of planets as resulting from the curvature of space produced by the Sun, represented as a rubber sheet dipped in the middle by the weighing of that massive body, is mistaken and misleading for the essence of relativity, even in the non-relativistic limit.

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.

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.

Physics in a general length space-time geometry: Call for experimental revision of the light speed anisotropy

OpenAIRE

Exirifard, Qasem

2013-01-01

We present a phenomenological model for the nature in the Finsler and Randers space-time geometries. We show that the parity-odd light speed anisotropy perpendicular to the gravitational equipotential surfaces encodes the deviation from the Riemann geometry toward the Randers geometry. We utilize an asymmetrical ring resonator and propose a setup in order to directly measure this deviation. We address the constraints that the current technology will impose on the deviation should the anisotro...

PIPERIDINE OLIGOMERS AND COMBINATORIAL LIBRARIES THEREOF

DEFF Research Database (Denmark)

1999-01-01

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

Three Syntactic Theories for Combinatory Graph Reduction

DEFF Research Database (Denmark)

Danvy, Olivier; Zerny, Ian

2011-01-01

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

Three Syntactic Theories for Combinatory Graph Reduction

DEFF Research Database (Denmark)

Danvy, Olivier; Zerny, Ian

2013-01-01

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

Quantum fields and processes a combinatorial approach

CERN Document Server

Gough, John

2018-01-01

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

Quantum fields and processes a combinatorial approach

CERN Document Server

Gough, John

2018-01-01

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

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.

Revolutions of Geometry

CERN Document Server

O'Leary, Michael

2010-01-01

Guides readers through the development of geometry and basic proof writing using a historical approach to the topic. In an effort to fully appreciate the logic and structure of geometric proofs, Revolutions of Geometry places proofs into the context of geometry's history, helping readers to understand that proof writing is crucial to the job of a mathematician. Written for students and educators of mathematics alike, the book guides readers through the rich history and influential works, from ancient times to the present, behind the development of geometry. As a result, readers are successfull

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.

Spinning geometry = Twisted geometry

International Nuclear Information System (INIS)

Freidel, Laurent; Ziprick, Jonathan

2014-01-01

It is well known that the SU(2)-gauge invariant phase space of loop gravity can be represented in terms of twisted geometries. These are piecewise-linear-flat geometries obtained by gluing together polyhedra, but the resulting geometries are not continuous across the faces. Here we show that this phase space can also be represented by continuous, piecewise-flat three-geometries called spinning geometries. These are composed of metric-flat three-cells glued together consistently. The geometry of each cell and the manner in which they are glued is compatible with the choice of fluxes and holonomies. We first remark that the fluxes provide each edge with an angular momentum. By studying the piecewise-flat geometries which minimize edge lengths, we show that these angular momenta can be literally interpreted as the spin of the edges: the geometries of all edges are necessarily helices. We also show that the compatibility of the gluing maps with the holonomy data results in the same conclusion. This shows that a spinning geometry represents a way to glue together the three-cells of a twisted geometry to form a continuous geometry which represents a point in the loop gravity phase space. (paper)

Novel Combinatorial Chemistry-Derived Inhibitors of Oncogenic Phosphatases

National Research Council Canada - National Science Library

Lazo, John

1999-01-01

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

Combinatorial Solid-Phase Synthesis of Balanol Analogues

DEFF Research Database (Denmark)

Nielsen, John; Lyngsø, Lars Ole

1996-01-01

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

Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies

NARCIS (Netherlands)

Ketema, J.; Simonsen, Jakob Grue

2010-01-01

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

Mitigation of Control Channel Jamming via Combinatorial Key Distribution

Science.gov (United States)

Falahati, Abolfazl; Azarafrooz, Mahdi

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

On some interconnections between combinatorial optimization and extremal graph theory

Directory of Open Access Journals (Sweden)

Cvetković Dragoš M.

2004-01-01

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

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

Fiber bundle geometry and space-time structure

International Nuclear Information System (INIS)

Nascimento, J.C.

1977-01-01

Within the framework of the geometric formulation of Gauge theories in fiber bundles, the general relation between the bundle connection (Gauge field) and the geometry of the base space is obtained. A possible Gauge theory for gravitation is presented [pt

A combinatorial perspective of the protein inference problem.

Science.gov (United States)

Yang, Chao; He, Zengyou; Yu, Weichuan

2013-01-01

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

Effects of Suboptimal Bidding in Combinatorial Auctions

Science.gov (United States)

Schneider, Stefan; Shabalin, Pasha; Bichler, Martin

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

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

Performance evaluation of novel LaBr{sub 3}(Ce) scintillator geometries for fast-timing applications

Energy Technology Data Exchange (ETDEWEB)

Vedia, V., E-mail: mv.vedia@ucm.es [Grupo de Física Nuclear, Facultad de CC. Físicas, Universidad Complutense, CEI Moncloa, 28040 Madrid (Spain); Carmona-Gallardo, M.; Fraile, L.M. [Grupo de Física Nuclear, Facultad de CC. Físicas, Universidad Complutense, CEI Moncloa, 28040 Madrid (Spain); Mach, H. [Grupo de Física Nuclear, Facultad de CC. Físicas, Universidad Complutense, CEI Moncloa, 28040 Madrid (Spain); National Centre for Nuclear Research, Division for Nuclear Physics, BP1, Warsaw (Poland); Udías, J.M. [Grupo de Física Nuclear, Facultad de CC. Físicas, Universidad Complutense, CEI Moncloa, 28040 Madrid (Spain)

2017-06-11

We evaluate the performance of two LaBr{sub 3}(Ce) crystals that were produced with special geometries, aimed at enhancing the scintillation light collection and thus the time resolution. Their design was motivated by the construction of high-performance fast-timing arrays like the FAst TIMing array for DESPEC (FATIMA), which demands a high packing factor in addition to good time and energy resolutions. Energy resolution and efficiency were measured using standard calibration sources. Timing measurements were performed at {sup 60}Co and {sup 22}Na γ-energies against a fast BaF{sub 2} reference detector. The time resolution was optimized by the choice of the photomultiplier bias voltage and the fine tuning of the constant fraction discriminator parameters. Monte Carlo simulations using the Geant4 toolkit were performed in order to achieve a better understanding of how the new geometries affect the light transport and thus the performance of the crystals. It is found that the conical-shaped LaBr{sub 3}(Ce) crystals are optimal for fast-timing applications and for the construction of arrays such as FATIMA.

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.

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.

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.

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

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.

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.

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.

A further study for the upper bound of the cardinality of Farey vertices and application in discrete geometry

Directory of Open Access Journals (Sweden)

Daniel Khoshnoudirad

2015-09-01

Full Text Available The aim of the paper is to bring new combinatorial analytical properties of the Farey diagrams of order $(m,n$, which are associated to the $(m,n$-cubes. The latter are the pieces of discrete planes occurring in discrete geometry, theoretical computer sciences, and combinatorial number theory. We give a new upper bound for the number of Farey vertices $FV(m,n$ obtained as intersections points of Farey lines ([14]: $$\\exists C>0, \\forall (m,n\\in\\mathbb{N}^{*2},\\quad \\Big|FV(m,n\\Big| \\leq C m^2 n^2 (m+n \\ln^2 (mn$$ Using it, in particular, we show that the number of $(m,n$-cubes $\\mathcal{U}_{m,n}$ verifies: $$\\exists C>0, \\forall (m,n\\in\\mathbb{N}^{*2},\\quad \\Big|\\mathcal{U}_{m,n}\\Big| \\leq C m^3 n^3 (m+n \\ln^2 (mn$$ which is an important improvement of the result previously obtained in [6], which was a polynomial of degree 8. This work uses combinatorics, graph theory, and elementary and analytical number theory.

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.

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

Directory of Open Access Journals (Sweden)

Mi-Yuan Shan

2013-01-01

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

Implementation of a combinatorial cleavage and deprotection scheme

DEFF Research Database (Denmark)

Nielsen, John; Rasmussen, Palle H.

1996-01-01

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

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

Science.gov (United States)

Evans, Garrett Nolan

In this work, I present two projects that both contribute to the aim of discovering how intelligence manifests in the brain. The first project is a method for analyzing recorded neural signals, which takes the form of a convolution-based metric on neural membrane potential recordings. Relying only on integral and algebraic operations, the metric compares the timing and number of spikes within recordings as well as the recordings' subthreshold features: summarizing differences in these with a single "distance" between the recordings. Like van Rossum's (2001) metric for spike trains, the metric is based on a convolution operation that it performs on the input data. The kernel used for the convolution is carefully chosen such that it produces a desirable frequency space response and, unlike van Rossum's kernel, causes the metric to be first order both in differences between nearby spike times and in differences between same-time membrane potential values: an important trait. The second project is a combinatorial syntax method for connectionist semantic network encoding. Combinatorial syntax has been a point on which those who support a symbol-processing view of intelligent processing and those who favor a connectionist view have had difficulty seeing eye-to-eye. Symbol-processing theorists have persuasively argued that combinatorial syntax is necessary for certain intelligent mental operations, such as reasoning by analogy. Connectionists have focused on the versatility and adaptability offered by self-organizing networks of simple processing units. With this project, I show that there is a way to reconcile the two perspectives and to ascribe a combinatorial syntax to a connectionist network. The critical principle is to interpret nodes, or units, in the connectionist network as bound integrations of the interpretations for nodes that they share links with. Nodes need not correspond exactly to neurons and may correspond instead to distributed sets, or assemblies, of

Influence of the deposition geometry on the microstructure of sputter-deposited V-Al-C-N coatings

Energy Technology Data Exchange (ETDEWEB)

Darma, Susan; Krause, Baerbel; Doyle, Stephen; Mangold, Stefan; Baumbach, Tilo [ISS, Karlsruher Institut fuer Technologie (Germany); Ulrich, Sven; Stueber, Michael [IAM-AWP, Karlsruher Institut fuer Technologie (Germany)

2012-07-01

Multi-element hard coating materials such as V-Al-C-N are of great interest for many technological applications. Their mechanical properties depend on the composition and microstructure of the coating. In order to determine the optimum composition and deposition conditions of these complex materials, many samples are required. One powerful tool for reducing the number of experiments is based on the so-called combinatorial approach for thin film deposition: many different thin film samples can be realized simultaneously, exploiting the deposition gradient resulting from codeposition of several materials. We will present an X-ray diffraction study of the influence of the deposition geometry on the microstructure of V-Al-C-N coatings. The films were deposited by reactive RF magnetron sputtering from a segmented target composed of AlN and VC. Synchrotron radiation measurements where performed at the beamline PDIFF at ANKA. Significant texture changes were observed which can be attributed to the deposition geometry, as verified by calculations of the flux distribution. We conclude that codeposition can accelerate significantly the screening of new materials, under the condition that the desired property is not significantly influenced by the microstructural changes due to the deposition geometry.

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…

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

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

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

Geometry-specified troposphere decorrelation for subcentimeter real-time kinematic solutions over long baselines

Science.gov (United States)

Li, Bofeng; Feng, Yanming; Shen, Yunzhong; Wang, Charles

2010-11-01

Real-time kinematic (RTK) GPS techniques have been extensively developed for applications including surveying, structural monitoring, and machine automation. Limitations of the existing RTK techniques that hinder their applications for geodynamics purposes are twofold: (1) the achievable RTK accuracy is on the level of a few centimeters and the uncertainty of vertical component is 1.5-2 times worse than those of horizontal components and (2) the RTK position uncertainty grows in proportional to the base-to-rover distances. The key limiting factor behind the problems is the significant effect of residual tropospheric errors on the positioning solutions, especially on the highly correlated height component. This paper develops the geometry-specified troposphere decorrelation strategy to achieve the subcentimeter kinematic positioning accuracy in all three components. The key is to set up a relative zenith tropospheric delay (RZTD) parameter to absorb the residual tropospheric effects and to solve the established model as an ill-posed problem using the regularization method. In order to compute a reasonable regularization parameter to obtain an optimal regularized solution, the covariance matrix of positional parameters estimated without the RZTD parameter, which is characterized by observation geometry, is used to replace the quadratic matrix of their "true" values. As a result, the regularization parameter is adaptively computed with variation of observation geometry. The experiment results show that new method can efficiently alleviate the model's ill condition and stabilize the solution from a single data epoch. Compared to the results from the conventional least squares method, the new method can improve the long-range RTK solution precision from several centimeters to the subcentimeter in all components. More significantly, the precision of the height component is even higher. Several geosciences applications that require subcentimeter real-time solutions can

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.

General Geometry and Geometry of Electromagnetism

OpenAIRE

Shahverdiyev, Shervgi S.

2002-01-01

It is shown that Electromagnetism creates geometry different from Riemannian geometry. General geometry including Riemannian geometry as a special case is constructed. It is proven that the most simplest special case of General Geometry is geometry underlying Electromagnetism. Action for electromagnetic field and Maxwell equations are derived from curvature function of geometry underlying Electromagnetism. And it is shown that equation of motion for a particle interacting with electromagnetic...

Isocyanide based multi component reactions in combinatorial chemistry.

NARCIS (Netherlands)

Dömling, A.

1998-01-01

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

View discovery in OLAP databases through statistical combinatorial optimization

Energy Technology Data Exchange (ETDEWEB)

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

2009-01-01

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

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.

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

Indian Academy of Sciences (India)

36

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

Exact model reduction of combinatorial reaction networks

Directory of Open Access Journals (Sweden)

Fey Dirk

2008-08-01

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

Geometry of multihadron production

Energy Technology Data Exchange (ETDEWEB)

Bjorken, J.D.

1994-10-01

This summary talk only reviews a small sample of topics featured at this symposium: Introduction; The Geometry and Geography of Phase space; Space-Time Geometry and HBT; Multiplicities, Intermittency, Correlations; Disoriented Chiral Condensate; Deep Inelastic Scattering at HERA; and Other Contributions.

Geometry of multihadron production

International Nuclear Information System (INIS)

Bjorken, J.D.

1994-10-01

This summary talk only reviews a small sample of topics featured at this symposium: Introduction; The Geometry and Geography of Phase space; Space-Time Geometry and HBT; Multiplicities, Intermittency, Correlations; Disoriented Chiral Condensate; Deep Inelastic Scattering at HERA; and Other Contributions

Development of a geometry-compensated neutron time-of-flight detector for ICF applications with approximately 200 ps time response

International Nuclear Information System (INIS)

Murphy, T.J.; Lerche, R.A.

1992-01-01

Current-mode neutron time-of-flight detectors are used on Nova for neutron yield, ion temperature, and neutron emission time measurements. Currently used detectors are limited by the time response of the microchannel plate photomultiplier tubes used with the scintillators, scintillator decay time, scintillator thickness, and oscilloscope response time. A change in the geometry of the scintillator allows one to take advantage of the increased time resolution made possible by more advanced transient recorders and microchannel plate photomultiplier tubes. A prototype detector has been designed to incorporate these changes, and could potentially yield time resolution of less than 150 ps. Experimental results are presented demonstrating an ion temperature measurement of a direct-drive DT implosion on Nova

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

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.

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.

Specific features of time-dependent Psub(N) approximations in spherical geometry

International Nuclear Information System (INIS)

Peltzer, P.; Pucker, N.

1979-01-01

Approximations to the time-dependent linear transport equation can result in more serious distortions in the description of the actual physical situation than in the stationary problem. This is demonstrated in detail for the case of a neutron pulse in spherical geometry, treated within a P 1 approximation. One has to pay special attention to the singularity at r = 0 and to the effect of the boundary conditions. Effects similar to those shown here are also to be expected in connection with Psub(N) approximations of higher order. (Auth.)

The design of geometry teaching: learning from the geometry textbooks of Godfrey and Siddons

OpenAIRE

Fujita, Taro; Jones, Keith

2002-01-01

Deciding how to teach geometry remains a demanding task with one of major arguments being about how to combine the intuitive and deductive aspects of geometry into an effective teaching design. In order to try to obtain an insight into tackling this issue, this paper reports an analysis of innovative geometry textbooks which were published in the early part of the 20th Century, a time when significant efforts were being made to improve the teaching and learning of geometry. The analysis sugge...

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

KAUST Repository

Rapakoulia, Trisevgeni

2017-08-09

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

Bioinspired computation in combinatorial optimization: algorithms and their computational complexity

DEFF Research Database (Denmark)

Neumann, Frank; Witt, Carsten

2012-01-01

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

Advanced Aqueous Phase Catalyst Development using Combinatorial Methods, Phase II

Data.gov (United States)

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

Device for preparing combinatorial libraries in powder metallurgy.

Science.gov (United States)

Yang, Shoufeng; Evans, Julian R G

2004-01-01

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

Probabilistic methods in combinatorial analysis

CERN Document Server

Sachkov, Vladimir N

2014-01-01

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

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

Science.gov (United States)

Chen, Hong-Zhang; Liu, Zhi-Hua

2015-06-01

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

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.

Geometry on the space of geometries

International Nuclear Information System (INIS)

Christodoulakis, T.; Zanelli, J.

1988-06-01

We discuss the geometric structure of the configuration space of pure gravity. This is an infinite dimensional manifold, M, where each point represents one spatial geometry g ij (x). The metric on M is dictated by geometrodynamics, and from it, the Christoffel symbols and Riemann tensor can be found. A ''free geometry'' tracing a geodesic on the manifold describes the time evolution of space in the strong gravity limit. In a regularization previously introduced by the authors, it is found that M does not have the same dimensionality, D, everywhere, and that D is not a scalar, although it is covariantly constant. In this regularization, it is seen that the path integral measure can be absorbed in a renormalization of the cosmological constant. (author). 19 refs

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.

Numerically robust geometry engine for compound solid geometries

International Nuclear Information System (INIS)

Vlachoudis, V.; Sinuela-Pastor, D.

2013-01-01

Monte Carlo programs heavily rely on a fast and numerically robust solid geometry engines. However the success of solid modeling, depends on facilities for specifying and editing parameterized models through a user-friendly graphical front-end. Such a user interface has to be fast enough in order to be interactive for 2D and/or 3D displays, but at the same time numerically robust in order to display possible modeling errors at real time that could be critical for the simulation. The graphical user interface Flair for FLUKA currently employs such an engine where special emphasis has been given on being fast and numerically robust. The numerically robustness is achieved by a novel method of estimating the floating precision of the operations, which dynamically adapts all the decision operations accordingly. Moreover a predictive caching mechanism is ensuring that logical errors in the geometry description are found online, without compromising the processing time by checking all regions. (authors)

Developments in special geometry

International Nuclear Information System (INIS)

Mohaupt, Thomas; Vaughan, Owen

2012-01-01

We review the special geometry of N = 2 supersymmetric vector and hypermultiplets with emphasis on recent developments and applications. A new formulation of the local c-map based on the Hesse potential and special real coordinates is presented. Other recent developments include the Euclidean version of special geometry, and generalizations of special geometry to non-supersymmetric theories. As applications we discuss the proof that the local r-map and c-map preserve geodesic completeness, and the construction of four- and five-dimensional static solutions through dimensional reduction over time. The shared features of the real, complex and quaternionic version of special geometry are stressed throughout.

A Lorentzian quantum geometry

Energy Technology Data Exchange (ETDEWEB)

Grotz, Andreas

2011-10-07

In this thesis, a formulation of a Lorentzian quantum geometry based on the framework of causal fermion systems is proposed. After giving the general definition of causal fermion systems, we deduce space-time as a topological space with an underlying causal structure. Restricting attention to systems of spin dimension two, we derive the objects of our quantum geometry: the spin space, the tangent space endowed with a Lorentzian metric, connection and curvature. In order to get the correspondence to classical differential geometry, we construct examples of causal fermion systems by regularizing Dirac sea configurations in Minkowski space and on a globally hyperbolic Lorentzian manifold. When removing the regularization, the objects of our quantum geometry reduce to the common objects of spin geometry on Lorentzian manifolds, up to higher order curvature corrections.

A Lorentzian quantum geometry

International Nuclear Information System (INIS)

Grotz, Andreas

2011-01-01

In this thesis, a formulation of a Lorentzian quantum geometry based on the framework of causal fermion systems is proposed. After giving the general definition of causal fermion systems, we deduce space-time as a topological space with an underlying causal structure. Restricting attention to systems of spin dimension two, we derive the objects of our quantum geometry: the spin space, the tangent space endowed with a Lorentzian metric, connection and curvature. In order to get the correspondence to classical differential geometry, we construct examples of causal fermion systems by regularizing Dirac sea configurations in Minkowski space and on a globally hyperbolic Lorentzian manifold. When removing the regularization, the objects of our quantum geometry reduce to the common objects of spin geometry on Lorentzian manifolds, up to higher order curvature corrections.

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.  

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

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.

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.

A combinatorial approximation algorithm for CDMA downlink rate allocation

NARCIS (Netherlands)

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

2006-01-01

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

A combinatorial approximation algorithm for CDMA downlink rate allocation

NARCIS (Netherlands)

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

2004-01-01

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

Intrinsic information carriers in combinatorial dynamical systems

Science.gov (United States)

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

2010-09-01

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

Intrinsic information carriers in combinatorial dynamical systems.

Science.gov (United States)

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

2010-09-01

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

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.

Some Combinatorial Interpretations and Applications of Fuss-Catalan Numbers

OpenAIRE

Lin, Chin-Hung

2011-01-01

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

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

Science.gov (United States)

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

2005-07-01

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

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

Science.gov (United States)

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

2017-06-15

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

An Atlas of Combinatorial Transcriptional Regulation in Mouse and Man

KAUST Repository

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

2010-01-01

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

An Atlas of Combinatorial Transcriptional Regulation in Mouse and Man

KAUST Repository

Ravasi, Timothy

2010-03-01

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

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

Science.gov (United States)

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

2017-11-13

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

Geometries

CERN Document Server

Sossinsky, A B

2012-01-01

The book is an innovative modern exposition of geometry, or rather, of geometries; it is the first textbook in which Felix Klein's Erlangen Program (the action of transformation groups) is systematically used as the basis for defining various geometries. The course of study presented is dedicated to the proposition that all geometries are created equal--although some, of course, remain more equal than others. The author concentrates on several of the more distinguished and beautiful ones, which include what he terms "toy geometries", the geometries of Platonic bodies, discrete geometries, and classical continuous geometries. The text is based on first-year semester course lectures delivered at the Independent University of Moscow in 2003 and 2006. It is by no means a formal algebraic or analytic treatment of geometric topics, but rather, a highly visual exposition containing upwards of 200 illustrations. The reader is expected to possess a familiarity with elementary Euclidean geometry, albeit those lacking t...

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

Science.gov (United States)

Hartmann, Alexander K.; Weigt, Martin

2005-10-01

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

Development of automatic combinatorial system for synthesis of nanoparticles using microreactors

Energy Technology Data Exchange (ETDEWEB)

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

2011-10-29

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

Combinatorial algorithms enabling computational science: tales from the front

International Nuclear Information System (INIS)

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

2006-01-01

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

Combinatorial algorithms enabling computational science: tales from the front

Energy Technology Data Exchange (ETDEWEB)

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

2006-09-15

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

Dynamic combinatorial libraries based on hydrogen-bonde molecular boxes

NARCIS (Netherlands)

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

2007-01-01

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

Generalizing optical geometry

International Nuclear Information System (INIS)

Jonsson, Rickard; Westman, Hans

2006-01-01

We show that by employing the standard projected curvature as a measure of spatial curvature, we can make a certain generalization of optical geometry (Abramowicz M A and Lasota J-P 1997 Class. Quantum Grav. A 14 23-30). This generalization applies to any spacetime that admits a hypersurface orthogonal shearfree congruence of worldlines. This is a somewhat larger class of spacetimes than the conformally static spacetimes assumed in standard optical geometry. In the generalized optical geometry, which in the generic case is time dependent, photons move with unit speed along spatial geodesics and the sideways force experienced by a particle following a spatially straight line is independent of the velocity. Also gyroscopes moving along spatial geodesics do not precess (relative to the forward direction). Gyroscopes that follow a curved spatial trajectory precess according to a very simple law of three-rotation. We also present an inertial force formalism in coordinate representation for this generalization. Furthermore, we show that by employing a new sense of spatial curvature (Jonsson R 2006 Class. Quantum Grav. 23 1)) closely connected to Fermat's principle, we can make a more extensive generalization of optical geometry that applies to arbitrary spacetimes. In general this optical geometry will be time dependent, but still geodesic photons move with unit speed and follow lines that are spatially straight in the new sense. Also, the sideways experienced (comoving) force on a test particle following a line that is straight in the new sense will be independent of the velocity

Normalization of time-series satellite reflectance data to a standard sun-target-sensor geometry using a semi-empirical model

Science.gov (United States)

Zhao, Yongguang; Li, Chuanrong; Ma, Lingling; Tang, Lingli; Wang, Ning; Zhou, Chuncheng; Qian, Yonggang

2017-10-01

Time series of satellite reflectance data have been widely used to characterize environmental phenomena, describe trends in vegetation dynamics and study climate change. However, several sensors with wide spatial coverage and high observation frequency are usually designed to have large field of view (FOV), which cause variations in the sun-targetsensor geometry in time-series reflectance data. In this study, on the basis of semiempirical kernel-driven BRDF model, a new semi-empirical model was proposed to normalize the sun-target-sensor geometry of remote sensing image. To evaluate the proposed model, bidirectional reflectance under different canopy growth conditions simulated by Discrete Anisotropic Radiative Transfer (DART) model were used. The semi-empirical model was first fitted by using all simulated bidirectional reflectance. Experimental result showed a good fit between the bidirectional reflectance estimated by the proposed model and the simulated value. Then, MODIS time-series reflectance data was normalized to a common sun-target-sensor geometry by the proposed model. The experimental results showed the proposed model yielded good fits between the observed and estimated values. The noise-like fluctuations in time-series reflectance data was also reduced after the sun-target-sensor normalization process.

Molecular motion in restricted geometries

Indian Academy of Sciences (India)

Molecular dynamics in restricted geometries is known to exhibit anomalous behaviour. Diffusion, translational or rotational, of molecules is altered significantly on confinement in restricted geometries. Quasielastic neutron scattering (QENS) offers a unique possibility of studying molecular motion in such systems. Both time ...

Quantum resonance for simulating combinatorial problems

International Nuclear Information System (INIS)

Zak, Michail; Fijany, Amir

2005-01-01

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

Automatic generation of combinatorial test data

CERN Document Server

Zhang, Jian; Ma, Feifei

2014-01-01

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

Advances in discrete differential geometry

CERN Document Server

2016-01-01

This is one of the first books on a newly emerging field of discrete differential geometry and an excellent way to access this exciting area. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics. The authors take a closer look at discrete models in differential geometry and dynamical systems. Their curves are polygonal, surfaces are made from triangles and quadrilaterals, and time is discrete. Nevertheless, the difference between the corresponding smooth curves, surfaces and classical dynamical systems with continuous time can hardly be seen. This is the paradigm of structure-preserving discretizations. Current advances in this field are stimulated to a large extent by its relevance for computer graphics and mathematical physics. This book is written by specialists working together on a common research project. It is about differential geometry and dynamical systems, smooth and discrete theories, ...

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

Time-dependent integral transport equation kernels, leakage rates and collision rates for plane and spherical geometry

International Nuclear Information System (INIS)

Henderson, D.L.

1987-01-01

Time-dependent integral transport equation flux and current kernels for plane and spherical geometry are derived for homogeneous media. Using the multiple collision formalism, isotropic sources that are delta distributions in time are considered for four different problems. The plane geometry flux kernel is applied to a uniformly distributed source within an infinite medium and to a surface source in a semi-infinite medium. The spherical flux kernel is applied to a point source in an infinite medium and to a point source at the origin of a finite sphere. The time-dependent first-flight leakage rates corresponding to the existing steady state first-flight escape probabilities are computed by the Laplace transform technique assuming a delta distribution source in time. The case of a constant source emitting neutrons over a time interval, Δt, for a spatially uniform source is obtained for a slab and a sphere. Time-dependent first-flight leakage rates are also determined for the general two region spherical medium problem for isotropic sources with a delta distribution in time uniformly distributed throughout both the inner and outer regions. The time-dependent collision rates due to the uncollided neutrons are computed for a slab and a sphere using the time-dependent first-flight leakage rates and the time-dependent continuity equation. The case of a constant source emitting neutrons over a time interval, Δt, is also considered

Optical geometry across the horizon

International Nuclear Information System (INIS)

Jonsson, Rickard

2006-01-01

In a recent paper (Jonsson and Westman 2006 Class. Quantum Grav. 23 61), a generalization of optical geometry, assuming a non-shearing reference congruence, is discussed. Here we illustrate that this formalism can be applied to (a finite four-volume) of any spherically symmetric spacetime. In particular we apply the formalism, using a non-static reference congruence, to do optical geometry across the horizon of a static black hole. While the resulting geometry in principle is time dependent, we can choose the reference congruence in such a manner that an embedding of the geometry always looks the same. Relative to the embedded geometry the reference points are then moving. We discuss the motion of photons, inertial forces and gyroscope precession in this framework

MORSE-CGT Monte Carlo radiation transport code with the capability of the torus geometric treatment

International Nuclear Information System (INIS)

Deng Li

1990-01-01

The combinatorial geometry package CGT with the capability of the torus geometric treatment is introduced. It is get by developing the combinatorial geometry package CG. The CGT package can be transplanted to those codes which the CG package is being used and makes them also with the capability. The MORSE-CGT code can be used to solve the neutron, gamma-ray or coupled neutron-gamma-ray transport problems and time dependence for both shielding and criticality problems in torus system or system which is produced by arbitrary finite combining torus with torus or other bodies in CG package and it can also be used to design the blanket and compute shielding for TOKAMAK Fusion-Fission Hybrid Reactor

Sources of hyperbolic geometry

CERN Document Server

Stillwell, John

1996-01-01

This book presents, for the first time in English, the papers of Beltrami, Klein, and Poincaré that brought hyperbolic geometry into the mainstream of mathematics. A recognition of Beltrami comparable to that given the pioneering works of Bolyai and Lobachevsky seems long overdue-not only because Beltrami rescued hyperbolic geometry from oblivion by proving it to be logically consistent, but because he gave it a concrete meaning (a model) that made hyperbolic geometry part of ordinary mathematics. The models subsequently discovered by Klein and Poincaré brought hyperbolic geometry even further down to earth and paved the way for the current explosion of activity in low-dimensional geometry and topology. By placing the works of these three mathematicians side by side and providing commentaries, this book gives the student, historian, or professional geometer a bird's-eye view of one of the great episodes in mathematics. The unified setting and historical context reveal the insights of Beltrami, Klein, and Po...

Gas-Foamed Scaffold Gradients for Combinatorial Screening in 3D

Directory of Open Access Journals (Sweden)

Joachim Kohn

2012-03-01

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

Combinatorial nuclear level-density model

International Nuclear Information System (INIS)

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

2013-01-01

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

Combinatorial optimization games

Energy Technology Data Exchange (ETDEWEB)

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

1997-06-01

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

Combinatorial effects of arginine and fluoride on oral bacteria.

Science.gov (United States)

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

2015-02-01

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

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.

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

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

Geometry

CERN Document Server

Prasolov, V V

2015-01-01

This book provides a systematic introduction to various geometries, including Euclidean, affine, projective, spherical, and hyperbolic geometries. Also included is a chapter on infinite-dimensional generalizations of Euclidean and affine geometries. A uniform approach to different geometries, based on Klein's Erlangen Program is suggested, and similarities of various phenomena in all geometries are traced. An important notion of duality of geometric objects is highlighted throughout the book. The authors also include a detailed presentation of the theory of conics and quadrics, including the theory of conics for non-Euclidean geometries. The book contains many beautiful geometric facts and has plenty of problems, most of them with solutions, which nicely supplement the main text. With more than 150 figures illustrating the arguments, the book can be recommended as a textbook for undergraduate and graduate-level courses in geometry.

Characterizing the combinatorial beam angle selection problem

Science.gov (United States)

Bangert, Mark; Ziegenhein, Peter; Oelfke, Uwe

2012-10-01

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

Characterizing the combinatorial beam angle selection problem

International Nuclear Information System (INIS)

Bangert, Mark; Ziegenhein, Peter; Oelfke, Uwe

2012-01-01

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

The Monte Carlo SRNA-VOX code for 3D proton dose distribution in voxelized geometry using CT data

International Nuclear Information System (INIS)

Ilic, Radovan D; Spasic-Jokic, Vesna; Belicev, Petar; Dragovic, Milos

2005-01-01

This paper describes the application of the SRNA Monte Carlo package for proton transport simulations in complex geometry and different material compositions. The SRNA package was developed for 3D dose distribution calculation in proton therapy and dosimetry and it was based on the theory of multiple scattering. The decay of proton induced compound nuclei was simulated by the Russian MSDM model and our own using ICRU 63 data. The developed package consists of two codes: the SRNA-2KG, which simulates proton transport in combinatorial geometry and the SRNA-VOX, which uses the voxelized geometry using the CT data and conversion of the Hounsfield's data to tissue elemental composition. Transition probabilities for both codes are prepared by the SRNADAT code. The simulation of the proton beam characterization by multi-layer Faraday cup, spatial distribution of positron emitters obtained by the SRNA-2KG code and intercomparison of computational codes in radiation dosimetry, indicate immediate application of the Monte Carlo techniques in clinical practice. In this paper, we briefly present the physical model implemented in the SRNA package, the ISTAR proton dose planning software, as well as the results of the numerical experiments with proton beams to obtain 3D dose distribution in the eye and breast tumour

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

Simultaneous travel time tomography for updating both velocity and reflector geometry in triangular/tetrahedral cell model

Science.gov (United States)

Bai, Chao-ying; He, Lei-yu; Li, Xing-wang; Sun, Jia-yu

2018-05-01

To conduct forward and simultaneous inversion in a complex geological model, including an irregular topography (or irregular reflector or velocity anomaly), we in this paper combined our previous multiphase arrival tracking method (referred as triangular shortest-path method, TSPM) in triangular (2D) or tetrahedral (3D) cell model and a linearized inversion solver (referred to as damped minimum norms and constrained least squares problem solved using the conjugate gradient method, DMNCLS-CG) to formulate a simultaneous travel time inversion method for updating both velocity and reflector geometry by using multiphase arrival times. In the triangular/tetrahedral cells, we deduced the partial derivative of velocity variation with respective to the depth change of reflector. The numerical simulation results show that the computational accuracy can be tuned to a high precision in forward modeling and the irregular velocity anomaly and reflector geometry can be accurately captured in the simultaneous inversion, because the triangular/tetrahedral cell can be easily used to stitch the irregular topography or subsurface interface.

TIMEX, 1-D Time-Dependent Multigroup Transport Theory with Delayed Neutron, Planar Cylindrical and Spherical Geometry

International Nuclear Information System (INIS)

Hill, T. R.; Reed, W. H.

1980-01-01

1 - Description of problem or function: TIMEX solves the time- dependent, one-dimensional multigroup transport equation with delayed neutrons in plane, cylindrical, spherical, and two-angle plane geometries. Both regular and adjoint, inhomogeneous and homogeneous problems subject to vacuum, reflective, periodic, white, albedo or inhomogeneous boundary flux conditions are solved. General anisotropic scattering is allowed and anisotropic inhomogeneous sources are permitted. 2 - Method of solution: The discrete ordinates approximation for the angular variable is used with the diamond (central) difference approximation for the angular extrapolation in curved geometries. A linear discontinuous finite element representation for the angular flux in each spatial mesh cell is used. Negative fluxes are eliminated by a local set-to-zero and correct algorithm. The time variable is differenced by an explicit technique that is unconditionally stable so that arbitrarily large time-steps can be taken. Two acceleration methods, exponential extrapolation and re-balance, are utilized to improve the accuracy of the time differencing scheme. 3 - Restrictions on the complexity of the problem: Variable dimensioning is used so that any combination of problem parameters leading to a container array less than MAXCOR can be accommodated. In addition, the CDC version permits the use of extended core storage less than MAXECS

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

DEFF Research Database (Denmark)

Sørensen, Anne

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

Confluence of an extension of combinatory logic by Boolean constants

DEFF Research Database (Denmark)

Czajka, Łukasz

2017-01-01

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

Combinatorial chemistry approach to development of molecular plastic solar cells

NARCIS (Netherlands)

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

1999-01-01

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

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

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.

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

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

KAUST Repository

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

2017-01-01

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

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

KAUST Repository

Kuwahara, Hiroyuki

2017-03-01

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

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

DEFF Research Database (Denmark)

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

2014-01-01

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

W-geometry

International Nuclear Information System (INIS)

Hull, C.M.

1993-01-01

The geometric structure of theories with gauge fields of spins two and higher should involve a higher spin generalisation of Riemannian geometry. Such geometries are discussed and the case of W ∝ -gravity is analysed in detail. While the gauge group for gravity in d dimensions is the diffeomorphism group of the space-time, the gauge group for a certain W-gravity theory (which is W ∝ -gravity in the case d=2) is the group of symplectic diffeomorphisms of the cotangent bundle of the space-time. Gauge transformations for W-gravity gauge fields are given by requiring the invariance of a generalised line element. Densities exist and can be constructed from the line element (generalising √detg μν ) only if d=1 or d=2, so that only for d=1,2 can actions be constructed. These two cases and the corresponding W-gravity actions are considered in detail. In d=2, the gauge group is effectively only a subgroup of the symplectic diffeomorphisms group. Some of the constraints that arise for d=2 are similar to equations arising in the study of self-dual four-dimensional geometries and can be analysed using twistor methods, allowing contact to be made with other formulations of W-gravity. While the twistor transform for self-dual spaces with one Killing vector reduces to a Legendre transform, that for two Killing vectors gives a generalisation of the Legendre transform. (orig.)

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

Geometry of polynomials and root-finding via path-lifting

Science.gov (United States)

Kim, Myong-Hi; Martens, Marco; Sutherland, Scott

2018-02-01

Using the interplay between topological, combinatorial, and geometric properties of polynomials and analytic results (primarily the covering structure and distortion estimates), we analyze a path-lifting method for finding approximate zeros, similar to those studied by Smale, Shub, Kim, and others. Given any polynomial, this simple algorithm always converges to a root, except on a finite set of initial points lying on a circle of a given radius. Specifically, the algorithm we analyze consists of iterating where the t k form a decreasing sequence of real numbers and z 0 is chosen on a circle containing all the roots. We show that the number of iterates required to locate an approximate zero of a polynomial f depends only on log\\vert f(z_0)/ρ_\\zeta\\vert (where ρ_\\zeta is the radius of convergence of the branch of f-1 taking 0 to a root ζ) and the logarithm of the angle between f(z_0) and certain critical values. Previous complexity results for related algorithms depend linearly on the reciprocals of these angles. Note that the complexity of the algorithm does not depend directly on the degree of f, but only on the geometry of the critical values. Furthermore, for any polynomial f with distinct roots, the average number of steps required over all starting points taken on a circle containing all the roots is bounded by a constant times the average of log(1/ρ_\\zeta) . The average of log(1/ρ_\\zeta) over all polynomials f with d roots in the unit disk is \

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…

Curvature tensor copies in affine geometry

International Nuclear Information System (INIS)

Srivastava, P.P.

1981-01-01

The sets of space-time and spin-connections which give rise to the same curvature tensor are constructed. The corresponding geometries are compared. Results are illustrated by an explicit calculation and comment on the copies in Einstein-Cartan and Weyl-Cartan geometries. (Author) [pt

Geometry, topology, and string theory

Energy Technology Data Exchange (ETDEWEB)

Varadarajan, Uday [Univ. of California, Berkeley, CA (United States)

2003-01-01

A variety of scenarios are considered which shed light upon the uses and limitations of classical geometric and topological notions in string theory. The primary focus is on situations in which D-brane or string probes of a given classical space-time see the geometry quite differently than one might naively expect. In particular, situations in which extra dimensions, non-commutative geometries as well as other non-local structures emerge are explored in detail. Further, a preliminary exploration of such issues in Lorentzian space-times with non-trivial causal structures within string theory is initiated.

Geometry, topology, and string theory

International Nuclear Information System (INIS)

Varadarajan, Uday

2003-01-01

A variety of scenarios are considered which shed light upon the uses and limitations of classical geometric and topological notions in string theory. The primary focus is on situations in which D-brane or string probes of a given classical space-time see the geometry quite differently than one might naively expect. In particular, situations in which extra dimensions, non-commutative geometries as well as other non-local structures emerge are explored in detail. Further, a preliminary exploration of such issues in Lorentzian space-times with non-trivial causal structures within string theory is initiated

Network geometry with flavor: From complexity to quantum geometry

Science.gov (United States)

Bianconi, Ginestra; Rahmede, Christoph

2016-03-01

Network geometry is attracting increasing attention because it has a wide range of applications, ranging from data mining to routing protocols in the Internet. At the same time advances in the understanding of the geometrical properties of networks are essential for further progress in quantum gravity. In network geometry, simplicial complexes describing the interaction between two or more nodes play a special role. In fact these structures can be used to discretize a geometrical d -dimensional space, and for this reason they have already been widely used in quantum gravity. Here we introduce the network geometry with flavor s =-1 ,0 ,1 (NGF) describing simplicial complexes defined in arbitrary dimension d and evolving by a nonequilibrium dynamics. The NGF can generate discrete geometries of different natures, ranging from chains and higher-dimensional manifolds to scale-free networks with small-world properties, scale-free degree distribution, and nontrivial community structure. The NGF admits as limiting cases both the Bianconi-Barabási models for complex networks, the stochastic Apollonian network, and the recently introduced model for complex quantum network manifolds. The thermodynamic properties of NGF reveal that NGF obeys a generalized area law opening a new scenario for formulating its coarse-grained limit. The structure of NGF is strongly dependent on the dimensionality d . In d =1 NGFs grow complex networks for which the preferential attachment mechanism is necessary in order to obtain a scale-free degree distribution. Instead, for NGF with dimension d >1 it is not necessary to have an explicit preferential attachment rule to generate scale-free topologies. We also show that NGF admits a quantum mechanical description in terms of associated quantum network states. Quantum network states evolve by a Markovian dynamics and a quantum network state at time t encodes all possible NGF evolutions up to time t . Interestingly the NGF remains fully classical but

Head First 2D Geometry

CERN Document Server

Fallow), Stray

2009-01-01

Having trouble with geometry? Do Pi, The Pythagorean Theorem, and angle calculations just make your head spin? Relax. With Head First 2D Geometry, you'll master everything from triangles, quads and polygons to the time-saving secrets of similar and congruent angles -- and it'll be quick, painless, and fun. Through entertaining stories and practical examples from the world around you, this book takes you beyond boring problems. You'll actually use what you learn to make real-life decisions, like using angles and parallel lines to crack a mysterious CSI case. Put geometry to work for you, and

Local differential geometry of null curves in conformally flat space-time

International Nuclear Information System (INIS)

Urbantke, H.

1989-01-01

The conformally invariant differential geometry of null curves in conformally flat space-times is given, using the six-vector formalism which has generalizations to higher dimensions. This is then paralleled by a twistor description, with a twofold merit: firstly, sometimes the description is easier in twistor terms, sometimes in six-vector terms, which leads to a mutual enlightenment of both; and secondly, the case of null curves in timelike pseudospheres or 2+1 Minkowski space we were only able to treat twistorially, making use of an invariant differential found by Fubini and Cech. The result is the expected one: apart from stated exceptional cases there is a conformally invariant parameter and two conformally invariant curvatures which, when specified in terms of this parameter, serve to characterize the curve up to conformal transformations. 12 refs. (Author)

First steps in combinatorial optimization on graphons: matchings

Czech Academy of Sciences Publication Activity Database

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

2017-01-01

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

First steps in combinatorial optimization on graphons: matchings

Czech Academy of Sciences Publication Activity Database

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

2017-01-01

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

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.

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

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

Increasing insightful thinking in analytic geometry

NARCIS (Netherlands)

Timmer, Mark; Verhoef, Neeltje Cornelia

Elsewhere in this issue Ferdinand Verhulst described the discussion of the interaction of analysis and geometry in the 19th century. In modern times such discussions come up again and again. As of 2014, synthetic geometry will not be part of the Dutch 'vwo - mathematics B' programme anymore.

Method and apparatus for combinatorial chemistry

Science.gov (United States)

Foote, Robert S [Oak Ridge, TN

2012-06-05

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

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

Science.gov (United States)

Chen, Sheng-Hong; Lahav, Galit

2016-12-01

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

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

Directory of Open Access Journals (Sweden)

Yong-Hyuk Kim

2014-01-01

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

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

Science.gov (United States)

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

2015-01-01

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

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

Optical geometry

International Nuclear Information System (INIS)

Robinson, I.; Trautman, A.

1988-01-01

The geometry of classical physics is Lorentzian; but weaker geometries are often more appropriate: null geodesics and electromagnetic fields, for example, are well known to be objects of conformal geometry. To deal with a single null congruence, or with the radiative electromagnetic fields associated with it, even less is needed: flag geometry for the first, optical geometry, with which this paper is chiefly concerned, for the second. The authors establish a natural one-to-one correspondence between optical geometries, considered locally, and three-dimensional Cauchy-Riemann structures. A number of Lorentzian geometries are shown to be equivalent from the optical point of view. For example the Goedel universe, the Taub-NUT metric and Hauser's twisting null solution have an optical geometry isomorphic to the one underlying the Robinson congruence in Minkowski space. The authors present general results on the problem of lifting a CR structure to a Lorentz manifold and, in particular, to Minkowski space; and exhibit the relevance of the deviation form to this problem

Morphing the feature-based multi-blocks of normative/healthy vertebral geometries to scoliosis vertebral geometries: development of personalized finite element models.

Science.gov (United States)

Hadagali, Prasannaah; Peters, James R; Balasubramanian, Sriram

2018-03-12

Personalized Finite Element (FE) models and hexahedral elements are preferred for biomechanical investigations. Feature-based multi-block methods are used to develop anatomically accurate personalized FE models with hexahedral mesh. It is tedious to manually construct multi-blocks for large number of geometries on an individual basis to develop personalized FE models. Mesh-morphing method mitigates the aforementioned tediousness in meshing personalized geometries every time, but leads to element warping and loss of geometrical data. Such issues increase in magnitude when normative spine FE model is morphed to scoliosis-affected spinal geometry. The only way to bypass the issue of hex-mesh distortion or loss of geometry as a result of morphing is to rely on manually constructing the multi-blocks for scoliosis-affected spine geometry of each individual, which is time intensive. A method to semi-automate the construction of multi-blocks on the geometry of scoliosis vertebrae from the existing multi-blocks of normative vertebrae is demonstrated in this paper. High-quality hexahedral elements were generated on the scoliosis vertebrae from the morphed multi-blocks of normative vertebrae. Time taken was 3 months to construct the multi-blocks for normative spine and less than a day for scoliosis. Efforts taken to construct multi-blocks on personalized scoliosis spinal geometries are significantly reduced by morphing existing multi-blocks.

Space-time philosophy reconstructed via massive Nordström scalar gravities? Laws vs. geometry, conventionality, and underdetermination

Science.gov (United States)

Pitts, J. Brian

2016-02-01

What if gravity satisfied the Klein-Gordon equation? Both particle physics from the 1920-30s and the 1890s Neumann-Seeliger modification of Newtonian gravity with exponential decay suggest considering a "graviton mass term" for gravity, which is algebraic in the potential. Unlike Nordström's "massless" theory, massive scalar gravity is strictly special relativistic in the sense of being invariant under the Poincaré group but not the 15-parameter Bateman-Cunningham conformal group. It therefore exhibits the whole of Minkowski space-time structure, albeit only indirectly concerning volumes. Massive scalar gravity is plausible in terms of relativistic field theory, while violating most interesting versions of Einstein's principles of general covariance, general relativity, equivalence, and Mach. Geometry is a poor guide to understanding massive scalar gravity(s): matter sees a conformally flat metric due to universal coupling, but gravity also sees the rest of the flat metric (barely or on long distances) in the mass term. What is the 'true' geometry, one might wonder, in line with Poincaré's modal conventionality argument? Infinitely many theories exhibit this bimetric 'geometry,' all with the total stress-energy's trace as source; thus geometry does not explain the field equations. The irrelevance of the Ehlers-Pirani-Schild construction to a critique of conventionalism becomes evident when multi-geometry theories are contemplated. Much as Seeliger envisaged, the smooth massless limit indicates underdetermination of theories by data between massless and massive scalar gravities-indeed an unconceived alternative. At least one version easily could have been developed before General Relativity; it then would have motivated thinking of Einstein's equations along the lines of Einstein's newly re-appreciated "physical strategy" and particle physics and would have suggested a rivalry from massive spin 2 variants of General Relativity (massless spin 2, Pauli and Fierz

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

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'…

On the impact of GNSS ambiguity resolution: geometry, ionosphere, time and biases

Science.gov (United States)

Khodabandeh, A.; Teunissen, P. J. G.

2018-06-01

Integer ambiguity resolution (IAR) is the key to fast and precise GNSS positioning and navigation. Next to the positioning parameters, however, there are several other types of GNSS parameters that are of importance for a range of different applications like atmospheric sounding, instrumental calibrations or time transfer. As some of these parameters may still require pseudo-range data for their estimation, their response to IAR may differ significantly. To infer the impact of ambiguity resolution on the parameters, we show how the ambiguity-resolved double-differenced phase data propagate into the GNSS parameter solutions. For that purpose, we introduce a canonical decomposition of the GNSS network model that, through its decoupled and decorrelated nature, provides direct insight into which parameters, or functions thereof, gain from IAR and which do not. Next to this qualitative analysis, we present for the GNSS estimable parameters of geometry, ionosphere, timing and instrumental biases closed-form expressions of their IAR precision gains together with supporting numerical examples.

Introducing geometry concept based on history of Islamic geometry

Science.gov (United States)

Maarif, S.; Wahyudin; Raditya, A.; Perbowo, K. S.

2018-01-01

Geometry is one of the areas of mathematics interesting to discuss. Geometry also has a long history in mathematical developments. Therefore, it is important integrated historical development of geometry in the classroom to increase’ knowledge of how mathematicians earlier finding and constructing a geometric concept. Introduction geometrical concept can be started by introducing the Muslim mathematician who invented these concepts so that students can understand in detail how a concept of geometry can be found. However, the history of mathematics development, especially history of Islamic geometry today is less popular in the world of education in Indonesia. There are several concepts discovered by Muslim mathematicians that should be appreciated by the students in learning geometry. Great ideas of mathematicians Muslim can be used as study materials to supplement religious character values taught by Muslim mathematicians. Additionally, by integrating the history of geometry in teaching geometry are expected to improve motivation and geometrical understanding concept.

Combinatorial Pooling Enables Selective Sequencing of the Barley Gene Space

Science.gov (United States)

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

2013-01-01

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

Combinatorial pooling enables selective sequencing of the barley gene space.

Directory of Open Access Journals (Sweden)

Stefano Lonardi

2013-04-01

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

Combinatorial pooling enables selective sequencing of the barley gene space.

Science.gov (United States)

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

2013-04-01

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

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.

Causal gene identification using combinatorial V-structure search.

Science.gov (United States)

Cai, Ruichu; Zhang, Zhenjie; Hao, Zhifeng

2013-07-01

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

A combinatorial approach to the design of vaccines.

Science.gov (United States)

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

2015-05-01

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

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

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

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)

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.

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.

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.

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.

Ion temperature measurement of indirectly-driven implosions using a geometry-compensated neutron time-of-flight detector

International Nuclear Information System (INIS)

Murphy, T.J.; Lerche, R.A.; Bennett, C.; Howe, G.

1994-05-01

A geometry-compensated neutron time-of-flight detector has been constructed and used on Nova to measure ion temperatures from indirectly-driven implosions with yields between 2.5 and 5 x 10 9 DD neutrons. The detector, which has an estimated response time of 250 ps, was located 150 cm from the targets. Due to the long decay time of the scintillator, the time-of-flight signal must be unfolded from the measured detector signal. Several methods for determining the width of the neutron energy spectrum from the data have been developed and give similar results. Scattered x rays continue to be a problem for low yield shots, but should be brought under control with adequate shielding

Ion-temperature measurement of indirectly driven implosions using a geometry-compensated neutron time-of-flight detector

International Nuclear Information System (INIS)

Murphy, T.J.; Lerche, R.A.; Bennett, C.; Howe, G.

1995-01-01

A geometry-compensated neutron time-of-flight detector has been constructed and used on Nova to measure ion temperatures from indirectly driven implosions with yields between 2.5 and 5x10 9 DD neutrons. The detector, which has an estimated respond time of 250 ps, was located 150 cm from the targets. Due to the long decay time of the scintillator, the time-of-flight signal must be unfolded from the measured detector signal. Several methods for determining the width of the neutron energy spectrum from the data have been developed and give similar results. Scattered x rays continue to be a problem for low yield shots, but should be brought under control with adequate shielding

Combinatorial interpretation of Haldane-Wu fractional exclusion statistics.

Science.gov (United States)

Aringazin, A K; Mazhitov, M I

2002-08-01

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

Combinatorial Models for Assembly and Decomposition of Products

OpenAIRE

A. N. Bojko

2015-01-01

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

Toric topology

CERN Document Server

Buchstaber, Victor M

2015-01-01

This book is about toric topology, a new area of mathematics that emerged at the end of the 1990s on the border of equivariant topology, algebraic and symplectic geometry, combinatorics, and commutative algebra. It has quickly grown into a very active area with many links to other areas of mathematics, and continues to attract experts from different fields. The key players in toric topology are moment-angle manifolds, a class of manifolds with torus actions defined in combinatorial terms. Construction of moment-angle manifolds relates to combinatorial geometry and algebraic geometry of toric v

A brief histone in time: understanding the combinatorial functions of histone PTMs in the nucleosome context.

Science.gov (United States)

Ng, Marlee K; Cheung, Peter

2016-02-01

It has been over 50 years since Allfrey et al. proposed that histone acetylation regulates RNA synthesis, and the study of histone modifications has progressed at an extraordinary pace for the past two decades. In this review, we provide a perspective on some key events and advances in our understanding of histone modifications. We also highlight reagents and tools from past to present that facilitated progress in this research field. Using histone H3 phosphorylation as an underlying thread, we review the rationale that led to the proposal of the histone code hypothesis, as well as examples that illustrate the concepts of combinatorial histone modifications and cross-talk pathways. We further highlight the importance of investigating these mechanisms in the context of nucleosomes rather than just at the histone level and present current and developing approaches for such studies. Overall, research on histone modifications has yielded great mechanistic insights into the regulation of genomic functions, and extending these studies using nucleosomes will further elucidate the complexity of these pathways in a more physiologically relevant context.

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.

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

Science.gov (United States)

Chang, Yi-Pin; Chu, Yen-Ho

2014-05-16

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

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

NARCIS (Netherlands)

Faigle, U.; Hurink, Johann L.

2010-01-01

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

Geometry through history Euclidean, hyperbolic, and projective geometries

CERN Document Server

Dillon, Meighan I

2018-01-01

Presented as an engaging discourse, this textbook invites readers to delve into the historical origins and uses of geometry. The narrative traces the influence of Euclid’s system of geometry, as developed in his classic text The Elements, through the Arabic period, the modern era in the West, and up to twentieth century mathematics. Axioms and proof methods used by mathematicians from those periods are explored alongside the problems in Euclidean geometry that lead to their work. Students cultivate skills applicable to much of modern mathematics through sections that integrate concepts like projective and hyperbolic geometry with representative proof-based exercises. For its sophisticated account of ancient to modern geometries, this text assumes only a year of college mathematics as it builds towards its conclusion with algebraic curves and quaternions. Euclid’s work has affected geometry for thousands of years, so this text has something to offer to anyone who wants to broaden their appreciation for the...

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

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.

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)

Gravity is Geometry.

Science.gov (United States)

MacKeown, P. K.

1984-01-01

Clarifies two concepts of gravity--those of a fictitious force and those of how space and time may have geometry. Reviews the position of Newton's theory of gravity in the context of special relativity and considers why gravity (as distinct from electromagnetics) lends itself to Einstein's revolutionary interpretation. (JN)

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

Two lectures on D-geometry and noncommutative geometry

International Nuclear Information System (INIS)

Douglas, M.R.

1999-01-01

This is a write-up of lectures given at the 1998 Spring School at the Abdus Salam ICTP. We give a conceptual introduction to D-geometry, the study of geometry as seen by D-branes in string theory, and to noncommutative geometry as it has appeared in D-brane and Matrix theory physics. (author)

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

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

Science.gov (United States)

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

2010-12-14

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

Twistor geometry

NARCIS (Netherlands)

van den Broek, P.M.

1984-01-01

The aim of this paper is to give a detailed exposition of the relation between the geometry of twistor space and the geometry of Minkowski space. The paper has a didactical purpose; no use has been made of differential geometry and cohomology.

Variation in computer time with geometry prescription in monte carlo code KENO-IV

International Nuclear Information System (INIS)

Gopalakrishnan, C.R.

1988-01-01

In most studies, the Monte Carlo criticality code KENO-IV has been compared with other Monte Carlo codes, but evaluation of its performance with different box descriptions has not been done so far. In Monte Carlo computations, any fractional savings of computing time is highly desirable. Variation in computation time with box description in KENO for two different fast reactor fuel subassemblies of FBTR and PFBR is studied. The K eff of an infinite array of fuel subassemblies is calculated by modelling the subassemblies in two different ways (i) multi-region, (ii) multi-box. In addition to these two cases, excess reactivity calculations of FBTR are also performed in two ways to study this effect in a complex geometry. It is observed that the K eff values calculated by multi-region and multi-box models agree very well. However the increase in computation time from the multi-box to the multi-region is considerable, while the difference in computer storage requirements for the two models is negligible. This variation in computing time arises from the way the neutron is tracked in the two cases. (author)

Geometry

Indian Academy of Sciences (India)

. In the previous article we looked at the origins of synthetic and analytic geometry. More practical minded people, the builders and navigators, were studying two other aspects of geometry- trigonometry and integral calculus. These are actually ...

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.

About the use of approximations, which ensure materials mass balance conservation by spatial meshes, in Sn full core calculations

International Nuclear Information System (INIS)

Voloshchenko, A.M.; Russkov, A.A.; Gurevich, M.I.; Olejnik, D.S.

2008-01-01

One analyzes a possibility to make use of the geometry approximations conserving the materials mass local balance in every mesh via adding of mixtures in the meshes containing several feed materials to perform the kinetic calculation of the reactor core neutron fields. To set the 3D-geometry of the reactor core one makes use of the combinatorial geometry methods implemented in the MCI Program to solve the diffusivity equations by the Monte Carlo method, to convert the combinatorial prescribing of the geometry into the mesh representation - the ray tracing method. According to the calculations of the WWER-1000 reactor core and the simulations of the spent fuel storage facility, the described procedure compares favorably with the conventional geometry approximations [ru

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

Czech Academy of Sciences Publication Activity Database

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

2011-01-01

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

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

NARCIS (Netherlands)

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

2014-01-01

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

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

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.

Estimating meme fitness in adaptive memetic algorithms for combinatorial problems.

Science.gov (United States)

Smith, J E

2012-01-01

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

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

Science.gov (United States)

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

2017-07-19

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

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

Directory of Open Access Journals (Sweden)

Jenny Rivers

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

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

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.

Towards combinatorial spectroscopy: the case of minor milk fatty acids determination.

Science.gov (United States)

Stefanov, I; Baeten, V; De Baets, B; Fievez, V

2013-08-15

Chemometrical models for determination of milk fatty acids (FA) are typically developed using spectral data from a single spectroscopy technique, e.g., mid-infrared spectroscopy in milk control. Such models perform poorly in determining minor components and are highly dependent on the spectral data source and on the type of matrix. In milk fat, the unsuccessful determination of minor (fatty acids lower than 1.0 g/100g in total fat) FA is often the result of: (1) the molecular structure similarity between the minor and the major FA within the milk fat matrix (thus the chemical signature specific to individual fatty acids has restricted specificity), and (2) the low signal intensity (detection limit) for specific vibrational modes. To overcome these limitations, data from different types of spectroscopy techniques, which brings additional chemical information in relation to the variation of the FA, could be included in the regression models to improve quantification. Here, Fourier transform (FT) Raman spectra were concatenated with attenuated total reflectance FT infrared (ATR/FTIR) spectra. The new combinatorial models showed up to 25% decrease in the root mean squared error of cross-validation (RMSECV) values, accompanied with a higher Rcv(2) for most individual FA or sums of FA groups, as compared to regression models based on Raman only or ATR/FTIR only spectra. In addition, improved models included less PLS components indicating an increased robustness. Interpretation of the most contributing regression coefficients indicated the value of newly combined spectral regions as carriers of specific chemical information. Although requiring additional spectroscopy instrumentation and prolonged acquisition time, this new combinatorial approach can be automated and is sufficient for semi-routine determination of the milk FA profile. Copyright © 2013 Elsevier B.V. All rights reserved.

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

Molecular geometry

CERN Document Server

Rodger, Alison

1995-01-01

Molecular Geometry discusses topics relevant to the arrangement of atoms. The book is comprised of seven chapters that tackle several areas of molecular geometry. Chapter 1 reviews the definition and determination of molecular geometry, while Chapter 2 discusses the unified view of stereochemistry and stereochemical changes. Chapter 3 covers the geometry of molecules of second row atoms, and Chapter 4 deals with the main group elements beyond the second row. The book also talks about the complexes of transition metals and f-block elements, and then covers the organometallic compounds and trans

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.

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.

Physics and geometry

International Nuclear Information System (INIS)

Konopleva, N.P.

2009-01-01

The basic ideas of description methods of physical fields and elementary particle interactions are discussed. One of such ideas is the conception of space-time geometry. In this connection experimental measurement methods are analyzed. It is shown that measure procedures are the origin of geometrical axioms. The connection between space symmetry properties and the conservation laws is considered

Symplectic and Poisson Geometry in Interaction with Analysis, Algebra and Topology & Symplectic Geometry, Noncommutative Geometry and Physics

CERN Document Server

Eliashberg, Yakov; Maeda, Yoshiaki; Symplectic, Poisson, and Noncommutative geometry

2014-01-01

Symplectic geometry originated in physics, but it has flourished as an independent subject in mathematics, together with its offspring, symplectic topology. Symplectic methods have even been applied back to mathematical physics. Noncommutative geometry has developed an alternative mathematical quantization scheme based on a geometric approach to operator algebras. Deformation quantization, a blend of symplectic methods and noncommutative geometry, approaches quantum mechanics from a more algebraic viewpoint, as it addresses quantization as a deformation of Poisson structures. This volume contains seven chapters based on lectures given by invited speakers at two May 2010 workshops held at the Mathematical Sciences Research Institute: Symplectic and Poisson Geometry in Interaction with Analysis, Algebra and Topology (honoring Alan Weinstein, one of the key figures in the field) and Symplectic Geometry, Noncommutative Geometry and Physics. The chapters include presentations of previously unpublished results and ...

Physical meaning of the optical reference geometry

International Nuclear Information System (INIS)

Abramowicz, M.A.

1990-09-01

I show that contrary to a popular misconception the optical reference geometry, introduced a few years ago as a formally possible metric of a 3-space corresponding to a static spacetime, is quite satisfactory also from the physical point of view. The optical reference geometry has a clear physical meaning, as it may be constructed experimentally by measuring light round travel time between static observers. Distances and directions in the optical reference geometry are more strongly connected to experiment than distances and directions in the widely used directly projected metric (discussed e.g. in Landau and Lifshitz textbook. In addition, the optical reference geometry is more natural and convenient than the directly projected one in application to dynamics. In the optical geometry dynamical behaviour of matter is described by concepts and formulae identical to those well known in Newtonian dynamics on a given two dimensional (curved) surface. (author). 22 refs

A Geometry in which all Triangles are Isosceles

Indian Academy of Sciences (India)

The real number line has a geometry which is Euclidean. Imagine a small pygmy tortoise trying to travel along a very long path; assume that its destination is at a very ..... are: geometry of space-time at small distances; classi- cal and quantum ...

Application of the nodal method RTN-0 for the solution of the neutron diffusion equation dependent of time in hexagonal-Z geometry

International Nuclear Information System (INIS)

Esquivel E, J.; Alonso V, G.; Del Valle G, E.

2015-09-01

The solution of the neutron diffusion equation either for reactors in steady state or time dependent, is obtained through approximations generated by implementing of nodal methods such as RTN-0 (Raviart-Thomas-Nedelec of zero index), which is used in this study. Since the nodal methods are applied in quadrangular geometries, in this paper a technique in which the hexagonal geometry through the transfinite interpolation of Gordon-Hall becomes the appropriate geometry to make use of the nodal method RTN-0 is presented. As a result, a computer program was developed, whereby is possible to obtain among other results the neutron multiplication effective factor (k eff ), and the distribution of radial and/or axial power. To verify the operation of the code, was applied to three benchmark problems: in the first two reactors VVER and FBR, results k eff and power distribution are obtained, considering the steady state case of reactor; while the third problem a type VVER is analyzed, in its case dependent of time, which qualitative results are presented on the behavior of the reactor power. (Author)

Arbitrariness of geometry and the aether

International Nuclear Information System (INIS)

Browne, P.F.

1976-01-01

As emphasized by Milne, an observer ultimately depends on the transmission and reception of light signals for the measurement of natural lengths and periods remote from his world point. The laws of geometry which are obeyed when these lengths and periods are plotted on a space--time depend, inevitably, on assumptions concerning the dependence of light velocity on the spatial and temporal coordinates. A convention regarding light velocity fixes the geometry, and conversely. However, the convention of flat space--time implies nonintegrable ''radar distances'' unless the concept of coordinate-dependent units of measure is employed. Einstein's space--time has the advantage of admitting a special reference system R with respect to which the aether fluid is at rest and the total gravitational field vanishes. A holonomic transformation from R to another reference system R belonging to the same space--time introduces a nonpermanent gravitational field and holonomic aether motion. A nonholonomic transformation from R to a reference system R* which belongs to a different space--time introduces a permanent gravitational field and nonholonomic aether motion. The arbitrariness of geometry is expressed by extending covariance to include the latter transformation. By means of a nonholonomic (or units) transformation it is possible, with the aid of the principle of equivalence, to obtain the Schwarzschild and de Sitter metrics from the Newtonian fields that would arise in a flat space--time description. Some light is thrown on the interpretation of cosmological models

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

OpenAIRE

Seo, Seunghyun

2004-01-01

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

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

Directory of Open Access Journals (Sweden)

Iman Yousefi

2015-01-01

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

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.

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

Energy Technology Data Exchange (ETDEWEB)

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

2007-09-01

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

Advances in bio-inspired computing for combinatorial optimization problems

CERN Document Server

Pintea, Camelia-Mihaela

2013-01-01

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

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

Science.gov (United States)

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

2018-05-01

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

Synthesis of 2,4-disubstituted thiazole combinatorial unit on solid-phase: microwave assisted conversion of alcohol to amine monitored by FT-IR

International Nuclear Information System (INIS)

Antonow, Dyeison; Eifler-Lima, Vera Lucia; Mahler, S. Graciela; Serra, Gloria L.; Manta, Eduardo

2005-01-01

Microwave-assisted solid-phase synthesis of the 2,4-disubstituted thiazole 3 on Merrifield Resin is described. The hydroxyl moiety was converted to amine in five steps - including coupling and cleavage - within a total reaction time of 2 hours and 26% overall yield. The entire solid-phase synthesis was efficiently monitored by FT-IR/KBr pellets and allows potential use in combinatorial chemistry. (author)

Arithmetic noncommutative geometry

CERN Document Server

Marcolli, Matilde

2005-01-01

Arithmetic noncommutative geometry denotes the use of ideas and tools from the field of noncommutative geometry, to address questions and reinterpret in a new perspective results and constructions from number theory and arithmetic algebraic geometry. This general philosophy is applied to the geometry and arithmetic of modular curves and to the fibers at archimedean places of arithmetic surfaces and varieties. The main reason why noncommutative geometry can be expected to say something about topics of arithmetic interest lies in the fact that it provides the right framework in which the tools of geometry continue to make sense on spaces that are very singular and apparently very far from the world of algebraic varieties. This provides a way of refining the boundary structure of certain classes of spaces that arise in the context of arithmetic geometry, such as moduli spaces (of which modular curves are the simplest case) or arithmetic varieties (completed by suitable "fibers at infinity"), by adding boundaries...

Dynamic bridge-finding in õ(log² n) amortized time

DEFF Research Database (Denmark)

Holm, Jacob; Rotenberg, Eva; Thorup, Mikkel

2018-01-01

2000], which was a bittrick-based improvement on the O((log n)4) amortized time algorithm by Holm et al.[STOC98, JACM2001]. Our approach is based on a different and purely combinatorial improvement of the algorithim of Holm et al., which by itself gives a new combinatorial

Low Complexity Connectivity Driven Dynamic Geometry Compression for 3D Tele-Immersion

NARCIS (Netherlands)

R.N. Mekuria (Rufael); D.C.A. Bulterman (Dick); P.S. Cesar Garcia (Pablo Santiago)

2014-01-01

htmlabstractGeometry based 3D Tele-Immersion is a novel emerging media application that involves on the fly reconstructed 3D mesh geometry. To enable real-time communication of such live reconstructed mesh geometry over a bandwidth limited link, fast dynamic geometry compression is needed. However,

Higher geometry an introduction to advanced methods in analytic geometry

CERN Document Server

Woods, Frederick S

2005-01-01

For students of mathematics with a sound background in analytic geometry and some knowledge of determinants, this volume has long been among the best available expositions of advanced work on projective and algebraic geometry. Developed from Professor Woods' lectures at the Massachusetts Institute of Technology, it bridges the gap between intermediate studies in the field and highly specialized works.With exceptional thoroughness, it presents the most important general concepts and methods of advanced algebraic geometry (as distinguished from differential geometry). It offers a thorough study

Torus actions and their applications in topology and combinatorics

CERN Document Server

Buchstaber, Victor M

2002-01-01

The book presents the study of torus actions on topological spaces is presented as a bridge connecting combinatorial and convex geometry with commutative and homological algebra, algebraic geometry, and topology. This established link helps in understanding the geometry and topology of a space with torus action by studying the combinatorics of the space of orbits. Conversely, subtle properties of a combinatorial object can be realized by interpreting it as the orbit structure for a proper manifold or as a complex acted on by a torus. The latter can be a symplectic manifold with Hamiltonian torus action, a toric variety or manifold, a subspace arrangement complement, etc., while the combinatorial objects include simplicial and cubical complexes, polytopes, and arrangements. This approach also provides a natural topological interpretation in terms of torus actions of many constructions from commutative and homological algebra used in combinatorics. The exposition centers around the theory of moment-angle comple...

Dayside merging and cusp geometry

International Nuclear Information System (INIS)

Crooker, N.U.

1979-01-01

Geometrical considerations are presented to show that dayside magnetic merging when constrained to act only where the fields are antiparallel results in lines of merging that converge at the polar cusps. An important consequence of this geometry is that no accelerated flows are predicted across the dayside magnetopause. Acceleration owing to merging acts in opposition to the magnetosheath flow at the merging point and produces the variably directed, slower-than-magnetosheath flows observed in the entry layer. Another consequence of the merging geometry is that much of the time closed field lines constitute the subsolar region of the magnetopause. The manner in which the polar cap convection patterns predicted by the proposed geometry change as the interplanetary field is rotated through 360 0 provides a unifying description of how the observed single circular vortex and the crescent-shaped double vortex patterns mutually evolve under the influence of a single operating principle

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.

Non-Riemannian geometry

CERN Document Server

Eisenhart, Luther Pfahler

2005-01-01

This concise text by a prominent mathematician deals chiefly with manifolds dominated by the geometry of paths. Topics include asymmetric and symmetric connections, the projective geometry of paths, and the geometry of sub-spaces. 1927 edition.

The Geometry Conference

CERN Document Server

Bárány, Imre; Vilcu, Costin

2016-01-01

This volume presents easy-to-understand yet surprising properties obtained using topological, geometric and graph theoretic tools in the areas covered by the Geometry Conference that took place in Mulhouse, France from September 7–11, 2014 in honour of Tudor Zamfirescu on the occasion of his 70th anniversary. The contributions address subjects in convexity and discrete geometry, in distance geometry or with geometrical flavor in combinatorics, graph theory or non-linear analysis. Written by top experts, these papers highlight the close connections between these fields, as well as ties to other domains of geometry and their reciprocal influence. They offer an overview on recent developments in geometry and its border with discrete mathematics, and provide answers to several open questions. The volume addresses a large audience in mathematics, including researchers and graduate students interested in geometry and geometrical problems.

Hyperbolic geometry

CERN Document Server

Iversen, Birger

1992-01-01

Although it arose from purely theoretical considerations of the underlying axioms of geometry, the work of Einstein and Dirac has demonstrated that hyperbolic geometry is a fundamental aspect of modern physics

Rapid mapping of protein functional epitopes by combinatorial alanine scanning

OpenAIRE

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

2000-01-01

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

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

Directory of Open Access Journals (Sweden)

E. Osaba

2014-01-01

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

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

Science.gov (United States)

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

2014-01-01

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

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

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

A Combinatorial Approach to Time Asymmetry

Directory of Open Access Journals (Sweden)

Martin Tamm

2016-03-01

Full Text Available In this paper, simple models for the multiverse are analyzed. Each universe is viewed as a path in a graph, and by considering very general statistical assumptions, essentially originating from Boltzmann, we can make the set of all such paths into a finite probability space. We can then also attempt to compute the probabilities for different kinds of behavior and in particular under certain conditions argue that an asymmetric behavior of the entropy should be much more probable than a symmetric one. This offers an explanation for the asymmetry of time as a broken symmetry in the multiverse. The focus here is on simple models which can be analyzed using methods from combinatorics. Although the computational difficulties rapidly become enormous when the size of the model grows, this still gives hints about how a full-scale model should behave.

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

Science.gov (United States)

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

2014-01-07

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

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

International Nuclear Information System (INIS)

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

2011-01-01

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

Combinatorial process optimization for negative photo-imageable spin-on dielectrics and investigation of post-apply bake and post-exposure bake interactions

Science.gov (United States)

Kim, Jihoon; Zhang, Ruzhi M.; Wolfer, Elizabeth; Patel, Bharatkumar K.; Toukhy, Medhat; Bogusz, Zachary; Nagahara, Tatsuro

2012-03-01

Patternable dielectric materials were developed and introduced to reduce semiconductor manufacturing complexity and cost of ownership (CoO). However, the bestowed dual functionalities of photo-imageable spin-on dielectrics (PSOD) put great challenges on the material design and development. In this work, we investigated the combinatorial process optimization for the negative-tone PSOD lithography by employing the Temperature Gradient Plate (TGP) technique which significantly reduced the numbers of wafers processed and minimized the developmental time. We demonstrated that this TGP combinatorial is very efficient at evaluating the effects and interactions of several independent variables such as post-apply bake (PAB) and post-exposure bake (PEB). Unlike most of the conventional photoresists, PAB turned out to have a great effect on the PSOD pattern profiles. Based on our extensive investigation, we observed great correlation between PAB and PEB processes. In this paper, we will discuss the variation of pattern profiles as a matrix of PAB and PEB and propose two possible cross-linking mechanisms for the PSOD materials to explain the unusual experimental results.

On organizing principles of discrete differential geometry. Geometry of spheres

International Nuclear Information System (INIS)

Bobenko, Alexander I; Suris, Yury B

2007-01-01

Discrete differential geometry aims to develop discrete equivalents of the geometric notions and methods of classical differential geometry. This survey contains a discussion of the following two fundamental discretization principles: the transformation group principle (smooth geometric objects and their discretizations are invariant with respect to the same transformation group) and the consistency principle (discretizations of smooth parametrized geometries can be extended to multidimensional consistent nets). The main concrete geometric problem treated here is discretization of curvature-line parametrized surfaces in Lie geometry. Systematic use of the discretization principles leads to a discretization of curvature-line parametrization which unifies circular and conical nets.

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.

Riemannian geometry and geometric analysis

CERN Document Server

Jost, Jürgen

2017-01-01

This established reference work continues to provide its readers with a gateway to some of the most interesting developments in contemporary geometry. It offers insight into a wide range of topics, including fundamental concepts of Riemannian geometry, such as geodesics, connections and curvature; the basic models and tools of geometric analysis, such as harmonic functions, forms, mappings, eigenvalues, the Dirac operator and the heat flow method; as well as the most important variational principles of theoretical physics, such as Yang-Mills, Ginzburg-Landau or the nonlinear sigma model of quantum field theory. The present volume connects all these topics in a systematic geometric framework. At the same time, it equips the reader with the working tools of the field and enables her or him to delve into geometric research.  The 7th edition has been systematically reorganized and updated. Almost no page has been left unchanged. It also includes new material, for instance on symplectic geometry, as well as the B...

Dihomotopy classes of dipaths in the geometric realization of a cubical set: from discrete to continuous and back again

DEFF Research Database (Denmark)

Fajstrup, Lisbeth

2005-01-01

model and give the corresponding discrete objects. We prove that this is in fact the case for the models considered: Each dipath is dihomotopic to a combinatorial dipath and if two combinatorial dipaths are dihomotopic, then they are combinatorially equivalent. Moreover, the notions of dihomotopy (LF......The geometric models of concurrency - Dijkstra's PV-models and V. Pratt's Higher Dimensional Automata - rely on a translation of discrete or algebraic information to geometry. In both these cases, the translation is the geometric realisation of a semi cubical complex, which is then a locally...... partially ordered space, an lpo space. The aim is to use the algebraic topology machinery, suitably adapted to the fact that there is a preferred time direction. Then the results - for instance dihomotopy classes of dipaths, which model the number of inequivalent computations should be used on the discrete...

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

Geometry and its applications

CERN Document Server

Meyer, Walter J

2006-01-01

Meyer''s Geometry and Its Applications, Second Edition, combines traditional geometry with current ideas to present a modern approach that is grounded in real-world applications. It balances the deductive approach with discovery learning, and introduces axiomatic, Euclidean geometry, non-Euclidean geometry, and transformational geometry. The text integrates applications and examples throughout and includes historical notes in many chapters. The Second Edition of Geometry and Its Applications is a significant text for any college or university that focuses on geometry''s usefulness in other disciplines. It is especially appropriate for engineering and science majors, as well as future mathematics teachers.* Realistic applications integrated throughout the text, including (but not limited to): - Symmetries of artistic patterns- Physics- Robotics- Computer vision- Computer graphics- Stability of architectural structures- Molecular biology- Medicine- Pattern recognition* Historical notes included in many chapters...

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

Science.gov (United States)

Dibó, Gábor

2012-02-01

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

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.

Beautiful geometry

CERN Document Server

Maor, Eli

2014-01-01

If you've ever thought that mathematics and art don't mix, this stunning visual history of geometry will change your mind. As much a work of art as a book about mathematics, Beautiful Geometry presents more than sixty exquisite color plates illustrating a wide range of geometric patterns and theorems, accompanied by brief accounts of the fascinating history and people behind each. With artwork by Swiss artist Eugen Jost and text by acclaimed math historian Eli Maor, this unique celebration of geometry covers numerous subjects, from straightedge-and-compass constructions to intriguing configur

Analytic theory of the energy and time independent particle transport in the plane geometry

International Nuclear Information System (INIS)

Simovic, R.D.

2001-01-01

An analytic investigation of the energy and time independent particle transport in the plane geometry described by a common anisotropic scattering function is carried out. Regarding the particles with specific diffusion histories in the infinite or the semi-infinite medium, new exact solutions of the corresponding transport equations are analytically derived by means of the Fourier inversion technique. Two particular groups of particles scattered after each successive collision into the directions μ 0, were considered. Its Fourier transformed transport equations have solutions without logarithmic singular points, in the upper part or the lower part of the complex k-plane. The Fourier inversion of solutions are carried out analytically and the obtained formulae represents valid generalization of the expressions for the flux of once scattered particles. (author)

Analytical study on optically measured surface profiles of referential geometry using a finite-difference time-domain method

International Nuclear Information System (INIS)

Fujii, A; Hayashi, S; Fujii, S; Yanagi, K

2014-01-01

This paper deals with the functional performance of optical surface texture measuring instruments on the market. It is well known that their height response curves against certain referential geometry are not always identical to each other. So, a more precise study on the optical instrument's characteristics is greatly needed. Firstly, we developed a new simulation tool using a finite-difference time-domain technique, which enables the prediction of the height response curve against the fundamental surface geometry in the case of the confocal laser scanning microscope. Secondly, by utilizing this new simulation tool, measurement results, including outliers, were compared with the analytical simulation results. The comparison showed the consistency, which indicates that necessary conditions of surface measurement standards for verifying the instrument performance can be established. Consequently, we suggest that the maximum measurable slope angle must be added to evaluation subjects as significant metrological characteristics of measuring instruments, along with the lateral period limit. Finally, we propose a procedure to determine the lateral period limit in an ISO standard. (paper)

Combinatorial differential geometry and ideal Bianchi-Ricci identities

Czech Academy of Sciences Publication Activity Database

Janyška, J.; Markl, Martin

2011-01-01

Roč. 11, č. 3 (2011), s. 509-540 ISSN 1615-715X R&D Projects: GA ČR GA201/08/0397 Institutional research plan: CEZ:AV0Z10190503 Keywords : Natural operator * linear connection * reduction theorem Subject RIV: BA - General Mathematics Impact factor: 0.338, year: 2011 http://www.degruyter.com/view/j/advg.2011.11.issue-3/advgeom.2011.017/advgeom.2011.017. xml

Combinatorial differential geometry and ideal Bianchi-Ricci identities

Czech Academy of Sciences Publication Activity Database

Janyška, J.; Markl, Martin

2011-01-01

Roč. 11, č. 3 (2011), s. 509-540 ISSN 1615-715X R&D Projects: GA ČR GA201/08/0397 Institutional research plan: CEZ:AV0Z10190503 Keywords : Natural operator * linear connection * reduction theorem Subject RIV: BA - General Mathematics Impact factor: 0.338, year: 2011 http://www.degruyter.com/view/j/advg.2011.11.issue-3/advgeom.2011.017/advgeom.2011.017.xml

Freudenthal duality and generalized special geometry

Energy Technology Data Exchange (ETDEWEB)

Ferrara, Sergio, E-mail: sergio.ferrara@cern.ch [Physics Department, Theory Unit, CERN, CH-1211, Geneva 23 (Switzerland); INFN - Laboratori Nazionali di Frascati, Via Enrico Fermi 40, I-00044 Frascati (Italy); Marrani, Alessio, E-mail: Alessio.Marrani@cern.ch [Physics Department, Theory Unit, CERN, CH-1211, Geneva 23 (Switzerland); Yeranyan, Armen, E-mail: ayeran@lnf.infn.it [INFN - Laboratori Nazionali di Frascati, Via Enrico Fermi 40, I-00044 Frascati (Italy); Department of Physics, Yerevan State University, Alex Manoogian St. 1, Yerevan, 0025 (Armenia)

2011-07-27

Freudenthal duality, introduced in Borsten et al. (2009) and defined as an anti-involution on the dyonic charge vector in d=4 space-time dimensions for those dualities admitting a quartic invariant, is proved to be a symmetry not only of the classical Bekenstein-Hawking entropy but also of the critical points of the black hole potential. Furthermore, Freudenthal duality is extended to any generalized special geometry, thus encompassing all N>2 supergravities, as well as N=2 generic special geometry, not necessarily having a coset space structure.

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

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.

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

Science.gov (United States)

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

2003-01-01

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

Spacetime and Euclidean geometry

Science.gov (United States)

Brill, Dieter; Jacobson, Ted

2006-04-01

Using only the principle of relativity and Euclidean geometry we show in this pedagogical article that the square of proper time or length in a two-dimensional spacetime diagram is proportional to the Euclidean area of the corresponding causal domain. We use this relation to derive the Minkowski line element by two geometric proofs of the spacetime Pythagoras theorem.

Analogy and Dynamic Geometry System Used to Introduce Three-Dimensional Geometry

Science.gov (United States)

Mammana, M. F.; Micale, B.; Pennisi, M.

2012-01-01

We present a sequence of classroom activities on Euclidean geometry, both plane and space geometry, used to make three dimensional geometry more catchy and simple. The activity consists of a guided research activity that leads the students to discover unexpected properties of two apparently distant geometrical entities, quadrilaterals and…

Cellular neural network to the spherical harmonics approximation of neutron transport equation in x-y geometry. Part I: Modeling and verification for time-independent solution

International Nuclear Information System (INIS)

Pirouzmand, Ahmad; Hadad, Kamal

2011-01-01

Highlights: → This paper describes the solution of time-independent neutron transport equation. → Using a novel method based on cellular neural networks (CNNs) coupled with P N method. → Utilize the CNN model to simulate spatial scalar flux distribution in steady state. → The accuracy, stability, and capabilities of CNN model are examined in x-y geometry. - Abstract: This paper describes a novel method based on using cellular neural networks (CNN) coupled with spherical harmonics method (P N ) to solve the time-independent neutron transport equation in x-y geometry. To achieve this, an equivalent electrical circuit based on second-order form of neutron transport equation and relevant boundary conditions is obtained using CNN method. We use the CNN model to simulate spatial response of scalar flux distribution in the steady state condition for different order of spherical harmonics approximations. The accuracy, stability, and capabilities of CNN model are examined in 2D Cartesian geometry for fixed source and criticality problems.

Information geometry

CERN Document Server

Ay, Nihat; Lê, Hông Vân; Schwachhöfer, Lorenz

2017-01-01

The book provides a comprehensive introduction and a novel mathematical foundation of the field of information geometry with complete proofs and detailed background material on measure theory, Riemannian geometry and Banach space theory. Parametrised measure models are defined as fundamental geometric objects, which can be both finite or infinite dimensional. Based on these models, canonical tensor fields are introduced and further studied, including the Fisher metric and the Amari-Chentsov tensor, and embeddings of statistical manifolds are investigated. This novel foundation then leads to application highlights, such as generalizations and extensions of the classical uniqueness result of Chentsov or the Cramér-Rao inequality. Additionally, several new application fields of information geometry are highlighted, for instance hierarchical and graphical models, complexity theory, population genetics, or Markov Chain Monte Carlo. The book will be of interest to mathematicians who are interested in geometry, inf...

Novel Combinatory Approaches to Repair Visual System after Optic Nerve Damage

Science.gov (United States)

2014-09-01

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

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

Science.gov (United States)

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

2017-11-02

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

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…

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

Science.gov (United States)

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

2011-08-24

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

Combinatorial 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

Geometry and Hamiltonian mechanics on discrete spaces

International Nuclear Information System (INIS)

Talasila, V; Clemente-Gallardo, J; Schaft, A J van der

2004-01-01

Numerical simulation is often crucial for analysing the behaviour of many complex systems which do not admit analytic solutions. To this end, one either converts a 'smooth' model into a discrete (in space and time) model, or models systems directly at a discrete level. The goal of this paper is to provide a discrete analogue of differential geometry, and to define on these discrete models a formal discrete Hamiltonian structure-in doing so we try to bring together various fundamental concepts from numerical analysis, differential geometry, algebraic geometry, simplicial homology and classical Hamiltonian mechanics. For example, the concept of a twisted derivation is borrowed from algebraic geometry for developing a discrete calculus. The theory is applied to a nonlinear pendulum and we compare the dynamics obtained through a discrete modelling approach with the dynamics obtained via the usual discretization procedures. Also an example of an energy-conserving algorithm on a simple harmonic oscillator is presented, and its effect on the Poisson structure is discussed

Methods of algebraic geometry in control theory

CERN Document Server

Falb, Peter

1999-01-01

"Control theory represents an attempt to codify, in mathematical terms, the principles and techniques used in the analysis and design of control systems. Algebraic geometry may, in an elementary way, be viewed as the study of the structure and properties of the solutions of systems of algebraic equations. The aim of this book is to provide access to the methods of algebraic geometry for engineers and applied scientists through the motivated context of control theory" .* The development which culminated with this volume began over twenty-five years ago with a series of lectures at the control group of the Lund Institute of Technology in Sweden. I have sought throughout to strive for clarity, often using constructive methods and giving several proofs of a particular result as well as many examples. The first volume dealt with the simplest control systems (i.e., single input, single output linear time-invariant systems) and with the simplest algebraic geometry (i.e., affine algebraic geometry). While this is qui...

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.

Digital atom interferometer with single particle control on a discretized space-time geometry.

Science.gov (United States)

Steffen, Andreas; Alberti, Andrea; Alt, Wolfgang; Belmechri, Noomen; Hild, Sebastian; Karski, Michał; Widera, Artur; Meschede, Dieter

2012-06-19

Engineering quantum particle systems, such as quantum simulators and quantum cellular automata, relies on full coherent control of quantum paths at the single particle level. Here we present an atom interferometer operating with single trapped atoms, where single particle wave packets are controlled through spin-dependent potentials. The interferometer is constructed from a sequence of discrete operations based on a set of elementary building blocks, which permit composing arbitrary interferometer geometries in a digital manner. We use this modularity to devise a space-time analogue of the well-known spin echo technique, yielding insight into decoherence mechanisms. We also demonstrate mesoscopic delocalization of single atoms with a separation-to-localization ratio exceeding 500; this result suggests their utilization beyond quantum logic applications as nano-resolution quantum probes in precision measurements, being able to measure potential gradients with precision 5 x 10(-4) in units of gravitational acceleration g.

Electro-optic sampling at 90 degree interaction geometry for time-of-arrival stamping of ultrafast relativistic electron diffraction

OpenAIRE

C. M. Scoby; P. Musumeci; J. T. Moody; M. S. Gutierrez

2010-01-01

In this paper we study a new geometry setup for electro-optic sampling (EOS) where the electron beam runs parallel to the ⟨110⟩ face of a ZnTe crystal and the probe laser is perpendicular to it and to the beam path. The simple setup is used to encode the time-of-arrival information of a 3.5  MeV

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

The Syntax of Time and Space Primitives in French.

Science.gov (United States)

Peeters, Bert

1997-01-01

Explores the combinatorial possibilities of semantic primitives of time and space in French, as defined in the theory of Natural Semantic Metalanguage. Highlights the need for new ways to express the allolexical relationship in some combinations, particularly those expressing "when/time." (Author/MSE)

Riemann-Christoffel Tensor in Differential Geometry of Fractional Order Application to Fractal Space-Time

Science.gov (United States)

Jumarie, Guy

2013-04-01

By using fractional differences, one recently proposed an alternative to the formulation of fractional differential calculus, of which the main characteristics is a new fractional Taylor series and its companion Rolle's formula which apply to non-differentiable functions. The key is that now we have at hand a differential increment of fractional order which can be manipulated exactly like in the standard Leibniz differential calculus. Briefly the fractional derivative is the quotient of fractional increments. It has been proposed that this calculus can be used to construct a differential geometry on manifold of fractional order. The present paper, on the one hand, refines the framework, and on the other hand, contributes some new results related to arc length of fractional curves, area on fractional differentiable manifold, covariant fractal derivative, Riemann-Christoffel tensor of fractional order, fractional differential equations of fractional geodesic, strip modeling of fractal space time and its relation with Lorentz transformation. The relation with Nottale's fractal space-time theory then appears in quite a natural way.

Geometry essentials for dummies

CERN Document Server

Ryan, Mark

2011-01-01

Just the critical concepts you need to score high in geometry This practical, friendly guide focuses on critical concepts taught in a typical geometry course, from the properties of triangles, parallelograms, circles, and cylinders, to the skills and strategies you need to write geometry proofs. Geometry Essentials For Dummies is perfect for cramming or doing homework, or as a reference for parents helping kids study for exams. Get down to the basics - get a handle on the basics of geometry, from lines, segments, and angles, to vertices, altitudes, and diagonals Conque

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.

General Relativity: Geometry Meets Physics

Science.gov (United States)

Thomsen, Dietrick E.

1975-01-01

Observing the relationship of general relativity and the geometry of space-time, the author questions whether the rest of physics has geometrical explanations. As a partial answer he discusses current research on subatomic particles employing geometric transformations, and cites the existence of geometrical definitions of physical quantities such…

Exploring Concepts of Geometry not Euclidean

Directory of Open Access Journals (Sweden)

Luiz Ambrozi

2016-02-01

Full Text Available With this article we intend to propose different situations of teaching and learning, how they can be applied in schools, mediated by the use of concrete materials and Geogebra software, emphasizing the use of technology in the classroom, that this proposal has the role of assisting in the conceptualization and identification of elements of non-Euclidean geometry. In addition, this short course is designed to be a time of current and continuing education for teachers, with activities to be developed with dynamic geometry and based on the theory of Conceptual Fields of Vergnaud.

Noncommutative Geometry, Quantum Fields and Motives

CERN Document Server

Connes, Alain

2007-01-01

The unifying theme of this book is the interplay among noncommutative geometry, physics, and number theory. The two main objects of investigation are spaces where both the noncommutative and the motivic aspects come to play a role: space-time, where the guiding principle is the problem of developing a quantum theory of gravity, and the space of primes, where one can regard the Riemann Hypothesis as a long-standing problem motivating the development of new geometric tools. The book stresses the relevance of noncommutative geometry in dealing with these two spaces. The first part of the book dea

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

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

Science.gov (United States)

Andriamanalimanana, Bruno R.

2004-08-01

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

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

Complex analysis and geometry

CERN Document Server

Silva, Alessandro

1993-01-01

The papers in this wide-ranging collection report on the results of investigations from a number of linked disciplines, including complex algebraic geometry, complex analytic geometry of manifolds and spaces, and complex differential geometry.

Hierarchical Cantor set in the large scale structure with torus geometry

Energy Technology Data Exchange (ETDEWEB)

Murdzek, R. [Physics Department, ' Al. I. Cuza' University, Blvd. Carol I, Nr. 11, Iassy 700506 (Romania)], E-mail: rmurdzek@yahoo.com

2008-12-15

The formation of large scale structures is considered within a model with string on toroidal space-time. Firstly, the space-time geometry is presented. In this geometry, the Universe is represented by a string describing a torus surface. Thereafter, the large scale structure of the Universe is derived from the string oscillations. The results are in agreement with the cellular structure of the large scale distribution and with the theory of a Cantorian space-time.

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

NARCIS (Netherlands)

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

2008-01-01

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

Combinatorial Models for Assembly and Decomposition of Products

Directory of Open Access Journals (Sweden)

A. N. Bojko

2015-01-01

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

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

OpenAIRE

Wang, Qi

2017-01-01

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

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

DEFF Research Database (Denmark)

Bundgaard, Peer

2006-01-01

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

What Diagrams Argue in Late Imperial Chinese Combinatorial Texts.

Science.gov (United States)

Bréard, Andrea

2015-01-01

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

Fabrication and characterization of thin-film phosphor combinatorial libraries

Science.gov (United States)

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

2002-05-01

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

The Common Evolution of Geometry and Architecture from a Geodetic Point of View

Science.gov (United States)

Bellone, T.; Fiermonte, F.; Mussio, L.

2017-05-01

Throughout history the link between geometry and architecture has been strong and while architects have used mathematics to construct their buildings, geometry has always been the essential tool allowing them to choose spatial shapes which are aesthetically appropriate. Sometimes it is geometry which drives architectural choices, but at other times it is architectural innovation which facilitates the emergence of new ideas in geometry. Among the best known types of geometry (Euclidean, projective, analytical, Topology, descriptive, fractal,…) those most frequently employed in architectural design are: - Euclidean Geometry - Projective Geometry - The non-Euclidean geometries. Entire architectural periods are linked to specific types of geometry. Euclidean geometry, for example, was the basis for architectural styles from Antiquity through to the Romanesque period. Perspective and Projective geometry, for their part, were important from the Gothic period through the Renaissance and into the Baroque and Neo-classical eras, while non-Euclidean geometries characterize modern architecture.