WorldWideScience

Sample records for twisted graph states

  1. Twisted boundary states and representation of generalized fusion algebra

    International Nuclear Information System (INIS)

    Ishikawa, Hiroshi; Tani, Taro

    2006-01-01

    The mutual consistency of boundary conditions twisted by an automorphism group G of the chiral algebra is studied for general modular invariants of rational conformal field theories. We show that a consistent set of twisted boundary states associated with any modular invariant realizes a non-negative integer matrix representation (NIM-rep) of the generalized fusion algebra, an extension of the fusion algebra by representations of the twisted chiral algebra associated with the automorphism group G. We check this result for several concrete cases. In particular, we find that two NIM-reps of the fusion algebra for su(3) k (k=3,5) are organized into a NIM-rep of the generalized fusion algebra for the charge-conjugation automorphism of su(3) k . We point out that the generalized fusion algebra is non-commutative if G is non-Abelian and provide some examples for G-bar S 3 . Finally, we give an argument that the graph fusion algebra associated with simple current extensions coincides with the generalized fusion algebra for the extended chiral algebra, and thereby explain that the graph fusion algebra contains the fusion algebra of the extended theory as a subalgebra

  2. Bell inequalities for graph states

    International Nuclear Information System (INIS)

    Toth, G.; Hyllus, P.; Briegel, H.J.; Guehne, O.

    2005-01-01

    Full text: In the last years graph states have attracted an increasing interest in the field of quantum information theory. Graph states form a family of multi-qubit states which comprises many popular states such as the GHZ states and the cluster states. They also play an important role in applications. For instance, measurement based quantum computation uses graph states as resources. From a theoretical point of view, it is remarkable that graph states allow for a simple description in terms of stabilizing operators. In this contribution, we investigate the non-local properties of graph states. We derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, any graph state violates at least one of the inequalities. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positively of the partial transpose or the geometric measure of entanglement. (author)

  3. Twisted boundary states in c=1 coset conformal field theories

    International Nuclear Information System (INIS)

    Ishikawa, Hiroshi; Yamaguchi, Atsushi

    2003-01-01

    We study the mutual consistency of twisted boundary conditions in the coset conformal field theory G/H. We calculate the overlap of the twisted boundary states of G/H with the untwisted ones, and show that the twisted boundary states are consistently defined in the charge-conjugation modular invariant. The overlap of the twisted boundary states is expressed by the branching functions of a twisted affine Lie algebra. As a check of our argument, we study the diagonal coset theory so(2n) 1 +so(2n) 1 /so(2n) 2 , which is equivalent to the orbifold S 1 /Z 2 at a particular radius. We construct the boundary states twisted by the automorphisms of the unextended Dynkin diagram of so(2n), and show their mutual consistency by identifying their counterpart in the orbifold. For the triality of so(8), the twisted states of the coset theory correspond to neither the Neumann nor the Dirichlet boundary states of the orbifold and yield conformal boundary states that preserve only the Virasoro algebra. (author)

  4. Quantum information processing with graph states

    International Nuclear Information System (INIS)

    Schlingemann, Dirk-Michael

    2005-04-01

    Graph states are multiparticle states which are associated with graphs. Each vertex of the graph corresponds to a single system or particle. The links describe quantum correlations (entanglement) between pairs of connected particles. Graph states were initiated independently by two research groups: On the one hand, graph states were introduced by Briegel and Raussendorf as a resource for a new model of one-way quantum computing, where algorithms are implemented by a sequence of measurements at single particles. On the other hand, graph states were developed by the author of this thesis and ReinhardWerner in Braunschweig, as a tool to build quantum error correcting codes, called graph codes. The connection between the two approaches was fully realized in close cooperation of both research groups. This habilitation thesis provides a survey of the theory of graph codes, focussing mainly, but not exclusively on the author's own research work. We present the theoretical and mathematical background for the analysis of graph codes. The concept of one-way quantum computing for general graph states is discussed. We explicitly show how to realize the encoding and decoding device of a graph code on a one-way quantum computer. This kind of implementation is to be seen as a mathematical description of a quantum memory device. In addition to that, we investigate interaction processes, which enable the creation of graph states on very large systems. Particular graph states can be created, for instance, by an Ising type interaction between next neighbor particles which sits at the points of an infinitely extended cubic lattice. Based on the theory of quantum cellular automata, we give a constructive characterization of general interactions which create a translationally invariant graph state. (orig.)

  5. Optical generation of matter qubit graph states

    International Nuclear Information System (INIS)

    Benjamin, S C; Eisert, J; Stace, T M

    2005-01-01

    We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple three-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network. Fusion of graph-state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph-state edges even as qubits elsewhere are measured, in a 'just in time' approach. An error analysis indicates that the scheme is relatively robust against imperfections in the apparatus

  6. Determining X-chains in graph states

    International Nuclear Information System (INIS)

    Wu, Jun-Yi; Kampermann, Hermann; Bruß, Dagmar

    2016-01-01

    The representation of graph states in the X-basis as well as the calculation of graph state overlaps can efficiently be performed by using the concept of X-chains (Wu et al 2015 Phys. Rev. A 92 012322). We present a necessary and sufficient criterion for X-chains and show that they can efficiently be determined by the Bareiss algorithm. An analytical approach for searching X-chain groups of a graph state is proposed. Furthermore we generalize the concept of X-chains to so-called Euler chains, whose induced subgraphs are Eulerian. This approach helps to determine if a given vertex set is an X-chain and we show how Euler chains can be used in the construction of multipartite Bell inequalities for graph states. (paper)

  7. Bound states on the lattice with partially twisted boundary conditions

    International Nuclear Information System (INIS)

    Agadjanov, D.; Guo, F.-K.; Ríos, G.; Rusetsky, A.

    2015-01-01

    We propose a method to study the nature of exotic hadrons by determining the wave function renormalization constant Z from lattice simulations. It is shown that, instead of studying the volume-dependence of the spectrum, one may investigate the dependence of the spectrum on the twisting angle, imposing twisted boundary conditions on the fermion fields on the lattice. In certain cases, e.g., the case of the DK bound state which is addressed in detail, it is demonstrated that the partial twisting is equivalent to the full twisting up to exponentially small corrections.

  8. Two-setting Bell inequalities for graph states

    International Nuclear Information System (INIS)

    Toth, Geza; Guehne, Otfried; Briegel, Hans J.

    2006-01-01

    We present Bell inequalities for graph states with a high violation of local realism. In particular, we show that there is a basic Bell inequality for every nontrivial graph state which is violated by the state at least by a factor of 2. This inequality needs the measurement of, at most, two operators for each qubit and involves only some of the qubits. We also show that for some families of graph states composite Bell inequalities can be constructed such that the violation of local realism increases exponentially with the number of qubits. We prove that some of our inequalities are facets of the convex polytope containing the many-body correlations consistent with local hidden variable models. Our Bell inequalities are built from stabilizing operators of graph states

  9. Two-colorable graph states with maximal Schmidt measure

    International Nuclear Information System (INIS)

    Severini, Simone

    2006-01-01

    The Schmidt measure was introduced by Eisert and Briegel for quantifying the degree of entanglement of multipartite quantum systems [J. Eisert, H.-J. Briegel, Phys. Rev. A 64 (2001) 22306]. For two-colorable graph states, the Schmidt measure is related to the spectrum of the associated graph. We observe that almost all two-colorable graph states have maximal Schmidt measure and we construct specific examples. By making appeal to a result of Ehrenfeucht et al. [A. Ehrenfeucht, T. Harju, G. Rozenberg, Discrete Math. 278 (2004) 45], we point out that the graph operations called local complementation and switching form a transitive group acting on the set of all graph states of a given dimension

  10. Greenberger-Horne-Zeilinger paradoxes from qudit graph states.

    Science.gov (United States)

    Tang, Weidong; Yu, Sixia; Oh, C H

    2013-03-08

    One fascinating way of revealing quantum nonlocality is the all-versus-nothing test due to Greenberger, Horne, and Zeilinger (GHZ) known as the GHZ paradox. So far genuine multipartite and multilevel GHZ paradoxes are known to exist only in systems containing an odd number of particles. Here we shall construct GHZ paradoxes for an arbitrary number (greater than 3) of particles with the help of qudit graph states on a special kind of graphs, called GHZ graphs. Furthermore, based on the GHZ paradox arising from a GHZ graph, we derive a Bell inequality with two d-outcome observables for each observer, whose maximal violation attained by the corresponding graph state, and a Kochen-Specker inequality testing the quantum contextuality in a state-independent fashion.

  11. Exploring exotic states with twisted boundary conditions

    International Nuclear Information System (INIS)

    Agadjanov, Dimitri

    2017-01-01

    he goal of this thesis is to develop methods to study the nature and properties of exotic hadrons from lattice simulations. The main focus lies in the application of twisted boundary conditions. The thesis consists of a general introduction and the collection of three papers, represented respectively in three chapters. The introduction of the thesis reviews the theoretical background, which is further used in the rest of the thesis. Further implementing partially twisted boundary conditions in the scalar sector of lattice QCD is studied. Then we develop a method to study the content of the exotic hadrons by determining the wave function renormalization constant from lattice simulations, exploiting the dependence of the spectrum on the twisted boundary conditions. The final chapter deals with a novel method to study the multi-channel scattering problem in a finite volume, which is relevant for exotic states. Its key idea is to extract the complex hadron-hadron optical potential, avoiding the difficulties, associated with the solution of the multi-channel Luescher equation.

  12. Exploring exotic states with twisted boundary conditions

    Energy Technology Data Exchange (ETDEWEB)

    Agadjanov, Dimitri

    2017-09-11

    he goal of this thesis is to develop methods to study the nature and properties of exotic hadrons from lattice simulations. The main focus lies in the application of twisted boundary conditions. The thesis consists of a general introduction and the collection of three papers, represented respectively in three chapters. The introduction of the thesis reviews the theoretical background, which is further used in the rest of the thesis. Further implementing partially twisted boundary conditions in the scalar sector of lattice QCD is studied. Then we develop a method to study the content of the exotic hadrons by determining the wave function renormalization constant from lattice simulations, exploiting the dependence of the spectrum on the twisted boundary conditions. The final chapter deals with a novel method to study the multi-channel scattering problem in a finite volume, which is relevant for exotic states. Its key idea is to extract the complex hadron-hadron optical potential, avoiding the difficulties, associated with the solution of the multi-channel Luescher equation.

  13. Partially coherent twisted states in arrays of coupled phase oscillators

    Energy Technology Data Exchange (ETDEWEB)

    Omel' chenko, Oleh E.; Wolfrum, Matthias [Weierstrass Institute, Mohrenstrasse 39, 10117 Berlin (Germany); Laing, Carlo R. [INMS, Massey University, Private Bag 102-904 NSMC, Auckland (New Zealand)

    2014-06-15

    We consider a one-dimensional array of phase oscillators with non-local coupling and a Lorentzian distribution of natural frequencies. The primary objects of interest are partially coherent states that are uniformly “twisted” in space. To analyze these, we take the continuum limit, perform an Ott/Antonsen reduction, integrate over the natural frequencies, and study the resulting spatio-temporal system on an unbounded domain. We show that these twisted states and their stability can be calculated explicitly. We find that stable twisted states with different wave numbers appear for increasing coupling strength in the well-known Eckhaus scenario. Simulations of finite arrays of oscillators show good agreement with results of the analysis of the infinite system.

  14. Partially coherent twisted states in arrays of coupled phase oscillators

    International Nuclear Information System (INIS)

    Omel'chenko, Oleh E.; Wolfrum, Matthias; Laing, Carlo R.

    2014-01-01

    We consider a one-dimensional array of phase oscillators with non-local coupling and a Lorentzian distribution of natural frequencies. The primary objects of interest are partially coherent states that are uniformly “twisted” in space. To analyze these, we take the continuum limit, perform an Ott/Antonsen reduction, integrate over the natural frequencies, and study the resulting spatio-temporal system on an unbounded domain. We show that these twisted states and their stability can be calculated explicitly. We find that stable twisted states with different wave numbers appear for increasing coupling strength in the well-known Eckhaus scenario. Simulations of finite arrays of oscillators show good agreement with results of the analysis of the infinite system

  15. Efficient growth of complex graph states via imperfect path erasure

    International Nuclear Information System (INIS)

    Campbell, Earl T; Fitzsimons, Joseph; Benjamin, Simon C; Kok, Pieter

    2007-01-01

    Given a suitably large and well connected (complex) graph state, any quantum algorithm can be implemented purely through local measurements on the individual qubits. Measurements can also be used to create the graph state: path erasure techniques allow one to entangle multiple qubits by determining only global properties of the qubits. Here, this powerful approach is extended by demonstrating that even imperfect path erasure can produce the required graph states with high efficiency. By characterizing the degree of error in each path erasure attempt, one can subsume the resulting imperfect entanglement into an extended graph state formalism. The subsequent growth of the improper graph state can be guided, through a series of strategic decisions, in such a way as to bound the growth of the error and eventually yield a high-fidelity graph state. As an implementation of these techniques, we develop an analytic model for atom (or atom-like) qubits in mismatched cavities, under the double-heralding entanglement procedure of Barrett and Kok (2005 Phys. Rev. A 71 060310). Compared to straightforward post-selection techniques our protocol offers a dramatic improvement in growing complex high-fidelity graph states

  16. Bell-type inequalities embedded in the subgraph of graph states

    International Nuclear Information System (INIS)

    Hsu, L.-Y.

    2006-01-01

    We investigate the Bell-type inequalities of graph states. In this paper, Bell-type inequalities can be derived based on two kinds of the associated subgraphs of the graph states. First, the star subgraphs lead to the maximal violation of the modified Seevinck-Svetlichny inequalities. Second, cycle subgraphs lead to maximal violation of Bell-type inequalities. As a result, once the associated graph of a graph state is given, the corresponding Bell operators can be immediatedly determined using stabilizing generators. In the above Bell-type inequalities, two measurement settings for each party are required

  17. Network-based Arbitrated Quantum Signature Scheme with Graph State

    Science.gov (United States)

    Ma, Hongling; Li, Fei; Mao, Ningyi; Wang, Yijun; Guo, Ying

    2017-08-01

    Implementing an arbitrated quantum signature(QAS) through complex networks is an interesting cryptography technology in the literature. In this paper, we propose an arbitrated quantum signature for the multi-user-involved networks, whose topological structures are established by the encoded graph state. The determinative transmission of the shared keys, is enabled by the appropriate stabilizers performed on the graph state. The implementation of this scheme depends on the deterministic distribution of the multi-user-shared graph state on which the encoded message can be processed in signing and verifying phases. There are four parties involved, the signatory Alice, the verifier Bob, the arbitrator Trent and Dealer who assists the legal participants in the signature generation and verification. The security is guaranteed by the entanglement of the encoded graph state which is cooperatively prepared by legal participants in complex quantum networks.

  18. Deterministic dense coding and faithful teleportation with multipartite graph states

    International Nuclear Information System (INIS)

    Huang, C.-Y.; Yu, I-C.; Lin, F.-L.; Hsu, L.-Y.

    2009-01-01

    We propose schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed schemes. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.

  19. Random graph states, maximal flow and Fuss-Catalan distributions

    International Nuclear Information System (INIS)

    Collins, BenoIt; Nechita, Ion; Zyczkowski, Karol

    2010-01-01

    For any graph consisting of k vertices and m edges we construct an ensemble of random pure quantum states which describe a system composed of 2m subsystems. Each edge of the graph represents a bipartite, maximally entangled state. Each vertex represents a random unitary matrix generated according to the Haar measure, which describes the coupling between subsystems. Dividing all subsystems into two parts, one may study entanglement with respect to this partition. A general technique to derive an expression for the average entanglement entropy of random pure states associated with a given graph is presented. Our technique relies on Weingarten calculus and flow problems. We analyze the statistical properties of spectra of such random density matrices and show for which cases they are described by the free Poissonian (Marchenko-Pastur) distribution. We derive a discrete family of generalized, Fuss-Catalan distributions and explicitly construct graphs which lead to ensembles of random states characterized by these novel distributions of eigenvalues.

  20. Adiabatic graph-state quantum computation

    International Nuclear Information System (INIS)

    Antonio, B; Anders, J; Markham, D

    2014-01-01

    Measurement-based quantum computation (MBQC) and holonomic quantum computation (HQC) are two very different computational methods. The computation in MBQC is driven by adaptive measurements executed in a particular order on a large entangled state. In contrast in HQC the system starts in the ground subspace of a Hamiltonian which is slowly changed such that a transformation occurs within the subspace. Following the approach of Bacon and Flammia, we show that any MBQC on a graph state with generalized flow (gflow) can be converted into an adiabatically driven holonomic computation, which we call adiabatic graph-state quantum computation (AGQC). We then investigate how properties of AGQC relate to the properties of MBQC, such as computational depth. We identify a trade-off that can be made between the number of adiabatic steps in AGQC and the norm of H-dot as well as the degree of H, in analogy to the trade-off between the number of measurements and classical post-processing seen in MBQC. Finally the effects of performing AGQC with orderings that differ from standard MBQC are investigated. (paper)

  1. Electronic structure and optical properties of twisted bilayer graphene calculated via time evolution of states in real space

    Science.gov (United States)

    Le, H. Anh; Do, V. Nam

    2018-03-01

    We investigate the electronic and optical properties of twisted bilayer graphene with arbitrary twist angles θ . Our results are based on a method of evolving in time quantum states in lattice space. We propose an efficient scheme of sampling lattice nodes that helps to reduce significantly computational cost, particularly for tiny twist angles. We demonstrate the continuous variation of the density of states and the optical conductivity with respect to the twist angle. It indicates that the commensurability between the two graphene layers does not play an essential role in governing the electronic and optical properties. We point out that, for the twist angles roughly in the range 0 .1∘energy exhibits the typical W shape with a small peak locating at the Fermi energy. This peak is formed as the merging of two van Hove peaks and reflects the appearance of states strongly localized in the AA-like region of moiré zones. When decreasing the twist angle to zero, the W shape is gradually transformed to the U shape, which is seen as the behavior of the density of states in the limit of θ →0∘ .

  2. Spectral stability of shifted states on star graphs

    Science.gov (United States)

    Kairzhan, Adilbek; Pelinovsky, Dmitry E.

    2018-03-01

    We consider the nonlinear Schrödinger (NLS) equation with the subcritical power nonlinearity on a star graph consisting of N edges and a single vertex under generalized Kirchhoff boundary conditions. The stationary NLS equation may admit a family of solitary waves parameterized by a translational parameter, which we call the shifted states. The two main examples include (i) the star graph with even N under the classical Kirchhoff boundary conditions and (ii) the star graph with one incoming edge and N  -  1 outgoing edges under a single constraint on coefficients of the generalized Kirchhoff boundary conditions. We obtain the general counting results on the Morse index of the shifted states and apply them to the two examples. In the case of (i), we prove that the shifted states with even N ≥slant 4 are saddle points of the action functional which are spectrally unstable under the NLS flow. In the case of (ii), we prove that the shifted states with the monotone profiles in the N  -  1 edges are spectrally stable, whereas the shifted states with non-monotone profiles in the N  -  1 edges are spectrally unstable, the two families intersect at the half-soliton states which are spectrally stable but nonlinearly unstable under the NLS flow. Since the NLS equation on a star graph with shifted states can be reduced to the homogeneous NLS equation on an infinite line, the spectral instability of shifted states is due to the perturbations breaking this reduction. We give a simple argument suggesting that the spectrally stable shifted states in the case of (ii) are nonlinearly unstable under the NLS flow due to the perturbations breaking the reduction to the homogeneous NLS equation.

  3. Some exact computations on the twisted butterfly state in string field theory

    International Nuclear Information System (INIS)

    Okawa, Yuji

    2004-01-01

    The twisted butterfly state solves the equation of motion of vacuum string field theory in the singular limit. The finiteness of the energy density of the solution is an important issue, but possible conformal anomaly resulting from the twisting has prevented us from addressing this problem. We present a description of the twisted regulated butterfly state in terms of a conformal field theory with a vanishing central charge which consists of the ordinary bc ghosts and a matter system with c=26. Various quantities relevant to vacuum string field theory are computed exactly using this description. We find that the energy density of the solution can be finite in the limit, but the finiteness depends on the sub leading structure of vacuum string field theory. We further argue, contrary to our previous expectation, that contributions from sub leading terms in the kinetic term to the energy density can be of the same order as the contribution from the leading term which consists of the midpoint ghost insertion. (author)

  4. Quantum Experiments and Graphs: Multiparty States as Coherent Superpositions of Perfect Matchings

    Science.gov (United States)

    Krenn, Mario; Gu, Xuemei; Zeilinger, Anton

    2017-12-01

    We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and graph theory. In these setups, the paths of photons are identified such that the photon-source information is never created. We find that each of these setups corresponds to an undirected graph, and every undirected graph corresponds to an experimental setup. Every term in the emerging quantum superposition corresponds to a perfect matching in the graph. Calculating the final quantum state is in the #P-complete complexity class, thus it cannot be done efficiently. To strengthen the link further, theorems from graph theory—such as Hall's marriage problem—are rephrased in the language of pair creation in quantum experiments. We show explicitly how this link allows one to answer questions about quantum experiments (such as which classes of entangled states can be created) with graph theoretical methods, and how to potentially simulate properties of graphs and networks with quantum experiments (such as critical exponents and phase transitions).

  5. Quantum Experiments and Graphs: Multiparty States as Coherent Superpositions of Perfect Matchings.

    Science.gov (United States)

    Krenn, Mario; Gu, Xuemei; Zeilinger, Anton

    2017-12-15

    We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and graph theory. In these setups, the paths of photons are identified such that the photon-source information is never created. We find that each of these setups corresponds to an undirected graph, and every undirected graph corresponds to an experimental setup. Every term in the emerging quantum superposition corresponds to a perfect matching in the graph. Calculating the final quantum state is in the #P-complete complexity class, thus it cannot be done efficiently. To strengthen the link further, theorems from graph theory-such as Hall's marriage problem-are rephrased in the language of pair creation in quantum experiments. We show explicitly how this link allows one to answer questions about quantum experiments (such as which classes of entangled states can be created) with graph theoretical methods, and how to potentially simulate properties of graphs and networks with quantum experiments (such as critical exponents and phase transitions).

  6. Twisted injectivity in projected entangled pair states and the classification of quantum phases

    Energy Technology Data Exchange (ETDEWEB)

    Buerschaper, Oliver, E-mail: obuerschaper@perimeterinstitute.ca

    2014-12-15

    We introduce a class of projected entangled pair states (PEPS) which is based on a group symmetry twisted by a 3-cocycle of the group. This twisted symmetry is expressed as a matrix product operator (MPO) with bond dimension greater than 1 and acts on the virtual boundary of a PEPS tensor. We show that it gives rise to a new standard form for PEPS from which we construct a family of local Hamiltonians which are gapped, frustration-free and include fixed points of the renormalization group flow. Based on this insight, we advance the classification of 2D gapped quantum spin systems by showing how this new standard form for PEPS determines the emergent topological order of these local Hamiltonians. Specifically, we identify their universality class as DIJKGRAAF–WITTEN topological quantum field theory (TQFT). - Highlights: • We introduce a new standard form for projected entangled pair states via a twisted group symmetry which is given by nontrivial matrix product operators. • We construct a large family of gapped, frustration-free Hamiltonians in two dimensions from this new standard form. • We rigorously show how this new standard form for low energy states determines the emergent topological order.

  7. Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

    Science.gov (United States)

    Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A.

    2016-01-01

    There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of “maximum flow-minimum cut” graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered. PMID:27089174

  8. Energy Minimization of Discrete Protein Titration State Models Using Graph Theory.

    Science.gov (United States)

    Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A

    2016-08-25

    There are several applications in computational biophysics that require the optimization of discrete interacting states, for example, amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of "maximum flow-minimum cut" graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.

  9. Local unitary versus local Clifford equivalence of stabilizer and graph states

    International Nuclear Information System (INIS)

    Zeng, Bei; Chung, Hyeyoun; Cross, Andrew W.; Chuang, Isaac L.

    2007-01-01

    The equivalence of stabilizer states under local transformations is of fundamental interest in understanding properties and uses of entanglement. Two stabilizer states are equivalent under the usual stochastic local operations and classical communication criterion if and only if they are equivalent under local unitary (LU) operations. More surprisingly, under certain conditions, two LU-equivalent stabilizer states are also equivalent under local Clifford (LC) operations, as was shown by Van den Nest et al. [Phys. Rev. A 71, 062323 (2005)]. Here, we broaden the class of stabilizer states for which LU equivalence implies LC equivalence (LU LC) to include all stabilizer states represented by graphs with cycles of length neither 3 nor 4. To compare our result with Van den Nest et al.'s, we show that any stabilizer state of distance δ=2 is beyond their criterion. We then further prove that LU LC holds for a more general class of stabilizer states of δ=2. We also explicitly construct graphs representing δ>2 stabilizer states which are beyond their criterion: we identify all 58 graphs with up to 11 vertices and construct graphs with 2 m -1 (m≥4) vertices using quantum error-correcting codes which have non-Clifford transversal gates

  10. Entanglement of the valence-bond-solid state on an arbitrary graph

    International Nuclear Information System (INIS)

    Xu Ying; Korepin, Vladimir E

    2008-01-01

    The Affleck-Kennedy-Lieb-Tasaki (AKLT) spin interacting model can be defined on an arbitrary graph. We explain the construction of the AKLT Hamiltonian. Given certain conditions, the ground state is unique and known as the valence-bond-solid (VBS) state. It can be used in measurement-based quantum computation as a resource state instead of the cluster state. We study the VBS ground state on an arbitrary connected graph. The graph is cut into two disconnected parts: the block and the environment. We study the entanglement between these two parts and prove that many eigenvalues of the density matrix of the block are zero. We describe a subspace of eigenvectors of the density matrix corresponding to non-zero eigenvalues. The subspace is the degenerate ground states of some Hamiltonian which we call the block Hamiltonian

  11. Twisted classical Poincare algebras

    International Nuclear Information System (INIS)

    Lukierski, J.; Ruegg, H.; Tolstoy, V.N.; Nowicki, A.

    1993-11-01

    We consider the twisting of Hopf structure for classical enveloping algebra U(g), where g is the inhomogeneous rotations algebra, with explicite formulae given for D=4 Poincare algebra (g=P 4 ). The comultiplications of twisted U F (P 4 ) are obtained by conjugating primitive classical coproducts by F element of U(c)xU(c), where c denotes any Abelian subalgebra of P 4 , and the universal R-matrices for U F (P 4 ) are triangular. As an example we show that the quantum deformation of Poincare algebra recently proposed by Chaichian and Demiczev is a twisted classical Poincare algebra. The interpretation of twisted Poincare algebra as describing relativistic symmetries with clustered 2-particle states is proposed. (orig.)

  12. An Approach for State Observation in Dynamical Systems Based on the Twisting Algorithm

    DEFF Research Database (Denmark)

    Schmidt, Lasse; Andersen, Torben Ole; Pedersen, Henrik C.

    2013-01-01

    This paper discusses a novel approach for state estimation in dynamical systems, with the special focus on hydraulic valve-cylinder drives. The proposed observer structure is based on the framework of the so-called twisting algorithm. This algorithm utilizes the sign of the state being the target...

  13. Electronic and Optical Properties of Twisted Bilayer Graphene

    Science.gov (United States)

    Huang, Shengqiang

    The ability to isolate single atomic layers of van der Waals materials has led to renewed interest in the electronic and optical properties of these materials as they can be fundamentally different at the monolayer limit. Moreover, these 2D crystals can be assembled together layer by layer, with controllable sequence and orientation, to form artificial materials that exhibit new features that are not found in monolayers nor bulk. Twisted bilayer graphene is one such prototype system formed by two monolayer graphene layers placed on top of each other with a twist angle between their lattices, whose electronic band structure depends on the twist angle. This thesis presents the efforts to explore the electronic and optical properties of twisted bilayer graphene by Raman spectroscopy and scanning tunneling microscopy measurements. We first synthesize twisted bilayer graphene with various twist angles via chemical vapor deposition. Using a combination of scanning tunneling microscopy and Raman spectroscopy, the twist angles are determined. The strength of the Raman G peak is sensitive to the electronic band structure of twisted bilayer graphene and therefore we use this peak to monitor changes upon doping. Our results demonstrate the ability to modify the electronic and optical properties of twisted bilayer graphene with doping. We also fabricate twisted bilayer graphene by controllable stacking of two graphene monolayers with a dry transfer technique. For twist angles smaller than one degree, many body interactions play an important role. It requires eight electrons per moire unit cell to fill up each band instead of four electrons in the case of a larger twist angle. For twist angles smaller than 0.4 degree, a network of domain walls separating AB and BA stacking regions forms, which are predicted to host topologically protected helical states. Using scanning tunneling microscopy and spectroscopy, these states are confirmed to appear on the domain walls when inversion

  14. `Twisted' electrons

    Science.gov (United States)

    Larocque, Hugo; Kaminer, Ido; Grillo, Vincenzo; Leuchs, Gerd; Padgett, Miles J.; Boyd, Robert W.; Segev, Mordechai; Karimi, Ebrahim

    2018-04-01

    Electrons have played a significant role in the development of many fields of physics during the last century. The interest surrounding them mostly involved their wave-like features prescribed by the quantum theory. In particular, these features correctly predict the behaviour of electrons in various physical systems including atoms, molecules, solid-state materials, and even in free space. Ten years ago, new breakthroughs were made, arising from the new ability to bestow orbital angular momentum (OAM) to the wave function of electrons. This quantity, in conjunction with the electron's charge, results in an additional magnetic property. Owing to these features, OAM-carrying, or twisted, electrons can effectively interact with magnetic fields in unprecedented ways and have motivated materials scientists to find new methods for generating twisted electrons and measuring their OAM content. Here, we provide an overview of such techniques along with an introduction to the exciting dynamics of twisted electrons.

  15. Line bundle twisted chiral de Rham complex and bound states of D-branes on toric manifolds

    International Nuclear Information System (INIS)

    Parkhomenko, S.E.

    2014-01-01

    In this note we calculate elliptic genus in various examples of twisted chiral de Rham complex on two-dimensional toric compact manifolds and Calabi–Yau hypersurfaces in toric manifolds. At first the elliptic genus is calculated for the line bundle twisted chiral de Rham complex on a compact smooth toric manifold and K3 hypersurface in P 3 . Then we twist chiral de Rham complex by sheaves localized on positive codimension submanifolds in P 2 and calculate in each case the elliptic genus. In the last example the elliptic genus of chiral de Rham complex on P 2 twisted by SL(N) vector bundle with instanton number k is calculated. In all the cases considered we find the infinite tower of open string oscillator contributions and identify directly the open string boundary conditions of the corresponding bound state of D-branes

  16. Partial twisting for scalar mesons

    International Nuclear Information System (INIS)

    Agadjanov, Dimitri; Meißner, Ulf-G.; Rusetsky, Akaki

    2014-01-01

    The possibility of imposing partially twisted boundary conditions is investigated for the scalar sector of lattice QCD. According to the commonly shared belief, the presence of quark-antiquark annihilation diagrams in the intermediate state generally hinders the use of the partial twisting. Using effective field theory techniques in a finite volume, and studying the scalar sector of QCD with total isospin I=1, we however demonstrate that partial twisting can still be performed, despite the fact that annihilation diagrams are present. The reason for this are delicate cancellations, which emerge due to the graded symmetry in partially quenched QCD with valence, sea and ghost quarks. The modified Lüscher equation in case of partial twisting is given

  17. Four-point functions with a twist

    Energy Technology Data Exchange (ETDEWEB)

    Bargheer, Till [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany). Theory Group

    2017-01-15

    We study the OPE of correlation functions of local operators in planar N=4 super Yang-Mills theory. The considered operators have an explicit spacetime dependence that is defined by twisting the translation generators with certain R-symmetry generators. We restrict to operators that carry a small number of excitations above the twisted BMN vacuum. The OPE limit of the four-point correlator is dominated by internal states with few magnons on top of the vacuum. The twisting directly couples all spacetime dependence of the correlator to these magnons. We analyze the OPE in detail, and single out the extremal states that have to cancel all double-trace contributions.

  18. New Boundary-Driven Twist States in Systems with Broken Spatial Inversion Symmetry

    Science.gov (United States)

    Hals, Kjetil M. D.; Everschor-Sitte, Karin

    2017-09-01

    A full description of a magnetic sample includes a correct treatment of the boundary conditions (BCs). This is in particular important in thin film systems, where even bulk properties might be modified by the properties of the boundary of the sample. We study generic ferromagnets with broken spatial inversion symmetry and derive the general micromagnetic BCs of a system with Dzyaloshinskii-Moriya interaction (DMI). We demonstrate that the BCs require the full tensorial structure of the third-rank DMI tensor and not just the antisymmetric part, which is usually taken into account. Specifically, we study systems with C∞ v symmetry and explore the consequences of the DMI. Interestingly, we find that the DMI already in the simplest case of a ferromagnetic thin film leads to a purely boundary-driven magnetic twist state at the edges of the sample. The twist state represents a new type of DMI-induced spin structure, which is completely independent of the internal DMI field. We estimate the size of the texture-induced magnetoresistance effect being in the range of that of domain walls.

  19. Graph state generation with noisy mirror-inverting spin chains

    International Nuclear Information System (INIS)

    Clark, Stephen R; Klein, Alexander; Bruderer, Martin; Jaksch, Dieter

    2007-01-01

    We investigate the influence of noise on a graph state generation scheme which exploits a mirror inverting spin chain. Within this scheme the spin chain is used repeatedly as an entanglement bus (EB) to create multi-partite entanglement. The noise model we consider comprises of each spin of this EB being exposed to independent local noise which degrades the capabilities of the EB. Here we concentrate on quantifying its performance as a single-qubit channel and as a mediator of a two-qubit entangling gate, since these are basic operations necessary for graph state generation using the EB. In particular, for the single-qubit case we numerically calculate the average channel fidelity and whether the channel becomes entanglement breaking, i.e. expunges any entanglement the transferred qubit may have with other external qubits. We find that neither local decay nor dephasing noise cause entanglement breaking. This is in contrast to local thermal and depolarizing noise where we determine a critical length and critical noise coupling, respectively, at which entanglement breaking occurs. The critical noise coupling for local depolarizing noise is found to exhibit a power-law dependence on the chain length. For two-qubits we similarly compute the average gate fidelity and whether the ability for this gate to create entanglement is maintained. The concatenation of these noisy gates for the construction of a five-qubit linear cluster state and a Greenberger-Horne-Zeilinger state indicates that the level of noise that can be tolerated for graph state generation is tightly constrained

  20. Twisted supersymmetry: Twisted symmetry versus renormalizability

    International Nuclear Information System (INIS)

    Dimitrijevic, Marija; Nikolic, Biljana; Radovanovic, Voja

    2011-01-01

    We discuss a deformation of superspace based on a Hermitian twist. The twist implies a *-product that is noncommutative, Hermitian and finite when expanded in a power series of the deformation parameter. The Leibniz rule for the twisted supersymmetry transformations is deformed. A minimal deformation of the Wess-Zumino action is proposed and its renormalizability properties are discussed. There is no tadpole contribution, but the two-point function diverges. We speculate that the deformed Leibniz rule, or more generally the twisted symmetry, interferes with renormalizability properties of the model. We discuss different possibilities to render a renormalizable model.

  1. Structures of Highly Twisted Amides Relevant to Amide N-C Cross-Coupling: Evidence for Ground-State Amide Destabilization.

    Science.gov (United States)

    Pace, Vittorio; Holzer, Wolfgang; Meng, Guangrong; Shi, Shicheng; Lalancette, Roger; Szostak, Roman; Szostak, Michal

    2016-10-04

    Herein, we show that acyclic amides that have recently enabled a series of elusive transition-metal-catalyzed N-C activation/cross-coupling reactions are highly twisted around the N-C(O) axis by a new destabilization mechanism of the amide bond. A unique effect of the N-glutarimide substituent, leading to uniformly high twist (ca. 90°) irrespective of the steric effect at the carbon side of the amide bond has been found. This represents the first example of a twisted amide that does not bear significant steric hindrance at the α-carbon atom. The (15) N NMR data show linear correlations between electron density at nitrogen and amide bond twist. This study strongly supports the concept of amide bond ground-state twist as a blueprint for activation of amides toward N-C bond cleavage. The new mechanism offers considerable opportunities for organic synthesis and biological processes involving non-planar amide bonds. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  2. An Infinite Family of Circulant Graphs with Perfect State Transfer in Discrete Quantum Walks

    OpenAIRE

    Zhan, Hanmeng

    2017-01-01

    We study perfect state transfer in a discrete quantum walk. In particular, we show that there are infinitely many $4$-regular circulant graphs that admit perfect state transfer between antipodal vertices. To the best of our knowledge, previously there was no infinite family of $k$-regular graphs with perfect state transfer, for any $k\\ge 3$.

  3. Reversible Twisting of Primary Amides via Ground State N-C(O) Destabilization: Highly Twisted Rotationally Inverted Acyclic Amides.

    Science.gov (United States)

    Meng, Guangrong; Shi, Shicheng; Lalancette, Roger; Szostak, Roman; Szostak, Michal

    2018-01-17

    Since the seminal studies by Pauling in 1930s, planarity has become the defining characteristic of the amide bond. Planarity of amides has central implications for the reactivity and chemical properties of amides of relevance to a range of chemical disciplines. While the vast majority of amides are planar, nonplanarity has a profound effect on the properties of the amide bond, with the most common method to restrict the amide bond relying on the incorporation of the amide function into a rigid cyclic ring system. In a major departure from this concept, here, we report the first class of acyclic twisted amides that can be prepared, reversibly, from common primary amides in a single, operationally trivial step. Di-tert-butoxycarbonylation of the amide nitrogen atom yields twisted amides in which the amide bond exhibits nearly perpendicular twist. Full structural characterization of a range of electronically diverse compounds from this new class of twisted amides is reported. Through reactivity studies we demonstrate unusual properties of the amide bond, wherein selective cleavage of the amide bond can be achieved by a judicious choice of the reaction conditions. Through computational studies we evaluate structural and energetic details pertaining to the amide bond deformation. The ability to selectively twist common primary amides, in a reversible manner, has important implications for the design and application of the amide bond nonplanarity in structural chemistry, biochemistry and organic synthesis.

  4. Identifying patients with Alzheimer's disease using resting-state fMRI and graph theory.

    Science.gov (United States)

    Khazaee, Ali; Ebrahimzadeh, Ata; Babajani-Feremi, Abbas

    2015-11-01

    Study of brain network on the basis of resting-state functional magnetic resonance imaging (fMRI) has provided promising results to investigate changes in connectivity among different brain regions because of diseases. Graph theory can efficiently characterize different aspects of the brain network by calculating measures of integration and segregation. In this study, we combine graph theoretical approaches with advanced machine learning methods to study functional brain network alteration in patients with Alzheimer's disease (AD). Support vector machine (SVM) was used to explore the ability of graph measures in diagnosis of AD. We applied our method on the resting-state fMRI data of twenty patients with AD and twenty age and gender matched healthy subjects. The data were preprocessed and each subject's graph was constructed by parcellation of the whole brain into 90 distinct regions using the automated anatomical labeling (AAL) atlas. The graph measures were then calculated and used as the discriminating features. Extracted network-based features were fed to different feature selection algorithms to choose most significant features. In addition to the machine learning approach, statistical analysis was performed on connectivity matrices to find altered connectivity patterns in patients with AD. Using the selected features, we were able to accurately classify patients with AD from healthy subjects with accuracy of 100%. Results of this study show that pattern recognition and graph of brain network, on the basis of the resting state fMRI data, can efficiently assist in the diagnosis of AD. Classification based on the resting-state fMRI can be used as a non-invasive and automatic tool to diagnosis of Alzheimer's disease. Copyright © 2015 International Federation of Clinical Neurophysiology. All rights reserved.

  5. Duality and braiding in twisted quantum field theory

    International Nuclear Information System (INIS)

    Riccardi, Mauro; Szabo, Richard J.

    2008-01-01

    We re-examine various issues surrounding the definition of twisted quantum field theories on flat noncommutative spaces. We propose an interpretation based on nonlocal commutative field redefinitions which clarifies previously observed properties such as the formal equivalence of Green's functions in the noncommutative and commutative theories, causality, and the absence of UV/IR mixing. We use these fields to define the functional integral formulation of twisted quantum field theory. We exploit techniques from braided tensor algebra to argue that the twisted Fock space states of these free fields obey conventional statistics. We support our claims with a detailed analysis of the modifications induced in the presence of background magnetic fields, which induces additional twists by magnetic translation operators and alters the effective noncommutative geometry seen by the twisted quantum fields. When two such field theories are dual to one another, we demonstrate that only our braided physical states are covariant under the duality

  6. Denjoy minimal sets and Birkhoff periodic orbits for non-exact monotone twist maps

    Science.gov (United States)

    Qin, Wen-Xin; Wang, Ya-Nan

    2018-06-01

    A non-exact monotone twist map φbarF is a composition of an exact monotone twist map φ bar with a generating function H and a vertical translation VF with VF ((x , y)) = (x , y - F). We show in this paper that for each ω ∈ R, there exists a critical value Fd (ω) ≥ 0 depending on H and ω such that for 0 ≤ F ≤Fd (ω), the non-exact twist map φbarF has an invariant Denjoy minimal set with irrational rotation number ω lying on a Lipschitz graph, or Birkhoff (p , q)-periodic orbits for rational ω = p / q. Like the Aubry-Mather theory, we also construct heteroclinic orbits connecting Birkhoff periodic orbits, and show that quasi-periodic orbits in these Denjoy minimal sets can be approximated by periodic orbits. In particular, we demonstrate that at the critical value F =Fd (ω), the Denjoy minimal set is not uniformly hyperbolic and can be approximated by smooth curves.

  7. Twisting the N=2 string

    International Nuclear Information System (INIS)

    Ketov, S.V.; Lechtenfeld, O.; Parkes, A.J.

    1993-12-01

    The most general homogeneous monodromy conditions in N= 2 string theory are classified in terms of the conjugacy classes of the global symmetry group U(1, 1) x Z 2 . For classes which generate a discrete subgroup Γ, the corresponding target space backgrounds C 1,1 /Γ include half spaces, complex orbifolds and tori. We propose a generalization of the intercept formula to matrix-valued twists, and find massless physical states in a number of twisted cases. In particular, the sixteen Z 2 -twisted sectors of the N = 2 string are investigated, and the corresponding ground states are identified via bosonization and BRST cohomology. We find enough room for an extended multiplet of 'spacetime' supersymmetry, with the number of supersymmetries being dependent on global 'spacetime' topology. Unfortunately, world-sheet locality for the chiral vertex operators does not permit interactions for the massless 'spacetime' fermions; however possibly, an asymmetric GSO projection could evade this problem. (orig.)

  8. Efficient Sampling of the Structure of Crypto Generators' State Transition Graphs

    Science.gov (United States)

    Keller, Jörg

    Cryptographic generators, e.g. stream cipher generators like the A5/1 used in GSM networks or pseudo-random number generators, are widely used in cryptographic network protocols. Basically, they are finite state machines with deterministic transition functions. Their state transition graphs typically cannot be analyzed analytically, nor can they be explored completely because of their size which typically is at least n = 264. Yet, their structure, i.e. number and sizes of weakly connected components, is of interest because a structure deviating significantly from expected values for random graphs may form a distinguishing attack that indicates a weakness or backdoor. By sampling, one randomly chooses k nodes, derives their distribution onto connected components by graph exploration, and extrapolates these results to the complete graph. In known algorithms, the computational cost to determine the component for one randomly chosen node is up to O(√n), which severely restricts the sample size k. We present an algorithm where the computational cost to find the connected component for one randomly chosen node is O(1), so that a much larger sample size k can be analyzed in a given time. We report on the performance of a prototype implementation, and about preliminary analysis for several generators.

  9. Scanning tunneling microscopy and spectroscopy of twisted trilayer graphene

    Science.gov (United States)

    Zuo, Wei-Jie; Qiao, Jia-Bin; Ma, Dong-Lin; Yin, Long-Jing; Sun, Gan; Zhang, Jun-Yang; Guan, Li-Yang; He, Lin

    2018-01-01

    Twist, as a simple and unique degree of freedom, could lead to enormous novel quantum phenomena in bilayer graphene. A small rotation angle introduces low-energy van Hove singularities (VHSs) approaching the Fermi level, which result in unusual correlated states in the bilayer graphene. It is reasonable to expect that the twist could also affect the electronic properties of few-layer graphene dramatically. However, such an issue has remained experimentally elusive. Here, by using scanning tunneling microscopy/spectroscopy (STM/STS), we systematically studied a twisted trilayer graphene (TTG) with two different small twist angles between adjacent layers. Two sets of VHSs, originating from the two twist angles, were observed in the TTG, indicating that the TTG could be simply regarded as a combination of two different twisted bilayers of graphene. By using high-resolution STS, we observed a split of the VHSs and directly imaged the spatial symmetry breaking of electronic states around the VHSs. These results suggest that electron-electron interactions play an important role in affecting the electronic properties of graphene systems with low-energy VHSs.

  10. Twisted light

    CSIR Research Space (South Africa)

    Forbes, A

    2010-12-01

    Full Text Available Research at the Mathematical Optics Group uses "twisted" light to study new quatum-based information security systems. In order to understand the structure of "twisted" light, it is useful to start with an ordinary light beam with zero twist, namely...

  11. Twist limits for late twisting double somersaults on trampoline.

    Science.gov (United States)

    Yeadon, M R; Hiley, M J

    2017-06-14

    An angle-driven computer simulation model of aerial movement was used to determine the maximum amount of twist that could be produced in the second somersault of a double somersault on trampoline using asymmetrical movements of the arms and hips. Lower bounds were placed on the durations of arm and hip angle changes based on performances of a world trampoline champion whose inertia parameters were used in the simulations. The limiting movements were identified as the largest possible odd number of half twists for forward somersaulting takeoffs and even number of half twists for backward takeoffs. Simulations of these two limiting movements were found using simulated annealing optimisation to produce the required amounts of somersault, tilt and twist at landing after a flight time of 2.0s. Additional optimisations were then run to seek solutions with the arms less adducted during the twisting phase. It was found that 3½ twists could be produced in the second somersault of a forward piked double somersault with arms abducted 8° from full adduction during the twisting phase and that three twists could be produced in the second somersault of a backward straight double somersault with arms fully adducted to the body. These two movements are at the limits of performance for elite trampolinists. Copyright © 2017 Elsevier Ltd. All rights reserved.

  12. Graph-based network analysis of resting-state functional MRI

    Directory of Open Access Journals (Sweden)

    Jinhui Wang

    2010-06-01

    Full Text Available In the past decade, resting-state functional MRI (R-fMRI measures of brain activity have attracted considerable attention. Based on changes in the blood oxygen level-dependent signal, R-fMRI offers a novel way to assess the brain’s spontaneous or intrinsic (i.e., task-free activity with both high spatial and temporal resolutions. The properties of both the intra- and inter-regional connectivity of resting-state brain activity have been well documented, promoting our understanding of the brain as a complex network. Specifically, the topological organization of brain networks has been recently studied with graph theory. In this review, we will summarize the recent advances in graph-based brain network analyses of R-fMRI signals, both in typical and atypical populations. Application of these approaches to R-fMRI data has demonstrated non-trivial topological properties of functional networks in the human brain. Among these is the knowledge that the brain’s intrinsic activity is organized as a small-world, highly efficient network, with significant modularity and highly connected hub regions. These network properties have also been found to change throughout normal development, aging and in various pathological conditions. The literature reviewed here suggests that graph-based network analyses are capable of uncovering system-level changes associated with different processes in the resting brain, which could provide novel insights into the understanding of the underlying physiological mechanisms of brain function. We also highlight several potential research topics in the future.

  13. Graph-based network analysis of resting-state functional MRI.

    Science.gov (United States)

    Wang, Jinhui; Zuo, Xinian; He, Yong

    2010-01-01

    In the past decade, resting-state functional MRI (R-fMRI) measures of brain activity have attracted considerable attention. Based on changes in the blood oxygen level-dependent signal, R-fMRI offers a novel way to assess the brain's spontaneous or intrinsic (i.e., task-free) activity with both high spatial and temporal resolutions. The properties of both the intra- and inter-regional connectivity of resting-state brain activity have been well documented, promoting our understanding of the brain as a complex network. Specifically, the topological organization of brain networks has been recently studied with graph theory. In this review, we will summarize the recent advances in graph-based brain network analyses of R-fMRI signals, both in typical and atypical populations. Application of these approaches to R-fMRI data has demonstrated non-trivial topological properties of functional networks in the human brain. Among these is the knowledge that the brain's intrinsic activity is organized as a small-world, highly efficient network, with significant modularity and highly connected hub regions. These network properties have also been found to change throughout normal development, aging, and in various pathological conditions. The literature reviewed here suggests that graph-based network analyses are capable of uncovering system-level changes associated with different processes in the resting brain, which could provide novel insights into the understanding of the underlying physiological mechanisms of brain function. We also highlight several potential research topics in the future.

  14. State space model extraction of thermohydraulic systems – Part I: A linear graph approach

    International Nuclear Information System (INIS)

    Uren, K.R.; Schoor, G. van

    2013-01-01

    Thermohydraulic simulation codes are increasingly making use of graphical design interfaces. The user can quickly and easily design a thermohydraulic system by placing symbols on the screen resembling system components. These components can then be connected to form a system representation. Such system models may then be used to obtain detailed simulations of the physical system. Usually this kind of simulation models are too complex and not ideal for control system design. Therefore, a need exists for automated techniques to extract lumped parameter models useful for control system design. The goal of this first paper, in a two part series, is to propose a method that utilises a graphical representation of a thermohydraulic system, and a lumped parameter modelling approach, to extract state space models. In this methodology each physical domain of the thermohydraulic system is represented by a linear graph. These linear graphs capture the interaction between all components within and across energy domains – hydraulic, thermal and mechanical. These linear graphs are analysed using a graph-theoretic approach to derive reduced order state space models. These models capture the dominant dynamics of the thermohydraulic system and are ideal for control system design purposes. The proposed state space model extraction method is demonstrated by considering a U-tube system. A non-linear state space model is extracted representing both the hydraulic and thermal domain dynamics of the system. The simulated state space model is compared with a Flownex ® model of the U-tube. Flownex ® is a validated systems thermal-fluid simulation software package. - Highlights: • A state space model extraction methodology based on graph-theoretic concepts. • An energy-based approach to consider multi-domain systems in a common framework. • Allow extraction of transparent (white-box) state space models automatically. • Reduced order models containing only independent state

  15. Twisting dependent properties of twisted carbon nanotube fibers: microstructure and strain transfer factors

    International Nuclear Information System (INIS)

    Zhou, Jinyuan; Xie, Erqing; Sun, Gengzhi; Zhan, Zhaoyao; Zheng, Lianxi

    2014-01-01

    The dependences of twisting parameters on the electric and mechanical properties of twisted CNT fibers were systematically studied. Results from electric and mechanical measurements showed that twisting intensity is very effective to improve the electric and mechanical properties of CNT fibers. Further calculations combined with Raman results indicate that the twisting treatments, to a certain extent, can greatly enhance the strain transfer factors of the samples, which dominates the mechanical properties of CNT fibers. In addition, studies on the effect of twisting speeds suggested that lower twisting speed can lead to higher uniformity but lower performances in the electric and mechanical properties, higher twisting speed to higher Young’s modulus and higher conductance but lower uniformities. Ultra-strong uniform CNT fibers need to be prepared with a suitable twisting speed. (paper)

  16. 'Duality twisted'boundary conditions in n-state Potts Models

    International Nuclear Information System (INIS)

    Schuetz, G.

    1992-11-01

    We discuss a new class of toroidal boundary conditions for one-dimensional quantum Hamiltonian with S n symmetry which are related to two-dimensional n-state Potts models in the extreme anisotropic Hamiltonian limit. At their self-dual point (a point were a second-order phase transition occurs for n=2,3,4) the duality transformation is shown to be an additional symmetry giving rise to a new class of 'duality twisted' toroidal boundary conditions. This corresponding Hamiltonians are given in terms of generators of the periodic Temprely-Lieb algebra with an odd number of generators. We discuss as an example the critical Ising model. Here the complete spectrum for the new boundary conditions can be obtained from a projection mechanism in the spin-1/2 XXZ Heisenberg chain. (author)

  17. Visibility graphs for fMRI data: Multiplex temporal graphs and their modulations across resting-state networks

    Directory of Open Access Journals (Sweden)

    Speranza Sannino

    2017-10-01

    Full Text Available Visibility algorithms are a family of methods that map time series into graphs, such that the tools of graph theory and network science can be used for the characterization of time series. This approach has proved a convenient tool, and visibility graphs have found applications across several disciplines. Recently, an approach has been proposed to extend this framework to multivariate time series, allowing a novel way to describe collective dynamics. Here we test their application to fMRI time series, following two main motivations, namely that (a this approach allows vs to simultaneously capture and process relevant aspects of both local and global dynamics in an easy and intuitive way, and (b this provides a suggestive bridge between time series and network theory that nicely fits the consolidating field of network neuroscience. Our application to a large open dataset reveals differences in the similarities of temporal networks (and thus in correlated dynamics across resting-state networks, and gives indications that some differences in brain activity connected to psychiatric disorders could be picked up by this approach. Here we present the first application of multivariate visibility graphs to fMRI data. Visibility graphs are a way to represent a time series as a temporal network, evidencing specific aspects of its dynamics, such as extreme events. Multivariate time series, as those encountered in neuroscience, and in fMRI in particular, can be seen as a multiplex network, in which each layer represents a time series (a region of interest in the brain in our case. Here we report the method, we describe some relevant aspects of its application to BOLD time series, and we discuss the analogies and differences with existing methods. Finally, we present an application to a high-quality, publicly available dataset, containing healthy subjects and psychotic patients, and we discuss our findings. All the code to reproduce the analyses and the

  18. Localized topological states in Bragg multihelicoidal fibers with twist defects

    Science.gov (United States)

    Alexeyev, C. N.; Lapin, B. P.; Milione, G.; Yavorsky, M. A.

    2016-06-01

    We have studied the influence of a twist defect in multihelicoidal Bragg fibers on the emerging of localized defect modes. We have shown that if such a fiber is excited with a Gaussian beam this leads to the appearance of a defect-localized topological state, whose topological charge coincides with the order of rotational symmetry of the fiber's refractive index. We have shown that this effect has a pronounced crossover behavior. We have also formulated a principle of creating the systems that can nestle defect-localized topologically charged modes. According to this principle, such systems have to possess topological activity, that is, the ability to change the topological charge of the incoming field, and operate in the Bragg regime.

  19. Bipartite separability and nonlocal quantum operations on graphs

    Science.gov (United States)

    Dutta, Supriyo; Adhikari, Bibhas; Banerjee, Subhashish; Srikanth, R.

    2016-07-01

    In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension m ×n arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

  20. Moiré-related in-gap states in a twisted MoS2/graphite heterojunction

    KAUST Repository

    Lu, Chun-I

    2017-07-21

    This report presents a series of low-temperature (4.5 K) scanning tunneling microscopy and spectroscopy experimental results on monolayer MoS2 deposited on highly oriented pyrolytic graphite using chemical vapor deposition. To reveal the detailed connection between atomic morphology and conductivity in twisted MoS2/graphite heterojunctions, we employ high-sensitivity tunneling spectroscopy measurements by choosing a reduced tip-sample distance. We discern previously unobserved conductance peaks within the band gap range of MoS2, and by comparing the tunneling spectra from MoS2 grains of varying rotation with respect to the substrate, show that these features have small but non-negligible dependence on the moiré superstructure. Furthermore, within a single moiré supercell, atomically resolved tunneling spectroscopy measurements show that the spectra between the moiré high and low areas are also distinct. These in-gap states are shown to have an energy shift attributed to their local lattice strain, matching corresponding behavior of the conduction band edge, and we therefore infer that these features are intrinsic to the density of states, rather than experimental artifacts, and attribute them to the twisted stacking and local strain energy of the MoS2/graphite heterointerface.

  1. Interaction graphs

    DEFF Research Database (Denmark)

    Seiller, Thomas

    2016-01-01

    Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should...... be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define...... "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite...

  2. A Modal-Logic Based Graph Abstraction

    NARCIS (Netherlands)

    Bauer, J.; Boneva, I.B.; Kurban, M.E.; Rensink, Arend; Ehrig, H; Heckel, R.; Rozenberg, G.; Taentzer, G.

    2008-01-01

    Infinite or very large state spaces often prohibit the successful verification of graph transformation systems. Abstract graph transformation is an approach that tackles this problem by abstracting graphs to abstract graphs of bounded size and by lifting application of productions to abstract

  3. Electrically Controllable Magnetism in Twisted Bilayer Graphene.

    Science.gov (United States)

    Gonzalez-Arraga, Luis A; Lado, J L; Guinea, Francisco; San-Jose, Pablo

    2017-09-08

    Twisted graphene bilayers develop highly localized states around AA-stacked regions for small twist angles. We show that interaction effects may induce either an antiferromagnetic or a ferromagnetic (FM) polarization of said regions, depending on the electrical bias between layers. Remarkably, FM-polarized AA regions under bias develop spiral magnetic ordering, with a relative 120° misalignment between neighboring regions due to a frustrated antiferromagnetic exchange. This remarkable spiral magnetism emerges naturally without the need of spin-orbit coupling, and competes with the more conventional lattice-antiferromagnetic instability, which interestingly develops at smaller bias under weaker interactions than in monolayer graphene, due to Fermi velocity suppression. This rich and electrically controllable magnetism could turn twisted bilayer graphene into an ideal system to study frustrated magnetism in two dimensions.

  4. New look at the dynamics of twisted accretion disks

    International Nuclear Information System (INIS)

    Hatchett, S.P.; Begelman, M.C.; Sarazin, C.L.

    1981-01-01

    We reexamine the dynamic response of a thin, accretion disk to twisting torques, guided by the earlier analyses by Bardeen and Petterson. We make several corrections to this earlier work, and present a new version of the twist equations consistent with their physical assumptions. By describing the distortion of the disk in terms Cartesian direction cosines rather than the Euler angles used by the earlier authors, we are able to transform the twist equations from a pair of coupled, nonlinear, partial differential equations to a single, linear, complex one. We write down formulae for the external twisting torques likley to be encountered in astrophysic, and we show that even with these driving torques our twist equation remains linear. We find exact, analytic solutions for steady state structure of a disk subject to Lense-Thirring torques by a nonaligned central Kerr black hole and also for the time-dependent problem of the structure of a slaved disk with its oscillating boundary conditions. Finally, we discuss the stability of disks against twisting modes and show that undriven disks and disks subject to time-independent driving torques are stable

  5. Highly twisted 1,2:8,9-dibenzozethrenes: Synthesis, ground state, and physical properties

    KAUST Repository

    Sun, Zhe; Zheng, Bin; Hu, Pan; Huang, Kuo-Wei; Wu, Jishan

    2014-01-01

    Two soluble and stable 1,2:8,9-dibenzozethrene derivatives (3a,b) are synthesized through a palladium-catalyzed cyclodimerization reaction. X-ray crystallographic analysis shows that these molecules are highly twisted owing to congestion at the cove region. Broken-symmetry DFT calculations predict that they have a singlet biradical ground state with a smaller biradical character and a large singlet-triplet energy gap; these predictions are supported by NMR and electronic absorption measurements. They have small energy gaps and exhibit farred/near-infrared absorption/emission and amphoteric redox behaviors.

  6. Highly twisted 1,2:8,9-dibenzozethrenes: Synthesis, ground state, and physical properties

    KAUST Repository

    Sun, Zhe

    2014-08-08

    Two soluble and stable 1,2:8,9-dibenzozethrene derivatives (3a,b) are synthesized through a palladium-catalyzed cyclodimerization reaction. X-ray crystallographic analysis shows that these molecules are highly twisted owing to congestion at the cove region. Broken-symmetry DFT calculations predict that they have a singlet biradical ground state with a smaller biradical character and a large singlet-triplet energy gap; these predictions are supported by NMR and electronic absorption measurements. They have small energy gaps and exhibit farred/near-infrared absorption/emission and amphoteric redox behaviors.

  7. The Twist Tensor Nuclear Norm for Video Completion.

    Science.gov (United States)

    Hu, Wenrui; Tao, Dacheng; Zhang, Wensheng; Xie, Yuan; Yang, Yehui

    2017-12-01

    In this paper, we propose a new low-rank tensor model based on the circulant algebra, namely, twist tensor nuclear norm (t-TNN). The twist tensor denotes a three-way tensor representation to laterally store 2-D data slices in order. On one hand, t-TNN convexly relaxes the tensor multirank of the twist tensor in the Fourier domain, which allows an efficient computation using fast Fourier transform. On the other, t-TNN is equal to the nuclear norm of block circulant matricization of the twist tensor in the original domain, which extends the traditional matrix nuclear norm in a block circulant way. We test the t-TNN model on a video completion application that aims to fill missing values and the experiment results validate its effectiveness, especially when dealing with video recorded by a nonstationary panning camera. The block circulant matricization of the twist tensor can be transformed into a circulant block representation with nuclear norm invariance. This representation, after transformation, exploits the horizontal translation relationship between the frames in a video, and endows the t-TNN model with a more powerful ability to reconstruct panning videos than the existing state-of-the-art low-rank models.

  8. Screw-vector bond graphs for kinetic-static modelling and analysis of mechanisms

    International Nuclear Information System (INIS)

    Bidard, Catherine

    1994-01-01

    This dissertation deals with the kinetic-static modelling and analysis of spatial mechanisms used in robotics systems. A framework is proposed, which embodies a geometrical and a network approach for kinetic-static modelling. For this purpose we use screw theory and bond graphs. A new form of bond graphs is introduced: the screw-vector bond graph, whose power variables are defined to be wrenches and twists expressed as intrinsic screw-vectors. The mechanism is then identified as a network, whose components are kinematic pairs and whose topology is described by a directed graph. A screw-vector Simple Junction Structure represents the topological constraints. Kinematic pairs are represented by one-port elements, defined by two reciprocal screw-vector spaces. Using dual bases of screw-vectors, a generic decomposition of kinematic pair elements is given. The reduction of kinetic-static models of series and parallel kinematic chains is used in order to derive kinetic-static functional models in geometric form. Thereupon, the computational causality assignment is adapted for the graphical analysis of the mobility and the functioning of spatial mechanisms, based on completely or incompletely specified models. (author) [fr

  9. Modal Properties and Stability of Bend-Twist Coupled Wind Turbine Blades

    DEFF Research Database (Denmark)

    Stäblein, Alexander R.; Hansen, Morten Hartvig; Verelst, David Robert

    2017-01-01

    a steady-state equilibrium using the aero-servo-elastic tool HAWCStab2 which has been extended by a beam element that allows for fully coupled cross-sectional properties. Bend-twist coupling is introduced in the cross-sectional stiffness matrix by means of coupling coefficients that introduce twist...

  10. Quantum walks on quotient graphs

    International Nuclear Information System (INIS)

    Krovi, Hari; Brun, Todd A.

    2007-01-01

    A discrete-time quantum walk on a graph Γ is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states the walk will be confined to a subspace of the original Hilbert space. Symmetries of the original graph, given by its automorphism group, can be inherited by the evolution operator. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup H of the automorphism group and illustrate it with examples. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup H used to construct it. The quotient graph is constructed by removing the symmetries of the subgroup H from the original graph. We then analyze the behavior of hitting times on quotient graphs. Hitting time is the average time it takes a walk to reach a given final vertex from a given initial vertex. It has been shown in earlier work [Phys. Rev. A 74, 042334 (2006)] that the hitting time for certain initial states of a quantum walks can be infinite, in contrast to classical random walks. We give a condition which determines whether the quotient graph has infinite hitting times given that they exist in the original graph. We apply this condition for the examples discussed and determine which quotient graphs have infinite hitting times. All known examples of quantum walks with hitting times which are short compared to classical random walks correspond to systems with quotient graphs much smaller than the original graph; we conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speedup

  11. Twisted network programming essentials

    CERN Document Server

    Fettig, Abe

    2005-01-01

    Twisted Network Programming Essentials from O'Reilly is a task-oriented look at this new open source, Python-based technology. The book begins with recommendations for various plug-ins and add-ons to enhance the basic package as installed. It then details Twisted's collection simple network protocols, and helper utilities. The book also includes projects that let you try out the Twisted framework for yourself. For example, you'll find examples of using Twisted to build web services applications using the REST architecture, using XML-RPC, and using SOAP. Written for developers who want to s

  12. A reduced-amide inhibitor of Pin1 binds in a conformation resembling a twisted-amide transition state.

    Science.gov (United States)

    Xu, Guoyan G; Zhang, Yan; Mercedes-Camacho, Ana Y; Etzkorn, Felicia A

    2011-11-08

    The mechanism of the cell cycle regulatory peptidyl prolyl isomerase (PPIase), Pin1, was investigated using reduced-amide inhibitors designed to mimic the twisted-amide transition state. Inhibitors, R-pSer-Ψ[CH(2)N]-Pro-2-(indol-3-yl)ethylamine, 1 [R = fluorenylmethoxycarbonyl (Fmoc)] and 2 (R = Ac), of Pin1 were synthesized and bioassayed. Inhibitor 1 had an IC(50) value of 6.3 μM, which is 4.5-fold better for Pin1 than our comparable ground-state analogue, a cis-amide alkene isostere-containing inhibitor. The change of Fmoc to Ac in 2 improved aqueous solubility for structural determination and resulted in an IC(50) value of 12 μM. The X-ray structure of the complex of 2 bound to Pin1 was determined to 1.76 Å resolution. The structure revealed that the reduced amide adopted a conformation similar to the proposed twisted-amide transition state of Pin1, with a trans-pyrrolidine conformation of the prolyl ring. A similar conformation of substrate would be destabilized relative to the planar amide conformation. Three additional reduced amides, with Thr replacing Ser and l- or d-pipecolate (Pip) replacing Pro, were slightly weaker inhibitors of Pin1.

  13. Modern graph theory

    CERN Document Server

    Bollobás, Béla

    1998-01-01

    The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed ...

  14. Modal properties and stability of bend–twist coupled wind turbine blades

    Directory of Open Access Journals (Sweden)

    A. R. Stäblein

    2017-06-01

    Full Text Available Coupling between bending and twist has a significant influence on the aeroelastic response of wind turbine blades. The coupling can arise from the blade geometry (e.g. sweep, prebending, or deflection under load or from the anisotropic properties of the blade material. Bend–twist coupling can be utilized to reduce the fatigue loads of wind turbine blades. In this study the effects of material-based coupling on the aeroelastic modal properties and stability limits of the DTU 10 MW Reference Wind Turbine are investigated. The modal properties are determined by means of eigenvalue analysis around a steady-state equilibrium using the aero-servo-elastic tool HAWCStab2 which has been extended by a beam element that allows for fully coupled cross-sectional properties. Bend–twist coupling is introduced in the cross-sectional stiffness matrix by means of coupling coefficients that introduce twist for flapwise (flap–twist coupling or edgewise (edge–twist coupling bending. Edge–twist coupling can increase or decrease the damping of the edgewise mode relative to the reference blade, depending on the operational condition of the turbine. Edge–twist to feather coupling for edgewise deflection towards the leading edge reduces the inflow speed at which the blade becomes unstable. Flap–twist to feather coupling for flapwise deflections towards the suction side increase the frequency and reduce damping of the flapwise mode. Flap–twist to stall reduces frequency and increases damping. The reduction of blade root flapwise and tower bottom fore–aft moments due to variations in mean wind speed of a flap–twist to feather blade are confirmed by frequency response functions.

  15. Discriminating between brain rest and attention states using fMRI connectivity graphs and subtree SVM

    Science.gov (United States)

    Mokhtari, Fatemeh; Bakhtiari, Shahab K.; Hossein-Zadeh, Gholam Ali; Soltanian-Zadeh, Hamid

    2012-02-01

    Decoding techniques have opened new windows to explore the brain function and information encoding in brain activity. In the current study, we design a recursive support vector machine which is enriched by a subtree graph kernel. We apply the classifier to discriminate between attentional cueing task and resting state from a block design fMRI dataset. The classifier is trained using weighted fMRI graphs constructed from activated regions during the two mentioned states. The proposed method leads to classification accuracy of 1. It is also able to elicit discriminative regions and connectivities between the two states using a backward edge elimination algorithm. This algorithm shows the importance of regions including cerebellum, insula, left middle superior frontal gyrus, post cingulate cortex, and connectivities between them to enhance the correct classification rate.

  16. System dynamics and control with bond graph modeling

    CERN Document Server

    Kypuros, Javier

    2013-01-01

    Part I Dynamic System ModelingIntroduction to System DynamicsIntroductionSystem Decomposition and Model ComplexityMathematical Modeling of Dynamic SystemsAnalysis and Design of Dynamic SystemsControl of Dynamic SystemsDiagrams of Dynamic SystemsA Graph-Centered Approach to ModelingSummaryPracticeExercisesBasic Bond Graph ElementsIntroductionPower and Energy VariablesBasic 1-Port ElementsBasic 2-Ports ElementsJunction ElementsSimple Bond Graph ExamplesSummaryPracticeExercisesBond Graph Synthesis and Equation DerivationIntroductionGeneral GuidelinesMechanical TranslationMechanical RotationElectrical CircuitsHydraulic CircuitsMixed SystemsState Equation DerivationState-Space RepresentationsAlgebraic Loops and Derivative CausalitySummaryPracticeExercisesImpedance Bond GraphsIntroductionLaplace Transform of the State-Space EquationBasic 1-Port ImpedancesImpedance Bond Graph SynthesisJunctions, Transformers, and GyratorsEffort and Flow DividersSign ChangesTransfer Function DerivationAlternative Derivation of Transf...

  17. Generalised twisted partition functions

    CERN Document Server

    Petkova, V B

    2001-01-01

    We consider the set of partition functions that result from the insertion of twist operators compatible with conformal invariance in a given 2D Conformal Field Theory (CFT). A consistency equation, which gives a classification of twists, is written and solved in particular cases. This generalises old results on twisted torus boundary conditions, gives a physical interpretation of Ocneanu's algebraic construction, and might offer a new route to the study of properties of CFT.

  18. High Dimensional Spectral Graph Theory and Non-backtracking Random Walks on Graphs

    Science.gov (United States)

    Kempton, Mark

    This thesis has two primary areas of focus. First we study connection graphs, which are weighted graphs in which each edge is associated with a d-dimensional rotation matrix for some fixed dimension d, in addition to a scalar weight. Second, we study non-backtracking random walks on graphs, which are random walks with the additional constraint that they cannot return to the immediately previous state at any given step. Our work in connection graphs is centered on the notion of consistency, that is, the product of rotations moving from one vertex to another is independent of the path taken, and a generalization called epsilon-consistency. We present higher dimensional versions of the combinatorial Laplacian matrix and normalized Laplacian matrix from spectral graph theory, and give results characterizing the consistency of a connection graph in terms of the spectra of these matrices. We generalize several tools from classical spectral graph theory, such as PageRank and effective resistance, to apply to connection graphs. We use these tools to give algorithms for sparsification, clustering, and noise reduction on connection graphs. In non-backtracking random walks, we address the question raised by Alon et. al. concerning how the mixing rate of a non-backtracking random walk to its stationary distribution compares to the mixing rate for an ordinary random walk. Alon et. al. address this question for regular graphs. We take a different approach, and use a generalization of Ihara's Theorem to give a new proof of Alon's result for regular graphs, and to extend the result to biregular graphs. Finally, we give a non-backtracking version of Polya's Random Walk Theorem for 2-dimensional grids.

  19. Using Canonical Forms for Isomorphism Reduction in Graph-based Model Checking

    NARCIS (Netherlands)

    Kant, Gijs

    Graph isomorphism checking can be used in graph-based model checking to achieve symmetry reduction. Instead of one-to-one comparing the graph representations of states, canonical forms of state graphs can be computed. These canonical forms can be used to store and compare states. However, computing

  20. Comparison between state graphs and fault trees for sequential and repairable systems

    International Nuclear Information System (INIS)

    Soussan, D.; Saignes, P.

    1996-01-01

    In French PSA (Probabilistic Safety Assessment) 1300 for the 1300 Mwe PWR plants carried out by EDF, sequential and reparable systems are modeled with state graphs. This method is particularly convenient for modeling dynamic systems with long-term missions but induces a bad traceability and understandability of models. In the objective of providing elements for rewriting PSA 1300 with only boolean models, EDF has asked CEA to participate to a methodological study. The aim is to carry out a feasibility study of transposition of state graphs models into fault trees on Component Cooling System and Essential Service Water System (CCS/ESWS) and to draw a methodological guide for transposition. The study realized on CCS/ESWS involves two main axes: quantification of cold source loss (as an accident sequence initiating event, called H1); quantification of the CCS/ESWS missions in accident sequences. The subject of this article is to show that this transformation is applicable with minimum distortions of the results and to determine the hypotheses, the conditions and the limits of application of this conversion. (authors). 2 refs

  1. Observations on discretization errors in twisted-mass lattice QCD

    International Nuclear Information System (INIS)

    Sharpe, Stephen R.

    2005-01-01

    I make a number of observations concerning discretization errors in twisted-mass lattice QCD that can be deduced by applying chiral perturbation theory including lattice artifacts. (1) The line along which the partially conserved axial current quark mass vanishes in the untwisted-mass-twisted-mass plane makes an angle to the twisted-mass axis which is a direct measure of O(a) terms in the chiral Lagrangian, and is found numerically to be large; (2) Numerical results for pionic quantities in the mass plane show the qualitative properties predicted by chiral perturbation theory, in particular, an asymmetry in slopes between positive and negative untwisted quark masses; (3) By extending the description of the 'Aoki regime' (where m q ∼a 2 Λ QCD 3 ) to next-to-leading order in chiral perturbation theory I show how the phase-transition lines and lines of maximal twist (using different definitions) extend into this region, and give predictions for the functional form of pionic quantities; (4) I argue that the recent claim that lattice artifacts at maximal twist have apparent infrared singularities in the chiral limit results from expanding about the incorrect vacuum state. Shifting to the correct vacuum (as can be done using chiral perturbation theory) the apparent singularities are summed into nonsingular, and furthermore predicted, forms. I further argue that there is no breakdown in the Symanzik expansion in powers of lattice spacing, and no barrier to simulating at maximal twist in the Aoki regime

  2. Quantum snake walk on graphs

    International Nuclear Information System (INIS)

    Rosmanis, Ansis

    2011-01-01

    I introduce a continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First, I analyze the quantum snake walk on the line, and I show that, even though most states stay localized throughout the evolution, there are specific states that most likely move on the line as wave packets with momentum inversely proportional to the length of the snake. Next, I discuss how an algorithm based on the quantum snake walk might potentially be able to solve an extended version of the glued trees problem, which asks to find a path connecting both roots of the glued trees graph. To the best of my knowledge, no efficient quantum algorithm solving this problem is known yet.

  3. Optics of twisted nematic and supertwisted nematic liquid-crystal displays

    Science.gov (United States)

    Leenhouts, F.; Schadt, M.

    1986-11-01

    For the first time calculations of the off-state transmission of twisted nematic liquid-crystal displays (LCD's) are presented which exhibit twist angles greater than the conventional 90 °. The transmission has been calculated using a treatment introduced by Priestley. In addition, the CIE (Commission Internationale d'Eclairage) color coordinates were evaluated which, together with the brightness, determine the optical appearance of an LCD. The finite efficiency of the polarizers was taken into account. The results are compared with those obtained for conventional 90 ° twisted nematic LCD's. From the calculations follow the conditions required to obtain optimal contrast and steep electro-optical characteristics in 180 ° supertwisted LCD's designed for high information content applications.

  4. Chromatic polynomials of random graphs

    International Nuclear Information System (INIS)

    Van Bussel, Frank; Fliegner, Denny; Timme, Marc; Ehrlich, Christoph; Stolzenberg, Sebastian

    2010-01-01

    Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.

  5. Twist-stretch profiles of DNA chains

    Science.gov (United States)

    Zoli, Marco

    2017-06-01

    Helical molecules change their twist number under the effect of a mechanical load. We study the twist-stretch relation for a set of short DNA molecules modeled by a mesoscopic Hamiltonian. Finite temperature path integral techniques are applied to generate a large ensemble of possible configurations for the base pairs of the sequence. The model also accounts for the bending and twisting fluctuations between adjacent base pairs along the molecules stack. Simulating a broad range of twisting conformation, we compute the helix structural parameters by averaging over the ensemble of base pairs configurations. The method selects, for any applied force, the average twist angle which minimizes the molecule’s free energy. It is found that the chains generally over-twist under an applied stretching and the over-twisting is physically associated to the contraction of the average helix diameter, i.e. to the damping of the base pair fluctuations. Instead, assuming that the maximum amplitude of the bending fluctuations may decrease against the external load, the DNA molecule first over-twists for weak applied forces and then untwists above a characteristic force value. Our results are discussed in relation to available experimental information albeit for kilo-base long molecules.

  6. DC conductivity of twisted bilayer graphene: Angle-dependent transport properties and effects of disorder

    Science.gov (United States)

    Andelković, M.; Covaci, L.; Peeters, F. M.

    2018-03-01

    The in-plane dc conductivity of twisted bilayer graphene is calculated using an expansion of the real-space Kubo-Bastin conductivity in terms of Chebyshev polynomials. We investigate within a tight-binding approach the transport properties as a function of rotation angle, applied perpendicular electric field, and vacancy disorder. We find that for high-angle twists, the two layers are effectively decoupled, and the minimum conductivity at the Dirac point corresponds to double the value observed in monolayer graphene. This remains valid even in the presence of vacancies, hinting that chiral symmetry is still preserved. On the contrary, for low twist angles, the conductivity at the Dirac point depends on the twist angle and is not protected in the presence of disorder. Furthermore, for low angles and in the presence of an applied electric field, we find that the chiral boundary states emerging between AB and BA regions contribute to the dc conductivity, despite the appearance of localized states in the AA regions. The results agree qualitatively with recent transport experiments in low-angle twisted bilayer graphene.

  7. Co-Roman domination in graphs

    Indian Academy of Sciences (India)

    1National Centre for Advanced Research in Discrete Mathematics ... 3Department of Computer Science, Ball State University, Muncie, IN, USA .... The corona of two disjoint graphs G1 and G2 is defined to be the graph G = G1 ◦ G2,.

  8. Noncommutative geometry and twisted conformal symmetry

    International Nuclear Information System (INIS)

    Matlock, Peter

    2005-01-01

    The twist-deformed conformal algebra is constructed as a Hopf algebra with twisted coproduct. This allows for the definition of conformal symmetry in a noncommutative background geometry. The twisted coproduct is reviewed for the Poincare algebra and the construction is then extended to the full conformal algebra. The case of Moyal-type noncommutativity of the coordinates is considered. It is demonstrated that conformal invariance need not be viewed as incompatible with noncommutative geometry; the noncommutativity of the coordinates appears as a consequence of the twisting, as has been shown in the literature in the case of the twisted Poincare algebra

  9. Proceedings of the third "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'16)

    DEFF Research Database (Denmark)

    2016-01-01

    The third edition of the "international - Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST) took place in Aalborg, the 4th largest city in Denmark situated beautifully in the northern part of the country, from the 24th to 26th of August 2016. The workshop venue...... learning; Optimization for sparse modelling; Information theory, geometry and randomness; Sparsity? What's next? (Discrete-valued signals; Union of low-dimensional spaces, Cosparsity, mixed/group norm, model-based, low-complexity models, ...); Matrix/manifold sensing/processing (graph, low...

  10. Transduction on Directed Graphs via Absorbing Random Walks.

    Science.gov (United States)

    De, Jaydeep; Zhang, Xiaowei; Lin, Feng; Cheng, Li

    2017-08-11

    In this paper we consider the problem of graph-based transductive classification, and we are particularly interested in the directed graph scenario which is a natural form for many real world applications.Different from existing research efforts that either only deal with undirected graphs or circumvent directionality by means of symmetrization, we propose a novel random walk approach on directed graphs using absorbing Markov chains, which can be regarded as maximizing the accumulated expected number of visits from the unlabeled transient states. Our algorithm is simple, easy to implement, and works with large-scale graphs on binary, multiclass, and multi-label prediction problems. Moreover, it is capable of preserving the graph structure even when the input graph is sparse and changes over time, as well as retaining weak signals presented in the directed edges. We present its intimate connections to a number of existing methods, including graph kernels, graph Laplacian based methods, and interestingly, spanning forest of graphs. Its computational complexity and the generalization error are also studied. Empirically our algorithm is systematically evaluated on a wide range of applications, where it has shown to perform competitively comparing to a suite of state-of-the-art methods. In particular, our algorithm is shown to work exceptionally well with large sparse directed graphs with e.g. millions of nodes and tens of millions of edges, where it significantly outperforms other state-of-the-art methods. In the dynamic graph setting involving insertion or deletion of nodes and edge-weight changes over time, it also allows efficient online updates that produce the same results as of the batch update counterparts.

  11. TEK twisted gradient flow running coupling

    CERN Document Server

    Pérez, Margarita García; Keegan, Liam; Okawa, Masanori

    2014-01-01

    We measure the running of the twisted gradient flow coupling in the Twisted Eguchi-Kawai (TEK) model, the SU(N) gauge theory on a single site lattice with twisted boundary conditions in the large N limit.

  12. Quantum walk on a chimera graph

    Science.gov (United States)

    Xu, Shu; Sun, Xiangxiang; Wu, Jizhou; Zhang, Wei-Wei; Arshed, Nigum; Sanders, Barry C.

    2018-05-01

    We analyse a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum walk features such as localization that starkly distinguishes classical from quantum behaviour. Motivated by technological thrusts, we study continuous-time quantum walk on enhanced variants of the chimera graph and on diminished chimera graph with a random removal of vertices. We explain the quantum walk by constructing a generating set for a suitable subgroup of graph isomorphisms and corresponding symmetry operators that commute with the quantum walk Hamiltonian; the Hamiltonian and these symmetry operators provide a complete set of labels for the spectrum and the stationary states. Our quantum walk characterization of the chimera graph and its variants yields valuable insights into graphs used for designing quantum-annealers.

  13. On the twist-2 and twist-3 contributions to the spin-dependent electroweak structure functions

    International Nuclear Information System (INIS)

    Bluemlein, J.; Kochelev, N.

    1997-01-01

    The twist-2 and twist-3 contributions of the polarized deep-inelastic structure functions are calculated both for neutral and charged current interactions using the operator product expansion in lowest order in QCD. The relations between the different structure functions are determined. New integral relations are derived between the twist-2 contributions of the structure functions g 3 (x,Q 2 ) and g 5 (x,Q 2 ) and between combinations of the twist-3 contributions to the structure functions g 2 (x,Q 2 ) and g 3 (x,Q 2 ). The sum rules for polarized deep-inelastic scattering are discussed in detail. (orig.)

  14. Twisted rudder for reducing fuel-oil consumption

    Directory of Open Access Journals (Sweden)

    Jung-Hun Kim

    2014-09-01

    Full Text Available Three twisted rudders fit for large container ships have been developed; 1 the Z-twisted rudder that is an asymmetry type taking into consideration incoming flow angles of the propeller slipstream, 2 the ZB-twisted rudder with a rudder bulb added onto the Z-twisted rudder, and 3 the ZB-F twisted rudder with a rudder fin attached to the ZB-twisted rudder. The twisted rudders have been designed computationally with the hydrodynamic characteristics in a self-propulsion condition in mind. The governing equation is the Navier-Stokes equations in an unsteady turbulent flow. The turbulence model applied is the Reynolds stress. The calculation was carried out in towing and self-propulsion conditions. The sliding mesh technique was employed to simulate the flow around the propeller. The speed performances of the ship with the twisted rudders were verified through model tests in a towing tank. The twisted versions showed greater performance driven by increased hull efficiency from less thrust deduction fraction and more effective wake fraction and decreased propeller rotating speed.

  15. Anisotropic piezoelectric twist actuation of helicopter rotor blades: Aeroelastic analysis and design optimization

    Science.gov (United States)

    Wilkie, William Keats

    1997-12-01

    An aeroelastic model suitable for control law and preliminary structural design of composite helicopter rotor blades incorporating embedded anisotropic piezoelectric actuator laminae is developed. The aeroelasticity model consists of a linear, nonuniform beam representation of the blade structure, including linear piezoelectric actuation terms, coupled with a nonlinear, finite-state unsteady aerodynamics model. A Galerkin procedure and numerical integration in the time domain are used to obtain a soluti An aeroelastic model suitable for control law and preliminary structural design of composite helicopter rotor blades incorporating embedded anisotropic piezoelectric actuator laminae is developed. The aeroelasticity model consists of a linear, nonuniform beam representation of the blade structure, including linear piezoelectric actuation terms, coupled with a nonlinear, finite-state unsteady aerodynamics model. A Galerkin procedure and numerical integration in the time domain are used to obtain amited additional piezoelectric material mass, it is shown that blade twist actuation approaches which exploit in-plane piezoelectric free-stain anisotropies are capable of producing amplitudes of oscillatory blade twisting sufficient for rotor vibration reduction applications. The second study examines the effectiveness of using embedded piezoelectric actuator laminae to alleviate vibratory loads due to retreating blade stall. A 10 to 15 percent improvement in dynamic stall limited forward flight speed, and a 5 percent improvement in stall limited rotor thrust were numerically demonstrated for the active twist rotor blade relative to a conventional blade design. The active twist blades are also demonstrated to be more susceptible than the conventional blades to dynamic stall induced vibratory loads when not operating with twist actuation. This is the result of designing the active twist blades with low torsional stiffness in order to maximize piezoelectric twist authority

  16. Nonsnaking doubly diffusive convectons and the twist instability

    Energy Technology Data Exchange (ETDEWEB)

    Beaume, Cédric, E-mail: ced.beaume@gmail.com; Knobloch, Edgar, E-mail: knobloch@berkeley.edu [Department of Physics, University of California, Berkeley, California 94720 (United States); Bergeon, Alain, E-mail: alain.bergeon@imft.fr [Université de Toulouse, INPT, UPS, IMFT (Institut de Mécanique des Fluides de Toulouse), Allée Camille Soula, F-31400 Toulouse, France and CNRS, IMFT, F-31400 Toulouse (France)

    2013-11-15

    Doubly diffusive convection in a three-dimensional horizontally extended domain with a square cross section in the vertical is considered. The fluid motion is driven by horizontal temperature and concentration differences in the transverse direction. When the buoyancy ratio N = −1 and the Rayleigh number is increased the conduction state loses stability to a subcritical, almost two-dimensional roll structure localized in the longitudinal direction. This structure exhibits abrupt growth in length near a particular value of the Rayleigh number but does not snake. Prior to this filling transition the structure becomes unstable to a secondary twist instability generating a pair of stationary, spatially localized zigzag states. In contrast to the primary branch these states snake as they grow in extent and eventually fill the whole domain. The origin of the twist instability and the properties of the resulting localized structures are investigated for both periodic and no-slip boundary conditions in the extended direction.

  17. From starproducts to Drinfeld-twists. Present and future applications

    International Nuclear Information System (INIS)

    Koch, Florian

    2008-01-01

    Physics comes up with models that invoke noncommutative structures in configuration space. Such structures are dual to the deformed coalgebra sector of a represented symmetry algebra. In the mean time such deformations are performed in terms of the symmetry algebra itself via twists or quasitriangular structures. One might thus find oneself in the bad situation that the symmetry algebra is not large enough to provide the required twist that dually matches the noncommutative structure found. It thus has to remain in the unpleasant state of being without any notion of symmetry. We show how starproducts can be pushed to twists by introducing a larger algebra that accommodates any finite dimensional representation of a Lie-algebra. This new algebra is similar to a Heisenberg-algebra but in contrast to the latter can be enhanced to a Hopf-algebra. Some Examples are given. (author)

  18. Fiber-Optic Sensors for Measurements of Torsion, Twist and Rotation: A Review.

    Science.gov (United States)

    Budinski, Vedran; Donlagic, Denis

    2017-02-23

    Optical measurement of mechanical parameters is gaining significant commercial interest in different industry sectors. Torsion, twist and rotation are among the very frequently measured mechanical parameters. Recently, twist/torsion/rotation sensors have become a topic of intense fiber-optic sensor research. Various sensing concepts have been reported. Many of those have different properties and performances, and many of them still need to be proven in out-of-the laboratory use. This paper provides an overview of basic approaches and a review of current state-of-the-art in fiber optic sensors for measurements of torsion, twist and/or rotation.Invited Paper.

  19. Tilting-Twisting-Rolling: a pen-based technique for compass geometric construction

    Institute of Scientific and Technical Information of China (English)

    Fei LYU; Feng TIAN; Guozhong DAI; Hongan WANG

    2017-01-01

    This paper presents a new pen-based technique,Tilting-Twisting-Rolling,to support compass geometric construction.By leveraging the 3D orientation information and 3D rotation information of a pen,this technique allows smooth pen action to complete multi-step geometric construction without switching task states.Results from a user study show this Tilting-Twisting-Rolling technique can improve user performance and user experience in compass geometric construction.

  20. Twist map, the extended Frenkel-Kontorova model and the devil's staircase

    International Nuclear Information System (INIS)

    Aubry, S.

    1982-01-01

    Exact results obtained on the discrete Frenkel Kontorova (FK) model and its extensions during the past few years are reviewed. These models are associated with area preserving twist maps of the cylinder (or a part of it) onto itself. The theorems obtained for the FK model thus yields new theorems for the twist maps. The exact structure of the ground-states which are either commensurate or incommensurate and assert the existence of elementary discommensurations under certain necessary and sufficient conditions is described. Necessary conditions for the trajectories to represent metastable configurations, which can be chaotic, are given. The existence of a finite Peierl Nabarro barrier for elementary discommensurations is connected with a property of non-integrability of the twist map. The existence of KAM tori corresponds to undefectible incommensurate ground-states and a theorem is given which asserts that when the phenon spectrum of an incommensurate ground-state exhibits a finite gap, then the corresponding trajectory is dense on a Cantor set with zero measure length. These theorems, when applied to the initial FK model, allows one to prove the existence of the transition by breaking of analyticity for the incommensurate structures when the parameter which describes the discrepancy of the model to the integrable limit varies. Finally, we describe a theorem proving the existence of a devil's staircase for the variation curve of the atomic mean distance versus a chemical potential, for certain properties of the twist map which are generally satisfied

  1. Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models

    Directory of Open Access Journals (Sweden)

    Tomasz Kajdanowicz

    2016-09-01

    Full Text Available Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdős–Renyi random graph model, Watts–Strogatz small world model, Albert–Barabási preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov–Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality. We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.

  2. The Effects of Exercise Intensity vs. Metabolic State on the Variability and Magnitude of Left Ventricular Twist Mechanics during Exercise.

    Directory of Open Access Journals (Sweden)

    Craig Armstrong

    Full Text Available Increased left ventricular (LV twist and untwisting rate (LV twist mechanics are essential responses of the heart to exercise. However, previously a large variability in LV twist mechanics during exercise has been observed, which complicates the interpretation of results. This study aimed to determine some of the physiological sources of variability in LV twist mechanics during exercise. Sixteen healthy males (age: 22 ± 4 years, [Formula: see text]O2peak: 45.5 ± 6.9 ml∙kg-1∙min-1, range of individual anaerobic threshold (IAT: 32-69% of [Formula: see text]O2peak were assessed at rest and during exercise at: i the same relative exercise intensity, 40%peak, ii at 2% above IAT, and, iii at 40%peak with hypoxia (40%peak+HYP. LV volumes were not significantly different between exercise conditions (P > 0.05. However, the mean margin of error of LV twist was significantly lower (F2,47 = 2.08, P 0.05. Overall, LV twist mechanics were linearly related to rate pressure product. During exercise, the intra-individual variability of LV twist mechanics is smaller at the same relative exercise intensity compared with IAT. However, the absolute magnitude (degrees of LV twist mechanics appears to be associated with the prevailing rate pressure product. Exercise tests that evaluate LV twist mechanics should be standardised by relative exercise intensity and rate pressure product be taken into account when interpreting results.

  3. The Effects of Exercise Intensity vs. Metabolic State on the Variability and Magnitude of Left Ventricular Twist Mechanics during Exercise

    Science.gov (United States)

    Armstrong, Craig; Samuel, Jake; Yarlett, Andrew; Cooper, Stephen-Mark; Stembridge, Mike; Stöhr, Eric J.

    2016-01-01

    Increased left ventricular (LV) twist and untwisting rate (LV twist mechanics) are essential responses of the heart to exercise. However, previously a large variability in LV twist mechanics during exercise has been observed, which complicates the interpretation of results. This study aimed to determine some of the physiological sources of variability in LV twist mechanics during exercise. Sixteen healthy males (age: 22 ± 4 years, V˙O2peak: 45.5 ± 6.9 ml∙kg-1∙min-1, range of individual anaerobic threshold (IAT): 32–69% of V˙O2peak) were assessed at rest and during exercise at: i) the same relative exercise intensity, 40%peak, ii) at 2% above IAT, and, iii) at 40%peak with hypoxia (40%peak+HYP). LV volumes were not significantly different between exercise conditions (P > 0.05). However, the mean margin of error of LV twist was significantly lower (F2,47 = 2.08, P 0.05). Overall, LV twist mechanics were linearly related to rate pressure product. During exercise, the intra-individual variability of LV twist mechanics is smaller at the same relative exercise intensity compared with IAT. However, the absolute magnitude (degrees) of LV twist mechanics appears to be associated with the prevailing rate pressure product. Exercise tests that evaluate LV twist mechanics should be standardised by relative exercise intensity and rate pressure product be taken into account when interpreting results. PMID:27100099

  4. Exclusive processes beyond leading twist: {gamma}*T {yields} {rho}T impact factor with twist three accuracy

    Energy Technology Data Exchange (ETDEWEB)

    Szymanowski, Lech [Soltan Institute for Nuclear Studies, Hoza 69, 00691, Warsaw (Poland); Anikin, Igor V. [Joint Institute for Nuclear Research - JINR, Joliot-Curie st., 6, Moskovskaya obl., 141980, Dubna (Russian Federation); Ivanov, Dmitry Yu [Sobolev Institute of Mathematics, Acad. Koptyug pr., 4, 630090 Novosibirsk (Russian Federation); Pire, Bernard [Centre de Physique Theorique - CPHT, UMR 7644, Ecole Polytechnique, Bat. 6, RDC, F91128 Palaiseau Cedex (France); Wallon, Samuel [Laboratoire de Physique Theorique d' Orsay - LPT, Bat. 210, Univ. Paris-Sud 11, 91405 Orsay Cedex (France)

    2010-07-01

    We describe a consistent approach to factorization of scattering amplitudes for exclusive processes beyond the leading twist approximation. The method is based on the Taylor expansion of the scattering amplitude in the momentum space around the dominant light-cone direction and thus naturally introduces an appropriate set of non-perturbative correlators which encode effects not only of the lowest but also of the higher Fock states of the produced particle. The reduction of original set of correlators to a set of independent ones is achieved with the help of equations of motion and invariance of the scattering amplitude under rotation on the light-cone. As a concrete application, we compute the expressions of the impact factor for the transition of virtual photon to transversally polarised {rho}-meson up to the twist 3 accuracy. (Phys.Lett.B682:413-418,2010 and Nucl.Phys.B828:1-68,2010.). (authors)

  5. Some remarks on definability of process graphs

    NARCIS (Netherlands)

    Grabmayer, C.A.; Klop, J.W.; Luttik, B.; Baier, C.; Hermanns, H.

    2006-01-01

    We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and BPP. For a process graph G, the density function in a state s maps a natural number n to the number of states of G with distance less or

  6. Fiber-Optic Sensors for Measurements of Torsion, Twist and Rotation: A Review

    Directory of Open Access Journals (Sweden)

    Vedran Budinski

    2017-02-01

    Full Text Available Optical measurement of mechanical parameters is gaining significant commercial interest in different industry sectors. Torsion, twist and rotation are among the very frequently measured mechanical parameters. Recently, twist/torsion/rotation sensors have become a topic of intense fiber-optic sensor research. Various sensing concepts have been reported. Many of those have different properties and performances, and many of them still need to be proven in out-of-the laboratory use. This paper provides an overview of basic approaches and a review of current state-of-the-art in fiber optic sensors for measurements of torsion, twist and/or rotation.Invited Paper

  7. Analysis list: Twist1 [Chip-atlas[Archive

    Lifescience Database Archive (English)

    Full Text Available Twist1 Embryo,Neural + mm9 http://dbarchive.biosciencedbc.jp/kyushu-u/mm9/target/Tw...ist1.1.tsv http://dbarchive.biosciencedbc.jp/kyushu-u/mm9/target/Twist1.5.tsv http://dbarchive.biosciencedbc....jp/kyushu-u/mm9/target/Twist1.10.tsv http://dbarchive.biosciencedbc.jp/kyushu-u/mm9/colo/Twist1.Embryo.tsv,http://dbarchive.bioscien...cedbc.jp/kyushu-u/mm9/colo/Twist1.Neural.tsv http://dbarchive.bioscience...dbc.jp/kyushu-u/mm9/colo/Embryo.gml,http://dbarchive.biosciencedbc.jp/kyushu-u/mm9/colo/Neural.gml ...

  8. Modeling and control of active twist aircraft

    Science.gov (United States)

    Cramer, Nicholas Bryan

    The Wright Brothers marked the beginning of powered flight in 1903 using an active twist mechanism as their means of controlling roll. As time passed due to advances in other technologies that transformed aviation the active twist mechanism was no longer used. With the recent advances in material science and manufacturability, the possibility of the practical use of active twist technologies has emerged. In this dissertation, the advantages and disadvantages of active twist techniques are investigated through the development of an aeroelastic modeling method intended for informing the designs of such technologies and wind tunnel testing to confirm the capabilities of the active twist technologies and validate the model. Control principles for the enabling structural technologies are also proposed while the potential gains of dynamic, active twist are analyzed.

  9. Fiber-Optic Sensors for Measurements of Torsion, Twist and Rotation: A Review †

    Science.gov (United States)

    Budinski, Vedran; Donlagic, Denis

    2017-01-01

    Optical measurement of mechanical parameters is gaining significant commercial interest in different industry sectors. Torsion, twist and rotation are among the very frequently measured mechanical parameters. Recently, twist/torsion/rotation sensors have become a topic of intense fiber-optic sensor research. Various sensing concepts have been reported. Many of those have different properties and performances, and many of them still need to be proven in out-of-the laboratory use. This paper provides an overview of basic approaches and a review of current state-of-the-art in fiber optic sensors for measurements of torsion, twist and/or rotation. PMID:28241510

  10. Survey of Approaches to Generate Realistic Synthetic Graphs

    Energy Technology Data Exchange (ETDEWEB)

    Lim, Seung-Hwan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lee, Sangkeun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Shankar, Mallikarjun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Imam, Neena [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2016-10-01

    A graph is a flexible data structure that can represent relationships between entities. As with other data analysis tasks, the use of realistic graphs is critical to obtaining valid research results. Unfortunately, using the actual ("real-world") graphs for research and new algorithm development is difficult due to the presence of sensitive information in the data or due to the scale of data. This results in practitioners developing algorithms and systems that employ synthetic graphs instead of real-world graphs. Generating realistic synthetic graphs that provide reliable statistical confidence to algorithmic analysis and system evaluation involves addressing technical hurdles in a broad set of areas. This report surveys the state of the art in approaches to generate realistic graphs that are derived from fitted graph models on real-world graphs.

  11. Pixels to Graphs by Associative Embedding

    KAUST Repository

    Newell, Alejandro

    2017-06-22

    Graphs are a useful abstraction of image content. Not only can graphs represent details about individual objects in a scene but they can capture the interactions between pairs of objects. We present a method for training a convolutional neural network such that it takes in an input image and produces a full graph. This is done end-to-end in a single stage with the use of associative embeddings. The network learns to simultaneously identify all of the elements that make up a graph and piece them together. We benchmark on the Visual Genome dataset, and report a Recall@50 of 9.7% compared to the prior state-of-the-art at 3.4%, a nearly threefold improvement on the challenging task of scene graph generation.

  12. Teaching Spatial Awareness for Better Twisting Somersaults.

    Science.gov (United States)

    Hennessy, Jeff T.

    1985-01-01

    The barani (front somersault with one-half twist) and the back somersault with one twist are basic foundation skills necessary for more advanced twisting maneuvers. Descriptions of these movements on a trampoline surface are offered. (DF)

  13. Perfect state transfer in unitary Cayley graphs over local rings

    Directory of Open Access Journals (Sweden)

    Yotsanan Meemark

    2014-12-01

    Full Text Available In this work, using eigenvalues and eigenvectors of unitary Cayley graphs over finite local rings and elementary linear algebra, we characterize which local rings allowing PST occurring in its unitary Cayley graph. Moreover, we have some developments when $R$ is a product of local rings.

  14. What Would a Graph Look Like in this Layout? A Machine Learning Approach to Large Graph Visualization.

    Science.gov (United States)

    Kwon, Oh-Hyun; Crnovrsanin, Tarik; Ma, Kwan-Liu

    2018-01-01

    Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a "good" layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.

  15. Twist deformations of the supersymmetric quantum mechanics

    Energy Technology Data Exchange (ETDEWEB)

    Castro, P.G.; Chakraborty, B.; Toppan, F., E-mail: pgcastro@cbpf.b, E-mail: biswajit@bose.res.i, E-mail: toppan@cbpf.b [Centro Brasileiro de Pesquisas Fisicas (CBPF), Rio de Janeiro, RJ (Brazil); Kuznetsova, Z., E-mail: zhanna.kuznetsova@ufabc.edu.b [Universidade Federal do ABC (UFABC), Santo Andre, SP (Brazil)

    2009-07-01

    The N-extended supersymmetric quantum mechanics is deformed via an abelian twist which preserves the super-Hopf algebra structure of its universal enveloping superalgebra. Two constructions are possible. For even N one can identify the 1D N-extended superalgebra with the fermionic Heisenberg algebra. Alternatively, supersymmetry generators can be realized as operators belonging to the Universal Enveloping Superalgebra of one bosonic and several fermionic oscillators. The deformed system is described in terms of twisted operators satisfying twist deformed (anti)commutators. The main differences between an abelian twist defined in terms of fermionic operators and an abelian twist defined in terms of bosonic operators are discussed. (author)

  16. Twist-3 effect from the longitudinally polarized proton for ALT in hadron production from pp collisions

    Directory of Open Access Journals (Sweden)

    Yuji Koike

    2016-08-01

    Full Text Available We compute the contribution from the longitudinally polarized proton to the twist-3 double-spin asymmetry ALT in inclusive (light hadron production from proton–proton collisions, i.e., p↑p→→hX. We show that using the relevant QCD equation-of-motion relation and Lorentz invariance relation allows one to eliminate the twist-3 quark-gluon correlator (associated with the longitudinally polarized proton in favor of one-variable twist-3 quark distributions and the (twist-2 transversity parton density. Including this result with the twist-3 pieces associated with the transversely polarized proton and unpolarized final-state hadron (which have already been calculated in the literature, we now have the complete leading-order cross section for this process.

  17. Detectable states, cycle fluxes, and motility scaling of molecular motor kinesin: An integrative kinetic graph theory analysis

    Science.gov (United States)

    Ren, Jie

    2017-12-01

    The process by which a kinesin motor couples its ATPase activity with concerted mechanical hand-over-hand steps is a foremost topic of molecular motor physics. Two major routes toward elucidating kinesin mechanisms are the motility performance characterization of velocity and run length, and single-molecular state detection experiments. However, these two sets of experimental approaches are largely uncoupled to date. Here, we introduce an integrative motility state analysis based on a theorized kinetic graph theory for kinesin, which, on one hand, is validated by a wealth of accumulated motility data, and, on the other hand, allows for rigorous quantification of state occurrences and chemomechanical cycling probabilities. An interesting linear scaling for kinesin motility performance across species is discussed as well. An integrative kinetic graph theory analysis provides a powerful tool to bridge motility and state characterization experiments, so as to forge a unified effort for the elucidation of the working mechanisms of molecular motors.

  18. A graph rewriting programming language for graph drawing

    OpenAIRE

    Rodgers, Peter

    1998-01-01

    This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computationally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools are all text based. Recent developments in graph rewriting systems have produced computationally com...

  19. Ten helical twist angles of B-DNA

    Energy Technology Data Exchange (ETDEWEB)

    Kabsch, W; Sander, C; Trifonov, E N

    1982-01-01

    On the assumption that the twist angles between adjacent base-pairs in the DNA molecule are additive a linear system of 40 equations was derived from experimental measurements of the total twist angles for different pieces of DNA of known sequences. This system of equations is found to be statistically consistent providing a solution for all ten possible twist angles of B-DNA by a least squares fitting procedure. Four of the calculated twist angles were not known before. The other six twist angles calculated are very close to the experimentally measured ones. The data used were obtained by the electrophoretic band-shift method, crystallography and nuclease digestion of DNA adsorbed to mica or Ca-phosphate surface. The validity of the principle of additivity of the twist angles implies that the angle between any particular two base-pairs is a function of only these base-pairs, independent of nearest neighbors.

  20. Cellular Automata on Graphs: Topological Properties of ER Graphs Evolved towards Low-Entropy Dynamics

    Directory of Open Access Journals (Sweden)

    Marc-Thorsten Hütt

    2012-06-01

    Full Text Available Cellular automata (CA are a remarkably  efficient tool for exploring general properties of complex systems and spatiotemporal patterns arising from local rules. Totalistic cellular automata,  where the update  rules depend  only on the density of neighboring states, are at the same time a versatile  tool for exploring  dynamical  processes on graphs. Here we briefly review our previous results on cellular automata on graphs, emphasizing some systematic relationships between network architecture and dynamics identified in this way. We then extend the investigation  towards graphs obtained in a simulated-evolution procedure, starting from Erdő s–Rényi (ER graphs and selecting for low entropies of the CA dynamics. Our key result is a strong association of low Shannon entropies with a broadening of the graph’s degree distribution.

  1. Twisted electron-acoustic waves in plasmas

    International Nuclear Information System (INIS)

    Aman-ur-Rehman; Ali, S.; Khan, S. A.; Shahzad, K.

    2016-01-01

    In the paraxial limit, a twisted electron-acoustic (EA) wave is studied in a collisionless unmagnetized plasma, whose constituents are the dynamical cold electrons and Boltzmannian hot electrons in the background of static positive ions. The analytical and numerical solutions of the plasma kinetic equation suggest that EA waves with finite amount of orbital angular momentum exhibit a twist in its behavior. The twisted wave particle resonance is also taken into consideration that has been appeared through the effective wave number q_e_f_f accounting for Laguerre-Gaussian mode profiles attributed to helical phase structures. Consequently, the dispersion relation and the damping rate of the EA waves are significantly modified with the twisted parameter η, and for η → ∞, the results coincide with the straight propagating plane EA waves. Numerically, new features of twisted EA waves are identified by considering various regimes of wavelength and the results might be useful for transport and trapping of plasma particles in a two-electron component plasma.

  2. Hadronic equation of state in the statistical bootstrap model and linear graph theory

    International Nuclear Information System (INIS)

    Fre, P.; Page, R.

    1976-01-01

    Taking a statistical mechanical point og view, the statistical bootstrap model is discussed and, from a critical analysis of the bootstrap volume comcept, it is reached a physical ipothesis, which leads immediately to the hadronic equation of state provided by the bootstrap integral equation. In this context also the connection between the statistical bootstrap and the linear graph theory approach to interacting gases is analyzed

  3. Remarks on twisted noncommutative quantum field theory

    Energy Technology Data Exchange (ETDEWEB)

    Zahn, J. [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik

    2006-04-15

    We review recent results on twisted noncommutative quantum field theory by embedding it into a general framework for the quantization of systems with a twisted symmetry. We discuss commutation relations in this setting and show that the twisted structure is so rigid that it is hard to derive any predictions, unless one gives up general principles of quantum theory. It is also shown that the twisted structure is not responsible for the presence or absence of UV/IR-mixing, as claimed in the literature. (Orig.)

  4. Adaptive twisting sliding mode algorithm for hypersonic reentry vehicle attitude control based on finite-time observer.

    Science.gov (United States)

    Guo, Zongyi; Chang, Jing; Guo, Jianguo; Zhou, Jun

    2018-06-01

    This paper focuses on the adaptive twisting sliding mode control for the Hypersonic Reentry Vehicles (HRVs) attitude tracking issue. The HRV attitude tracking model is transformed into the error dynamics in matched structure, whereas an unmeasurable state is redefined by lumping the existing unmatched disturbance with the angular rate. Hence, an adaptive finite-time observer is used to estimate the unknown state. Then, an adaptive twisting algorithm is proposed for systems subject to disturbances with unknown bounds. The stability of the proposed observer-based adaptive twisting approach is guaranteed, and the case of noisy measurement is analyzed. Also, the developed control law avoids the aggressive chattering phenomenon of the existing adaptive twisting approaches because the adaptive gains decrease close to the disturbance once the trajectories reach the sliding surface. Finally, numerical simulations on the attitude control of the HRV are conducted to verify the effectiveness and benefit of the proposed approach. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

  5. Morphing wing structure with controllable twist based on adaptive bending-twist coupling

    Science.gov (United States)

    Raither, Wolfram; Heymanns, Matthias; Bergamini, Andrea; Ermanni, Paolo

    2013-06-01

    A novel semi-passive morphing airfoil concept based on variable bending-twist coupling induced by adaptive shear center location and torsional stiffness is presented. Numerical parametric studies and upscaling show that the concept relying on smart materials permits effective twist control while offering the potential of being lightweight and energy efficient. By means of an experimental characterization of an adaptive beam and a scaled adaptive wing structure, effectiveness and producibility of the structural concept are demonstrated.

  6. Morphing wing structure with controllable twist based on adaptive bending–twist coupling

    International Nuclear Information System (INIS)

    Raither, Wolfram; Heymanns, Matthias; Ermanni, Paolo; Bergamini, Andrea

    2013-01-01

    A novel semi-passive morphing airfoil concept based on variable bending–twist coupling induced by adaptive shear center location and torsional stiffness is presented. Numerical parametric studies and upscaling show that the concept relying on smart materials permits effective twist control while offering the potential of being lightweight and energy efficient. By means of an experimental characterization of an adaptive beam and a scaled adaptive wing structure, effectiveness and producibility of the structural concept are demonstrated. (paper)

  7. Beams made of twisted atoms: A theoretical analysis

    Energy Technology Data Exchange (ETDEWEB)

    Hayrapetyan, Armen [Physikalisches Institut, Ruprecht-Karls-Universitaet Heidelberg, 69120 Heidelberg (Germany); Matula, Oliver [Physikalisches Institut, Ruprecht-Karls-Universitaet Heidelberg, 69120 Heidelberg (Germany); GSI Helmholtzzentrum fuer Schwerionenforschung, 64291 Darmstadt (Germany); Surzhykov, Andrey [Helmholtz-Institut Jena, 07743 Jena (Germany); Fritzsche, Stephan [Helmholtz-Institut Jena, 07743 Jena (Germany); Theoretisch-Physikalisches Institut, Friedrich-Schiller-Universitaet Jena, 07743 Jena (Germany)

    2014-07-01

    We have analyzed Bessel beams of two-level atoms that are driven by a linearly polarized laser light. Based on the Schroedinger equation for two-level systems, we first determine the states of two-level atoms in a plane-wave field by taking into account propagation directions both of the atom and the field. For such laser-driven two-level atoms, we construct Bessel beams by going beyond the typical paraxial approximation. In particular, we show that the probability density of these atomic beams exhibits a non-trivial, Bessel-squared-type behavior. The profile of such twisted atoms is affected by atom and laser parameters, such as the nuclear charge, atom velocity, laser frequency, and propagation geometry of the atom and laser beams. Moreover, we spatially and temporally characterize the beam of hydrogen and selected (neutral) alkali-metal atoms that carry non-zero orbital angular momentum (OAM). The proposed spatiotemporal Bessel states (i) are able to describe twisted states of any two-level system which is driven by the radiation field and (ii) have potential applications in atomic and nuclear processes as well as in quantum communication.

  8. Conical twist fields and null polygonal Wilson loops

    Science.gov (United States)

    Castro-Alvaredo, Olalla A.; Doyon, Benjamin; Fioravanti, Davide

    2018-06-01

    Using an extension of the concept of twist field in QFT to space-time (external) symmetries, we study conical twist fields in two-dimensional integrable QFT. These create conical singularities of arbitrary excess angle. We show that, upon appropriate identification between the excess angle and the number of sheets, they have the same conformal dimension as branch-point twist fields commonly used to represent partition functions on Riemann surfaces, and that both fields have closely related form factors. However, we show that conical twist fields are truly different from branch-point twist fields. They generate different operator product expansions (short distance expansions) and form factor expansions (large distance expansions). In fact, we verify in free field theories, by re-summing form factors, that the conical twist fields operator product expansions are correctly reproduced. We propose that conical twist fields are the correct fields in order to understand null polygonal Wilson loops/gluon scattering amplitudes of planar maximally supersymmetric Yang-Mills theory.

  9. graphkernels: R and Python packages for graph comparison.

    Science.gov (United States)

    Sugiyama, Mahito; Ghisu, M Elisabetta; Llinares-López, Felipe; Borgwardt, Karsten

    2018-02-01

    Measuring the similarity of graphs is a fundamental step in the analysis of graph-structured data, which is omnipresent in computational biology. Graph kernels have been proposed as a powerful and efficient approach to this problem of graph comparison. Here we provide graphkernels, the first R and Python graph kernel libraries including baseline kernels such as label histogram based kernels, classic graph kernels such as random walk based kernels, and the state-of-the-art Weisfeiler-Lehman graph kernel. The core of all graph kernels is implemented in C ++ for efficiency. Using the kernel matrices computed by the package, we can easily perform tasks such as classification, regression and clustering on graph-structured samples. The R and Python packages including source code are available at https://CRAN.R-project.org/package=graphkernels and https://pypi.python.org/pypi/graphkernels. mahito@nii.ac.jp or elisabetta.ghisu@bsse.ethz.ch. Supplementary data are available online at Bioinformatics. © The Author(s) 2017. Published by Oxford University Press.

  10. Graph Aggregation

    NARCIS (Netherlands)

    Endriss, U.; Grandi, U.

    Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference

  11. Renormalization constants for 2-twist operators in twisted mass QCD

    International Nuclear Information System (INIS)

    Alexandrou, C.; Constantinou, M.; Panagopoulos, H.; Stylianou, F.; Korzec, T.

    2011-01-01

    Perturbative and nonperturbative results on the renormalization constants of the fermion field and the twist-2 fermion bilinears are presented with emphasis on the nonperturbative evaluation of the one-derivative twist-2 vector and axial-vector operators. Nonperturbative results are obtained using the twisted mass Wilson fermion formulation employing two degenerate dynamical quarks and the tree-level Symanzik improved gluon action. The simulations have been performed for pion masses in the range of about 450-260 MeV and at three values of the lattice spacing a corresponding to β=3.9, 4.05, 4.20. Subtraction of O(a 2 ) terms is carried out by performing the perturbative evaluation of these operators at 1-loop and up to O(a 2 ). The renormalization conditions are defined in the RI ' -MOM scheme, for both perturbative and nonperturbative results. The renormalization factors, obtained for different values of the renormalization scale, are evolved perturbatively to a reference scale set by the inverse of the lattice spacing. In addition, they are translated to MS at 2 GeV using 3-loop perturbative results for the conversion factors.

  12. Resting-state theta band connectivity and graph analysis in generalized social anxiety disorder.

    Science.gov (United States)

    Xing, Mengqi; Tadayonnejad, Reza; MacNamara, Annmarie; Ajilore, Olusola; DiGangi, Julia; Phan, K Luan; Leow, Alex; Klumpp, Heide

    2017-01-01

    Functional magnetic resonance imaging (fMRI) resting-state studies show generalized social anxiety disorder (gSAD) is associated with disturbances in networks involved in emotion regulation, emotion processing, and perceptual functions, suggesting a network framework is integral to elucidating the pathophysiology of gSAD. However, fMRI does not measure the fast dynamic interconnections of functional networks. Therefore, we examined whole-brain functional connectomics with electroencephalogram (EEG) during resting-state. Resting-state EEG data was recorded for 32 patients with gSAD and 32 demographically-matched healthy controls (HC). Sensor-level connectivity analysis was applied on EEG data by using Weighted Phase Lag Index (WPLI) and graph analysis based on WPLI was used to determine clustering coefficient and characteristic path length to estimate local integration and global segregation of networks. WPLI results showed increased oscillatory midline coherence in the theta frequency band indicating higher connectivity in the gSAD relative to HC group during rest. Additionally, WPLI values positively correlated with state anxiety levels within the gSAD group but not the HC group. Our graph theory based connectomics analysis demonstrated increased clustering coefficient and decreased characteristic path length in theta-based whole brain functional organization in subjects with gSAD compared to HC. Theta-dependent interconnectivity was associated with state anxiety in gSAD and an increase in information processing efficiency in gSAD (compared to controls). Results may represent enhanced baseline self-focused attention, which is consistent with cognitive models of gSAD and fMRI studies implicating emotion dysregulation and disturbances in task negative networks (e.g., default mode network) in gSAD.

  13. How to Twist a Knot

    DEFF Research Database (Denmark)

    Randrup, Thomas; Røgen, Peter

    1997-01-01

    is an invariant of ambient isotopy measuring the topological twist of the closed strip. We classify closed strips in euclidean 3-space by their knots and their twisting number. We prove that this classification exactly divides closed strips into isotopy classes. Using this classification we point out how some...

  14. Transverse kink oscillations in the presence of twist

    Science.gov (United States)

    Terradas, J.; Goossens, M.

    2012-12-01

    Context. Magnetic twist is thought to play an important role in coronal loops. The effects of magnetic twist on stable magnetohydrodynamic (MHD) waves is poorly understood because they are seldom studied for relevant cases. Aims: The goal of this work is to study the fingerprints of magnetic twist on stable transverse kink oscillations. Methods: We numerically calculated the eigenmodes of propagating and standing MHD waves for a model of a loop with magnetic twist. The azimuthal component of the magnetic field was assumed to be small in comparison to the longitudinal component. We did not consider resonantly damped modes or kink instabilities in our analysis. Results: For a nonconstant twist the frequencies of the MHD wave modes are split, which has important consequences for standing waves. This is different from the degenerated situation for equilibrium models with constant twist, which are characterised by an azimuthal component of the magnetic field that linearly increases with the radial coordinate. Conclusions: In the presence of twist standing kink solutions are characterised by a change in polarisation of the transverse displacement along the tube. For weak twist, and in the thin tube approximation, the frequency of standing modes is unaltered and the tube oscillates at the kink speed of the corresponding straight tube. The change in polarisation is linearly proportional to the degree of twist. This has implications with regard to observations of kink modes, since the detection of this variation in polarisation can be used as an indirect method to estimate the twist in oscillating loops.

  15. Graph Processing on GPUs: A Survey

    DEFF Research Database (Denmark)

    Shi, Xuanhua; Zheng, Zhigao; Zhou, Yongluan

    2018-01-01

    hundreds of billions, has attracted much attention in both industry and academia. It still remains a great challenge to process such large-scale graphs. Researchers have been seeking for new possible solutions. Because of the massive degree of parallelism and the high memory access bandwidth in GPU......, utilizing GPU to accelerate graph processing proves to be a promising solution. This article surveys the key issues of graph processing on GPUs, including data layout, memory access pattern, workload mapping, and specific GPU programming. In this article, we summarize the state-of-the-art research on GPU...

  16. WORKSHOP: Let's twist again..

    Energy Technology Data Exchange (ETDEWEB)

    Villalobos Baillie, Orlando

    1988-12-15

    In the quantum chromodynamics (QCD) candidate theory of interquark forces, calculations involve summing the effects from many different possible quark/gluon interactions. In addition to the 'leading term' frequently used as the basis for QCD calculations, additional contributions — so-called 'higher twists' — are modulated by powers of kinematical factors. An illuminating international workshop to discuss higher twist QCD was held at the College de France, Paris, from 21-23 September.

  17. The One Universal Graph — a free and open graph database

    Science.gov (United States)

    Ng, Liang S.; Champion, Corbin

    2016-02-01

    Recent developments in graph database mostly are huge projects involving big organizations, big operations and big capital, as the name Big Data attests. We proposed the concept of One Universal Graph (OUG) which states that all observable and known objects and concepts (physical, conceptual or digitally represented) can be connected with only one single graph; furthermore the OUG can be implemented with a very simple text file format with free software, capable of being executed on Android or smaller devices. As such the One Universal Graph Data Exchange (GOUDEX) modules can potentially be installed on hundreds of millions of Android devices and Intel compatible computers shipped annually. Coupled with its open nature and ability to connect to existing leading search engines and databases currently in operation, GOUDEX has the potential to become the largest and a better interface for users and programmers to interact with the data on the Internet. With a Web User Interface for users to use and program in native Linux environment, Free Crowdware implemented in GOUDEX can help inexperienced users learn programming with better organized documentation for free software, and is able to manage programmer's contribution down to a single line of code or a single variable in software projects. It can become the first practically realizable “Internet brain” on which a global artificial intelligence system can be implemented. Being practically free and open, One Universal Graph can have significant applications in robotics, artificial intelligence as well as social networks.

  18. DVCS amplitude with kinematical twist-3 terms

    International Nuclear Information System (INIS)

    Radyushkin, A.V.; Weiss, C.

    2000-01-01

    The authors compute the amplitude of deeply virtual Compton scattering (DVCS) using the calculus of QCD string operators in coordinate representation. To restore the electromagnetic gauge invariance (transversality) of the twist-2 amplitude they include the operators of twist-3 which appear as total derivatives of twist-2 operators. The results are equivalent to a Wandzura-Wilczek approximation for twist-3 skewed parton distributions. They find that this approximation gives a finite result for the amplitude of a longitudinally polarized virtual photon, while the amplitude for transverse polarization is divergent, i.e., factorization breaks down in this term

  19. On a conjecture concerning helly circle graphs

    Directory of Open Access Journals (Sweden)

    Durán Guillermo

    2003-01-01

    Full Text Available We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and inequations which represents the structure of G, in such a way that G is an e-circle graph if and only if S has a solution. In fact, e-circle graphs are exactly the circle graphs (intersection graphs of chords in a circle, and thus this method provides an analytic way for recognizing circle graphs. A graph G is a Helly circle graph if G is a circle graph and there exists a model of G by chords such that every three pairwise intersecting chords intersect at the same point. A conjecture by Durán (2000 states that G is a Helly circle graph if and only if G is a circle graph and contains no induced diamonds (a diamond is a graph formed by four vertices and five edges. Many unsuccessful efforts - mainly based on combinatorial and geometrical approaches - have been done in order to validate this conjecture. In this work, we utilize the ideas behind the definition of e-circle graphs and restate this conjecture in terms of an equivalence between two systems of equations and inequations, providing a new, analytic tool to deal with it.

  20. Low-Rank Matrix Factorization With Adaptive Graph Regularizer.

    Science.gov (United States)

    Lu, Gui-Fu; Wang, Yong; Zou, Jian

    2016-05-01

    In this paper, we present a novel low-rank matrix factorization algorithm with adaptive graph regularizer (LMFAGR). We extend the recently proposed low-rank matrix with manifold regularization (MMF) method with an adaptive regularizer. Different from MMF, which constructs an affinity graph in advance, LMFAGR can simultaneously seek graph weight matrix and low-dimensional representations of data. That is, graph construction and low-rank matrix factorization are incorporated into a unified framework, which results in an automatically updated graph rather than a predefined one. The experimental results on some data sets demonstrate that the proposed algorithm outperforms the state-of-the-art low-rank matrix factorization methods.

  1. The many faces of Ocneanu cells

    CERN Document Server

    Petkova, V B

    2001-01-01

    We define generalised chiral vertex operators covariant under the Ocneanu ``double triangle algebra'' {\\cal A}, a novel quantum symmetry intrinsic to a given rational 2-d conformal field theory. This provides a chiral approach, which, unlike the conventional one, makes explicit various algebraic structures encountered previously in the study of these theories and of the associated critical lattice models, and thus allows their unified treatment. The triangular Ocneanu cells, the 3j-symbols of the weak Hopf algebra {\\cal A}, reappear in several guises. With {\\cal A} and its dual algebra {hat A} one associates a pair of graphs, G and {\\tilde G}. While G are known to encode complete sets of conformal boundary states, the Ocneanu graphs {\\tilde G} classify twisted torus partition functions. The fusion algebra of the twist operators provides the data determining {\\hat A}. The study of bulk field correlators in the presence of twists reveals that the Ocneanu graph quantum symmetry gives also an information on the f...

  2. Exclusivity structures and graph representatives of local complementation orbits

    Science.gov (United States)

    Cabello, Adán; Parker, Matthew G.; Scarpa, Giannicola; Severini, Simone

    2013-07-01

    We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lovász number which is equal to its fractional packing number. The vertices of H(G) represent all possible events consistent with the stabilizer group of the graph state associated with G, and exclusive events are adjacent. Mathematically, the graph H(G) corresponds to the orbit of G under local complementation. Physically, the construction translates into graph-theoretic terms the connection between a graph state and a Bell inequality maximally violated by quantum mechanics. In the context of zero-error information theory, the construction suggests a protocol achieving the maximum rate of entanglement-assisted capacity, a quantum mechanical analogue of the Shannon capacity, for each H(G). The violation of the Bell inequality is expressed by the one-shot version of this capacity being strictly larger than the independence number. Finally, given the correspondence between graphs and exclusivity structures, we are able to compute the independence number for certain infinite families of graphs with the use of quantum non-locality, therefore highlighting an application of quantum theory in the proof of a purely combinatorial statement.

  3. Proxy Graph: Visual Quality Metrics of Big Graph Sampling.

    Science.gov (United States)

    Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra

    2017-06-01

    Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.

  4. Angular momentum transport with twisted exciton wave packets

    Science.gov (United States)

    Zang, Xiaoning; Lusk, Mark T.

    2017-10-01

    A chain of cofacial molecules with CN or CN h symmetry supports excitonic states with a screwlike structure. These can be quantified with the combination of an axial wave number and an azimuthal winding number. Combinations of these states can be used to construct excitonic wave packets that spiral down the chain with well-determined linear and angular momenta. These twisted exciton wave packets can be created and annihilated using laser pulses, and their angular momentum can be optically modified during transit. This allows for the creation of optoexcitonic circuits in which information, encoded in the angular momentum of light, is converted into excitonic wave packets that can be manipulated, transported, and then reemitted. A tight-binding paradigm is used to demonstrate the key ideas. The approach is then extended to quantify the evolution of twisted exciton wave packets in a many-body, multilevel time-domain density functional theory setting. In both settings, numerical methods are developed that allow the site-to-site transfer of angular momentum to be quantified.

  5. Processing mechanics of alternate twist ply (ATP) yarn technology

    Science.gov (United States)

    Elkhamy, Donia Said

    Ply yarns are important in many textile manufacturing processes and various applications. The primary process used for producing ply yarns is cabling. The speed of cabling is limited to about 35m/min. With the world's increasing demands of ply yarn supply, cabling is incompatible with today's demand activated manufacturing strategies. The Alternate Twist Ply (ATP) yarn technology is a relatively new process for producing ply yarns with improved productivity and flexibility. This technology involves self plying of twisted singles yarn to produce ply yarn. The ATP process can run more than ten times faster than cabling. To implement the ATP process to produce ply yarns there are major quality issues; uniform Twist Profile and yarn Twist Efficiency. The goal of this thesis is to improve these issues through process modeling based on understanding the physics and processing mechanics of the ATP yarn system. In our study we determine the main parameters that control the yarn twist profile. Process modeling of the yarn twist across different process zones was done. A computational model was designed to predict the process parameters required to achieve a square wave twist profile. Twist efficiency, a measure of yarn torsional stability and bulk, is determined by the ratio of ply yarn twist to singles yarn twist. Response Surface Methodology was used to develop the processing window that can reproduce ATP yarns with high twist efficiency. Equilibrium conditions of tensions and torques acting on the yarns at the self ply point were analyzed and determined the pathway for achieving higher twist efficiency. Mechanistic modeling relating equilibrium conditions to the twist efficiency was developed. A static tester was designed to zoom into the self ply zone of the ATP yarn. A computer controlled, prototypic ATP machine was constructed and confirmed the mechanistic model results. Optimum parameters achieving maximum twist efficiency were determined in this study. The

  6. Identification of Voxels Confounded by Venous Signals Using Resting-State fMRI Functional Connectivity Graph Clustering

    Directory of Open Access Journals (Sweden)

    Klaudius eKalcher

    2015-12-01

    Full Text Available Identifying venous voxels in fMRI datasets is important to increase the specificity of fMRI analyses to microvasculature in the vicinity of the neural processes triggering the BOLD response. This is, however, difficult to achieve in particular in typical studies where magnitude images of BOLD EPI are the only data available. In this study, voxelwise functional connectivity graphs were computed on minimally preprocessed low TR (333 ms multiband resting-state fMRI data, using both high positive and negative correlations to define edges between nodes (voxels. A high correlation threshold for binarization ensures that most edges in the resulting sparse graph reflect the high coherence of signals in medium to large veins. Graph clustering based on the optimization of modularity was then employed to identify clusters of coherent voxels in this graph, and all clusters of 50 or more voxels were then interpreted as corresponding to medium to large veins. Indeed, a comparison with SWI reveals that 75.6 ± 5.9% of voxels within these large clusters overlap with veins visible in the SWI image or lie outside the brain parenchyma. Some of the remainingdifferences between the two modalities can be explained by imperfect alignment or geometric distortions between the two images. Overall, the graph clustering based method for identifying venous voxels has a high specificity as well as the additional advantages of being computed in the same voxel grid as the fMRI dataset itself and not needingany additional data beyond what is usually acquired (and exported in standard fMRI experiments.

  7. Generating Realistic Labelled, Weighted Random Graphs

    Directory of Open Access Journals (Sweden)

    Michael Charles Davis

    2015-12-01

    Full Text Available Generative algorithms for random graphs have yielded insights into the structure and evolution of real-world networks. Most networks exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Usually, random graph models consider only structural information, but many real-world networks also have labelled vertices and weighted edges. In this paper, we present a generative model for random graphs with discrete vertex labels and numeric edge weights. The weights are represented as a set of Beta Mixture Models (BMMs with an arbitrary number of mixtures, which are learned from real-world networks. We propose a Bayesian Variational Inference (VI approach, which yields an accurate estimation while keeping computation times tractable. We compare our approach to state-of-the-art random labelled graph generators and an earlier approach based on Gaussian Mixture Models (GMMs. Our results allow us to draw conclusions about the contribution of vertex labels and edge weights to graph structure.

  8. Photophysics of internal twisting

    International Nuclear Information System (INIS)

    Heisel, F.; Miehe, J.A.; Lippert, E.; Rettig, W.; Bonacic-Koutecky, V.

    1987-01-01

    The formation and characteristics of the ''twisted intermolecular charge transfer'' is studied. Basic concepts on dual fluorescence, steady-state fluorescence, kinetic investigations and cage effects are discussed. The theoretical treatment on the electronic structure of the bonded π - donor - π acceptor pairs is outlined. The two-electron, two-orbital model, the ab initio CI models of simple double, charged and dative π - bonds as well as complex dative π - bonds and the origin of the dual fluorescence of 9.9'-Bianthryl are shown. Concerning the stochastic description of chemical reactions, Master equation, Markov, Birth-Death and Diffusion processes, Kramers-Moyal expansion, Langevin equation, Kramers' approach to steady-state rates of reaction and its extension to non-Markovian processes, and also unimolecular reactions in the absence of potential barrier are considered. Experimental results and interpretation on dynamics of DMABN in the excited state, kinetics of other dialkylanilines, extended donor-acceptor systems with anomalous fluorescence and donor-acceptor systems without anomalous fluorescence are given

  9. Direct evidence for an orbital magnetic quadrupole twist mode in nuclei

    International Nuclear Information System (INIS)

    Reitz, B.; Frekers, D.

    2002-02-01

    The reactions 58 Ni(e,e') and 58 Ni(p,p') have been studied at kinematics favorable for the excitation of J π = 2 - states by isovector spin-flip transitions with ΔL = 1. There are states at an excitation energy E x ∼ 10 MeV which are strongly excited in electron scattering but not in proton scattering, suggesting a predominantly orbital character. This is taken as direct evidence for the so-called twist mode in nuclei in which different layers of nuclear fluid in the upper and lower hemisphere counterrotate against each other. Microscopic quasiparticle-phonon model calculations which predict sizable orbital M2 strength at his excitation energy yield indeed a current flow pattern of the strongest transitions consistent with a twist-like motion. (orig.)

  10. Chromatic graph theory

    CERN Document Server

    Chartrand, Gary; Rosen, Kenneth H

    2008-01-01

    Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex coloring...

  11. The One Universal Graph — a free and open graph database

    International Nuclear Information System (INIS)

    Ng, Liang S.; Champion, Corbin

    2016-01-01

    Recent developments in graph database mostly are huge projects involving big organizations, big operations and big capital, as the name Big Data attests. We proposed the concept of One Universal Graph (OUG) which states that all observable and known objects and concepts (physical, conceptual or digitally represented) can be connected with only one single graph; furthermore the OUG can be implemented with a very simple text file format with free software, capable of being executed on Android or smaller devices. As such the One Universal Graph Data Exchange (GOUDEX) modules can potentially be installed on hundreds of millions of Android devices and Intel compatible computers shipped annually. Coupled with its open nature and ability to connect to existing leading search engines and databases currently in operation, GOUDEX has the potential to become the largest and a better interface for users and programmers to interact with the data on the Internet. With a Web User Interface for users to use and program in native Linux environment, Free Crowdware implemented in GOUDEX can help inexperienced users learn programming with better organized documentation for free software, and is able to manage programmer's contribution down to a single line of code or a single variable in software projects. It can become the first practically realizable “Internet brain” on which a global artificial intelligence system can be implemented. Being practically free and open, One Universal Graph can have significant applications in robotics, artificial intelligence as well as social networks. (paper)

  12. The Influence of Preprocessing Steps on Graph Theory Measures Derived from Resting State fMRI.

    Science.gov (United States)

    Gargouri, Fatma; Kallel, Fathi; Delphine, Sebastien; Ben Hamida, Ahmed; Lehéricy, Stéphane; Valabregue, Romain

    2018-01-01

    Resting state functional MRI (rs-fMRI) is an imaging technique that allows the spontaneous activity of the brain to be measured. Measures of functional connectivity highly depend on the quality of the BOLD signal data processing. In this study, our aim was to study the influence of preprocessing steps and their order of application on small-world topology and their efficiency in resting state fMRI data analysis using graph theory. We applied the most standard preprocessing steps: slice-timing, realign, smoothing, filtering, and the tCompCor method. In particular, we were interested in how preprocessing can retain the small-world economic properties and how to maximize the local and global efficiency of a network while minimizing the cost. Tests that we conducted in 54 healthy subjects showed that the choice and ordering of preprocessing steps impacted the graph measures. We found that the csr (where we applied realignment, smoothing, and tCompCor as a final step) and the scr (where we applied realignment, tCompCor and smoothing as a final step) strategies had the highest mean values of global efficiency (eg) . Furthermore, we found that the fscr strategy (where we applied realignment, tCompCor, smoothing, and filtering as a final step), had the highest mean local efficiency (el) values. These results confirm that the graph theory measures of functional connectivity depend on the ordering of the processing steps, with the best results being obtained using smoothing and tCompCor as the final steps for global efficiency with additional filtering for local efficiency.

  13. The Influence of Preprocessing Steps on Graph Theory Measures Derived from Resting State fMRI

    Directory of Open Access Journals (Sweden)

    Fatma Gargouri

    2018-02-01

    Full Text Available Resting state functional MRI (rs-fMRI is an imaging technique that allows the spontaneous activity of the brain to be measured. Measures of functional connectivity highly depend on the quality of the BOLD signal data processing. In this study, our aim was to study the influence of preprocessing steps and their order of application on small-world topology and their efficiency in resting state fMRI data analysis using graph theory. We applied the most standard preprocessing steps: slice-timing, realign, smoothing, filtering, and the tCompCor method. In particular, we were interested in how preprocessing can retain the small-world economic properties and how to maximize the local and global efficiency of a network while minimizing the cost. Tests that we conducted in 54 healthy subjects showed that the choice and ordering of preprocessing steps impacted the graph measures. We found that the csr (where we applied realignment, smoothing, and tCompCor as a final step and the scr (where we applied realignment, tCompCor and smoothing as a final step strategies had the highest mean values of global efficiency (eg. Furthermore, we found that the fscr strategy (where we applied realignment, tCompCor, smoothing, and filtering as a final step, had the highest mean local efficiency (el values. These results confirm that the graph theory measures of functional connectivity depend on the ordering of the processing steps, with the best results being obtained using smoothing and tCompCor as the final steps for global efficiency with additional filtering for local efficiency.

  14. The Influence of Preprocessing Steps on Graph Theory Measures Derived from Resting State fMRI

    Science.gov (United States)

    Gargouri, Fatma; Kallel, Fathi; Delphine, Sebastien; Ben Hamida, Ahmed; Lehéricy, Stéphane; Valabregue, Romain

    2018-01-01

    Resting state functional MRI (rs-fMRI) is an imaging technique that allows the spontaneous activity of the brain to be measured. Measures of functional connectivity highly depend on the quality of the BOLD signal data processing. In this study, our aim was to study the influence of preprocessing steps and their order of application on small-world topology and their efficiency in resting state fMRI data analysis using graph theory. We applied the most standard preprocessing steps: slice-timing, realign, smoothing, filtering, and the tCompCor method. In particular, we were interested in how preprocessing can retain the small-world economic properties and how to maximize the local and global efficiency of a network while minimizing the cost. Tests that we conducted in 54 healthy subjects showed that the choice and ordering of preprocessing steps impacted the graph measures. We found that the csr (where we applied realignment, smoothing, and tCompCor as a final step) and the scr (where we applied realignment, tCompCor and smoothing as a final step) strategies had the highest mean values of global efficiency (eg). Furthermore, we found that the fscr strategy (where we applied realignment, tCompCor, smoothing, and filtering as a final step), had the highest mean local efficiency (el) values. These results confirm that the graph theory measures of functional connectivity depend on the ordering of the processing steps, with the best results being obtained using smoothing and tCompCor as the final steps for global efficiency with additional filtering for local efficiency. PMID:29497372

  15. Twist operators in N=4 beta-deformed theory

    NARCIS (Netherlands)

    de Leeuw, M.; Łukowski, T.

    2010-01-01

    In this paper we derive both the leading order finite size corrections for twist-2 and twist-3 operators and the next-to-leading order finite-size correction for twist-2 operators in beta-deformed SYM theory. The obtained results respect the principle of maximum transcendentality as well as

  16. Higher twist contributions to deep-inelastic structure functions

    International Nuclear Information System (INIS)

    Bluemlein, J.; Boettcher, H.

    2008-07-01

    We report on a recent extraction of the higher twist contributions to the deep inelastic structure functions F ep,ed 2 (x,Q 2 ) in the large x region. It is shown that the size of the extracted higher twist contributions is strongly correlated with the higher order corrections applied to the leading twist part. A gradual lowering of the higher twist contributions going from NLO to N 4 LO is observed, where in the latter case only the leading large x terms were considered. (orig.)

  17. Using Pretwist to Reduce Power Loss of Bend-Twist Coupled Blades

    DEFF Research Database (Denmark)

    Stäblein, Alexander; Tibaldi, Carlo; Hansen, Morten Hartvig

    2016-01-01

    Bend-twist coupling of wind turbine blades is known as a means to reduce the structural loads of the turbine. While the load reduction is desirable, bend-twist coupling also leads to a decrease in the annual energy production of the turbine. The reduction is mainly related to a no longer optimal......, and fatigue load for the DTU 10 MW Reference Wind Turbine. The analysis was carried out by calculating the nonlinear steady state rotor deflection in an uniform inflow over the operational range of the turbine. The steady state power curve together with a Rayleigh wind speed distribution has been used...... to estimate the annual energy production. The turbine model was then linearised around the steady state and the power spectral density of the blade response, which was computed from transfer functions and the wind speed variations in the frequency domain, was used to estimate the fatigue loads by a spectral...

  18. Betweenness-based algorithm for a partition scale-free graph

    International Nuclear Information System (INIS)

    Zhang Bai-Da; Wu Jun-Jie; Zhou Jing; Tang Yu-Hua

    2011-01-01

    Many real-world networks are found to be scale-free. However, graph partition technology, as a technology capable of parallel computing, performs poorly when scale-free graphs are provided. The reason for this is that traditional partitioning algorithms are designed for random networks and regular networks, rather than for scale-free networks. Multilevel graph-partitioning algorithms are currently considered to be the state of the art and are used extensively. In this paper, we analyse the reasons why traditional multilevel graph-partitioning algorithms perform poorly and present a new multilevel graph-partitioning paradigm, top down partitioning, which derives its name from the comparison with the traditional bottom—up partitioning. A new multilevel partitioning algorithm, named betweenness-based partitioning algorithm, is also presented as an implementation of top—down partitioning paradigm. An experimental evaluation of seven different real-world scale-free networks shows that the betweenness-based partitioning algorithm significantly outperforms the existing state-of-the-art approaches. (interdisciplinary physics and related areas of science and technology)

  19. A novel role for Twist-1 in pulp homeostasis.

    Science.gov (United States)

    Galler, K M; Yasue, A; Cavender, A C; Bialek, P; Karsenty, G; D'Souza, R N

    2007-10-01

    The molecular mechanisms that maintain the equilibrium of odontoblast progenitor cells in dental pulp are unknown. Here we tested whether homeostasis in dental pulp is modulated by Twist-1, a nuclear protein that partners with Runx2 during osteoblast differentiation. Our analysis of Twist-1(+/-) mice revealed phenotypic changes that involved an earlier onset of dentin matrix formation, increased alkaline phosphatase activity, and pulp stones within the pulp. RT-PCR analyses revealed Twist-1 expression in several adult organs, including pulp. Decreased levels of Twist-1 led to higher levels of type I collagen and Dspp gene expression in perivascular cells associated with the pulp stones. In mice heterozygous for both Twist-1 and Runx2 inactivation, the phenotype of pulp stones appeared completely rescued. These findings suggest that Twist-1 plays a key role in restraining odontoblast differentiation, thus maintaining homeostasis in dental pulp. Furthermore, Twist-1 functions in dental pulp are dependent on its interaction with Runx2.

  20. Incremental View Maintenance for Deductive Graph Databases Using Generalized Discrimination Networks

    Directory of Open Access Journals (Sweden)

    Thomas Beyhl

    2016-12-01

    Full Text Available Nowadays, graph databases are employed when relationships between entities are in the scope of database queries to avoid performance-critical join operations of relational databases. Graph queries are used to query and modify graphs stored in graph databases. Graph queries employ graph pattern matching that is NP-complete for subgraph isomorphism. Graph database views can be employed that keep ready answers in terms of precalculated graph pattern matches for often stated and complex graph queries to increase query performance. However, such graph database views must be kept consistent with the graphs stored in the graph database. In this paper, we describe how to use incremental graph pattern matching as technique for maintaining graph database views. We present an incremental maintenance algorithm for graph database views, which works for imperatively and declaratively specified graph queries. The evaluation shows that our maintenance algorithm scales when the number of nodes and edges stored in the graph database increases. Furthermore, our evaluation shows that our approach can outperform existing approaches for the incremental maintenance of graph query results.

  1. SpaceTwist

    DEFF Research Database (Denmark)

    Yiu, Man Lung; Jensen, Christian Søndergaard; Xuegang, Huang

    2008-01-01

    -based matching generally fall short in offering practical query accuracy guarantees. Our proposed framework, called SpaceTwist, rectifies these shortcomings for k nearest neighbor (kNN) queries. Starting with a location different from the user's actual location, nearest neighbors are retrieved incrementally...

  2. Magnetization Modeling of Twisted Superconducting Filaments

    CERN Document Server

    Satiramatekul, T; Devred, Arnaud; Leroy, Daniel

    2007-01-01

    This paper presents a new Finite Element numerical method to analyze the coupling between twisted filaments in a superconducting multifilament composite wire. To avoid the large number of elements required by a 3D code, the proposed method makes use of the energy balance principle in a 2D code. The relationship between superconductor critical current density and local magnetic flux density is implemented in the program for the Bean and modified Kim models. The modeled wire is made up of six filaments twisted together and embedded in a lowresistivity matrix. Computations of magnetization cycle and of the electric field pattern have been performed for various twist pitch values in the case of a pure copper matrix. The results confirm that the maximum magnetization depends on the matrix conductivity, the superconductor critical current density, the applied field frequency, and the filament twist pitch. The simulations also lead to a practical criterion for wire design that can be used to assess whether or not th...

  3. Graph sampling

    OpenAIRE

    Zhang, L.-C.; Patone, M.

    2017-01-01

    We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.

  4. Integer Flows and Circuit Covers of Graphs and Signed Graphs

    Science.gov (United States)

    Cheng, Jian

    The work in Chapter 2 is motivated by Tutte and Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {2, 3}, if (G, sigma) is (k - 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted into an integer-valued ( k + 1)-ow with a larger or the same support. We also prove that if (G, sigma) is odd-(2p+1)-edge-connected, then (G, sigma) admits a modulo circular (2 + 1/ p)-flows if and only if it admits an integer-valued circular (2 + 1/p)-flows, which improves all previous result by Xu and Zhang (DM2005), Schubert and Steffen (EJC2015), and Zhu (JCTB2015). Shortest circuit cover conjecture is one of the major open problems in graph theory. It states that every bridgeless graph G contains a set of circuits F such that each edge is contained in at least one member of F and the length of F is at most 7/5∥E(G)∥. This concept was recently generalized to signed graphs by Macajova et al. (JGT2015). In Chapter 3, we improve their upper bound from 11∥E( G)∥ to 14/3 ∥E(G)∥, and if G is 2-edgeconnected and has even negativeness, then it can be further reduced to 11/3 ∥E(G)∥. Tutte's 3-flow conjecture has been studied by many graph theorists in the last several decades. As a new approach to this conjecture, DeVos and Thomassen considered the vectors as ow values and found that there is a close relation between vector S1-flows and integer 3-NZFs. Motivated by their observation, in Chapter 4, we prove that if a graph G admits a vector S1-flow with rank at most two, then G admits an integer 3-NZF. The concept of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it

  5. b-tree facets for the simple graph partitioning polytope

    DEFF Research Database (Denmark)

    Sørensen, Michael Malmros

    2004-01-01

    The simple graph partitioning problem is to partition an edge-weighted graph into mutually disjoint subgraphs, each consisting of no more than b nodes, such that the sum of the weights of all edges in the subgraphs is maximal. In this paper we introduce a large class of facet defining inequalities...... for the simple graph partitioning polytopes P_n(b), b >= 3, associated with the complete graph on n nodes. These inequalities are induced by a graph configuration which is built upon trees of cardinality b. We provide a closed-form theorem that states all necessary and sufficient conditions for the facet...... defining property of the inequalities. Udgivelsesdato: JUN...

  6. Algorithms for Planar Graphs and Graphs in Metric Spaces

    DEFF Research Database (Denmark)

    Wulff-Nilsen, Christian

    structural properties that can be exploited. For instance, a road network or a wire layout on a microchip is typically (near-)planar and distances in the network are often defined w.r.t. the Euclidean or the rectilinear metric. Specialized algorithms that take advantage of such properties are often orders...... of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... for geometric graphs and graphs embedded in metric spaces. Roughly speaking, the stretch factor is a real value expressing how well a (geo-)metric graph approximates the underlying complete graph w.r.t. distances. We give improved algorithms for computing the stretch factor of a given graph and for augmenting...

  7. Twisting short dsDNA with applied tension

    Science.gov (United States)

    Zoli, Marco

    2018-02-01

    The twisting deformation of mechanically stretched DNA molecules is studied by a coarse grained Hamiltonian model incorporating the fundamental interactions that stabilize the double helix and accounting for the radial and angular base pair fluctuations. The latter are all the more important at short length scales in which DNA fragments maintain an intrinsic flexibility. The presented computational method simulates a broad ensemble of possible molecule conformations characterized by a specific average twist and determines the energetically most convenient helical twist by free energy minimization. As this is done for any external load, the method yields the characteristic twist-stretch profile of the molecule and also computes the changes in the macroscopic helix parameters i.e. average diameter and rise distance. It is predicted that short molecules under stretching should first over-twist and then untwist by increasing the external load. Moreover, applying a constant load and simulating a torsional strain which over-twists the helix, it is found that the average helix diameter shrinks while the molecule elongates, in agreement with the experimental trend observed in kilo-base long sequences. The quantitative relation between percent relative elongation and superhelical density at fixed load is derived. The proposed theoretical model and computational method offer a general approach to characterize specific DNA fragments and predict their macroscopic elastic response as a function of the effective potential parameters of the mesoscopic Hamiltonian.

  8. Quick Mining of Isomorphic Exact Large Patterns from Large Graphs

    KAUST Repository

    Almasri, Islam

    2014-12-01

    The applications of the sub graph isomorphism search are growing with the growing number of areas that model their systems using graphs or networks. Specifically, many biological systems, such as protein interaction networks, molecular structures and protein contact maps, are modeled as graphs. The sub graph isomorphism search is concerned with finding all sub graphs that are isomorphic to a relevant query graph, the existence of such sub graphs can reflect on the characteristics of the modeled system. The most computationally expensive step in the search for isomorphic sub graphs is the backtracking algorithm that traverses the nodes of the target graph. In this paper, we propose a pruning approach that is inspired by the minimum remaining value heuristic that achieves greater scalability over large query and target graphs. Our testing on various biological networks shows that performance enhancement of our approach over existing state-of-the-art approaches varies between 6x and 53x. © 2014 IEEE.

  9. Quick Mining of Isomorphic Exact Large Patterns from Large Graphs

    KAUST Repository

    Almasri, Islam; Gao, Xin; Fedoroff, Nina V.

    2014-01-01

    The applications of the sub graph isomorphism search are growing with the growing number of areas that model their systems using graphs or networks. Specifically, many biological systems, such as protein interaction networks, molecular structures and protein contact maps, are modeled as graphs. The sub graph isomorphism search is concerned with finding all sub graphs that are isomorphic to a relevant query graph, the existence of such sub graphs can reflect on the characteristics of the modeled system. The most computationally expensive step in the search for isomorphic sub graphs is the backtracking algorithm that traverses the nodes of the target graph. In this paper, we propose a pruning approach that is inspired by the minimum remaining value heuristic that achieves greater scalability over large query and target graphs. Our testing on various biological networks shows that performance enhancement of our approach over existing state-of-the-art approaches varies between 6x and 53x. © 2014 IEEE.

  10. Studies on the separation between higher-twist and minimum-twist in the photoproduction experiment WA69 at the CERN-OMEGA spectrometer

    International Nuclear Information System (INIS)

    Kingler, J.

    1990-01-01

    A Lund type Monte Carlo program (LUCIFER) is used to describe in perturbative QCD the pointlike component of the photon interacting on a hydrogen target. Kinematical and topological variables are developed to enhance higher twist events on the lowest order minimum twist background. The emphasis is laid on π ± , K ± higher twist mesons. (orig.)

  11. Hierarchical graphs for rule-based modeling of biochemical systems

    Directory of Open Access Journals (Sweden)

    Hu Bin

    2011-02-01

    Full Text Available Abstract Background In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state of a component, and an edge represents a bond between components. Components of a molecule share the same color. Furthermore, graph-rewriting rules are used to represent molecular interactions. A rule that specifies addition (removal of an edge represents a class of association (dissociation reactions, and a rule that specifies a change of a vertex attribute represents a class of reactions that affect the internal state of a molecular component. A set of rules comprises an executable model that can be used to determine, through various means, the system-level dynamics of molecular interactions in a biochemical system. Results For purposes of model annotation, we propose the use of hierarchical graphs to represent structural relationships among components and subcomponents of molecules. We illustrate how hierarchical graphs can be used to naturally document the structural organization of the functional components and subcomponents of two proteins: the protein tyrosine kinase Lck and the T cell receptor (TCR complex. We also show that computational methods developed for regular graphs can be applied to hierarchical graphs. In particular, we describe a generalization of Nauty, a graph isomorphism and canonical labeling algorithm. The generalized version of the Nauty procedure, which we call HNauty, can be used to assign canonical labels to hierarchical graphs or more generally to graphs with multiple edge types. The difference between the Nauty and HNauty procedures is minor, but for completeness, we provide an explanation of the entire HNauty algorithm. Conclusions Hierarchical graphs provide more intuitive formal representations of proteins and other structured molecules with multiple functional components than do the regular graphs of current languages for

  12. A nonlinear merging protocol for consensus in multi-agent systems on signed and weighted graphs

    Science.gov (United States)

    Feng, Shasha; Wang, Li; Li, Yijia; Sun, Shiwen; Xia, Chengyi

    2018-01-01

    In this paper, we investigate the multi-agent consensus for networks with undirected graphs which are not connected, especially for the signed graph in which some edge weights are positive and some edges have negative weights, and the negative-weight graph whose edge weights are negative. We propose a novel nonlinear merging consensus protocol to drive the states of all agents to converge to the same state zero which is not dependent upon the initial states of agents. If the undirected graph whose edge weights are positive is connected, then the states of all agents converge to the same state more quickly when compared to most other protocols. While the undirected graph whose edge weights might be positive or negative is unconnected, the states of all agents can still converge to the same state zero under the premise that the undirected graph can be divided into several connected subgraphs with more than one node. Furthermore, we also discuss the impact of parameter r presented in our protocol. Current results can further deepen the understanding of consensus processes for multi-agent systems.

  13. Graph-state preparation and quantum computation with global addressing of optical lattices

    International Nuclear Information System (INIS)

    Kay, Alastair; Pachos, Jiannis K.; Adams, Charles S.

    2006-01-01

    We present a way to manipulate ultracold atoms where four atomic levels are trapped by appropriately tuned optical lattices. When employed to perform quantum computation via global control, this unique structure dramatically reduces the number of steps involved in the control procedures, either for the standard, network, model, or for one-way quantum computation. The use of a far-blue-detuned lattice and a magnetically insensitive computational basis makes the scheme robust against decoherence. The present scheme is a promising candidate for experimental implementation of quantum computation and for graph-state preparation in one, two, or three spatial dimensions

  14. Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph

    Directory of Open Access Journals (Sweden)

    P. Anusha Devi

    2015-10-01

    Full Text Available An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G,$ is the minimum number of da-ecards that uniquely determines $G.$  The adversary degree associated edge reconstruction number of a graph $G, adern(G,$ is the minimum number $k$ such that every collection of $k$ da-ecards of $G$ uniquely determines $G.$ The maximal subgraph without end vertices of a graph $G$ which is not a tree is the pruned graph of $G.$ It is shown that $dern$ of complete multipartite graphs and some connected graphs with regular pruned graph is $1$ or $2.$ We also determine $dern$ and $adern$ of corona product of standard graphs.

  15. Simulating QCD at the physical point with Nf=2 Wilson twisted mass fermions at maximal twist

    International Nuclear Information System (INIS)

    Abdel-Rehim, A.; Alexandrou, C.; Cyprus Univ. Nicosia; Burger, F.

    2015-12-01

    We present simulations of QCD using N f =2 dynamical Wilson twisted mass lattice QCD with physical value of the pion mass and at one value of the lattice spacing. Such simulations at a∼0.09 fm became possible by adding the clover term to the action. While O(a) improvement is still guaranteed by Wilson twisted mass fermions at maximal twist, the introduction of the clover term reduces O(a 2 ) cutoff effects related to isospin symmetry breaking. We give results for a set of phenomenologically interesting observables like pseudo-scalar masses and decay constants, quark masses and the anomalous magnetic moments of leptons. We mostly find remarkably good agreement with phenomenology, even though we cannot take the continuum and thermodynamic limits.

  16. Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

    International Nuclear Information System (INIS)

    Ablinger, Jakob; Schneider, Carsten; Bluemlein, Johannes; Raab, Clemens; Wissbrock, Fabian

    2014-02-01

    We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version to the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∝30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N element of C. Integrals with a power-like divergence in N-space∝a N , a element of R, a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.

  17. Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

    Energy Technology Data Exchange (ETDEWEB)

    Ablinger, Jakob; Schneider, Carsten [Johannes Kepler Univ., Linz (Austria). Reserach Inst. for Symbolic Computation (RISC); Bluemlein, Johannes; Raab, Clemens [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Wissbrock, Fabian [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Johannes Kepler Univ., Linz (Austria). Reserach Inst. for Symbolic Computation (RISC)

    2014-02-15

    We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version to the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∝30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N element of C. Integrals with a power-like divergence in N-space∝a{sup N}, a element of R, a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.

  18. Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

    Energy Technology Data Exchange (ETDEWEB)

    Ablinger, Jakob [Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenbergerstraße 69, A-4040 Linz (Austria); Blümlein, Johannes; Raab, Clemens [Deutsches Elektronen-Synchrotron, DESY, Platanenallee 6, D-15738 Zeuthen (Germany); Schneider, Carsten [Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenbergerstraße 69, A-4040 Linz (Austria); Wißbrock, Fabian [Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenbergerstraße 69, A-4040 Linz (Austria); Deutsches Elektronen-Synchrotron, DESY, Platanenallee 6, D-15738 Zeuthen (Germany)

    2014-08-15

    We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version of the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators, new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∼30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N∈C. Integrals with a power-like divergence in N-space ∝a{sup N},a∈R,a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.

  19. Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

    International Nuclear Information System (INIS)

    Ablinger, Jakob; Blümlein, Johannes; Raab, Clemens; Schneider, Carsten; Wißbrock, Fabian

    2014-01-01

    We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version of the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators, new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∼30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N∈C. Integrals with a power-like divergence in N-space ∝a N ,a∈R,a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions

  20. Introduction to graph theory

    CERN Document Server

    Trudeau, Richard J

    1994-01-01

    Preface1. Pure Mathematics Introduction; Euclidean Geometry as Pure Mathematics; Games; Why Study Pure Mathematics?; What's Coming; Suggested Reading2. Graphs Introduction; Sets; Paradox; Graphs; Graph diagrams; Cautions; Common Graphs; Discovery; Complements and Subgraphs; Isomorphism; Recognizing Isomorphic Graphs; Semantics The Number of Graphs Having a Given nu; Exercises; Suggested Reading3. Planar Graphs Introduction; UG, K subscript 5, and the Jordan Curve Theorem; Are there More Nonplanar Graphs?; Expansions; Kuratowski's Theorem; Determining Whether a Graph is Planar or

  1. Graph Theory. 2. Vertex Descriptors and Graph Coloring

    Directory of Open Access Journals (Sweden)

    Lorentz JÄNTSCHI

    2002-12-01

    Full Text Available This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.

  2. On an edge partition and root graphs of some classes of line graphs

    Directory of Open Access Journals (Sweden)

    K Pravas

    2017-04-01

    Full Text Available The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets of the Gallai and anti-Gallai graphs of $G$. Based on this, an optimal algorithm to find the root graph of a line graph is obtained. Moreover, root graphs of diameter-maximal, distance-hereditary, Ptolemaic and chordal graphs are also discussed.

  3. Graphs and matrices

    CERN Document Server

    Bapat, Ravindra B

    2014-01-01

    This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...

  4. Twist-1 Up-Regulation in Carcinoma Correlates to Poor Survival

    Directory of Open Access Journals (Sweden)

    Alimujiang Wushou

    2014-11-01

    Full Text Available Epithelial-to-mesenchymal transition (EMT facilitates tumor metastasis. Twist is a basic helix-loop-helix protein that modulates many target genes through E-box-responsive elements. There are two twist-like proteins, Twist-1 and Twist-2, sharing high structural homology in mammals. Twist-1 was found to be a key factor in the promotion of metastasis of cancer cells, and is known to induce EMT. Twist-1 participation in carcinoma progression and metastasis has been reported in a variety of tumors. However, controversy exists concerning the correlation between Twist-1 and prognostic value with respect to carcinoma. A systematic review and meta-analysis were performed to determine whether the expression of Twist-1 was associated with the prognosis of carcinoma patients. This analysis included 17 studies: four studies evaluated lung cancer, three evaluated head and neck cancer, two evaluated breast cancer, two evaluated esophageal cancer, two evaluated liver cancer and one each evaluated osteosarcoma, bladder, cervical and ovarian cancer. A total of 2006 patients were enrolled in these studies, and the median trial sample size was 118 patients. Twist-1 expression was associated with worse overall survival (OS at both 3 years (hazard ratio “HR” for death = 2.13, 95% CI = 1.86 to 2.45, p < 0.001 and 5 years (HR for death = 2.01, 95% CI = 1.76 to 2.29, p < 0.001. Expression of Twist-1 is associated with worse survival in carcinoma.

  5. Left ventricular twist is load-dependent as shown in a large animal model with controlled cardiac load

    Directory of Open Access Journals (Sweden)

    A’roch Roman

    2012-06-01

    Full Text Available Abstract Background Left ventricular rotation and twist can be assessed noninvasively by speckle tracking echocardiography. We sought to characterize the effects of acute load change and change in inotropic state on rotation parameters as a measure of left ventricular (LV contractility. Methods Seven anesthetised juvenile pigs were studied, using direct measurement of left ventricular pressure and volume and simultaneous transthoracic echocardiography. Transient inflation of an inferior vena cava balloon (IVCB catheter produced controlled load reduction. First and last beats in the sequence of eight were analysed with speckle tracking (STE during the load alteration and analysed for change in rotation/twist during controlled load alteration at same contractile status. Two pharmacological inotropic interventions were also included to examine the same hypothesis in additionally conditions of increased and decreased myocardial contractility in each animal. Paired comparisons were made for different load states using the Wilcoxon’s Signed Rank test. Results The inferior vena cava balloon occlusion (IVCBO load change compared for first to last beat resulted in LV twist increase (11.67° ±2.65° vs. 16.17° ±3.56° respectively, p  Conclusions Peak systolic LV twist and peak early diastolic untwisting rate are load dependent. Differences in LV load should be included in the interpretation when serial measures of twist are compared.

  6. Euclidean supersymmetry, twisting and topological sigma models

    International Nuclear Information System (INIS)

    Hull, C.M.; Lindstroem, U.; Santos, L. Melo dos; Zabzine, M.; Unge, R. von

    2008-01-01

    We discuss two dimensional N-extended supersymmetry in Euclidean signature and its R-symmetry. For N = 2, the R-symmetry is SO(2) x SO(1, 1), so that only an A-twist is possible. To formulate a B-twist, or to construct Euclidean N = 2 models with H-flux so that the target geometry is generalised Kahler, it is necessary to work with a complexification of the sigma models. These issues are related to the obstructions to the existence of non-trivial twisted chiral superfields in Euclidean superspace.

  7. Graphs cospectral with a friendship graph or its complement

    Directory of Open Access Journals (Sweden)

    Alireza Abdollahi

    2013-12-01

    Full Text Available Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length $4$ or $5$, then $Gcong F_n$. Moreover if $G$ is connected and planar then $Gcong F_n$.All but one of connected components of $G$ are isomorphic to $K_2$.The complement $overline{F_n}$ of the friendship graph is determined by its adjacency eigenvalues, that is, if $overline{F_n}$ is cospectral with a graph $H$, then $Hcong overline{F_n}$.

  8. Oliver Twist

    NARCIS (Netherlands)

    Dickens, Charles

    2005-01-01

    Oliver Twist is one of Dickens's most popular novels, with many famous film, television and musical adaptations. It is a classic story of good against evil, packed with humour and pathos, drama and suspense, in which the orphaned Oliver is brought up in a harsh workhouse, and then taken in and

  9. Graph Treewidth and Geometric Thickness Parameters

    OpenAIRE

    Dujmović, Vida; Wood, David R.

    2005-01-01

    Consider a drawing of a graph $G$ in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of $G$, is the classical graph parameter "thickness". By restricting the edges to be straight, we obtain the "geometric thickness". By further restricting the vertices to be in convex position, we obtain the "book thickness". This paper studies the relationship between these parameters and treewidth. Our first main result states that for grap...

  10. Twist operator correlation functions in O(n) loop models

    International Nuclear Information System (INIS)

    Simmons, Jacob J H; Cardy, John

    2009-01-01

    Using conformal field theoretic methods we calculate correlation functions of geometric observables in the loop representation of the O(n) model at the critical point. We focus on correlation functions containing twist operators, combining these with anchored loops, boundaries with SLE processes and with double SLE processes. We focus further upon n = 0, representing self-avoiding loops, which corresponds to a logarithmic conformal field theory (LCFT) with c = 0. In this limit the twist operator plays the role of a 0-weight indicator operator, which we verify by comparison with known examples. Using the additional conditions imposed by the twist operator null states, we derive a new explicit result for the probabilities that an SLE 8/3 winds in various ways about two points in the upper half-plane, e.g. that the SLE passes to the left of both points. The collection of c = 0 logarithmic CFT operators that we use deriving the winding probabilities is novel, highlighting a potential incompatibility caused by the presence of two distinct logarithmic partners to the stress tensor within the theory. We argue that both partners do appear in the theory, one in the bulk and one on the boundary and that the incompatibility is resolved by restrictive bulk-boundary fusion rules

  11. The circumference of the square of a connected graph

    DEFF Research Database (Denmark)

    Brandt, S.; Muttel, J.; Rautenbach, D.

    2014-01-01

    The celebrated result of Fleischner states that the square of every 2-connected graph is Hamiltonian. We investigate what happens if the graph is just connected. For every n a parts per thousand yen 3, we determine the smallest length c(n) of a longest cycle in the square of a connected graph of ...... of order n and show that c(n) is a logarithmic function in n. Furthermore, for every c a parts per thousand yen 3, we characterize the connected graphs of largest order whose square contains no cycle of length at least c....

  12. Graph embedding with rich information through heterogeneous graph

    KAUST Repository

    Sun, Guolei

    2017-11-12

    Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most existing algorithms for graph embedding only rely on the topology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this thesis, we proposed a novel and general framework for graph embedding with rich text information (GERI) through constructing a heterogeneous network, in which we integrate node and edge content information with graph topology. Specially, we designed a novel biased random walk to explore the constructed heterogeneous network with the notion of flexible neighborhood. Our sampling strategy can compromise between BFS and DFS local search on heterogeneous graph. To further improve our algorithm, we proposed semi-supervised GERI (SGERI), which learns graph embedding in an discriminative manner through heterogeneous network with label information. The efficacy of our method is demonstrated by extensive comparison experiments with 9 baselines over multi-label and multi-class classification on various datasets including Citeseer, Cora, DBLP and Wiki. It shows that GERI improves the Micro-F1 and Macro-F1 of node classification up to 10%, and SGERI improves GERI by 5% in Wiki.

  13. Topics in graph theory graphs and their Cartesian product

    CERN Document Server

    Imrich, Wilfried; Rall, Douglas F

    2008-01-01

    From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.

  14. Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph

    Science.gov (United States)

    Nagarathinam, R.; Parvathi, N.

    2018-04-01

    Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat

  15. A method for independent component graph analysis of resting-state fMRI

    DEFF Research Database (Denmark)

    de Paula, Demetrius Ribeiro; Ziegler, Erik; Abeyasinghe, Pubuditha M.

    2017-01-01

    Introduction Independent component analysis (ICA) has been extensively used for reducing task-free BOLD fMRI recordings into spatial maps and their associated time-courses. The spatially identified independent components can be considered as intrinsic connectivity networks (ICNs) of non-contiguou......Introduction Independent component analysis (ICA) has been extensively used for reducing task-free BOLD fMRI recordings into spatial maps and their associated time-courses. The spatially identified independent components can be considered as intrinsic connectivity networks (ICNs) of non......-contiguous regions. To date, the spatial patterns of the networks have been analyzed with techniques developed for volumetric data. Objective Here, we detail a graph building technique that allows these ICNs to be analyzed with graph theory. Methods First, ICA was performed at the single-subject level in 15 healthy...... parcellated regions. Third, between-node functional connectivity was established by building edge weights for each networks. Group-level graph analysis was finally performed for each network and compared to the classical network. Results Network graph comparison between the classically constructed network...

  16. Twisted Acceleration-Enlarged Newton-Hooke Hopf Algebras

    International Nuclear Information System (INIS)

    Daszkiewicz, M.

    2010-01-01

    Ten Abelian twist deformations of acceleration-enlarged Newton-Hooke Hopf algebra are considered. The corresponding quantum space-times are derived as well. It is demonstrated that their contraction limit τ → ∞ leads to the new twisted acceleration-enlarged Galilei spaces. (author)

  17. Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs

    KAUST Repository

    Jamour, Fuad Tarek

    2017-10-17

    Betweenness centrality quantifies the importance of nodes in a graph in many applications, including network analysis, community detection and identification of influential users. Typically, graphs in such applications evolve over time. Thus, the computation of betweenness centrality should be performed incrementally. This is challenging because updating even a single edge may trigger the computation of all-pairs shortest paths in the entire graph. Existing approaches cannot scale to large graphs: they either require excessive memory (i.e., quadratic to the size of the input graph) or perform unnecessary computations rendering them prohibitively slow. We propose iCentral; a novel incremental algorithm for computing betweenness centrality in evolving graphs. We decompose the graph into biconnected components and prove that processing can be localized within the affected components. iCentral is the first algorithm to support incremental betweeness centrality computation within a graph component. This is done efficiently, in linear space; consequently, iCentral scales to large graphs. We demonstrate with real datasets that the serial implementation of iCentral is up to 3.7 times faster than existing serial methods. Our parallel implementation that scales to large graphs, is an order of magnitude faster than the state-of-the-art parallel algorithm, while using an order of magnitude less computational resources.

  18. TWIST1 promotes invasion through mesenchymal change in human glioblastoma

    Directory of Open Access Journals (Sweden)

    Wakimoto Hiroaki

    2010-07-01

    Full Text Available Abstract Background Tumor cell invasion into adjacent normal brain is a mesenchymal feature of GBM and a major factor contributing to their dismal outcomes. Therefore, better understandings of mechanisms that promote mesenchymal change in GBM are of great clinical importance to address invasion. We previously showed that the bHLH transcription factor TWIST1 which orchestrates carcinoma metastasis through an epithelial mesenchymal transition (EMT is upregulated in GBM and promotes invasion of the SF767 GBM cell line in vitro. Results To further define TWIST1 functions in GBM we tested the impact of TWIST1 over-expression on invasion in vivo and its impact on gene expression. We found that TWIST1 significantly increased SNB19 and T98G cell line invasion in orthotopic xenotransplants and increased expression of genes in functional categories associated with adhesion, extracellular matrix proteins, cell motility and locomotion, cell migration and actin cytoskeleton organization. Consistent with this TWIST1 reduced cell aggregation, promoted actin cytoskeletal re-organization and enhanced migration and adhesion to fibronectin substrates. Individual genes upregulated by TWIST1 known to promote EMT and/or GBM invasion included SNAI2, MMP2, HGF, FAP and FN1. Distinct from carcinoma EMT, TWIST1 did not generate an E- to N-cadherin "switch" in GBM cell lines. The clinical relevance of putative TWIST target genes SNAI2 and fibroblast activation protein alpha (FAP identified in vitro was confirmed by their highly correlated expression with TWIST1 in 39 human tumors. The potential therapeutic importance of inhibiting TWIST1 was also shown through a decrease in cell invasion in vitro and growth of GBM stem cells. Conclusions Together these studies demonstrated that TWIST1 enhances GBM invasion in concert with mesenchymal change not involving the canonical cadherin switch of carcinoma EMT. Given the recent recognition that mesenchymal change in GBMs is

  19. QCD factorization of exclusive processes beyond leading twist: γT*→ρT impact factor with twist three accuracy

    International Nuclear Information System (INIS)

    Anikin, I.V.; Ivanov, D.Yu.; Pire, B.; Szymanowski, L.; Wallon, S.

    2010-01-01

    We describe a consistent approach to factorization of scattering amplitudes for exclusive processes beyond the leading twist approximation. The method involves the Taylor expansion of the scattering amplitude in the momentum space around the dominant light-cone direction and thus naturally introduces an appropriate set of non-perturbative correlators which encode effects not only of the lowest but also of the higher Fock states of the produced particle. The reduction of original set of correlators to a set of independent ones is achieved with the help of equations of motion and invariance of the scattering amplitude under rotation on the light cone. We compare the proposed method with the covariant method formulated in the coordinate space, based on the operator product expansion. We prove the equivalence of two proposed parametrizations of the ρ T distribution amplitudes. As a concrete application, we compute the expressions of the impact factor for the transition of virtual photon to transversally polarised ρ-meson up to the twist 3 accuracy within these two quite different methods and show that they are identical.

  20. Handbook of graph grammars and computing by graph transformation

    CERN Document Server

    Engels, G; Kreowski, H J; Rozenberg, G

    1999-01-01

    Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.The area of graph grammars and graph tran

  1. Renormalization of quark propagator, vertex functions, and twist-2 operators from twisted-mass lattice QCD at Nf=4

    Science.gov (United States)

    Blossier, Benoît.; Brinet, Mariane; Guichon, Pierre; Morénas, Vincent; Pène, Olivier; Rodríguez-Quintero, Jose; Zafeiropoulos, Savvas

    2015-06-01

    We present a precise nonperturbative determination of the renormalization constants in the mass independent RI'-MOM scheme. The lattice implementation uses the Iwasaki gauge action and four degenerate dynamical twisted-mass fermions. The gauge configurations are provided by the ETM Collaboration. Renormalization constants for scalar, pseudoscalar, vector and axial operators, as well as the quark propagator renormalization, are computed at three different values of the lattice spacing, two volumes and several twisted-mass parameters. The method we developed allows for a precise cross-check of the running, thanks to the particular proper treatment of hypercubic artifacts. Results for the twist-2 operator O44 are also presented.

  2. Use of Attack Graphs in Security Systems

    Directory of Open Access Journals (Sweden)

    Vivek Shandilya

    2014-01-01

    Full Text Available Attack graphs have been used to model the vulnerabilities of the systems and their potential exploits. The successful exploits leading to the partial/total failure of the systems are subject of keen security interest. Considerable effort has been expended in exhaustive modeling, analyses, detection, and mitigation of attacks. One prominent methodology involves constructing attack graphs of the pertinent system for analysis and response strategies. This not only gives the simplified representation of the system, but also allows prioritizing the security properties whose violations are of greater concern, for both detection and repair. We present a survey and critical study of state-of-the-art technologies in attack graph generation and use in security system. Based on our research, we identify the potential, challenges, and direction of the current research in using attack graphs.

  3. Graph-based semi-supervised learning

    CERN Document Server

    Subramanya, Amarnag

    2014-01-01

    While labeled data is expensive to prepare, ever increasing amounts of unlabeled data is becoming widely available. In order to adapt to this phenomenon, several semi-supervised learning (SSL) algorithms, which learn from labeled as well as unlabeled data, have been developed. In a separate line of work, researchers have started to realize that graphs provide a natural way to represent data in a variety of domains. Graph-based SSL algorithms, which bring together these two lines of work, have been shown to outperform the state-of-the-art in many applications in speech processing, computer visi

  4. An approach for brain-controlled prostheses based on Scene Graph Steady-State Visual Evoked Potentials.

    Science.gov (United States)

    Li, Rui; Zhang, Xiaodong; Li, Hanzhe; Zhang, Liming; Lu, Zhufeng; Chen, Jiangcheng

    2018-08-01

    Brain control technology can restore communication between the brain and a prosthesis, and choosing a Brain-Computer Interface (BCI) paradigm to evoke electroencephalogram (EEG) signals is an essential step for developing this technology. In this paper, the Scene Graph paradigm used for controlling prostheses was proposed; this paradigm is based on Steady-State Visual Evoked Potentials (SSVEPs) regarding the Scene Graph of a subject's intention. A mathematic model was built to predict SSVEPs evoked by the proposed paradigm and a sinusoidal stimulation method was used to present the Scene Graph stimulus to elicit SSVEPs from subjects. Then, a 2-degree of freedom (2-DOF) brain-controlled prosthesis system was constructed to validate the performance of the Scene Graph-SSVEP (SG-SSVEP)-based BCI. The classification of SG-SSVEPs was detected via the Canonical Correlation Analysis (CCA) approach. To assess the efficiency of proposed BCI system, the performances of traditional SSVEP-BCI system were compared. Experimental results from six subjects suggested that the proposed system effectively enhanced the SSVEP responses, decreased the degradation of SSVEP strength and reduced the visual fatigue in comparison with the traditional SSVEP-BCI system. The average signal to noise ratio (SNR) of SG-SSVEP was 6.31 ± 2.64 dB, versus 3.38 ± 0.78 dB of traditional-SSVEP. In addition, the proposed system achieved good performances in prosthesis control. The average accuracy was 94.58% ± 7.05%, and the corresponding high information transfer rate (IRT) was 19.55 ± 3.07 bit/min. The experimental results revealed that the SG-SSVEP based BCI system achieves the good performance and improved the stability relative to the conventional approach. Copyright © 2018 Elsevier B.V. All rights reserved.

  5. Twisted covariant noncommutative self-dual gravity

    International Nuclear Information System (INIS)

    Estrada-Jimenez, S.; Garcia-Compean, H.; Obregon, O.; Ramirez, C.

    2008-01-01

    A twisted covariant formulation of noncommutative self-dual gravity is presented. The formulation for constructing twisted noncommutative Yang-Mills theories is used. It is shown that the noncommutative torsion is solved at any order of the θ expansion in terms of the tetrad and some extra fields of the theory. In the process the first order expansion in θ for the Plebanski action is explicitly obtained.

  6. Soft tissue twisting injuries of the knee

    International Nuclear Information System (INIS)

    Magee, T.; Shapiro, M.

    2001-01-01

    Twisting injuries occur as a result of differential motion of different tissue types in injuries with some rotational force. These injuries are well described in brain injuries but, to our knowledge, have not been described in the musculoskeletal literature. We correlated the clinical examination and MR findings of 20 patients with twisting injuries of the soft tissues around the knee. Design and patients: We prospectively followed the clinical courses of 20 patients with knee injuries who had clinical histories and MR findings to suggest twisting injuries of the subcutaneous tissues. Patients with associated internal derangement of the knee (i.e., meniscal tears, ligamentous or bone injuries) were excluded from this study. MR findings to suggest twisting injuries included linear areas of abnormal dark signal on T1-weighted sequences and abnormal bright signal on T2-weighted or short tau inversion recovery (STIR) sequences and/or signal to suggest hemorrhage within the subcutaneous tissues. These MR criteria were adapted from those established for indirect musculotendinous junction injuries. Results: All 20 patients presented with considerable pain that suggested internal derangement on physical examination by the referring orthopedic surgeons. All presented with injuries associated with rotational force. The patients were placed on a course of protected weight-bearing of the affected extremity for 4 weeks. All patients had pain relief by clinical examination after this period of protected weight-bearing. Twisting injuries of the soft tissues can result in considerable pain that can be confused with internal derangement of the knee on physical examination. Soft tissue twisting injuries need to be recognized on MR examinations as they may be the cause of the patient's pain despite no MR evidence of internal derangement of the knee. The demonstration of soft tissue twisting injuries in a patient with severe knee pain but no documented internal derangement on MR

  7. Reaction mechanism of the acidic hydrolysis of highly twisted amides: Rate acceleration caused by the twist of the amide bond.

    Science.gov (United States)

    Mujika, Jon I; Formoso, Elena; Mercero, Jose M; Lopez, Xabier

    2006-08-03

    We present an ab initio study of the acid hydrolysis of a highly twisted amide and a planar amide analogue. The aim of these studies is to investigate the effect that the twist of the amide bond has on the reaction barriers and mechanism of acid hydrolysis. Concerted and stepwise mechanisms were investigated using density functional theory and polarizable continuum model calculations. Remarkable differences were observed between the mechanism of twisted and planar amide, due mainly to the preference for N-protonation of the former and O-protonation of the latter. In addition, we were also able to determine that the hydrolytic mechanism of the twisted amide will be pH dependent. Thus, there is a preference for a stepwise mechanism with formation of an intermediate in the acid hydrolysis, whereas the neutral hydrolysis undergoes a concerted-type mechanism. There is a nice agreement between the characterized intermediate and available X-ray data and a good agreement with the kinetically estimated rate acceleration of hydrolysis with respect to analogous undistorted amide compounds. This work, along with previous ab initio calculations, describes a complex and rich chemistry for the hydrolysis of highly twisted amides as a function of pH. The theoretical data provided will allow for a better understanding of the available kinetic data of the rate acceleration of amides upon twisting and the relation of the observed rate acceleration with intrinsic differential reactivity upon loss of amide bond resonance.

  8. A twisted generalization of Novikov-Poisson algebras

    OpenAIRE

    Yau, Donald

    2010-01-01

    Hom-Novikov-Poisson algebras, which are twisted generalizations of Novikov-Poisson algebras, are studied. Hom-Novikov-Poisson algebras are shown to be closed under tensor products and several kinds of twistings. Necessary and sufficient conditions are given under which Hom-Novikov-Poisson algebras give rise to Hom-Poisson algebras.

  9. Efficient Extraction of High Centrality Vertices in Distributed Graphs

    Energy Technology Data Exchange (ETDEWEB)

    Kumbhare, Alok [Univ. of Southern California, Los Angeles, CA (United States); Frincu, Marc [Univ. of Southern California, Los Angeles, CA (United States); Raghavendra, Cauligi S. [Univ. of Southern California, Los Angeles, CA (United States); Prasanna, Viktor K. [Univ. of Southern California, Los Angeles, CA (United States)

    2014-09-09

    Betweenness centrality (BC) is an important measure for identifying high value or critical vertices in graphs, in variety of domains such as communication networks, road networks, and social graphs. However, calculating betweenness values is prohibitively expensive and, more often, domain experts are interested only in the vertices with the highest centrality values. In this paper, we first propose a partition-centric algorithm (MS-BC) to calculate BC for a large distributed graph that optimizes resource utilization and improves overall performance. Further, we extend the notion of approximate BC by pruning the graph and removing a subset of edges and vertices that contribute the least to the betweenness values of other vertices (MSL-BC), which further improves the runtime performance. We evaluate the proposed algorithms using a mix of real-world and synthetic graphs on an HPC cluster and analyze its strengths and weaknesses. The experimental results show an improvement in performance of upto 12x for large sparse graphs as compared to the state-of-the-art, and at the same time highlights the need for better partitioning methods to enable a balanced workload across partitions for unbalanced graphs such as small-world or power-law graphs.

  10. Bond graphs : an integrating tool for design of mechatronic systems

    International Nuclear Information System (INIS)

    Ould Bouamama, B.

    2011-01-01

    Bond graph is a powerful tool well known for dynamic modelling of multi physical systems: This is the only modelling technique to generate automatically state space or non-linear models using dedicated software tools (CAMP-G, 20-Sim, Symbols, Dymola...). Recently several fundamental theories have been developed for using a bond graph model not only for modeling but also as a real integrated tool from conceptual ideas to optimal practical realization of mechatronic system. This keynote presents a synthesis of those new theories which exploit some particular properties (such as causal, structural and behavioral) of this graphical methodology. Based on a pedagogical example, it will be shown how from a physical system (not a transfer function or state equation) and using only one representation (Bond graph), the following results can be performed: modeling (formal state equations generation), Control analysis (observability, controllability, Structural I/O decouplability, dynamic decoupling,...) diagnosis analysis (automatic generation of robust fault indicators, sensor placement, structural diagnosability) and finally sizing of actuators. The presentation will be illustrated by real industrial applications. Limits and perspectives of bond graph theory conclude the keynote.

  11. Herdable Systems Over Signed, Directed Graphs

    KAUST Repository

    Ruf, Sebastian F.; Egerstedt, Magnus; Shamma, Jeff S.

    2018-01-01

    This paper considers the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. The basic theory of herdable systems is presented, including a necessary and sufficient condition for herdability. This paper then considers the impact of the underlying graph structure of a linear system on the herdability of the system, for the case where the graph is represented as signed and directed. By classifying nodes based on the length and sign of walks from an input, we find a class of completely herdable systems as well as provide a complete characterization of nodes that can be herded in systems with an underlying graph that is a directed out-branching rooted at a single input.

  12. Herdable Systems Over Signed, Directed Graphs

    KAUST Repository

    Ruf, Sebastian F.

    2018-04-11

    This paper considers the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. The basic theory of herdable systems is presented, including a necessary and sufficient condition for herdability. This paper then considers the impact of the underlying graph structure of a linear system on the herdability of the system, for the case where the graph is represented as signed and directed. By classifying nodes based on the length and sign of walks from an input, we find a class of completely herdable systems as well as provide a complete characterization of nodes that can be herded in systems with an underlying graph that is a directed out-branching rooted at a single input.

  13. Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes

    Directory of Open Access Journals (Sweden)

    Katona Gyula Y.

    2014-11-01

    Full Text Available The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.

  14. Introduction to twisted conformal fields

    International Nuclear Information System (INIS)

    Kazama, Y.

    1988-01-01

    A pedagogical account is given of the recent developments in the theory of twisted conformal fields. Among other things, the main part of the lecture concerns the construction of the twist-emission vertex operator, which is a generalization of the fermion emission vertex in the superstring theory. Several different forms of the vertex are derived and their mutural relationships are clarified. In this paper, the authors include a brief survey of the history of the fermion emission vertex, as it offers a good perspective in which to appreciate the logical development

  15. Dataset of TWIST1-regulated genes in the cranial mesoderm and a transcriptome comparison of cranial mesoderm and cranial neural crest

    Directory of Open Access Journals (Sweden)

    Heidi Bildsoe

    2016-12-01

    Full Text Available This article contains data related to the research article entitled “Transcriptional targets of TWIST1 in the cranial mesoderm regulate cell-matrix interactions and mesenchyme maintenance” by Bildsoe et al. (2016 [1]. The data presented here are derived from: (1 a microarray-based comparison of sorted cranial mesoderm (CM and cranial neural crest (CNC cells from E9.5 mouse embryos; (2 comparisons of transcription profiles of head tissues from mouse embryos with a CM-specific loss-of-function of Twist1 and control mouse embryos collected at E8.5 and E9.5; (3 ChIP-seq using a TWIST1-specific monoclonal antibody with chromatin extracts from TWIST1-expressing MDCK cells, a model for a TWIST1-dependent mesenchymal state.

  16. On the performance analysis of Savonius rotor with twisted blades

    Energy Technology Data Exchange (ETDEWEB)

    Saha, U.K.; Rajkumar, M. Jaya [Department of Mechanical Engineering, Indian Institute of Technology Guwahati, Guwahati-781 039 (India)

    2006-09-15

    The present investigation is aimed at exploring the feasibility of twisted bladed Savonius rotor for power generation. The twisted blade in a three-bladed rotor system has been tested in a low speed wind tunnel, and its performance has been compared with conventional semicircular blades (with twist angle of 0{sup o}). Performance analysis has been made on the basis of starting characteristics, static torque and rotational speed. Experimental evidence shows the potential of the twisted bladed rotor in terms of smooth running, higher efficiency and self-starting capability as compared to that of the conventional bladed rotor. Further experiments have been conducted in the same setup to optimize the twist angle. (author)

  17. Continuous-Time Classical and Quantum Random Walk on Direct Product of Cayley Graphs

    International Nuclear Information System (INIS)

    Salimi, S.; Jafarizadeh, M. A.

    2009-01-01

    In this paper we define direct product of graphs and give a recipe for obtaining probability of observing particle on vertices in the continuous-time classical and quantum random walk. In the recipe, the probability of observing particle on direct product of graph is obtained by multiplication of probability on the corresponding to sub-graphs, where this method is useful to determining probability of walk on complicated graphs. Using this method, we calculate the probability of continuous-time classical and quantum random walks on many of finite direct product Cayley graphs (complete cycle, complete K n , charter and n-cube). Also, we inquire that the classical state the stationary uniform distribution is reached as t → ∞ but for quantum state is not always satisfied. (general)

  18. Graphs and Homomorphisms

    CERN Document Server

    Hell, Pavol

    2004-01-01

    This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colourings, and has applications in complexity theory, artificial intelligence, telecommunication, and, most recently, statistical physics.Based on the authors' lecture notes for graduate courses, this book can be used as a textbook for a second course in graph theory at 4th year or master's level an

  19. QCD factorization of exclusive processes beyond leading twist: gamma{sub T}*->rho{sub T} impact factor with twist three accuracy

    Energy Technology Data Exchange (ETDEWEB)

    Anikin, I.V. [Bogoliubov Laboratory of Theoretical Physics, JINR, 141980 Dubna (Russian Federation); Ivanov, D.Yu. [Sobolev Institute of Mathematics, 630090 Novosibirsk (Russian Federation); Pire, B., E-mail: pire@cpht.polytechnique.f [CPHT, Ecole Polytechnique, CNRS, 91128 Palaiseau Cedex (France); Szymanowski, L. [Soltan Institute for Nuclear Studies, PL-00-681 Warsaw (Poland); Wallon, S. [LPT, Universite Paris-Sud, CNRS, 91405 Orsay (France); UPMC Univ. Paris 06, faculte de physique, 4 place Jussieu, 75252 Paris Cedex 05 (France)

    2010-03-21

    We describe a consistent approach to factorization of scattering amplitudes for exclusive processes beyond the leading twist approximation. The method involves the Taylor expansion of the scattering amplitude in the momentum space around the dominant light-cone direction and thus naturally introduces an appropriate set of non-perturbative correlators which encode effects not only of the lowest but also of the higher Fock states of the produced particle. The reduction of original set of correlators to a set of independent ones is achieved with the help of equations of motion and invariance of the scattering amplitude under rotation on the light cone. We compare the proposed method with the covariant method formulated in the coordinate space, based on the operator product expansion. We prove the equivalence of two proposed parametrizations of the rho{sub T} distribution amplitudes. As a concrete application, we compute the expressions of the impact factor for the transition of virtual photon to transversally polarised rho-meson up to the twist 3 accuracy within these two quite different methods and show that they are identical.

  20. Twisted sigma-model solitons on the quantum projective line

    Science.gov (United States)

    Landi, Giovanni

    2018-04-01

    On the configuration space of projections in a noncommutative algebra, and for an automorphism of the algebra, we use a twisted Hochschild cocycle for an action functional and a twisted cyclic cocycle for a topological term. The latter is Hochschild-cohomologous to the former and positivity in twisted Hochschild cohomology results into a lower bound for the action functional. While the equations for the critical points are rather involved, the use of the positivity and the bound by the topological term lead to self-duality equations (thus yielding twisted noncommutative sigma-model solitons, or instantons). We present explicit nontrivial solutions on the quantum projective line.

  1. High performance electrochemical and electrothermal artificial muscles from twist-spun carbon nanotube yarn

    Science.gov (United States)

    Lee, Jae Ah; Baughman, Ray H.; Kim, Seon Jeong

    2015-04-01

    High performance torsional and tensile artificial muscles are described, which utilize thermally- or electrochemically-induced volume changes of twist-spun, guest-filled, carbon nanotube (CNT) yarns. These yarns were prepared by incorporating twist in carbon nanotube sheets drawn from spinnable CNT forests. Inserting high twist into the CNT yarn results in yarn coiling, which can dramatically amplify tensile stroke and work capabilities compared with that for the non-coiled twisted yarn. When electrochemically driven in a liquid electrolyte, these artificial muscles can generate a torsional rotation per muscle length that is over 1000 times higher than for previously reported torsional muscles. All-solid-state torsional electrochemical yarn muscles have provided a large torsional muscle stroke (53° per mm of yarn length) and a tensile stroke of up to 1.3% when lifting loads that are ~25 times heavier than can be lifted by the same diameter human skeletal muscle. Over a million torsional and tensile actuation cycles have been demonstrated for thermally powered CNT hybrid yarns muscles filled with paraffin wax, wherein a muscle spins a rotor at an average 11,500 revolutions/minute or delivers 3% tensile contraction at 1200 cycles/minute. At lower actuation rates, these thermally powered muscles provide tensile strokes of over 10%.

  2. Graph theoretical calculation of systems reliability with semi-Markov processes

    International Nuclear Information System (INIS)

    Widmer, U.

    1984-06-01

    The determination of the state probabilities and related quantities of a system characterized by an SMP (or a homogeneous MP) can be performed by means of graph-theoretical methods. The calculation procedures for semi-Markov processes based on signal flow graphs are reviewed. Some methods from electrotechnics are adapted in order to obtain a representation of the state probabilities by means of trees. From this some formulas are derived for the asymptotic state probabilities and for the mean life-time in reliability considerations. (Auth.)

  3. Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs

    DEFF Research Database (Denmark)

    Bensmail, Julien; Renault, Gabriel

    2016-01-01

    An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪⋯∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently co...

  4. A higher twist correction to heavy quark production

    International Nuclear Information System (INIS)

    Brodsky, S.J.; Gunion, J.F.; Soper, D.E.

    1987-06-01

    The leading twist prediction for heavy quark production and a model for a higher twist correction that may be important for charm production was discussed. The correction arises from the interaction of the charm quark with spectator quarks

  5. Non-heuristic reduction of the graph in graph-cut optimization

    International Nuclear Information System (INIS)

    Malgouyres, François; Lermé, Nicolas

    2012-01-01

    During the last ten years, graph cuts had a growing impact in shape optimization. In particular, they are commonly used in applications of shape optimization such as image processing, computer vision and computer graphics. Their success is due to their ability to efficiently solve (apparently) difficult shape optimization problems which typically involve the perimeter of the shape. Nevertheless, solving problems with a large number of variables remains computationally expensive and requires a high memory usage since underlying graphs sometimes involve billion of nodes and even more edges. Several strategies have been proposed in the literature to improve graph-cuts in this regards. In this paper, we give a formal statement which expresses that a simple and local test performed on every node before its construction permits to avoid the construction of useless nodes for the graphs typically encountered in image processing and vision. A useless node is such that the value of the maximum flow in the graph does not change when removing the node from the graph. Such a test therefore permits to limit the construction of the graph to a band of useful nodes surrounding the final cut.

  6. Graph topologies on closed multifunctions

    Directory of Open Access Journals (Sweden)

    Giuseppe Di Maio

    2003-10-01

    Full Text Available In this paper we study function space topologies on closed multifunctions, i.e. closed relations on X x Y using various hypertopologies. The hypertopologies are in essence, graph topologies i.e topologies on functions considered as graphs which are subsets of X x Y . We also study several topologies, including one that is derived from the Attouch-Wets filter on the range. We state embedding theorems which enable us to generalize and prove some recent results in the literature with the use of known results in the hyperspace of the range space and in the function space topologies of ordinary functions.

  7. Graph embedding with rich information through heterogeneous graph

    KAUST Repository

    Sun, Guolei

    2017-01-01

    Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most

  8. Optical yarn assessment system for twist measurement in rotor-spun yarn

    International Nuclear Information System (INIS)

    Jhatial, R.A.

    2015-01-01

    This paper presents the development of an optical yarn assessment system for evaluation of twist and structure of twisted yarn. The system comprises a yarn carriage unit, a video microscope and a personal computer. This system was used in conjunction with the well-known tracer fibre technique. This system enables digital images to be grabbed and continuous movies of the yarn to be recorded in order to facilitate the measurement of twist and the analysis of yarn structure. Yarn samples from polyester, viscose and cotton with 35 tex and 485 turns/meter were spun from the roving with 2.3% of black fibres on the SKF laboratory ring frame. In order to measure the twist in the rotor yarns with the optical yarn assessment system, a set of yarn samples from same fibres were spun on RU 14 rotor machine with 35 tex and 475 turns/meter. The twist was measured with the optical yarn assessment system and sixty tests of each sample were carried out on the Zweigle D301. It is clear from the results that there is consistency in the twist of ring-spun yarn measured by the optical yarn assessment system. However, the measured twist with the Zwiegle D301 is inconsistent in the different yarns. The difference in the mean twist measured with the optical twist measuring system and the double untwist-twist method was not significant at a 5% probability level when data was analyzed with t test by using SPSS (Statistical Package for Social Sciences). (author)

  9. Graphing trillions of triangles.

    Science.gov (United States)

    Burkhardt, Paul

    2017-07-01

    The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.

  10. Level-rank duality of untwisted and twisted D-branes

    International Nuclear Information System (INIS)

    Naculich, Stephen G.; Schnitzer, Howard J.

    2006-01-01

    Level-rank duality of untwisted and twisted D-branes of WZW models is explored. We derive the relation between D0-brane charges of level-rank dual untwisted D-branes of su-bar (N) K and sp-bar (n) k , and of level-rank dual twisted D-branes of su-bar (2n+1) 2k+1 . The analysis of level-rank duality of twisted D-branes of su-bar (2n+1) 2k+1 is facilitated by their close relation to untwisted D-branes of sp-bar (n) k . We also demonstrate level-rank duality of the spectrum of an open string stretched between untwisted or twisted D-branes in each of these cases

  11. Adaptive Graph Convolutional Neural Networks

    OpenAIRE

    Li, Ruoyu; Wang, Sheng; Zhu, Feiyun; Huang, Junzhou

    2018-01-01

    Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking data of arbitrary graph structure as input. In that way a task-driven adaptive graph is learned for eac...

  12. Label Information Guided Graph Construction for Semi-Supervised Learning.

    Science.gov (United States)

    Zhuang, Liansheng; Zhou, Zihan; Gao, Shenghua; Yin, Jingwen; Lin, Zhouchen; Ma, Yi

    2017-09-01

    In the literature, most existing graph-based semi-supervised learning methods only use the label information of observed samples in the label propagation stage, while ignoring such valuable information when learning the graph. In this paper, we argue that it is beneficial to consider the label information in the graph learning stage. Specifically, by enforcing the weight of edges between labeled samples of different classes to be zero, we explicitly incorporate the label information into the state-of-the-art graph learning methods, such as the low-rank representation (LRR), and propose a novel semi-supervised graph learning method called semi-supervised low-rank representation. This results in a convex optimization problem with linear constraints, which can be solved by the linearized alternating direction method. Though we take LRR as an example, our proposed method is in fact very general and can be applied to any self-representation graph learning methods. Experiment results on both synthetic and real data sets demonstrate that the proposed graph learning method can better capture the global geometric structure of the data, and therefore is more effective for semi-supervised learning tasks.

  13. Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?

    Directory of Open Access Journals (Sweden)

    Mehmet Fatih Öçal

    2017-01-01

    Full Text Available Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students’ learning during graphing functions. However, the display of graphs of functions that students sketched by hand may be relatively different when compared to the correct forms sketched using graphing software. The possible misleading effects of this situation brought a discussion of a misconception (asymptote misconception on graphing functions. The purpose of this study is two- fold. First of all, this study investigated whether using graphing software (GeoGebra in this case helps students to determine and resolve this misconception in calculus classrooms. Second, the reasons for this misconception are sought. The multiple case study was utilized in this study. University students in two calculus classrooms who received instructions with (35 students or without GeoGebra assisted instructions (32 students were compared according to whether they fell into this misconception on graphing basic functions (1/x, lnx, ex. In addition, students were interviewed to reveal the reasons behind this misconception. Data were analyzed by means of descriptive and content analysis methods. The findings indicated that those who received GeoGebra assisted instruction were better in resolving it. In addition, the reasons behind this misconception were found to be teacher-based, exam-based and some other factors.

  14. Sigma terms and strangeness content of the nucleon with Nf=2+1+1 twisted mass fermions

    International Nuclear Information System (INIS)

    Alexandrou, C.

    2012-11-01

    We investigate excited state contaminations in a direct computation of the nucleon σ-terms. This is an important source of systematic effects that needs to be controlled besides the light quark mass dependence and lattice artefacts. We use maximally twisted mass fermions with dynamical light (u,d), strange and charm degrees of freedom. Employing an efficient stochastic evaluation of the disconnected contribution available for twisted mass fermions, we show that the effect of excited states is large in particular for the strange σ-terms, where it can be as big as O(>or similar 40%). This leads to the unfortunate conclusion that even with a source-sink separation of ∝1.5 fm and a good statistical accuracy it is not clear, whether excited state effects are under control for this quantity.

  15. Graph-cut based discrete-valued image reconstruction.

    Science.gov (United States)

    Tuysuzoglu, Ahmet; Karl, W Clem; Stojanovic, Ivana; Castañòn, David; Ünlü, M Selim

    2015-05-01

    Efficient graph-cut methods have been used with great success for labeling and denoising problems occurring in computer vision. Unfortunately, the presence of linear image mappings has prevented the use of these techniques in most discrete-amplitude image reconstruction problems. In this paper, we develop a graph-cut based framework for the direct solution of discrete amplitude linear image reconstruction problems cast as regularized energy function minimizations. We first analyze the structure of discrete linear inverse problem cost functions to show that the obstacle to the application of graph-cut methods to their solution is the variable mixing caused by the presence of the linear sensing operator. We then propose to use a surrogate energy functional that overcomes the challenges imposed by the sensing operator yet can be utilized efficiently in existing graph-cut frameworks. We use this surrogate energy functional to devise a monotonic iterative algorithm for the solution of discrete valued inverse problems. We first provide experiments using local convolutional operators and show the robustness of the proposed technique to noise and stability to changes in regularization parameter. Then we focus on nonlocal, tomographic examples where we consider limited-angle data problems. We compare our technique with state-of-the-art discrete and continuous image reconstruction techniques. Experiments show that the proposed method outperforms state-of-the-art techniques in challenging scenarios involving discrete valued unknowns.

  16. OAM mode converter in twisted fibers

    DEFF Research Database (Denmark)

    Usuga Castaneda, Mario A.; Beltran-Mejia, Felipe; Cordeiro, Cristiano

    2014-01-01

    We analyze the case of an OAM mode converter based on a twisted fiber, through finite element simulations where we exploit an equivalence between geometric and material transformations. The obtained converter has potential applications in MDM. © 2014 OSA.......We analyze the case of an OAM mode converter based on a twisted fiber, through finite element simulations where we exploit an equivalence between geometric and material transformations. The obtained converter has potential applications in MDM. © 2014 OSA....

  17. Twisting perturbed parafermions

    Directory of Open Access Journals (Sweden)

    A.V. Belitsky

    2017-07-01

    Full Text Available The near-collinear expansion of scattering amplitudes in maximally supersymmetric Yang–Mills theory at strong coupling is governed by the dynamics of stings propagating on the five sphere. The pentagon transitions in the operator product expansion which systematize the series get reformulated in terms of matrix elements of branch-point twist operators in the two-dimensional O(6 nonlinear sigma model. The facts that the latter is an asymptotically free field theory and that there exists no local realization of twist fields prevents one from explicit calculation of their scaling dimensions and operator product expansion coefficients. This complication is bypassed making use of the equivalence of the sigma model to the infinite-level limit of WZNW models perturbed by current–current interactions, such that one can use conformal symmetry and conformal perturbation theory for systematic calculations. Presently, to set up the formalism, we consider the O(3 sigma model which is reformulated as perturbed parafermions.

  18. Twisted Vanes Would Enhance Fuel/Air Mixing In Turbines

    Science.gov (United States)

    Nguyen, H. Lee; Micklow, Gerald J.; Dogra, Anju S.

    1994-01-01

    Computations of flow show performance of high-shear airblast fuel injector in gas-turbine engine enhanced by use of appropriately proportioned twisted (instead of flat) dome swirl vanes. Resultant more nearly uniform fuel/air mixture burns more efficiently, emitting smaller amounts of nitrogen oxides. Twisted-vane high-shear airblast injectors also incorporated into paint sprayers, providing advantages of low pressure drop characteristic of airblast injectors in general and finer atomization of advanced twisted-blade design.

  19. X-Graphs: Language and Algorithms for Heterogeneous Graph Streams

    Science.gov (United States)

    2017-09-01

    are widely used by academia and industry. 15. SUBJECT TERMS Data Analytics, Graph Analytics, High-Performance Computing 16. SECURITY CLASSIFICATION...form the core of the DeepDive Knowledge Construction System. 2 INTRODUCTION The goal of the X-Graphs project was to develop computational techniques...memory multicore machine. Ringo is based on Snap.py and SNAP, and uses Python . Ringo now allows the integration of Delite DSL Framework Graph

  20. A Bond Graph Approach for the Modeling and Simulation of a Buck Converter

    Directory of Open Access Journals (Sweden)

    Rached Zrafi

    2018-01-01

    Full Text Available This paper deals with the modeling of bond graph buck converter systems. The bond graph formalism, which represents a heterogeneous formalism for physical modeling, is used to design a sub-model of a power MOSFET and PiN diode switchers. These bond graph models are based on the device’s electrical elements. The application of these models to a bond graph buck converter permit us to obtain an invariant causal structure when the switch devices change state. This paper shows the usefulness of the bond graph device’s modeling to simulate an implicit bond graph buck converter.

  1. On the sizes of expander graphs and minimum distances of graph codes

    DEFF Research Database (Denmark)

    Høholdt, Tom; Justesen, Jørn

    2014-01-01

    We give lower bounds for the minimum distances of graph codes based on expander graphs. The bounds depend only on the second eigenvalue of the graph and the parameters of the component codes. We also give an upper bound on the size of a degree regular graph with given second eigenvalue....

  2. Localization in random bipartite graphs: Numerical and empirical study

    Science.gov (United States)

    Slanina, František

    2017-05-01

    We investigate adjacency matrices of bipartite graphs with a power-law degree distribution. Motivation for this study is twofold: first, vibrational states in granular matter and jammed sphere packings; second, graphs encoding social interaction, especially electronic commerce. We establish the position of the mobility edge and show that it strongly depends on the power in the degree distribution and on the ratio of the sizes of the two parts of the bipartite graph. At the jamming threshold, where the two parts have the same size, localization vanishes. We found that the multifractal spectrum is nontrivial in the delocalized phase, but still near the mobility edge. We also study an empirical bipartite graph, namely, the Amazon reviewer-item network. We found that in this specific graph the mobility edge disappears, and we draw a conclusion from this fact regarding earlier empirical studies of the Amazon network.

  3. Comparison of split double and triple twists in pair figure skating.

    Science.gov (United States)

    King, Deborah L; Smith, Sarah L; Brown, Michele R; McCrory, Jean L; Munkasy, Barry A; Scheirman, Gary I

    2008-05-01

    In this study, we compared the kinematic variables of the split triple twist with those of the split double twist to help coaches and scientists understand these landmark pair skating skills. High-speed video was taken during the pair short and free programmes at the 2002 Salt Lake City Winter Olympics and the 2003 International Skating Union Grand Prix Finals. Three-dimensional analyses of 14 split double twists and 15 split triple twists from eleven pairs were completed. In spite of considerable variability in the performance variables among the pairs, the main difference between the split double twists and split triple twists was an increase in rotational rate. While eight of the eleven pairs relied primarily on an increased rotational rate to complete the split triple twist, three pairs employed a combined strategy of increased rotational rate and increased flight time due predominantly to delayed or lower catches. These results were similar to observations of jumps in singles skating for which the extra rotation is typically due to an increase in rotational velocity; increases in flight time come primarily from delayed landings as opposed to additional height during flight. Combining an increase in flight time and rotational rate may be a good strategy for completing the split triple twist in pair skating.

  4. Similarity Measure of Graphs

    Directory of Open Access Journals (Sweden)

    Amine Labriji

    2017-07-01

    Full Text Available The topic of identifying the similarity of graphs was considered as highly recommended research field in the Web semantic, artificial intelligence, the shape recognition and information research. One of the fundamental problems of graph databases is finding similar graphs to a graph query. Existing approaches dealing with this problem are usually based on the nodes and arcs of the two graphs, regardless of parental semantic links. For instance, a common connection is not identified as being part of the similarity of two graphs in cases like two graphs without common concepts, the measure of similarity based on the union of two graphs, or the one based on the notion of maximum common sub-graph (SCM, or the distance of edition of graphs. This leads to an inadequate situation in the context of information research. To overcome this problem, we suggest a new measure of similarity between graphs, based on the similarity measure of Wu and Palmer. We have shown that this new measure satisfies the properties of a measure of similarities and we applied this new measure on examples. The results show that our measure provides a run time with a gain of time compared to existing approaches. In addition, we compared the relevance of the similarity values obtained, it appears that this new graphs measure is advantageous and  offers a contribution to solving the problem mentioned above.

  5. Critical Behavior of the Annealed Ising Model on Random Regular Graphs

    Science.gov (United States)

    Can, Van Hao

    2017-11-01

    In Giardinà et al. (ALEA Lat Am J Probab Math Stat 13(1):121-161, 2016), the authors have defined an annealed Ising model on random graphs and proved limit theorems for the magnetization of this model on some random graphs including random 2-regular graphs. Then in Can (Annealed limit theorems for the Ising model on random regular graphs, arXiv:1701.08639, 2017), we generalized their results to the class of all random regular graphs. In this paper, we study the critical behavior of this model. In particular, we determine the critical exponents and prove a non standard limit theorem stating that the magnetization scaled by n^{3/4} converges to a specific random variable, with n the number of vertices of random regular graphs.

  6. Test-retest reliability of fMRI-based graph theoretical properties during working memory, emotion processing, and resting state.

    Science.gov (United States)

    Cao, Hengyi; Plichta, Michael M; Schäfer, Axel; Haddad, Leila; Grimm, Oliver; Schneider, Michael; Esslinger, Christine; Kirsch, Peter; Meyer-Lindenberg, Andreas; Tost, Heike

    2014-01-01

    The investigation of the brain connectome with functional magnetic resonance imaging (fMRI) and graph theory analyses has recently gained much popularity, but little is known about the robustness of these properties, in particular those derived from active fMRI tasks. Here, we studied the test-retest reliability of brain graphs calculated from 26 healthy participants with three established fMRI experiments (n-back working memory, emotional face-matching, resting state) and two parcellation schemes for node definition (AAL atlas, functional atlas proposed by Power et al.). We compared the intra-class correlation coefficients (ICCs) of five different data processing strategies and demonstrated a superior reliability of task-regression methods with condition-specific regressors. The between-task comparison revealed significantly higher ICCs for resting state relative to the active tasks, and a superiority of the n-back task relative to the face-matching task for global and local network properties. While the mean ICCs were typically lower for the active tasks, overall fair to good reliabilities were detected for global and local connectivity properties, and for the n-back task with both atlases, smallworldness. For all three tasks and atlases, low mean ICCs were seen for the local network properties. However, node-specific good reliabilities were detected for node degree in regions known to be critical for the challenged functions (resting-state: default-mode network nodes, n-back: fronto-parietal nodes, face-matching: limbic nodes). Between-atlas comparison demonstrated significantly higher reliabilities for the functional parcellations for global and local network properties. Our findings can inform the choice of processing strategies, brain atlases and outcome properties for fMRI studies using active tasks, graph theory methods, and within-subject designs, in particular future pharmaco-fMRI studies. © 2013 Elsevier Inc. All rights reserved.

  7. Spectra of Graphs

    NARCIS (Netherlands)

    Brouwer, A.E.; Haemers, W.H.

    2012-01-01

    This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association

  8. Multigraph: Interactive Data Graphs on the Web

    Science.gov (United States)

    Phillips, M. B.

    2010-12-01

    Many aspects of geophysical science involve time dependent data that is often presented in the form of a graph. Considering that the web has become a primary means of communication, there are surprisingly few good tools and techniques available for presenting time-series data on the web. The most common solution is to use a desktop tool such as Excel or Matlab to create a graph which is saved as an image and then included in a web page like any other image. This technique is straightforward, but it limits the user to one particular view of the data, and disconnects the graph from the data in a way that makes updating a graph with new data an often cumbersome manual process. This situation is somewhat analogous to the state of mapping before the advent of GIS. Maps existed only in printed form, and creating a map was a laborious process. In the last several years, however, the world of mapping has experienced a revolution in the form of web-based and other interactive computer technologies, so that it is now commonplace for anyone to easily browse through gigabytes of geographic data. Multigraph seeks to bring a similar ease of access to time series data. Multigraph is a program for displaying interactive time-series data graphs in web pages that includes a simple way of configuring the appearance of the graph and the data to be included. It allows multiple data sources to be combined into a single graph, and allows the user to explore the data interactively. Multigraph lets users explore and visualize "data space" in the same way that interactive mapping applications such as Google Maps facilitate exploring and visualizing geography. Viewing a Multigraph graph is extremely simple and intuitive, and requires no instructions. Creating a new graph for inclusion in a web page involves writing a simple XML configuration file and requires no programming. Multigraph can read data in a variety of formats, and can display data from a web service, allowing users to "surf

  9. Phosphorylation of basic helix-loop-helix transcription factor Twist in development and disease.

    Science.gov (United States)

    Xue, Gongda; Hemmings, Brian A

    2012-02-01

    The transcription factor Twist plays vital roles during embryonic development through regulating/controlling cell migration. However, postnatally, in normal physiological settings, Twist is either not expressed or inactivated. Increasing evidence shows a strong correlation between Twist reactivation and both cancer progression and malignancy, where the transcriptional activities of Twist support cancer cells to disseminate from primary tumours and subsequently establish a secondary tumour growth in distant organs. However, it is largely unclear how this signalling programme is reactivated or what signalling pathways regulate its activity. The present review discusses recent advances in Twist regulation and activity, with a focus on phosphorylation-dependent Twist activity, potential upstream kinases and the contribution of these factors in transducing biological signals from upstream signalling complexes. The recent advances in these areas have shed new light on how phosphorylation-dependent regulation of the Twist proteins promotes or suppresses Twist activity, leading to differential regulation of Twist transcriptional targets and thereby influencing cell fate.

  10. Evolution equation for the higher-twist B-meson distribution amplitude

    International Nuclear Information System (INIS)

    Braun, V.M.; Offen, N.; Manashov, A.N.; Regensburg Univ.; Sankt-Petersburg State Univ.

    2015-07-01

    We find that the evolution equation for the three-particle quark-gluon B-meson light-cone distribution amplitude (DA) of subleading twist is completely integrable in the large N c limit and can be solved exactly. The lowest anomalous dimension is separated from the remaining, continuous, spectrum by a finite gap. The corresponding eigenfunction coincides with the contribution of quark-gluon states to the two-particle DA φ - (ω) so that the evolution equation for the latter is the same as for the leading-twist DA φ + (ω) up to a constant shift in the anomalous dimension. Thus, ''genuine'' three-particle states that belong to the continuous spectrum effectively decouple from φ - (ω) to the leading-order accuracy. In turn, the scale dependence of the full three-particle DA turns out to be nontrivial so that the contribution with the lowest anomalous dimension does not become leading at any scale. The results are illustrated on a simple model that can be used in studies of 1/m b corrections to heavy-meson decays in the framework of QCD factorization or light-cone sum rules.

  11. Pattern graph rewrite systems

    Directory of Open Access Journals (Sweden)

    Aleks Kissinger

    2014-03-01

    Full Text Available String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the power of such rewrite systems can be greatly extended by introducing pattern graphs, which provide a means of expressing infinite families of rewrite rules where certain marked subgraphs, called !-boxes ("bang boxes", on both sides of a rule can be copied any number of times or removed. After reviewing the string graph formalism, we show how string graphs can be extended to pattern graphs and how pattern graphs and pattern rewrite rules can be instantiated to concrete string graphs and rewrite rules. We then provide examples demonstrating the expressive power of pattern graphs and how they can be applied to study interacting algebraic structures that are central to categorical quantum mechanics.

  12. Further Generalisations of Twisted Gabidulin Codes

    DEFF Research Database (Denmark)

    Puchinger, Sven; Rosenkilde, Johan Sebastian Heesemann; Sheekey, John

    2017-01-01

    We present a new family of maximum rank distance (MRD) codes. The new class contains codes that are neither equivalent to a generalised Gabidulin nor to a twisted Gabidulin code, the only two known general constructions of linear MRD codes.......We present a new family of maximum rank distance (MRD) codes. The new class contains codes that are neither equivalent to a generalised Gabidulin nor to a twisted Gabidulin code, the only two known general constructions of linear MRD codes....

  13. Geometry of the toroidal N-helix: optimal-packing and zero-twist

    DEFF Research Database (Denmark)

    Olsen, Kasper; Bohr, Jakob

    2012-01-01

    Two important geometrical properties of N-helix structures are influenced by bending. One is maximizing the volume fraction, which is called optimal-packing, and the other is having a vanishing strain-twist coupling, which is called zero-twist. Zero-twist helices rotate neither in one nor...... helix. General N-helices are discussed, as well as zero-twist helices for N > 1. The derived geometrical restrictions are gradually modified by changing the aspect ratio of the torus....

  14. A method to estimate the necessary twist pitch in multi-filamentary superconductors

    International Nuclear Information System (INIS)

    Lindau, S; Magnusson, N; Taxt, H

    2014-01-01

    Twisting of multi-filamentary superconductors is an important step in the development of wires with AC losses at an acceptable level for AC applications. The necessary twist pitch depends on wire architecture, critical current density, matrix material, and external factors such as temperature, frequency and applied magnetic field. The development of an AC optimized MgB 2 superconductor would be facilitated by a fast method to set the requirements for the twist pitch. A problem often encountered when comparing wires with different twist pitches is the degradation in critical current occurring at small twist pitches due to mechanical deformation. In this work we propose to use a non-twisted conductor to estimate the influence of twisting on the AC losses. A long superconductor is cut into smaller lengths, each simulating one third of the twist pitch, and the AC losses due to applied magnetic fields are compared between samples of different lengths. With this method, the effect of reducing the size of the loop of the coupling currents is studied without changing the superconducting parameters. AC loss measurement results are presented for a round titanium matrix MgB 2 wire with simulated twist pitches between 9 mm and 87 mm.

  15. On middle cube graphs

    Directory of Open Access Journals (Sweden)

    C. Dalfo

    2015-10-01

    Full Text Available We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors.

  16. Effect of Turbulence on Power for Bend-Twist Coupled Blades

    DEFF Research Database (Denmark)

    Stäblein, Alexander; Hansen, Morten Hartvig

    2016-01-01

    that it might be related to the dynamic response of bend-twist coupled blades in turbulent flow. This paper contains estimations of the power curve from nonlinear time simulations, a linear frequency domain based method and a normal distribution weighted average method. It is shown that the frequency domain...... that changes in power due to turbulence are similar for coupled and uncoupled blades. Power gains at low wind speeds are related to the curvature of the steady state power curve. Losses around rated wind speed are caused by the effects of controller switching between partial and full power operation.......Bend-twist coupling of wind turbine blades reduces the structural loads of the turbine but it also results in a decrease of the annual energy production. The main part of the power loss can be mitigated by pretwisting the blade, but some power loss remains and previous studies indicate...

  17. New twist on artificial muscles.

    Science.gov (United States)

    Haines, Carter S; Li, Na; Spinks, Geoffrey M; Aliev, Ali E; Di, Jiangtao; Baughman, Ray H

    2016-10-18

    Lightweight artificial muscle fibers that can match the large tensile stroke of natural muscles have been elusive. In particular, low stroke, limited cycle life, and inefficient energy conversion have combined with high cost and hysteretic performance to restrict practical use. In recent years, a new class of artificial muscles, based on highly twisted fibers, has emerged that can deliver more than 2,000 J/kg of specific work during muscle contraction, compared with just 40 J/kg for natural muscle. Thermally actuated muscles made from ordinary polymer fibers can deliver long-life, hysteresis-free tensile strokes of more than 30% and torsional actuation capable of spinning a paddle at speeds of more than 100,000 rpm. In this perspective, we explore the mechanisms and potential applications of present twisted fiber muscles and the future opportunities and challenges for developing twisted muscles having improved cycle rates, efficiencies, and functionality. We also demonstrate artificial muscle sewing threads and textiles and coiled structures that exhibit nearly unlimited actuation strokes. In addition to robotics and prosthetics, future applications include smart textiles that change breathability in response to temperature and moisture and window shutters that automatically open and close to conserve energy.

  18. Graph visualization (Invited talk)

    NARCIS (Netherlands)

    Wijk, van J.J.; Kreveld, van M.J.; Speckmann, B.

    2012-01-01

    Black and white node link diagrams are the classic method to depict graphs, but these often fall short to give insight in large graphs or when attributes of nodes and edges play an important role. Graph visualization aims obtaining insight in such graphs using interactive graphical representations.

  19. Adventures in graph theory

    CERN Document Server

    Joyner, W David

    2017-01-01

    This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants for graphs prepares the reader for the subsequent dive into the applications of graph theory. To pique the reader’s interest in areas of possible exploration, recent results in mathematics appear throughout the book, accompanied with examples of related graphs, how they arise, and what their valuable uses are. The consequences of graph theory covered by the authors are complicated and far-reaching, so topics are always exhibited in a user-friendly manner with copious graphs, exercises, and Sage code for the computation of equations. Samples of the book’s source code can be found at github.com/springer-math/adventures-in-graph-theory. The text is geared towards ad...

  20. Efficient Graph Computation for Node2Vec

    OpenAIRE

    Zhou, Dongyan; Niu, Songjie; Chen, Shimin

    2018-01-01

    Node2Vec is a state-of-the-art general-purpose feature learning method for network analysis. However, current solutions cannot run Node2Vec on large-scale graphs with billions of vertices and edges, which are common in real-world applications. The existing distributed Node2Vec on Spark incurs significant space and time overhead. It runs out of memory even for mid-sized graphs with millions of vertices. Moreover, it considers at most 30 edges for every vertex in generating random walks, causin...

  1. Distance-regular graphs

    NARCIS (Netherlands)

    van Dam, Edwin R.; Koolen, Jack H.; Tanaka, Hajime

    2016-01-01

    This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN'[Brouwer, A.E., Cohen, A.M., Neumaier,

  2. On the strong metric dimension of generalized butterfly graph, starbarbell graph, and {C}_{m}\\odot {P}_{n} graph

    Science.gov (United States)

    Yunia Mayasari, Ratih; Atmojo Kusmayadi, Tri

    2018-04-01

    Let G be a connected graph with vertex set V(G) and edge set E(G). For every pair of vertices u,v\\in V(G), the interval I[u, v] between u and v to be the collection of all vertices that belong to some shortest u ‑ v path. A vertex s\\in V(G) strongly resolves two vertices u and v if u belongs to a shortest v ‑ s path or v belongs to a shortest u ‑ s path. A vertex set S of G is a strong resolving set of G if every two distinct vertices of G are strongly resolved by some vertex of S. The strong metric basis of G is a strong resolving set with minimal cardinality. The strong metric dimension sdim(G) of a graph G is defined as the cardinality of strong metric basis. In this paper we determine the strong metric dimension of a generalized butterfly graph, starbarbell graph, and {C}mȯ {P}n graph. We obtain the strong metric dimension of generalized butterfly graph is sdim(BFn ) = 2n ‑ 2. The strong metric dimension of starbarbell graph is sdim(S{B}{m1,{m}2,\\ldots,{m}n})={\\sum }i=1n({m}i-1)-1. The strong metric dimension of {C}mȯ {P}n graph are sdim({C}mȯ {P}n)=2m-1 for m > 3 and n = 2, and sdim({C}mȯ {P}n)=2m-2 for m > 3 and n > 2.

  3. Subgraph detection using graph signals

    KAUST Repository

    Chepuri, Sundeep Prabhakar

    2017-03-06

    In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.

  4. Subgraph detection using graph signals

    KAUST Repository

    Chepuri, Sundeep Prabhakar; Leus, Geert

    2017-01-01

    In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.

  5. Bend-twist coupling potential of wind turbine blades

    DEFF Research Database (Denmark)

    Fedorov, Vladimir; Berggreen, Christian

    2014-01-01

    -twist coupling magnitude of up to 0.2 is feasible to achieve in the baseline blade structure made of glass-fiber reinforced plastics. Further, by substituting the glass-fibers with carbon-fibers the coupling effect can be increased to 0.4. Additionally, the effect of introduction of bend-twist coupling...

  6. Graph spectrum

    NARCIS (Netherlands)

    Brouwer, A.E.; Haemers, W.H.; Brouwer, A.E.; Haemers, W.H.

    2012-01-01

    This chapter presents some simple results on graph spectra.We assume the reader is familiar with elementary linear algebra and graph theory. Throughout, J will denote the all-1 matrix, and 1 is the all-1 vector.

  7. Raman Excitation Profile of the G-band Enhancement in Twisted Bilayer Graphene

    Science.gov (United States)

    Eliel, G. S. N.; Ribeiro, H. B.; Sato, K.; Saito, R.; Lu, Chun-Chieh; Chiu, Po-Wen; Fantini, C.; Righi, A.; Pimenta, M. A.

    2017-12-01

    A resonant Raman study of twisted bilayer graphene (TBG) samples with different twisting angles using many different laser lines in the visible range is presented. The samples were fabricated by CVD technique and transferred to Si/SiO2 substrates. The Raman excitation profiles of the huge enhancement of the G-band intensity for a group of different TBG flakes were obtained experimentally, and the analysis of the profiles using a theoretical expression for the Raman intensities allowed us to obtain the energies of the van Hove singularities generated by the Moiré patterns and the lifetimes of the excited state of the Raman process. Our results exhibit a good agreement between experimental and calculated energies for van Hove singularities and show that the lifetime of photoexcited carrier does not depend significantly on the twisting angle in the range intermediate angles ( 𝜃 between 10∘ and 15∘). We observed that the width of the resonance window (Γ ≈ 250 meV) is much larger than the REP of the Raman modes of carbon nanotubes, which are also enhanced by resonances with van Hove singularities.

  8. Pragmatic Graph Rewriting Modifications

    OpenAIRE

    Rodgers, Peter; Vidal, Natalia

    1999-01-01

    We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified a...

  9. Simplicial complexes of graphs

    CERN Document Server

    Jonsson, Jakob

    2008-01-01

    A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.

  10. The STAPL Parallel Graph Library

    KAUST Repository

    Harshvardhan,

    2013-01-01

    This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable distributed graph container and a collection of commonly used parallel graph algorithms. The library introduces pGraph pViews that separate algorithm design from the container implementation. It supports three graph processing algorithmic paradigms, level-synchronous, asynchronous and coarse-grained, and provides common graph algorithms based on them. Experimental results demonstrate improved scalability in performance and data size over existing graph libraries on more than 16,000 cores and on internet-scale graphs containing over 16 billion vertices and 250 billion edges. © Springer-Verlag Berlin Heidelberg 2013.

  11. Supersymmetric gauged double field theory: systematic derivation by virtue of twist

    International Nuclear Information System (INIS)

    Cho, Wonyoung; Fernández-Melgarejo, J.J.; Jeon, Imtak; Park, Jeong-Hyuck

    2015-01-01

    In a completely systematic and geometric way, we derive maximal and half-maximal supersymmetric gauged double field theories in lower than ten dimensions. To this end, we apply a simple twisting ansatz to the D=10 ungauged maximal and half-maximal supersymmetric double field theories constructed previously within the so-called semi-covariant formalism. The twisting ansatz may not satisfy the section condition. Nonetheless, all the features of the semi-covariant formalism, including its complete covariantizability, are still valid after the twist under alternative consistency conditions. The twist allows gaugings as supersymmetry preserving deformations of the D=10 untwisted theories after Scherk-Schwarz-type dimensional reductions. The maximal supersymmetric twist requires an extra condition to ensure both the Ramond-Ramond gauge symmetry and the 32 supersymmetries unbroken.

  12. Nonlinear physics of twisted magnetic field lines

    International Nuclear Information System (INIS)

    Yoshida, Zensho

    1998-01-01

    Twisted magnetic field lines appear commonly in many different plasma systems, such as magnetic ropes created through interactions between the magnetosphere and the solar wind, magnetic clouds in the solar wind, solar corona, galactic jets, accretion discs, as well as fusion plasma devices. In this paper, we study the topological characterization of twisted magnetic fields, nonlinear effect induced by the Lorentz back reaction, length-scale bounds, and statistical distributions. (author)

  13. Topic Model for Graph Mining.

    Science.gov (United States)

    Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng

    2015-12-01

    Graph mining has been a popular research area because of its numerous application scenarios. Many unstructured and structured data can be represented as graphs, such as, documents, chemical molecular structures, and images. However, an issue in relation to current research on graphs is that they cannot adequately discover the topics hidden in graph-structured data which can be beneficial for both the unsupervised learning and supervised learning of the graphs. Although topic models have proved to be very successful in discovering latent topics, the standard topic models cannot be directly applied to graph-structured data due to the "bag-of-word" assumption. In this paper, an innovative graph topic model (GTM) is proposed to address this issue, which uses Bernoulli distributions to model the edges between nodes in a graph. It can, therefore, make the edges in a graph contribute to latent topic discovery and further improve the accuracy of the supervised and unsupervised learning of graphs. The experimental results on two different types of graph datasets show that the proposed GTM outperforms the latent Dirichlet allocation on classification by using the unveiled topics of these two models to represent graphs.

  14. A graph edit dictionary for correcting errors in roof topology graphs reconstructed from point clouds

    Science.gov (United States)

    Xiong, B.; Oude Elberink, S.; Vosselman, G.

    2014-07-01

    In the task of 3D building model reconstruction from point clouds we face the problem of recovering a roof topology graph in the presence of noise, small roof faces and low point densities. Errors in roof topology graphs will seriously affect the final modelling results. The aim of this research is to automatically correct these errors. We define the graph correction as a graph-to-graph problem, similar to the spelling correction problem (also called the string-to-string problem). The graph correction is more complex than string correction, as the graphs are 2D while strings are only 1D. We design a strategy based on a dictionary of graph edit operations to automatically identify and correct the errors in the input graph. For each type of error the graph edit dictionary stores a representative erroneous subgraph as well as the corrected version. As an erroneous roof topology graph may contain several errors, a heuristic search is applied to find the optimum sequence of graph edits to correct the errors one by one. The graph edit dictionary can be expanded to include entries needed to cope with errors that were previously not encountered. Experiments show that the dictionary with only fifteen entries already properly corrects one quarter of erroneous graphs in about 4500 buildings, and even half of the erroneous graphs in one test area, achieving as high as a 95% acceptance rate of the reconstructed models.

  15. Higher-twist correlations in polarized hadrons

    International Nuclear Information System (INIS)

    Tangerman, R.D.

    1996-01-01

    In this thesis we studied the response of polarized hadrons to several high-energy probes, working in the framework of the field theoretic model. Emphasis is laid upon higher-twist effects such as quark transverse momentum. The inclusive DIS process is very well suited to study QCD. From general principles we were able to derive four positivity constraints on the structure functions without invoking the helicity formalism. The on-shell quark model is used to illustrate these constraints. Subseqeuently, we concentrated on the higher-twist structure function g 2 (x,Q 2 ). (orig./HSI)

  16. Contracts for Cross-organizational Workflows as Timed Dynamic Condition Response Graphs

    DEFF Research Database (Denmark)

    Hildebrandt, Thomas; Mukkamala, Raghava Rao; Slaats, Tijs

    2013-01-01

    We conservatively extend the declarative Dynamic Condition Response (DCR) Graph process model, introduced in the PhD thesis of the second author, to allow for discrete time deadlines. We prove that safety and liveness properties can be verified by mapping finite timed DCR Graphs to finite state...

  17. Connected Colourings of Complete Graphs and Hypergraphs

    OpenAIRE

    Leader, Imre; Tan, Ta Sheng

    2014-01-01

    Gallai's colouring theorem states that if the edges of a complete graph are 3-coloured, with each colour class forming a connected (spanning) subgraph, then there is a triangle that has all 3 colours. What happens for more colours: if we $k$-colour the edges of the complete graph, with each colour class connected, how many of the $\\binom{k}{3}$ triples of colours must appear as triangles? In this note we show that the `obvious' conjecture, namely that there are always at least $\\binom{k-1}{2}...

  18. Metastable states in magnetic nanorings

    DEFF Research Database (Denmark)

    Castaño, F. J.; Ross, C. A.; Frandsen, Cathrine

    2003-01-01

    Magnetization states and hysteresis behavior of small ferromagnetic rings, of diameters 180-520 nm, have been investigated using magnetic force microscopy. In addition to the expected bi-domain ("onion") and flux-closed ("vortex") magnetization states, a metastable state has been found. This "twi......Magnetization states and hysteresis behavior of small ferromagnetic rings, of diameters 180-520 nm, have been investigated using magnetic force microscopy. In addition to the expected bi-domain ("onion") and flux-closed ("vortex") magnetization states, a metastable state has been found....... This "twisted" state contains a 360degrees domain wall which can exist over a wide range of applied fields. Four possible configurations of the twisted state are possible. Micromagnetic modeling shows that the twisted state is stabilised in small diameter, narrow rings. Additionally, more complex configurations...

  19. Transcription factors zeb1, twist and snai1 in breast carcinoma

    International Nuclear Information System (INIS)

    Soini, Ylermi; Tuhkanen, Hanna; Sironen, Reijo; Virtanen, Ismo; Kataja, Vesa; Auvinen, Päivi; Mannermaa, Arto; Kosma, Veli-Matti

    2011-01-01

    Epitheliomesenchymal transition (EMT) is the process where cancer cells attain fibroblastic features and are thus able to invade neighboring tissues. Transcriptional factors zeb1, snai1 and twist regulate EMT. We used immunohistochemistry to investigate the expression of zeb1, twist and snai1 in tumor and stromal compartments by in a large set of breast carcinomas. The results were compared with estrogen and progesterone receptor status, HER2 amplification, grade, histology, TNM status and survival of the patients. Nuclear expression for twist was seen in the epithelial tumor cell compartment in 3.6% and for snai1 in 3.1% of the cases while zeb1 was not detected at all in these areas. In contrast, the tumor stromal compartment showed nuclear zeb1 and twist expression in 75% and 52.4% of the cases, respectively. Although rare, nuclear expression of twist in the epithelial tumor cell compartment was associated with a poor outcome of the patients (p = 0.054 log rank, p = 0.013, Breslow, p = 0.025 Tarone-Ware). Expression of snai1, or expression of zeb1 or twist in the stromal compartment did not have any prognostic significance. Furthermore, none of these factors associated with the size of the tumors, nor with the presence of axillary or distant metastases. Expression of zeb1 and twist in the stromal compartment was positively associated with a positive estrogen or progesterone receptor status of the tumors. Stromal zeb1 expression was significantly lower in ductal in situ carcinomas than in invasive carcinomas (p = 0.020). Medullary carcinomas (p = 0.017) and mucinous carcinomas (p = 0.009) had a lower stromal expression of zeb1 than ductal carcinomas. Stromal twist expression was also lower in mucinous (p = 0.017) than in ductal carcinomas. Expression of transcriptional factors zeb1 and twist mainly occur in the stromal compartment of breast carcinomas, possibly representing two populations of cells; EMT transformed neoplastic cells and stromal fibroblastic cells

  20. Introduction to quantum graphs

    CERN Document Server

    Berkolaiko, Gregory

    2012-01-01

    A "quantum graph" is a graph considered as a one-dimensional complex and equipped with a differential operator ("Hamiltonian"). Quantum graphs arise naturally as simplified models in mathematics, physics, chemistry, and engineering when one considers propagation of waves of various nature through a quasi-one-dimensional (e.g., "meso-" or "nano-scale") system that looks like a thin neighborhood of a graph. Works that currently would be classified as discussing quantum graphs have been appearing since at least the 1930s, and since then, quantum graphs techniques have been applied successfully in various areas of mathematical physics, mathematics in general and its applications. One can mention, for instance, dynamical systems theory, control theory, quantum chaos, Anderson localization, microelectronics, photonic crystals, physical chemistry, nano-sciences, superconductivity theory, etc. Quantum graphs present many non-trivial mathematical challenges, which makes them dear to a mathematician's heart. Work on qu...

  1. Conformal invariance and pion wave functions of nonleading twist

    International Nuclear Information System (INIS)

    Braun, V.M.; Filyanov, I.E.

    1989-01-01

    The restrictions are studied for the general structure of pion wave functions of twist 3 and twist 4 imposed by the conformal symmetry and the equations of motion. A systematic expansion of wave functions in the conformal spin is built and the first order corrections to asymptotic formulae are calculated by the QCD sum rule method. In particular, we have found a multiplicatively renormalizable contribution into the two-particle wave function of twist 4 which cannot be expanded in a finite set of Gegenbauer polynomials. 19 refs.; 5 figs

  2. Graph Generator Survey

    Energy Technology Data Exchange (ETDEWEB)

    Lothian, Joshua [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sullivan, Blair D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Baker, Matthew B. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Schrock, Jonathan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Poole, Stephen W. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2013-10-01

    The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of different application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.

  3. Functions and graphs

    CERN Document Server

    Gelfand, I M; Shnol, E E

    1969-01-01

    The second in a series of systematic studies by a celebrated mathematician I. M. Gelfand and colleagues, this volume presents students with a well-illustrated sequence of problems and exercises designed to illuminate the properties of functions and graphs. Since readers do not have the benefit of a blackboard on which a teacher constructs a graph, the authors abandoned the customary use of diagrams in which only the final form of the graph appears; instead, the book's margins feature step-by-step diagrams for the complete construction of each graph. The first part of the book employs simple fu

  4. Loose Graph Simulations

    DEFF Research Database (Denmark)

    Mansutti, Alessio; Miculan, Marino; Peressotti, Marco

    2017-01-01

    We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all these notions, LGS allows us to express directly...... also problems which are “mixed” instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide formal translation of SGI, RLPM, and GS into LGSs, and we give...

  5. Enhancement of turbulent flow heat transfer in a tube with modified twisted tapes

    Energy Technology Data Exchange (ETDEWEB)

    Lei, Y.G.; Zhao, C.H.; Song, C.F. [College of Environmental Science and Engineering, Taiyuan University of Technology, Taiyuan (China)

    2012-12-15

    Numerical simulations were performed to study the fluid flow and heat transfer in a tube with staggered twisted tapes with central holes. In the range of Reynolds numbers between 6000 and 28 000, the modified twisted tapes increased the Nusselt number by 76.2 {proportional_to} 149.7 % and the friction factor by 380.2 {proportional_to} 443.8 % compared to the smooth tube. Compared to the typical twisted tapes, the modified twisted tapes produced an acceleration flow through the triangle regions leading to the enhancement of heat transfer, and the holes in the modified tapes reduced the severe pressure loss. It was found that the modified twisted tapes decreased the friction factor by 8.0 {proportional_to} 16.1 % and enhanced the heat transfer by 34.1 {proportional_to} 46.8 % in comparison with the typical tapes. These results indicated that the performance ratio values of the tube with modified twisted tapes were higher than 1.0 in the range of Reynolds numbers studied. The computed performance ratios of the tube with modified twisted tapes were much higher than those of the tube with typical twisted tapes. This means that the integrated performance of the tube with staggered twisted tapes with central holes is superior to that of the tube with typical twisted tapes. (Copyright copyright 2012 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

  6. Windings of twisted strings

    Science.gov (United States)

    Casali, Eduardo; Tourkine, Piotr

    2018-03-01

    Twistor string models have been known for more than a decade now but have come back under the spotlight recently with the advent of the scattering equation formalism which has greatly generalized the scope of these models. A striking ubiquitous feature of these models has always been that, contrary to usual string theory, they do not admit vibrational modes and thus describe only conventional field theory. In this paper we report on the surprising discovery of a whole new sector of one of these theories which we call "twisted strings," when spacetime has compact directions. We find that the spectrum is enhanced from a finite number of states to an infinite number of interacting higher spin massive states. We describe both bosonic and world sheet supersymmetric models, their spectra and scattering amplitudes. These models have distinctive features of both string and field theory, for example they are invariant under stringy T-duality but have the high energy behavior typical of field theory. Therefore they describe a new kind of field theories in target space, sitting on their own halfway between string and field theory.

  7. Gauging the twisted Poincare symmetry as a noncommutative theory of gravitation

    International Nuclear Information System (INIS)

    Chaichian, M.; Tureanu, A.; Oksanen, M.; Zet, G.

    2009-01-01

    Einstein's theory of general relativity was formulated as a gauge theory of Lorentz symmetry by Utiyama in 1956, while the Einstein-Cartan gravitational theory was formulated by Kibble in 1961 as the gauge theory of Poincare transformations. In this framework, we propose a formulation of the gravitational theory on canonical noncommutative space-time by covariantly gauging the twisted Poincare symmetry, in order to fulfil the requirement of covariance under the general coordinate transformations, an essential ingredient of the theory of general relativity. It appears that the twisted Poincare symmetry cannot be gauged by generalizing the Abelian twist to a covariant non-Abelian twist, nor by introducing a more general covariant twist element. The advantages of such a formulation as well as the related problems are discussed and possible ways out are outlined.

  8. Iterative methods for overlap and twisted mass fermions

    International Nuclear Information System (INIS)

    Chiarappa, T.; Jansen, K.; Shindler, A.; Wetzorke, I.; Scorzato, L.; Urbach, C.; Wenger, U.

    2006-09-01

    We present a comparison of a number of iterative solvers of linear systems of equations for obtaining the fermion propagator in lattice QCD. In particular, we consider chirally invariant overlap and chirally improved Wilson (maximally) twisted mass fermions. The comparison of both formulations of lattice QCD is performed at four fixed values of the pion mass between 230 MeV and 720 MeV. For overlap fermions we address adaptive precision and low mode preconditioning while for twisted mass fermions we discuss even/odd preconditioning. Taking the best available algorithms in each case we find that calculations with the overlap operator are by a factor of 30-120 more expensive than with the twisted mass operator. (orig.)

  9. Iterative methods for overlap and twisted mass fermions

    Energy Technology Data Exchange (ETDEWEB)

    Chiarappa, T. [Univ. di Milano Bicocca (Italy); Jansen, K.; Shindler, A.; Wetzorke, I. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Nagai, K.I. [Wuppertal Univ. (Gesamthochschule) (Germany). Fachbereich Physik; Papinutto, M. [INFN Sezione di Roma Tre, Rome (Italy); Scorzato, L. [European Centre for Theoretical Studies in Nuclear Physics and Related Areas (ECT), Villazzano (Italy); Urbach, C. [Liverpool Univ. (United Kingdom). Dept. of Mathematical Sciences; Wenger, U. [ETH Zuerich (Switzerland). Inst. fuer Theoretische Physik

    2006-09-15

    We present a comparison of a number of iterative solvers of linear systems of equations for obtaining the fermion propagator in lattice QCD. In particular, we consider chirally invariant overlap and chirally improved Wilson (maximally) twisted mass fermions. The comparison of both formulations of lattice QCD is performed at four fixed values of the pion mass between 230 MeV and 720 MeV. For overlap fermions we address adaptive precision and low mode preconditioning while for twisted mass fermions we discuss even/odd preconditioning. Taking the best available algorithms in each case we find that calculations with the overlap operator are by a factor of 30-120 more expensive than with the twisted mass operator. (orig.)

  10. Template preparation of twisted nanoparticles of mesoporous silica

    Institute of Scientific and Technical Information of China (English)

    Kui Niu; Zhongbin Ni; Chengwu Fu; Tatsuo Kaneko; Mingqing Chen

    2011-01-01

    Optical isomers of N-lauroyl-L-(or-D-) alanine sodium salt {C12-L-(or-D-)AlaS} surfactants were used for the preparation of mesoporous silica nanoparticles with a twisted hexagonal rod-like morphology. Thermogravimetric analysis (TGA) was used to determine the temperature for template removal. Circular dichroism (CD) spectra of the surfactant solution with various compositions illustrated the formation and supramolecular assembly of protein-like molecular architecture leading to formation of twisted nanoparticles. Scanning electron microscopy (SEM),high-resolution transmission electron microscopy (HRTEM)and X-ray powder diffraction (XRD) patterns of these as-synthesized mesoporous silica confirmed that the twisted morphology of these nanoparticles was closely related to the supramolecular-assembled complex of amino acid surfactants.

  11. Spontaneous Self-Assembly of Fully Protected Ester 1:1 [α/α-Nα-Bn-hydrazino] Pseudodipeptides into a Twisted Parallel β-Sheet in the Crystal State.

    Science.gov (United States)

    Romero, Eugénie; Moussodia, Ralph-Olivier; Kriznik, Alexandre; Wenger, Emmanuel; Acherar, Samir; Jamart-Grégoire, Brigitte

    2016-10-07

    Previous studies have demonstrated that amidic α/β-pseudodipeptides, 1:1 [α/α-N α -Bn-hydrazino], have the ability to fold via a succession of γ-turn (C 7 pseudocycle) and hydrazinoturn in CDCl 3 solution, their amide terminals enabling the formation of an intramolecular H-bond network. Despite their lack of a primary amide terminals allowing the formation of the hydrazinoturn, their ester counterparts 1-4 were proven to self-assemble into C 6 and C 7 pseudocycles by intramolecular H-bonds in solution state and into an uncommon twisted parallel β-sheet through intermolecular H-bonding in the crystal state to form a supramolecular helix, with eight molecules needed to complete a full 360° rotation. Such self-organization (with eight molecules) has only been observed in a specific α/α-pseudodipeptide, depsipeptide (Boc-Leu-Lac-OEt). Relying on IR absorption, NMR, X-ray diffraction, and CD analyses, the aim of this study was to demonstrate that stereoisomers of ester 1:1 [α/α-N α -Bn-hydrazino] pseudodipeptides 1-4 are able to self-assemble into this β-helical structure. The absolute configuration of the asymmetric C α -atom of the α-amino acid residue influences the left- or right-handed twist without changing the pitch of the formed helix.

  12. Correlation Between Expression of Twist and Podoplanin in Ductal Breast Carcinoma.

    Science.gov (United States)

    Grzegrzolka, Jedrzej; Wojtyra, Patrycja; Biala, Martyna; Piotrowska, Aleksandra; Gomulkiewicz, Agnieszka; Rys, Janusz; Podhorska-Okolow, Marzenna; Dziegiel, Piotr

    2017-10-01

    As a result of activation of transcription factors engaged in epithelial-mesenchymal transition (EMT), such as Twist, inhibition of epithelial markers and an increased expression of mesenchymal markers are observed. One of the specific markers of cancer-associated fibroblasts is podoplanin (PDPN) - a mucin-type membrane glycoprotein. The aim of this work was to study the localisation and intensity of expression of Twist and PDPN on the mRNA and protein level in cases of invasive ductal breast carcinoma (IDC), and its association with patients' clinico-pathological data. The study included archival material in a form of 80 paraffin IDC blocks and 11 IDC fragments frozen in liquid nitrogen. Immunohistochemical expression of Twist and PDPN was evaluated using light microscope and semiquantitative scale for evaluation of nuclear expression or immunoreactive scale (IRS) for evaluation of cytoplasmic expression. Material was isolated from frozen IDC fragments using laser micro-dissection (from cancer and stromal cells, separately) and was used to perform real-time PCR. Twist expression was higher in stromal cells in comparison to cancer cells. Analysis of patients' survival rate showed, that higher expression of Twist in cancer cells was associated with shorter overall survival time and shorter event-free survival time. The expression of PDPN was also higher in stromal cells in comparison with cancer cells. In addition, positive correlation was observed between expression of Twist and PDPN in stromal cells of IDC (r=0.267; p<0.05). The relationship between the higher expression of Twist in both cancer and stromal cells and shorter patients' survival indicates Twist as a potential useful prognostic marker in IDC. Positive correlation of Twist and PDPN expression may indicate the role of PDPN in EMT in IDC. Copyright© 2017, International Institute of Anticancer Research (Dr. George J. Delinasios), All rights reserved.

  13. Twisted entire cyclic cohomology, J-L-O cocycles and equivariant spectral triples

    International Nuclear Information System (INIS)

    Goswami, D.

    2002-07-01

    We study the 'quantized calculus' corresponding to the algebraic ideas related to 'twisted cyclic cohomology'. With very similar definitions and techniques, we define and study 'twisted entire cyclic cohomology' and the 'twisted Chern character' associated with an appropriate operator theoretic data called 'twisted spectral data', which consists of a spectral triple in the conventional sense of noncommutative geometry and an additional positive operator having some specified properties. Furthermore, it is shown that given a spectral triple (in the conventional sense) which is equivariant under the action of a compact matrix pseudogroup, it is possible to obtain a canonical twisted spectral data and hence the corresponding (twisted) Chern character, which will be invariant under the action of the pseudogroup, in contrast to the fact that the Chern character coming from the conventional noncommutative geometry need not be invariant under the above action. (author)

  14. On the space of connections having non-trivial twisted harmonic spinors

    International Nuclear Information System (INIS)

    Bei, Francesco; Waterstraat, Nils

    2015-01-01

    We consider Dirac operators on odd-dimensional compact spin manifolds which are twisted by a product bundle. We show that the space of connections on the twisting bundle which yields an invertible operator has infinitely many connected components if the untwisted Dirac operator is invertible and the dimension of the twisting bundle is sufficiently large

  15. On the space of connections having non-trivial twisted harmonic spinors

    Energy Technology Data Exchange (ETDEWEB)

    Bei, Francesco, E-mail: bei@math.hu-berlin.de [Institut für Mathematik, Humboldt Universität zu Berlin, Unter den Linden 6, 10099 Berlin (Germany); Waterstraat, Nils, E-mail: n.waterstraat@kent.ac.uk [School of Mathematics, Statistics & Actuarial Science, University of Kent, Canterbury, Kent CT2 7NF (United Kingdom)

    2015-09-15

    We consider Dirac operators on odd-dimensional compact spin manifolds which are twisted by a product bundle. We show that the space of connections on the twisting bundle which yields an invertible operator has infinitely many connected components if the untwisted Dirac operator is invertible and the dimension of the twisting bundle is sufficiently large.

  16. Aeroelastic Analysis of Helicopter Rotor Blades Incorporating Anisotropic Piezoelectric Twist Actuation

    Science.gov (United States)

    Wilkie, W. Keats; Belvin, W. Keith; Park, K. C.

    1996-01-01

    A simple aeroelastic analysis of a helicopter rotor blade incorporating embedded piezoelectric fiber composite, interdigitated electrode blade twist actuators is described. The analysis consists of a linear torsion and flapwise bending model coupled with a nonlinear ONERA based unsteady aerodynamics model. A modified Galerkin procedure is performed upon the rotor blade partial differential equations of motion to develop a system of ordinary differential equations suitable for dynamics simulation using numerical integration. The twist actuation responses for three conceptual fullscale blade designs with realistic constraints on blade mass are numerically evaluated using the analysis. Numerical results indicate that useful amplitudes of nonresonant elastic twist, on the order of one to two degrees, are achievable under one-g hovering flight conditions for interdigitated electrode poling configurations. Twist actuation for the interdigitated electrode blades is also compared with the twist actuation of a conventionally poled piezoelectric fiber composite blade. Elastic twist produced using the interdigitated electrode actuators was found to be four to five times larger than that obtained with the conventionally poled actuators.

  17. Quadratic Twists of Rigid Calabi–Yau Threefolds Over

    DEFF Research Database (Denmark)

    Gouvêa, Fernando Q.; Kiming, Ian; Yui, Noriko

    2013-01-01

    of weight 4 on some Γ 0(N). We show that quadratic twisting of a threefold corresponds to twisting the attached newform by quadratic characters and illustrate with a number of obvious and not so obvious examples. The question is motivated by the deeper question of which newforms of weight 4 on some Γ 0(N...

  18. Overlapping community detection based on link graph using distance dynamics

    Science.gov (United States)

    Chen, Lei; Zhang, Jing; Cai, Li-Jun

    2018-01-01

    The distance dynamics model was recently proposed to detect the disjoint community of a complex network. To identify the overlapping structure of a network using the distance dynamics model, an overlapping community detection algorithm, called L-Attractor, is proposed in this paper. The process of L-Attractor mainly consists of three phases. In the first phase, L-Attractor transforms the original graph to a link graph (a new edge graph) to assure that one node has multiple distances. In the second phase, using the improved distance dynamics model, a dynamic interaction process is introduced to simulate the distance dynamics (shrink or stretch). Through the dynamic interaction process, all distances converge, and the disjoint community structure of the link graph naturally manifests itself. In the third phase, a recovery method is designed to convert the disjoint community structure of the link graph to the overlapping community structure of the original graph. Extensive experiments are conducted on the LFR benchmark networks as well as real-world networks. Based on the results, our algorithm demonstrates higher accuracy and quality than other state-of-the-art algorithms.

  19. Autoregressive Moving Average Graph Filtering

    OpenAIRE

    Isufi, Elvin; Loukas, Andreas; Simonetto, Andrea; Leus, Geert

    2016-01-01

    One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which (i) are able to approximate any desired graph frequency response, and (ii) give exact solutions for tasks such as graph signal denoising and interpolation. The design phi...

  20. The geometric Langlands twist in five and six dimensions

    International Nuclear Information System (INIS)

    Bak, Dongsu; Gustavsson, Andreas

    2015-01-01

    Abelian 6d (2,0) theory has SO(5) R symmetry. We twist this theory by identifying the R symmetry group with the SO(5) subgroup of the SO(1,5) Lorentz group. This twisted theory can be put on any five-manifold M, times R, while preserving one scalar supercharge. We subsequently assume the existence of one unit normalized Killing vector field on M, and we find a corresponding SO(4) twist that preserves two supercharges and is a generalization of the geometric Langlands twist of 4d SYM. We generalize the story to non-Abelian gauge group for the corresponding 5d SYM theories on M. We derive a vanishing theorem for BPS contact instantons by identifying the 6d potential energy and its BPS bound, in the 5d theory. To this end we need to perform a Wick rotation that complexifies the gauge field.

  1. Higher-Twist Dynamics in Large Transverse Momentum Hadron Production

    International Nuclear Information System (INIS)

    Francois, Alero

    2009-01-01

    A scaling law analysis of the world data on inclusive large-p # perpendicular# hadron production in hadronic collisions is carried out. A significant deviation from leading-twist perturbative QCD predictions at next-to-leading order is reported. The observed discrepancy is largest at high values of x # perpendicular# = 2p # perpendicular#/√s. In contrast, the production of prompt photons and jets exhibits the scaling behavior which is close to the conformal limit, in agreement with the leading-twist expectation. These results bring evidence for a non-negligible contribution of higher-twist processes in large-p # perpendicular# hadron production in hadronic collisions, where the hadron is produced directly in the hard subprocess rather than by gluon or quark jet fragmentation. Predictions for scaling exponents at RHIC and LHC are given, and it is suggested to trigger the isolated large-p # perpendicular# hadron production to enhance higher-twist processes.

  2. On cyclic orthogonal double covers of circulant graphs by special infinite graphs

    Directory of Open Access Journals (Sweden)

    R. El-Shanawany

    2017-12-01

    Full Text Available In this article, a technique to construct cyclic orthogonal double covers (CODCs of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and K1,2n−10 is introduced.

  3. Periodic solutions of asymptotically linear Hamiltonian systems without twist conditions

    Energy Technology Data Exchange (ETDEWEB)

    Cheng Rong [Coll. of Mathematics and Physics, Nanjing Univ. of Information Science and Tech., Nanjing (China); Dept. of Mathematics, Southeast Univ., Nanjing (China); Zhang Dongfeng [Dept. of Mathematics, Southeast Univ., Nanjing (China)

    2010-05-15

    In dynamical system theory, especially in many fields of applications from mechanics, Hamiltonian systems play an important role, since many related equations in mechanics can be written in an Hamiltonian form. In this paper, we study the existence of periodic solutions for a class of Hamiltonian systems. By applying the Galerkin approximation method together with a result of critical point theory, we establish the existence of periodic solutions of asymptotically linear Hamiltonian systems without twist conditions. Twist conditions play crucial roles in the study of periodic solutions for asymptotically linear Hamiltonian systems. The lack of twist conditions brings some difficulty to the study. To the authors' knowledge, very little is known about the case, where twist conditions do not hold. (orig.)

  4. Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory

    KAUST Repository

    Pearce, Roger

    2010-11-01

    Processing large graphs is becoming increasingly important for many domains such as social networks, bioinformatics, etc. Unfortunately, many algorithms and implementations do not scale with increasing graph sizes. As a result, researchers have attempted to meet the growing data demands using parallel and external memory techniques. We present a novel asynchronous approach to compute Breadth-First-Search (BFS), Single-Source-Shortest-Paths, and Connected Components for large graphs in shared memory. Our highly parallel asynchronous approach hides data latency due to both poor locality and delays in the underlying graph data storage. We present an experimental study applying our technique to both In-Memory and Semi-External Memory graphs utilizing multi-core processors and solid-state memory devices. Our experiments using synthetic and real-world datasets show that our asynchronous approach is able to overcome data latencies and provide significant speedup over alternative approaches. For example, on billion vertex graphs our asynchronous BFS scales up to 14x on 16-cores. © 2010 IEEE.

  5. RNA-Based TWIST1 Inhibition via Dendrimer Complex to Reduce Breast Cancer Cell Metastasis

    Directory of Open Access Journals (Sweden)

    James Finlay

    2015-01-01

    Full Text Available Breast cancer is the leading cause of cancer-related deaths among women in the United States, and survival rates are lower for patients with metastases and/or triple-negative breast cancer (TNBC; ER, PR, and Her2 negative. Understanding the mechanisms of cancer metastasis is therefore crucial to identify new therapeutic targets and develop novel treatments to improve patient outcomes. A potential target is the TWIST1 transcription factor, which is often overexpressed in aggressive breast cancers and is a master regulator of cellular migration through epithelial-mesenchymal transition (EMT. Here, we demonstrate an siRNA-based TWIST1 silencing approach with delivery using a modified poly(amidoamine (PAMAM dendrimer. Our results demonstrate that SUM1315 TNBC cells efficiently take up PAMAM-siRNA complexes, leading to significant knockdown of TWIST1 and EMT-related target genes. Knockdown lasts up to one week after transfection and leads to a reduction in migration and invasion, as determined by wound healing and transwell assays. Furthermore, we demonstrate that PAMAM dendrimers can deliver siRNA to xenograft orthotopic tumors and siRNA remains in the tumor for at least four hours after treatment. These results suggest that further development of dendrimer-based delivery of siRNA for TWIST1 silencing may lead to a valuable adjunctive therapy for patients with TNBC.

  6. Higher-Twist Distribution Amplitudes of the K Meson in QCD

    CERN Document Server

    Ball, P; Lenz, A; Ball, Patricia

    2006-01-01

    We present a systematic study of twist-3 and twist-4 light-cone distribution amplitudes of the K meson in QCD. The structure of SU(3)-breaking corrections is studied in detail. Non-perturbative input parameters are estimated from QCD sum rules and renormalons. As a by-product, we give a complete reanalysis of the twist-3 and -4 parameters of the pi-meson distribution amplitudes; some of the results differ from those usually quoted in the literature.

  7. Fundamentals of algebraic graph transformation

    CERN Document Server

    Ehrig, Hartmut; Prange, Ulrike; Taentzer, Gabriele

    2006-01-01

    Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. Part I is an introduction to the classical case of graph and typed graph transformation. In Part II basic and advanced results are first shown for an abstract form of replacement systems, so-called adhesive high-level replacement systems based on category theory, and are then instantiated to several forms of graph and Petri net transformation systems. Part III develops typed attributed graph transformation, a technique of key relevance in the modeling of visual languages and in model transformation. Part IV contains a practical case study on model transformation and a presentation of the AGG (attributed graph grammar) tool envir...

  8. Continuous Static Gait with Twisting Trunk of a Metamorphic Quadruped Robot

    Directory of Open Access Journals (Sweden)

    C. Zhang

    2018-01-01

    Full Text Available The natural quadrupeds, such as geckos and lizards, often twist their trunks when moving. Conventional quadruped robots cannot perform the same motion due to equipping with a trunk which is a rigid body or at most consists of two blocks connected by passive joints. This paper proposes a metamorphic quadruped robot with a reconfigurable trunk which can implement active trunk motions, called MetaRobot I. The robot can imitate the natural quadrupeds to execute motion of trunk twisting. Benefiting from the twisting trunk, the stride length of this quadruped is increased comparing to that of conventional quadruped robots.In this paper a continuous static gait benefited from the twisting trunk performing the increased stride length is introduced. After that, the increased stride length relative to the trunk twisting will be analysed mathematically. Other points impacting the implementation of the increased stride length in the gait are investigated such as the upper limit of the stride length and the kinematic margin. The increased stride length in the gait will lead the increase of locomotion speed comparing with conventional quadruped robots, giving the extent that natural quadrupeds twisting their trunks when moving. The simulation and an experiment on the prototype are then carried out to illustrate the benefits on the stride length and locomotion speed brought by the twisting trunk to the quadruped robot.

  9. Cerclage handling for improved fracture treatment. A biomechanical study on the twisting procedure.

    Science.gov (United States)

    Wähnert, D; Lenz, M; Schlegel, U; Perren, S; Windolf, M

    2011-01-01

    Twisting is clinically the most frequently applied method for tightening and maintaining cerclage fixation. The twisting procedure is controversially discussed. Several factors during twisting affect the mechanical behaviour of the cerclage. This in vitro study investigated the influence of different parameters of the twisting procedure on the fixation strength of the cerclage in an experimental setup with centripetal force application. Cortical half shells of the femoral shaft were mounted on a testing fixture. 1.0 mm, 1.25 mm and 1.5 mm stainless ste- el wire cerclages as well as a 1.0mm cable cerclage were applied to the bone. Pretension of the cerclage during the installation was measured during the locking procedure. Subsequently, cyclic testing was performed up to failure. Higher pretension could be achieved with increasing wire diameter. However, with larger wire diameter the drop of pre- tension due to the bending and cutting the twist also increased. The cable cerclage showed the highest pretension after locking. Cerclages twisted under traction revealed significantly higher initial cerclage tension. Plastically deformed twists offered higher cerclage pretension compared to twists which were deformed in the elastic region of the material. Cutting the wire within the twist caused the highest loss of cerclage tension (44% initial tension) whereas only 11 % was lost when cutting the wire ends separately. The bending direction of the twist significantly influenced the cerclage pretension. 45% pretension was lost in forward bending of the twist, 53% in perpendicular bending and 90% in backward bending. Several parameters affect the quality of a cerclage fixation. Adequate installation of cerclage wires could markedly improve the clinical outcome of cerclage.

  10. AKT-ions with a TWIST between EMT and MET.

    Science.gov (United States)

    Tang, Huifang; Massi, Daniela; Hemmings, Brian A; Mandalà, Mario; Hu, Zhengqiang; Wicki, Andreas; Xue, Gongda

    2016-09-20

    The transcription factor Twist is an important regulator of cranial suture during embryogenesis. Closure of the neural tube is achieved via Twist-triggered cellular transition from an epithelial to mesenchymal phenotype, a process known as epithelial-mesenchymal transition (EMT), characterized by a remarkable increase in cell motility. In the absence of Twist activity, EMT and associated phenotypic changes in cell morphology and motility can also be induced, albeit moderately, by other transcription factor families, including Snail and Zeb. Aberrant EMT triggered by Twist in human mammary tumour cells was first reported to drive metastasis to the lung in a metastatic breast cancer model. Subsequent analysis of many types of carcinoma demonstrated overexpression of these unique EMT transcription factors, which statistically correlated with worse outcome, indicating their potential as biomarkers in the clinic. However, the mechanisms underlying their activation remain unclear. Interestingly, increasing evidence indicates they are selectively activated by distinct intracellular kinases, thereby acting as downstream effectors facilitating transduction of cytoplasmic signals into nucleus and reprogramming EMT and mesenchymal-epithelial transition (MET) transcription to control cell plasticity. Understanding these relationships and emerging data indicating differential phosphorylation of Twist leads to complex and even paradoxical functionalities, will be vital to unlocking their potential in clinical settings.

  11. Efficient nonparametric and asymptotic Bayesian model selection methods for attributed graph clustering

    KAUST Repository

    Xu, Zhiqiang

    2017-02-16

    Attributed graph clustering, also known as community detection on attributed graphs, attracts much interests recently due to the ubiquity of attributed graphs in real life. Many existing algorithms have been proposed for this problem, which are either distance based or model based. However, model selection in attributed graph clustering has not been well addressed, that is, most existing algorithms assume the cluster number to be known a priori. In this paper, we propose two efficient approaches for attributed graph clustering with automatic model selection. The first approach is a popular Bayesian nonparametric method, while the second approach is an asymptotic method based on a recently proposed model selection criterion, factorized information criterion. Experimental results on both synthetic and real datasets demonstrate that our approaches for attributed graph clustering with automatic model selection significantly outperform the state-of-the-art algorithm.

  12. Efficient nonparametric and asymptotic Bayesian model selection methods for attributed graph clustering

    KAUST Repository

    Xu, Zhiqiang; Cheng, James; Xiao, Xiaokui; Fujimaki, Ryohei; Muraoka, Yusuke

    2017-01-01

    Attributed graph clustering, also known as community detection on attributed graphs, attracts much interests recently due to the ubiquity of attributed graphs in real life. Many existing algorithms have been proposed for this problem, which are either distance based or model based. However, model selection in attributed graph clustering has not been well addressed, that is, most existing algorithms assume the cluster number to be known a priori. In this paper, we propose two efficient approaches for attributed graph clustering with automatic model selection. The first approach is a popular Bayesian nonparametric method, while the second approach is an asymptotic method based on a recently proposed model selection criterion, factorized information criterion. Experimental results on both synthetic and real datasets demonstrate that our approaches for attributed graph clustering with automatic model selection significantly outperform the state-of-the-art algorithm.

  13. Sigma terms and strangeness content of the nucleon with N{sub f}=2+1+1 twisted mass fermions

    Energy Technology Data Exchange (ETDEWEB)

    Alexandrou, C. [The Cyprus Institute, Nicosia (Cyprus). Computation-based Science and Technology Research Center (CaSToRC); Cyprus Univ., Nicosia (Cyprus). Dept. of Physics; Constantinou, M.; Hadjiyiannakou, K.; Strelchenko, A. [Cyprus Univ., Nicosia (Cyprus). Dept. of Physics; Dinter, S.; Drach, V.; Jansen, K. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Koustou, G.; Vaquero, A. [The Cyprus Institute, Nicosia (Cyprus). Computation-based Science and Technology Research Center (CaSToRC)

    2012-11-15

    We investigate excited state contaminations in a direct computation of the nucleon {sigma}-terms. This is an important source of systematic effects that needs to be controlled besides the light quark mass dependence and lattice artefacts. We use maximally twisted mass fermions with dynamical light (u,d), strange and charm degrees of freedom. Employing an efficient stochastic evaluation of the disconnected contribution available for twisted mass fermions, we show that the effect of excited states is large in particular for the strange {sigma}-terms, where it can be as big as O(>or similar 40%). This leads to the unfortunate conclusion that even with a source-sink separation of {proportional_to}1.5 fm and a good statistical accuracy it is not clear, whether excited state effects are under control for this quantity.

  14. Conductive sub-layer of twisted-tape-induced swirl-flow heat transfer in vertical circular tubes with various twisted-tape inserts

    Science.gov (United States)

    Hata, K.; Fukuda, K.; Masuzaki, S.

    2018-04-01

    Twisted-tape-induced swirl-flow heat transfer due to exponentially increasing heat inputs with various exponential periods ( Q = Q 0 exp(t/τ), τ = 6.04 to 23.07 s) and twisted-tape-induced pressure drop was systematically measured for various mass velocities ( G = 4115 to 13,656 kg/m2 s), inlet liquid temperatures ( T in = 285.88 to 299.09 K), and inlet pressures ( P in = 847.45 to 943.29 kPa) using an experimental water loop flow. Measurements were made over a 59.2-mm effective length and three sections (upper, middle, and lower positions), within which four potential taps were spot-welded onto the outer surface of a 6-mm-inner-diameter, 69.6-mm-heated length, 0.4-mm-thickness platinum circular test tube. Type SUS304 twisted tapes with a width w = 5.6 mm, a thickness δ T = 0.6 mm, a total length l = 372 mm, and twist ratios y = 2.39 and 4.45 were employed in this study. The RANS equations (Reynolds Averaged Navier-Stokes Simulation) with a k-ɛ turbulence model for a circular tube 6 mm in diameter and 636 mm in length were numerically solved for heating of water with a heated section 6 mm in diameter and 70 mm in length using the CFD code, under the same conditions as the experimental ones and considering the temperature dependence of the thermo-physical properties concerned. The theoretical values of surface heat flux q on the circular tubes with twisted tapes with twist ratios y of 2.39 and 4.45 were found to be almost in agreement with the corresponding experimental values of heat flux q, with deviations of less than 30% for the range of temperature difference between the average heater inner surface temperature and the liquid bulk mean temperature ΔT L [ = T s,av - T L , T L = ( T in + T out )/2] considered in this study. The theoretical values of the local surface temperature T s , local average liquid temperature T f,av , and local liquid pressure drop ΔP x were found to be within almost 15% of the corresponding experimental ones. The thickness of the

  15. 'Twisted' strings and higher level Kac-Moody representations

    International Nuclear Information System (INIS)

    Horvath, Z.; Palla, L.

    1989-01-01

    Using an orbifold-like construction the twisted sector of a closed string moving on GxG (with G simply laced) is determined. A level-two G current operating there is constructed explicitly. The decomposition of the twisted sector into products between appropriate conformal and level-two G representations is given if 2 rank G-2 dim G/(2+g)<1. (orig.)

  16. Sox5 induces epithelial to mesenchymal transition by transactivation of Twist1

    International Nuclear Information System (INIS)

    Pei, Xin-Hong; Lv, Xin-Quan; Li, Hui-Xiang

    2014-01-01

    Highlights: • Depletion of Sox5 inhibits breast cancer proliferation, migration, and invasion. • Sox5 transactivates Twist1 expression. • Sox5 induces epithelial to mesenchymal transition through transactivation of Twist1 expression. - Abstract: The epithelial to mesenchymal transition (EMT), a highly conserved cellular program, plays an important role in normal embryogenesis and cancer metastasis. Twist1, a master regulator of embryonic morphogenesis, is overexpressed in breast cancer and contributes to metastasis by promoting EMT. In exploring the mechanism underlying the increased Twist1 in breast cancer cells, we found that the transcription factor SRY (sex-determining region Y)-box 5(Sox5) is up-regulation in breast cancer cells and depletion of Sox5 inhibits breast cancer cell proliferation, migration, and invasion. Furthermore, depletion of Sox5 in breast cancer cells caused a dramatic decrease in Twist1 and chromosome immunoprecipitation assay showed that Sox5 can bind directly to the Twist1 promoter, suggesting that Sox5 transactivates Twist1 expression. We further demonstrated that knockdown of Sox5 up-regulated epithelial phenotype cell biomarker (E-cadherin) and down-regulated mesenchymal phenotype cell biomarkers (N-cadherin, Vimentin, and Fibronectin 1), resulting in suppression of EMT. Our study suggests that Sox5 transactivates Twist1 expression and plays an important role in the regulation of breast cancer progression

  17. Graph-based modelling in engineering

    CERN Document Server

    Rysiński, Jacek

    2017-01-01

    This book presents versatile, modern and creative applications of graph theory in mechanical engineering, robotics and computer networks. Topics related to mechanical engineering include e.g. machine and mechanism science, mechatronics, robotics, gearing and transmissions, design theory and production processes. The graphs treated are simple graphs, weighted and mixed graphs, bond graphs, Petri nets, logical trees etc. The authors represent several countries in Europe and America, and their contributions show how different, elegant, useful and fruitful the utilization of graphs in modelling of engineering systems can be. .

  18. Twisted spin Sutherland models from quantum Hamiltonian reduction

    International Nuclear Information System (INIS)

    Feher, L; Pusztai, B G

    2008-01-01

    Recent general results on Hamiltonian reductions under polar group actions are applied to study some reductions of the free particle governed by the Laplace-Beltrami operator of a compact, connected, simple Lie group. The reduced systems associated with arbitrary finite-dimensional irreducible representations of the group by using the symmetry induced by twisted conjugations are described in detail. These systems generically yield integrable Sutherland-type many-body models with spin, which are called twisted spin Sutherland models if the underlying twisted conjugations are built on non-trivial Dynkin diagram automorphisms. The spectra of these models can be calculated, in principle, by solving certain Clebsch-Gordan problems, and the result is presented for the models associated with the symmetric tensorial powers of the defining representation of SU(N)

  19. Decomposing series-parallel graphs into paths of length 3 and triangles

    DEFF Research Database (Denmark)

    Merker, Martin

    2015-01-01

    An old conjecture by Jünger, Reinelt and Pulleyblank states that every 2-edge-connected planar graph can be decomposed into paths of length 3 and triangles, provided its size is divisible by 3. We prove the conjecture for a class of planar graphs including all 2-edge-connected series-parallel gra...

  20. BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.

    Science.gov (United States)

    Vorburger, Robert S; Reischauer, Carolin; Boesiger, Peter

    2013-02-01

    Bootstrap methods have recently been introduced to diffusion-weighted magnetic resonance imaging to estimate the measurement uncertainty of ensuing diffusion parameters directly from the acquired data without the necessity to assume a noise model. These methods have been previously combined with deterministic streamline tractography algorithms to allow for the assessment of connection probabilities in the human brain. Thereby, the local noise induced disturbance in the diffusion data is accumulated additively due to the incremental progression of streamline tractography algorithms. Graph based approaches have been proposed to overcome this drawback of streamline techniques. For this reason, the bootstrap method is in the present work incorporated into a graph setup to derive a new probabilistic fiber tractography method, called BootGraph. The acquired data set is thereby converted into a weighted, undirected graph by defining a vertex in each voxel and edges between adjacent vertices. By means of the cone of uncertainty, which is derived using the wild bootstrap, a weight is thereafter assigned to each edge. Two path finding algorithms are subsequently applied to derive connection probabilities. While the first algorithm is based on the shortest path approach, the second algorithm takes all existing paths between two vertices into consideration. Tracking results are compared to an established algorithm based on the bootstrap method in combination with streamline fiber tractography and to another graph based algorithm. The BootGraph shows a very good performance in crossing situations with respect to false negatives and permits incorporating additional constraints, such as a curvature threshold. By inheriting the advantages of the bootstrap method and graph theory, the BootGraph method provides a computationally efficient and flexible probabilistic tractography setup to compute connection probability maps and virtual fiber pathways without the drawbacks of

  1. Extension-twist coupling of composite circular tubes with application to tilt rotor blade design

    Science.gov (United States)

    Nixon, Mark W.

    1987-01-01

    This investigation was conducted to determine if twist deformation required for the design of full-scale extension-twist-coupled tilt-rotor blades can be achieved within material design limit loads, and to demonstrate the accuracy of a coupled-beam analysis in predicting twist deformations. Two extension-twist-coupled tilt-rotor blade designs were developed based on theoretically optimum aerodynamic twist distributions. The designs indicated a twist rate requirement of between .216 and .333 deg/in. Agreement between axial tests and analytical predictions was within 10 percent at design limit loads. Agreement between the torsion tests and predictions was within 11 percent.

  2. PARTIAL ERUPTION OF A FILAMENT WITH TWISTING NON-UNIFORM FIELDS

    International Nuclear Information System (INIS)

    Bi, Yi; Jiang, Yunchun; Yang, Jiayan; Xiang, Yongyuan; Cai, Yunfang; Liu, Weiwei

    2015-01-01

    The eruption of a filament in a kinklike fashion is often regarded as a signature of kink instability. However, the kink instability threshold for the filament’s magnetic structure is not widely understood. Using Hα observations from the New Vacuum Solar Telescope, we present a partial eruptive filament. During the eruption, the filament thread appeared to split from its middle and to break out in a kinklike fashion. In this period, the remaining filament material stayed below and erupted without the kinking motion later on. The coronal magnetic field lines associated with the filament are obtained from nonlinear force-free field extrapolations using the twelve-minute-cadence vector magnetograms of the Helioseismic and Magnetic Imager (HMI) on board the Solar Dynamic Observatory. We studied the extrapolated field lines passing through the magnetic dips which are in good agreement with the observed filament. The field lines are non-uniformly twisted and appear to be composed of two twisted flux ropes winding around each other. One of them has a higher twist than the other, and the flux rope with the higher twist has its dips aligned with the kinking eruptive thread at the beginning of its eruption. Before the eruption, moreover, the flux rope with the higher twist was found to expand with an approximately constant field twist. In addition, the helicity flux maps deduced from the HMI magnetograms show that some helicity is injected into the overlying magnetic arcade, but no significant helicity is injected into the flux ropes. Accordingly, we suggest that the highly twisted flux rope became kink unstable when the instability threshold declined with the expansion of the flux rope

  3. The geometrical origin of the strain-twist coupling in double helices

    Directory of Open Access Journals (Sweden)

    Kasper Olsen

    2011-03-01

    Full Text Available A simple geometrical explanation for the counterintuitive phenomenon when twist leads to extension in double helices is presented. The coupling between strain and twist is investigated using a tubular description. It is shown that the relation between strain and rotation is universal and depends only on the pitch angle. For pitch angles below 39.4° strain leads to further winding, while for larger pitch angles strain leads to unwinding. The zero-twist structure, with a pitch angle of 39.4°, is at the unique point between winding and unwinding and independent of the mechanical properties of the double helix. The existence of zero-twist structures, i.e. structures that display neither winding, nor unwinding under strain is discussed. Close-packed double helices are shown to extend rather than shorten when twisted. Numerical estimates of this elongation upon winding are given for DNA, chromatin, and RNA.

  4. Visibility Graph Based Time Series Analysis.

    Science.gov (United States)

    Stephen, Mutua; Gu, Changgui; Yang, Huijie

    2015-01-01

    Network based time series analysis has made considerable achievements in the recent years. By mapping mono/multivariate time series into networks, one can investigate both it's microscopic and macroscopic behaviors. However, most proposed approaches lead to the construction of static networks consequently providing limited information on evolutionary behaviors. In the present paper we propose a method called visibility graph based time series analysis, in which series segments are mapped to visibility graphs as being descriptions of the corresponding states and the successively occurring states are linked. This procedure converts a time series to a temporal network and at the same time a network of networks. Findings from empirical records for stock markets in USA (S&P500 and Nasdaq) and artificial series generated by means of fractional Gaussian motions show that the method can provide us rich information benefiting short-term and long-term predictions. Theoretically, we propose a method to investigate time series from the viewpoint of network of networks.

  5. Visibility Graph Based Time Series Analysis.

    Directory of Open Access Journals (Sweden)

    Mutua Stephen

    Full Text Available Network based time series analysis has made considerable achievements in the recent years. By mapping mono/multivariate time series into networks, one can investigate both it's microscopic and macroscopic behaviors. However, most proposed approaches lead to the construction of static networks consequently providing limited information on evolutionary behaviors. In the present paper we propose a method called visibility graph based time series analysis, in which series segments are mapped to visibility graphs as being descriptions of the corresponding states and the successively occurring states are linked. This procedure converts a time series to a temporal network and at the same time a network of networks. Findings from empirical records for stock markets in USA (S&P500 and Nasdaq and artificial series generated by means of fractional Gaussian motions show that the method can provide us rich information benefiting short-term and long-term predictions. Theoretically, we propose a method to investigate time series from the viewpoint of network of networks.

  6. Dynamical twisted mass fermions with light quarks. Simulation and analysis details

    Energy Technology Data Exchange (ETDEWEB)

    Boucaud, P. [Paris-11 Univ., 91 - Orsay (France). Lab. de Physique Theorique; Dimopoulos, P. [Rome-2 Univ. (Italy). Dipt. di Fisica; Farchioni, F. [Muenster Univ. (DE). Inst. fuer Theoretische Physik] (and others)

    2008-03-15

    In a recent paper (2007) we presented precise lattice QCD results of our European Twisted Mass Collaboration (ETMC). They were obtained by employing two mass-degenerate flavours of twisted mass fermions at maximal twist. In the present paper we give details on our simulations and the computation of physical observables. In particular, we discuss the problem of tuning to maximal twist, the techniques we have used to compute correlators and error estimates. In addition, we provide more information on the algorithm used, the autocorrelation times and scale determination, the evaluation of disconnected contributions and the description of our data by means of chiral perturbation theory formulae. (orig.)

  7. Dynamical twisted mass fermions with light quarks. Simulation and analysis details

    International Nuclear Information System (INIS)

    Boucaud, P.; Dimopoulos, P.; Farchioni, F.

    2008-03-01

    In a recent paper (2007) we presented precise lattice QCD results of our European Twisted Mass Collaboration (ETMC). They were obtained by employing two mass-degenerate flavours of twisted mass fermions at maximal twist. In the present paper we give details on our simulations and the computation of physical observables. In particular, we discuss the problem of tuning to maximal twist, the techniques we have used to compute correlators and error estimates. In addition, we provide more information on the algorithm used, the autocorrelation times and scale determination, the evaluation of disconnected contributions and the description of our data by means of chiral perturbation theory formulae. (orig.)

  8. Composite material bend-twist coupling for wind turbine blade applications

    Science.gov (United States)

    Walsh, Justin M.

    Current efforts in wind turbine blade design seek to employ bend-twist coupling of composite materials for passive power control by twisting blades to feather. Past efforts in this area of study have proved to be problematic, especially in formulation of the bend-twist coupling coefficient alpha. Kevlar/epoxy, carbon/epoxy and glass/epoxy specimens were manufactured to study bend-twist coupling, from which numerical and analytical models could be verified. Finite element analysis was implemented to evaluate fiber orientation and material property effects on coupling magnitude. An analytical/empirical model was then derived to describe numerical results and serve as a replacement for the commonly used coupling coefficient alpha. Through the results from numerical and analytical models, a foundation for aeroelastic design of wind turbines blades utilizing biased composite materials is provided.

  9. Flux Density through Guides with Microstructured Twisted Clad DB Medium

    Directory of Open Access Journals (Sweden)

    M. A. Baqir

    2014-01-01

    Full Text Available The paper deals with the study of flux density through a newly proposed twisted clad guide containing DB medium. The inner core and the outer clad sections are usual dielectrics, and the introduced twisted windings at the core-clad interface are treated under DB boundary conditions. The pitch angle of twist is supposed to greatly contribute towards the control over the dispersion characteristics of the guide. The eigenvalue equation for the guiding structure is deduced, and the analytical investigations are made to explore the propagation patterns of flux densities corresponding to the sustained low-order hybrid modes under the situation of varying pitch angles. The emphasis has been put on the effects due to the DB twisted pitch on the propagation of energy flux density through the guide.

  10. Equipackable graphs

    DEFF Research Database (Denmark)

    Vestergaard, Preben Dahl; Hartnell, Bert L.

    2006-01-01

    There are many results dealing with the problem of decomposing a fixed graph into isomorphic subgraphs. There has also been work on characterizing graphs with the property that one can delete the edges of a number of edge disjoint copies of the subgraph and, regardless of how that is done, the gr...

  11. Khovanov homology of graph-links

    Energy Technology Data Exchange (ETDEWEB)

    Nikonov, Igor M [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)

    2012-08-31

    Graph-links arise as the intersection graphs of turning chord diagrams of links. Speaking informally, graph-links provide a combinatorial description of links up to mutations. Many link invariants can be reformulated in the language of graph-links. Khovanov homology, a well-known and useful knot invariant, is defined for graph-links in this paper (in the case of the ground field of characteristic two). Bibliography: 14 titles.

  12. Effect of Twisting and Stretching on Magneto Resistance and Spin Filtration in CNTs

    Directory of Open Access Journals (Sweden)

    Anil Kumar Singh

    2017-08-01

    Full Text Available Spin-dependent quantum transport properties in twisted carbon nanotube and stretched carbon nanotube are calculated using density functional theory (DFT and non-equilibrium green’s function (NEGF formulation. Twisting and stretching have no effect on spin transport in CNTs at low bias voltages. However, at high bias voltages the effects are significant. Stretching restricts any spin-up current in antiparallel configuration (APC, which results in higher magneto resistance (MR. Twisting allows spin-up current almost equivalent to the pristine CNT case, resulting in lower MR. High spin filtration is observed in PC and APC for pristine, stretched and twisted structures at all applied voltages. In APC, at low voltages spin filtration in stretched CNT is higher than in pristine and twisted ones, with pristine giving a higher spin filtration than twisted CNT.

  13. Generalized connectivity of graphs

    CERN Document Server

    Li, Xueliang

    2016-01-01

    Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.

  14. Chirality-controlled spontaneous twisting of crystals due to thermal topochemical reaction.

    Science.gov (United States)

    Rai, Rishika; Krishnan, Baiju P; Sureshan, Kana M

    2018-03-20

    Crystals that show mechanical response against various stimuli are of great interest. These stimuli induce polymorphic transitions, isomerizations, or chemical reactions in the crystal and the strain generated between the daughter and parent domains is transcribed into mechanical response. We observed that the crystals of modified dipeptide LL (N 3 -l-Ala-l-Val-NHCH 2 C≡CH) undergo spontaneous twisting to form right-handed twisted crystals not only at room temperature but also at 0 °C over time. Using various spectroscopic techniques, we have established that the twisting is due to the spontaneous topochemical azide-alkyne cycloaddition (TAAC) reaction at room temperature or lower temperatures. The rate of twisting can be increased by heating, exploiting the faster kinetics of the TAAC reaction at higher temperatures. To address the role of molecular chirality in the direction of twisting the enantiomer of dipeptide LL, N 3 -d-Ala-d-Val-NHCH 2 C≡CH (DD), was synthesized and topochemical reactivity and mechanoresponse of its crystals were studied. We have found that dipeptide DD not only underwent TAAC reaction, giving 1,4-triazole-linked pseudopolypeptides of d-amino acids, but also underwent twisting with opposite handedness (left-handed twisting), establishing the role of molecular chirality in controlling the direction of mechanoresponse. This paper reports ( i ) a mechanical response due to a thermal reaction and ( ii ) a spontaneous mechanical response in crystals and ( iii ) explains the role of molecular chirality in the handedness of the macroscopic mechanical response.

  15. On two energy-like invariants of line graphs and related graph operations

    Directory of Open Access Journals (Sweden)

    Xiaodan Chen

    2016-02-01

    Full Text Available Abstract For a simple graph G of order n, let μ 1 ≥ μ 2 ≥ ⋯ ≥ μ n = 0 $\\mu_{1}\\geq\\mu_{2}\\geq\\cdots\\geq\\mu_{n}=0$ be its Laplacian eigenvalues, and let q 1 ≥ q 2 ≥ ⋯ ≥ q n ≥ 0 $q_{1}\\geq q_{2}\\geq\\cdots\\geq q_{n}\\geq0$ be its signless Laplacian eigenvalues. The Laplacian-energy-like invariant and incidence energy of G are defined as, respectively, LEL ( G = ∑ i = 1 n − 1 μ i and IE ( G = ∑ i = 1 n q i . $$\\mathit{LEL}(G=\\sum_{i=1}^{n-1}\\sqrt{ \\mu_{i}} \\quad\\mbox{and}\\quad \\mathit {IE}(G=\\sum_{i=1}^{n} \\sqrt{q_{i}}. $$ In this paper, we present some new upper and lower bounds on LEL and IE of line graph, subdivision graph, para-line graph and total graph of a regular graph, some of which improve previously known results. The main tools we use here are the Cauchy-Schwarz inequality and the Ozeki inequality.

  16. On the twists of interplanetary magnetic flux ropes observed at 1 AU

    Science.gov (United States)

    Wang, Yuming; Zhuang, Bin; Hu, Qiang; Liu, Rui; Shen, Chenglong; Chi, Yutian

    2016-10-01

    Magnetic flux ropes (MFRs) are one kind of fundamental structures in the solar/space physics and involved in various eruption phenomena. Twist, characterizing how the magnetic field lines wind around a main axis, is an intrinsic property of MFRs, closely related to the magnetic free energy and stableness. Although the effect of the twist on the behavior of MFRs had been widely studied in observations, theory, modeling, and numerical simulations, it is still unclear how much amount of twist is carried by MFRs in the solar atmosphere and in heliosphere and what role the twist played in the eruptions of MFRs. Contrasting to the solar MFRs, there are lots of in situ measurements of magnetic clouds (MCs), the large-scale MFRs in interplanetary space, providing some important information of the twist of MFRs. Thus, starting from MCs, we investigate the twist of interplanetary MFRs with the aid of a velocity-modified uniform-twist force-free flux rope model. It is found that most of MCs can be roughly fitted by the model and nearly half of them can be fitted fairly well though the derived twist is probably overestimated by a factor of 2.5. By applying the model to 115 MCs observed at 1 AU, we find that (1) the twist angles of interplanetary MFRs generally follow a trend of about 0.6l/R radians, where l/R is the aspect ratio of a MFR, with a cutoff at about 12π radians AU-1, (2) most of them are significantly larger than 2.5π radians but well bounded by 2l/R radians, (3) strongly twisted magnetic field lines probably limit the expansion and size of MFRs, and (4) the magnetic field lines in the legs wind more tightly than those in the leading part of MFRs. These results not only advance our understanding of the properties and behavior of interplanetary MFRs but also shed light on the formation and eruption of MFRs in the solar atmosphere. A discussion about the twist and stableness of solar MFRs are therefore given.

  17. Price Competition on Graphs

    OpenAIRE

    Adriaan R. Soetevent

    2010-01-01

    This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial discontinuities in firm-level demand may occur. I show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs. I conjecture that this non-existence result holds...

  18. Price Competition on Graphs

    OpenAIRE

    Pim Heijnen; Adriaan Soetevent

    2014-01-01

    This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. We derive an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. These graph models of price competition may lead to spatial discontinuities in firm-level demand. We show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs and conjecture that this non-existence result holds more general...

  19. Skew-adjacency matrices of graphs

    NARCIS (Netherlands)

    Cavers, M.; Cioaba, S.M.; Fallat, S.; Gregory, D.A.; Haemers, W.H.; Kirkland, S.J.; McDonald, J.J.; Tsatsomeros, M.

    2012-01-01

    The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguish adjacency cospectral graphs. This leads to the following topics: graphs whose skew-adjacency matrices are all cospectral; relations between the matchings polynomial of a graph and the characteristic

  20. Graph theory

    CERN Document Server

    Diestel, Reinhard

    2017-01-01

    This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. From the reviews: “This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory.”Acta Scientiarum Mathematiciarum “Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity. ”Persi Diaconis & Ron Graham, SIAM Review “The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theo...

  1. Acyclicity in edge-colored graphs

    DEFF Research Database (Denmark)

    Gutin, Gregory; Jones, Mark; Sheng, Bin

    2017-01-01

    A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type i......+1, i=1,2,3,4. The first three types are equivalent to the absence of PC cycles, PC closed trails, and PC closed walks, respectively. While graphs of types 1, 2 and 3 can be recognized in polynomial time, the problem of recognizing graphs of type 4 is, somewhat surprisingly, NP-hard even for 2-edge-colored...... graphs (i.e., when only two colors are used). The same problem with respect to type 5 is polynomial-time solvable for all edge-colored graphs. Using the five types, we investigate the border between intractability and tractability for the problems of finding the maximum number of internally vertex...

  2. Integral Twist Actuation of Helicopter Rotor Blades for Vibration Reduction

    Science.gov (United States)

    Shin, SangJoon; Cesnik, Carlos E. S.

    2001-01-01

    Active integral twist control for vibration reduction of helicopter rotors during forward flight is investigated. The twist deformation is obtained using embedded anisotropic piezocomposite actuators. An analytical framework is developed to examine integrally-twisted blades and their aeroelastic response during different flight conditions: frequency domain analysis for hover, and time domain analysis for forward flight. Both stem from the same three-dimensional electroelastic beam formulation with geometrical-exactness, and axe coupled with a finite-state dynamic inflow aerodynamics model. A prototype Active Twist Rotor blade was designed with this framework using Active Fiber Composites as the actuator. The ATR prototype blade was successfully tested under non-rotating conditions. Hover testing was conducted to evaluate structural integrity and dynamic response. In both conditions, a very good correlation was obtained against the analysis. Finally, a four-bladed ATR system is built and tested to demonstrate its concept in forward flight. This experiment was conducted at NASA Langley Tansonic Dynamics Tunnel and represents the first-of-a-kind Mach-scaled fully-active-twist rotor system to undergo forward flight test. In parallel, the impact upon the fixed- and rotating-system loads is estimated by the analysis. While discrepancies are found in the amplitude of the loads under actuation, the predicted trend of load variation with respect to its control phase correlates well. It was also shown, both experimentally and numerically, that the ATR blade design has the potential for hub vibratory load reduction of up to 90% using individual blade control actuation. Using the numerical framework, system identification is performed to estimate the harmonic transfer functions. The linear time-periodic system can be represented by a linear time-invariant system under the three modes of blade actuation: collective, longitudinal cyclic, and lateral cyclic. A vibration

  3. Graph Sampling for Covariance Estimation

    KAUST Repository

    Chepuri, Sundeep Prabhakar

    2017-04-25

    In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs. Second-order stationary graph signals may be obtained by graph filtering zero-mean white noise and they admit a well-defined power spectrum whose shape is determined by the frequency response of the graph filter. Estimating the graph power spectrum forms an important component of stationary graph signal processing and related inference tasks such as Wiener prediction or inpainting on graphs. The central result of this paper is that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the second-order statistics of the graph signal from the subsampled observations, and more importantly, without any spectral priors. To this end, both a nonparametric approach as well as parametric approaches including moving average and autoregressive models for the graph power spectrum are considered. The results specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non-parametric and the moving average models, whereas a particular subsampling scheme that allows linear estimation for the autoregressive model is proposed. Numerical experiments on synthetic as well as real datasets related to climatology and processing handwritten digits are provided to demonstrate the developed theory.

  4. Price competition on graphs

    NARCIS (Netherlands)

    Soetevent, A.R.

    2010-01-01

    This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial

  5. Twisting the Mirror TBA

    NARCIS (Netherlands)

    Arutyunov, G.E.; de Leeuw, M.; van Tongeren, S.J.

    2010-01-01

    We study finite-size corrections to the magnon dispersion relation in three models which differ from string theory on AdS5 x S5 in their boundary conditions. Asymptotically, this is accomplished by twisting the transfer matrix in a way which manifestly preserves integrability. In model I all

  6. Graphing the order of the sexes: constructing, recalling, interpreting, and putting the self in gender difference graphs.

    Science.gov (United States)

    Hegarty, Peter; Lemieux, Anthony F; McQueen, Grant

    2010-03-01

    Graphs seem to connote facts more than words or tables do. Consequently, they seem unlikely places to spot implicit sexism at work. Yet, in 6 studies (N = 741), women and men constructed (Study 1) and recalled (Study 2) gender difference graphs with men's data first, and graphed powerful groups (Study 3) and individuals (Study 4) ahead of weaker ones. Participants who interpreted graph order as evidence of author "bias" inferred that the author graphed his or her own gender group first (Study 5). Women's, but not men's, preferences to graph men first were mitigated when participants graphed a difference between themselves and an opposite-sex friend prior to graphing gender differences (Study 6). Graph production and comprehension are affected by beliefs and suppositions about the groups represented in graphs to a greater degree than cognitive models of graph comprehension or realist models of scientific thinking have yet acknowledged.

  7. Collective Rationality in Graph Aggregation

    NARCIS (Netherlands)

    Endriss, U.; Grandi, U.; Schaub, T.; Friedrich, G.; O'Sullivan, B.

    2014-01-01

    Suppose a number of agents each provide us with a directed graph over a common set of vertices. Graph aggregation is the problem of computing a single “collective” graph that best represents the information inherent in this profile of individual graphs. We consider this aggregation problem from the

  8. Finite element and analytical models for twisted and coiled actuator

    Science.gov (United States)

    Tang, Xintian; Liu, Yingxiang; Li, Kai; Chen, Weishan; Zhao, Jianguo

    2018-01-01

    Twisted and coiled actuator (TCA) is a class of recently discovered artificial muscle, which is usually made by twisting and coiling polymer fibers into spring-like structures. It has been widely studied since discovery due to its impressive output characteristics and bright prospects. However, its mathematical models describing the actuation in response to the temperature are still not fully developed. It is known that the large tensile stroke is resulted from the untwisting of the twisted fiber when heated. Thus, the recovered torque during untwisting is a key parameter in the mathematical model. This paper presents a simplified model for the recovered torque of TCA. Finite element method is used for evaluating the thermal stress of the twisted fiber. Based on the results of the finite element analyses, the constitutive equations of twisted fibers are simplified to develop an analytic model of the recovered torque. Finally, the model of the recovered torque is used to predict the deformation of TCA under varying temperatures and validated against experimental results. This work will enhance our understanding of the deformation mechanism of TCAs, which will pave the way for the closed-loop position control.

  9. New dualities and misleading anomaly matchings from outer-automorphism twists

    Energy Technology Data Exchange (ETDEWEB)

    Pal, Sridip; Song, Jaewon [Department of Physics, University of California, San Diego,La Jolla, CA 92093 (United States)

    2017-03-29

    We study four-dimensional N=1,2 superconformal theories in class S obtained by compactifying the 6d N=(2,0) theory on a Riemann surface C with outer-automorphism twist lines. From the pair-of-pants decompositions of C, we find various dual descriptions for the same theory having distinct gauge groups. We show that the various configurations of the twist line give rise to dual descriptions for the identical theory. We compute the ’t Hooft anomaly coefficients and the superconformal indices to test dualities. Surprisingly, we find that the class S theories with twist lines wrapping 1-cycles of C have the identical ’t Hooft anomalies as the ones without the twist line, whereas the superconformal indices differ. This provides a large set of examples where the anomaly matching is insufficient to test dualities.

  10. GoFFish: A Sub-Graph Centric Framework for Large-Scale Graph Analytics1

    Energy Technology Data Exchange (ETDEWEB)

    Simmhan, Yogesh; Kumbhare, Alok; Wickramaarachchi, Charith; Nagarkar, Soonil; Ravi, Santosh; Raghavendra, Cauligi; Prasanna, Viktor

    2014-08-25

    Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ratio and slow convergence of iterative superstep. In this paper we introduce GoFFish a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters. We introduce a sub-graph centric programming abstraction that combines the scalability of a vertex centric approach with the flexibility of shared memory sub-graph computation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation.

  11. Leading twist moments of the neutron structure function F_2n

    Energy Technology Data Exchange (ETDEWEB)

    M. Osipenko; W. Melnitchouk; S. Simula; S. Kulagin; G. Ricco

    2005-10-20

    We perform a global analysis of neutron $F_2^n$ structure function data, obtained by combining proton and deuteron measurements over a large range of kinematics. From these data the lowest moments ($n \\leq 10$) of the leading twist neutron $F_2^n$ structure function are extracted. Particular attention is paid to nuclear effects in the deuteron, which become increasingly important for the higher moments. Our results for the nonsinglet, isovector $p - n$ combination of the leading twist moments are compared with those of available lattice simulations. We also determine the lowest few moments of the higher twist contributions, obtained by subtracting the leading twist from the total structure function, and analyze their isospin dependence.

  12. Intermittent energy bursts and recurrent topological change of a twisting magnetic flux tube

    International Nuclear Information System (INIS)

    Amo, Hiroyoshi; Sato, Tetsuya; Kageyama, Akira.

    1994-09-01

    When continuously twisted, a magnetic flux tube suffers a large kink distortion in the middle part of the tube, like a knot-of-tension instability of a bundle of twisted rubber strings, and reconnection is triggered starting with the twisted field lines and quickly proceeding to the untwisted field lines at the twist-untwist boundary, whereby a giant burst-like energy release takes place. Subsequently, bursts occur intermittently and reconnection advances deeper into the untwisted region. Then, a companion pair of the linked twist-untwist flux tubes reconnect with each other to return to the original axisymmetric tube. The process is thus repeatable. (author)

  13. Graph Theory. 1. Fragmentation of Structural Graphs

    Directory of Open Access Journals (Sweden)

    Lorentz JÄNTSCHI

    2002-12-01

    Full Text Available The investigation of structural graphs has many fields of applications in engineering, especially in applied sciences like as applied chemistry and physics, computer sciences and automation, electronics and telecommunication. The main subject of the paper is to express fragmentation criteria in graph using a new method of investigation: terminal paths. Using terminal paths are defined most of the fragmentation criteria that are in use in molecular topology, but the fields of applications are more generally than that, as I mentioned before. Graphical examples of fragmentation are given for every fragmentation criteria. Note that all fragmentation is made with a computer program that implements a routine for every criterion.[1] A web routine for tracing all terminal paths in graph can be found at the address: http://vl.academicdirect.ro/molecular_topology/tpaths/ [1] M. V. Diudea, I. Gutman, L. Jäntschi, Molecular Topology, Nova Science, Commack, New York, 2001, 2002.

  14. Bond graph model-based fault diagnosis of hybrid systems

    CERN Document Server

    Borutzky, Wolfgang

    2015-01-01

    This book presents a bond graph model-based approach to fault diagnosis in mechatronic systems appropriately represented by a hybrid model. The book begins by giving a survey of the fundamentals of fault diagnosis and failure prognosis, then recalls state-of-art developments referring to latest publications, and goes on to discuss various bond graph representations of hybrid system models, equations formulation for switched systems, and simulation of their dynamic behavior. The structured text: • focuses on bond graph model-based fault detection and isolation in hybrid systems; • addresses isolation of multiple parametric faults in hybrid systems; • considers system mode identification; • provides a number of elaborated case studies that consider fault scenarios for switched power electronic systems commonly used in a variety of applications; and • indicates that bond graph modelling can also be used for failure prognosis. In order to facilitate the understanding of fault diagnosis and the presented...

  15. Graph-theoretic analysis of discrete-phase-space states for condition change detection and quantification of information

    Science.gov (United States)

    Hively, Lee M.

    2014-09-16

    Data collected from devices and human condition may be used to forewarn of critical events such as machine/structural failure or events from brain/heart wave data stroke. By monitoring the data, and determining what values are indicative of a failure forewarning, one can provide adequate notice of the impending failure in order to take preventive measures. This disclosure teaches a computer-based method to convert dynamical numeric data representing physical objects (unstructured data) into discrete-phase-space states, and hence into a graph (structured data) for extraction of condition change.

  16. Using Behavior Over Time Graphs to Spur Systems Thinking Among Public Health Practitioners.

    Science.gov (United States)

    Calancie, Larissa; Anderson, Seri; Branscomb, Jane; Apostolico, Alexsandra A; Lich, Kristen Hassmiller

    2018-02-01

    Public health practitioners can use Behavior Over Time (BOT) graphs to spur discussion and systems thinking around complex challenges. Multiple large systems, such as health care, the economy, and education, affect chronic disease rates in the United States. System thinking tools can build public health practitioners' capacity to understand these systems and collaborate within and across sectors to improve population health. BOT graphs show a variable, or variables (y axis) over time (x axis). Although analyzing trends is not new to public health, drawing BOT graphs, annotating the events and systemic forces that are likely to influence the depicted trends, and then discussing the graphs in a diverse group provides an opportunity for public health practitioners to hear each other's perspectives and creates a more holistic understanding of the key factors that contribute to a trend. We describe how BOT graphs are used in public health, how they can be used to generate group discussion, and how this process can advance systems-level thinking. Then we describe how BOT graphs were used with groups of maternal and child health (MCH) practitioners and partners (N = 101) during a training session to advance their thinking about MCH challenges. Eighty-six percent of the 84 participants who completed an evaluation agreed or strongly agreed that they would use this BOT graph process to engage stakeholders in their home states and jurisdictions. The BOT graph process we describe can be applied to a variety of public health issues and used by practitioners, stakeholders, and researchers.

  17. Introductory graph theory

    CERN Document Server

    Chartrand, Gary

    1984-01-01

    Graph theory is used today in the physical sciences, social sciences, computer science, and other areas. Introductory Graph Theory presents a nontechnical introduction to this exciting field in a clear, lively, and informative style. Author Gary Chartrand covers the important elementary topics of graph theory and its applications. In addition, he presents a large variety of proofs designed to strengthen mathematical techniques and offers challenging opportunities to have fun with mathematics. Ten major topics - profusely illustrated - include: Mathematical Models, Elementary Concepts of Grap

  18. Learning molecular energies using localized graph kernels

    Science.gov (United States)

    Ferré, Grégoire; Haut, Terry; Barros, Kipton

    2017-03-01

    Recent machine learning methods make it possible to model potential energy of atomic configurations with chemical-level accuracy (as calculated from ab initio calculations) and at speeds suitable for molecular dynamics simulation. Best performance is achieved when the known physical constraints are encoded in the machine learning models. For example, the atomic energy is invariant under global translations and rotations; it is also invariant to permutations of same-species atoms. Although simple to state, these symmetries are complicated to encode into machine learning algorithms. In this paper, we present a machine learning approach based on graph theory that naturally incorporates translation, rotation, and permutation symmetries. Specifically, we use a random walk graph kernel to measure the similarity of two adjacency matrices, each of which represents a local atomic environment. This Graph Approximated Energy (GRAPE) approach is flexible and admits many possible extensions. We benchmark a simple version of GRAPE by predicting atomization energies on a standard dataset of organic molecules.

  19. A Transformation Called "Twist"

    Science.gov (United States)

    Hwang, Daniel

    2010-01-01

    The transformations found in secondary mathematics curriculum are typically limited to stretches and translations (e.g., ACARA, 2010). Advanced students may find the transformation, twist, to be of further interest. As most available resources are written for professional-level readers, this article is intended to be an introduction accessible to…

  20. Generation of Individual Whole-Brain Atlases With Resting-State fMRI Data Using Simultaneous Graph Computation and Parcellation.

    Science.gov (United States)

    Wang, J; Hao, Z; Wang, H

    2018-01-01

    The human brain can be characterized as functional networks. Therefore, it is important to subdivide the brain appropriately in order to construct reliable networks. Resting-state functional connectivity-based parcellation is a commonly used technique to fulfill this goal. Here we propose a novel individual subject-level parcellation approach based on whole-brain resting-state functional magnetic resonance imaging (fMRI) data. We first used a supervoxel method known as simple linear iterative clustering directly on resting-state fMRI time series to generate supervoxels, and then combined similar supervoxels to generate clusters using a clustering method known as graph-without-cut (GWC). The GWC approach incorporates spatial information and multiple features of the supervoxels by energy minimization, simultaneously yielding an optimal graph and brain parcellation. Meanwhile, it theoretically guarantees that the actual cluster number is exactly equal to the initialized cluster number. By comparing the results of the GWC approach and those of the random GWC approach, we demonstrated that GWC does not rely heavily on spatial structures, thus avoiding the challenges encountered in some previous whole-brain parcellation approaches. In addition, by comparing the GWC approach to two competing approaches, we showed that GWC achieved better parcellation performances in terms of different evaluation metrics. The proposed approach can be used to generate individualized brain atlases for applications related to cognition, development, aging, disease, personalized medicine, etc. The major source codes of this study have been made publicly available at https://github.com/yuzhounh/GWC.

  1. Stability of coupled tearing and twisting modes in tokamaks

    International Nuclear Information System (INIS)

    Fitzpatrick, R.

    1994-03-01

    A dispersion relation is derived for resistive modes of arbitrary parity in a tokamak plasma. At low mode amplitude, tearing and twisting modes which have nonideal MHD behavior at only one rational surface at a time in the plasma are decoupled via sheared rotation and diamagnetic flows. At higher amplitude, more unstable open-quote compound close-quote modes develop which have nonideal behavior simultaneously at many surfaces. Such modes possess tearing parity layers at some of the nonideal surfaces, and twisting parity layers at others, but mixed parity layers are generally disallowed. At low mode number, open-quote compound close-quote modes are likely to have tearing parity layers at all of the nonideal surfaces in a very low-β plasma, but twisting parity layers become more probable as the plasma β is increased. At high mode number, unstable twisting modes which exceed a critical amplitude drive conventional magnetic island chains on alternate rational surfaces, to form an interlocking structure in which the O-points and X-points of neighboring chains line up

  2. Creating more effective graphs

    CERN Document Server

    Robbins, Naomi B

    2012-01-01

    A succinct and highly readable guide to creating effective graphs The right graph can be a powerful tool for communicating information, improving a presentation, or conveying your point in print. If your professional endeavors call for you to present data graphically, here's a book that can help you do it more effectively. Creating More Effective Graphs gives you the basic knowledge and techniques required to choose and create appropriate graphs for a broad range of applications. Using real-world examples everyone can relate to, the author draws on her years of experience in gr

  3. Graph Compression by BFS

    Directory of Open Access Journals (Sweden)

    Alberto Apostolico

    2009-08-01

    Full Text Available The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods.

  4. GSMNet: A Hierarchical Graph Model for Moving Objects in Networks

    Directory of Open Access Journals (Sweden)

    Hengcai Zhang

    2017-03-01

    Full Text Available Existing data models for moving objects in networks are often limited by flexibly controlling the granularity of representing networks and the cost of location updates and do not encompass semantic information, such as traffic states, traffic restrictions and social relationships. In this paper, we aim to fill the gap of traditional network-constrained models and propose a hierarchical graph model called the Geo-Social-Moving model for moving objects in Networks (GSMNet that adopts four graph structures, RouteGraph, SegmentGraph, ObjectGraph and MoveGraph, to represent the underlying networks, trajectories and semantic information in an integrated manner. The bulk of user-defined data types and corresponding operators is proposed to handle moving objects and answer a new class of queries supporting three kinds of conditions: spatial, temporal and semantic information. Then, we develop a prototype system with the native graph database system Neo4Jto implement the proposed GSMNet model. In the experiment, we conduct the performance evaluation using simulated trajectories generated from the BerlinMOD (Berlin Moving Objects Database benchmark and compare with the mature MOD system Secondo. The results of 17 benchmark queries demonstrate that our proposed GSMNet model has strong potential to reduce time-consuming table join operations an d shows remarkable advantages with regard to representing semantic information and controlling the cost of location updates.

  5. Graphing Inequalities, Connecting Meaning

    Science.gov (United States)

    Switzer, J. Matt

    2014-01-01

    Students often have difficulty with graphing inequalities (see Filloy, Rojano, and Rubio 2002; Drijvers 2002), and J. Matt Switzer's students were no exception. Although students can produce graphs for simple inequalities, they often struggle when the format of the inequality is unfamiliar. Even when producing a correct graph of an…

  6. Fuzzy Graph Language Recognizability

    OpenAIRE

    Kalampakas , Antonios; Spartalis , Stefanos; Iliadis , Lazaros

    2012-01-01

    Part 5: Fuzzy Logic; International audience; Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.

  7. Presurgery resting-state local graph-theory measures predict neurocognitive outcomes after brain surgery in temporal lobe epilepsy.

    Science.gov (United States)

    Doucet, Gaelle E; Rider, Robert; Taylor, Nathan; Skidmore, Christopher; Sharan, Ashwini; Sperling, Michael; Tracy, Joseph I

    2015-04-01

    This study determined the ability of resting-state functional connectivity (rsFC) graph-theory measures to predict neurocognitive status postsurgery in patients with temporal lobe epilepsy (TLE) who underwent anterior temporal lobectomy (ATL). A presurgical resting-state functional magnetic resonance imaging (fMRI) condition was collected in 16 left and 16 right TLE patients who underwent ATL. In addition, patients received neuropsychological testing pre- and postsurgery in verbal and nonverbal episodic memory, language, working memory, and attention domains. Regarding the functional data, we investigated three graph-theory properties (local efficiency, distance, and participation), measuring segregation, integration and centrality, respectively. These measures were only computed in regions of functional relevance to the ictal pathology, or the cognitive domain. Linear regression analyses were computed to predict the change in each neurocognitive domain. Our analyses revealed that cognitive outcome was successfully predicted with at least 68% of the variance explained in each model, for both TLE groups. The only model not significantly predictive involved nonverbal episodic memory outcome in right TLE. Measures involving the healthy hippocampus were the most common among the predictors, suggesting that enhanced integration of this structure with the rest of the brain may improve cognitive outcomes. Regardless of TLE group, left inferior frontal regions were the best predictors of language outcome. Working memory outcome was predicted mostly by right-sided regions, in both groups. Overall, the results indicated our integration measure was the most predictive of neurocognitive outcome. In contrast, our segregation measure was the least predictive. This study provides evidence that presurgery rsFC measures may help determine neurocognitive outcomes following ATL. The results have implications for refining our understanding of compensatory reorganization and predicting

  8. Quantitative graph theory mathematical foundations and applications

    CERN Document Server

    Dehmer, Matthias

    2014-01-01

    The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as:Comparative approaches (graph similarity or distance)Graph measures to characterize graphs quantitat

  9. Dynamic Representations of Sparse Graphs

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Fagerberg, Rolf

    1999-01-01

    We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....

  10. Spectral fluctuations of quantum graphs

    International Nuclear Information System (INIS)

    Pluhař, Z.; Weidenmüller, H. A.

    2014-01-01

    We prove the Bohigas-Giannoni-Schmit conjecture in its most general form for completely connected simple graphs with incommensurate bond lengths. We show that for graphs that are classically mixing (i.e., graphs for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap), the generating functions for all (P,Q) correlation functions for both closed and open graphs coincide (in the limit of infinite graph size) with the corresponding expressions of random-matrix theory, both for orthogonal and for unitary symmetry

  11. Multiple graph regularized protein domain ranking.

    Science.gov (United States)

    Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

    2012-11-19

    Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

  12. Predicting conversion from MCI to AD using resting-state fMRI, graph theoretical approach and SVM.

    Science.gov (United States)

    Hojjati, Seyed Hani; Ebrahimzadeh, Ata; Khazaee, Ali; Babajani-Feremi, Abbas

    2017-04-15

    We investigated identifying patients with mild cognitive impairment (MCI) who progress to Alzheimer's disease (AD), MCI converter (MCI-C), from those with MCI who do not progress to AD, MCI non-converter (MCI-NC), based on resting-state fMRI (rs-fMRI). Graph theory and machine learning approach were utilized to predict progress of patients with MCI to AD using rs-fMRI. Eighteen MCI converts (average age 73.6 years; 11 male) and 62 age-matched MCI non-converters (average age 73.0 years, 28 male) were included in this study. We trained and tested a support vector machine (SVM) to classify MCI-C from MCI-NC using features constructed based on the local and global graph measures. A novel feature selection algorithm was developed and utilized to select an optimal subset of features. Using subset of optimal features in SVM, we classified MCI-C from MCI-NC with an accuracy, sensitivity, specificity, and the area under the receiver operating characteristic (ROC) curve of 91.4%, 83.24%, 90.1%, and 0.95, respectively. Furthermore, results of our statistical analyses were used to identify the affected brain regions in AD. To the best of our knowledge, this is the first study that combines the graph measures (constructed based on rs-fMRI) with machine learning approach and accurately classify MCI-C from MCI-NC. Results of this study demonstrate potential of the proposed approach for early AD diagnosis and demonstrate capability of rs-fMRI to predict conversion from MCI to AD by identifying affected brain regions underlying this conversion. Copyright © 2017 Elsevier B.V. All rights reserved.

  13. Design optimization for active twist rotor blades

    Science.gov (United States)

    Mok, Ji Won

    This dissertation introduces the process of optimizing active twist rotor blades in the presence of embedded anisotropic piezo-composite actuators. Optimum design of active twist blades is a complex task, since it involves a rich design space with tightly coupled design variables. The study presents the development of an optimization framework for active helicopter rotor blade cross-sectional design. This optimization framework allows for exploring a rich and highly nonlinear design space in order to optimize the active twist rotor blades. Different analytical components are combined in the framework: cross-sectional analysis (UM/VABS), an automated mesh generator, a beam solver (DYMORE), a three-dimensional local strain recovery module, and a gradient based optimizer within MATLAB. Through the mathematical optimization problem, the static twist actuation performance of a blade is maximized while satisfying a series of blade constraints. These constraints are associated with locations of the center of gravity and elastic axis, blade mass per unit span, fundamental rotating blade frequencies, and the blade strength based on local three-dimensional strain fields under worst loading conditions. Through pre-processing, limitations of the proposed process have been studied. When limitations were detected, resolution strategies were proposed. These include mesh overlapping, element distortion, trailing edge tab modeling, electrode modeling and foam implementation of the mesh generator, and the initial point sensibility of the current optimization scheme. Examples demonstrate the effectiveness of this process. Optimization studies were performed on the NASA/Army/MIT ATR blade case. Even though that design was built and shown significant impact in vibration reduction, the proposed optimization process showed that the design could be improved significantly. The second example, based on a model scale of the AH-64D Apache blade, emphasized the capability of this framework to

  14. Acyclicity in edge-colored graphs

    DEFF Research Database (Denmark)

    Gutin, Gregory; Jones, Mark; Sheng, Bin

    2017-01-01

    A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type...

  15. κ-Minkowski spacetime as the result of Jordanian twist deformation

    International Nuclear Information System (INIS)

    Borowiec, A.; Pachol, A.

    2009-01-01

    Two one-parameter families of twists providing κ-Minkowski * product deformed spacetime are considered: Abelian and Jordanian. We compare the derivation of quantum Minkowski space from two perspectives. The first one is the Hopf module algebra point of view, which is strictly related with Drinfeld's twisting tensor technique. The other one relies on an appropriate extension of ''deformed realizations'' of nondeformed Lorentz algebra by the quantum Minkowski algebra. This extension turns out to be de Sitter Lie algebra. We show the way both approaches are related. The second path allows us to calculate deformed dispersion relations for toy models ensuing from different twist parameters. In the Abelian case, one recovers κ-Poincare dispersion relations having numerous applications in doubly special relativity. Jordanian twists provide a new type of dispersion relations which in the minimal case (related to Weyl-Poincare algebra) takes an energy-dependent linear mass deformation form.

  16. ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS

    OpenAIRE

    Said Broumi; Mohamed Talea; Assia Bakali; Florentin Smarandache

    2016-01-01

    In this article, we combine the concept of bipolar neutrosophic set and graph theory. We introduce the notions of bipolar single valued neutrosophic graphs, strong bipolar single valued neutrosophic graphs, complete bipolar single valued neutrosophic graphs, regular bipolar single valued neutrosophic graphs and investigate some of their related properties.

  17. Practical graph mining with R

    CERN Document Server

    Hendrix, William; Jenkins, John; Padmanabhan, Kanchana; Chakraborty, Arpan

    2014-01-01

    Practical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting patterns from graph data. It covers many basic and advanced techniques for the identification of anomalous or frequently recurring patterns in a graph, the discovery of groups or clusters of nodes that share common patterns of attributes and relationships, the extraction of patterns that distinguish one category of graphs from another, and the use of those patterns to predict the category of new graphs. Hands-On Application of Graph Data Mining Each chapter in the book focuses on a graph mining task, such as link analysis, cluster analysis, and classification. Through applications using real data sets, the book demonstrates how computational techniques can help solve real-world problems. The applications covered include network intrusion detection, tumor cell diagnostics, face recognition, predictive toxicology, mining metabolic and protein-protein interaction networks, and community detection in social networks. De...

  18. Quantum walks of two interacting particles on percolation graphs

    Science.gov (United States)

    Siloi, Ilaria; Benedetti, Claudia; Piccinini, Enrico; Paris, Matteo G. A.; Bordone, Paolo

    2017-10-01

    We address the dynamics of two indistinguishable interacting particles moving on a dynamical percolation graph, i.e., a graph where the edges are independent random telegraph processes whose values jump between 0 and 1, thus mimicking percolation. The interplay between the particle interaction strength, initial state and the percolation rate determine different dynamical regimes for the walkers. We show that, whenever the walkers are initially localised within the interaction range, fast noise enhances the particle spread compared to the noiseless case.

  19. Performance improvement of small-scale rotors by passive blade twist control

    OpenAIRE

    Lv, Peng; Prothin, Sebastien; Mohd Zawawi, Fazila; Bénard, Emmanuel; Morlier, Joseph; Moschetta, Jean-Marc

    2015-01-01

    A passive twist control is proposed as an adaptive way to maximize the overall efficiency of the small-scale rotor blade for multifunctional aircrafts. Incorporated into a database of airfoil characteristics, Blade Element Momentum Theory is implemented to obtain the blade optimum twist rates for hover and forward flight. In order to realize the required torsion of blade between hover and forward flight, glass/epoxy laminate blade is proposed based on Centrifugal Force Induced Twist concept. ...

  20. Unique CCT repeats mediate transcription of the TWIST1 gene in mesenchymal cell lines

    International Nuclear Information System (INIS)

    Ohkuma, Mizue; Funato, Noriko; Higashihori, Norihisa; Murakami, Masanori; Ohyama, Kimie; Nakamura, Masataka

    2007-01-01

    TWIST1, a basic helix-loop-helix transcription factor, plays critical roles in embryo development, cancer metastasis and mesenchymal progenitor differentiation. Little is known about transcriptional regulation of TWIST1 expression. Here we identified DNA sequences responsible for TWIST1 expression in mesenchymal lineage cell lines. Reporter assays with TWIST1 promoter mutants defined the -102 to -74 sequences that are essential for TWIST1 expression in human and mouse mesenchymal cell lines. Tandem repeats of CCT, but not putative CREB and NF-κB sites in the sequences substantially supported activity of the TWIST1 promoter. Electrophoretic mobility shift assay demonstrated that the DNA sequences with the CCT repeats formed complexes with nuclear factors, containing, at least, Sp1 and Sp3. These results suggest critical implication of the CCT repeats in association with Sp1 and Sp3 factors in sustaining expression of the TWIST1 gene in mesenchymal cells

  1. A seminar on graph theory

    CERN Document Server

    Harary, Frank

    2015-01-01

    Presented in 1962-63 by experts at University College, London, these lectures offer a variety of perspectives on graph theory. Although the opening chapters form a coherent body of graph theoretic concepts, this volume is not a text on the subject but rather an introduction to the extensive literature of graph theory. The seminar's topics are geared toward advanced undergraduate students of mathematics.Lectures by this volume's editor, Frank Harary, include ""Some Theorems and Concepts of Graph Theory,"" ""Topological Concepts in Graph Theory,"" ""Graphical Reconstruction,"" and other introduc

  2. Valve-aided twisted Savonius rotor

    Energy Technology Data Exchange (ETDEWEB)

    Jaya Rajkumar, M.; Saha, U.K.

    2006-05-15

    Accessories, such as end plates, deflecting plates, shielding and guide vanes, may increase the power of a Savonius rotor, but make the system structurally complex. In such cases, the rotor can develop a relatively large torque at small rotational speeds and is cheap to build, however it harnesses only a small fraction of the incident wind energy. Another proposition for increasing specific output is to place non-return valves inside the concave side of the blades. Such methods have been studied experimentally with a twisted-blade Thus improving a Savonius rotor's energy capture. This new concept has been named as the 'Valve-Aided Twisted Savonius'rotor. Tests were conducted in a low-speed wind tunnel to evaluate performance. This mechanism is found to be independent of flow direction, and shows potential for large machines. [Author].

  3. Twisting failure of centrally loaded open-section columns in the elastic range

    Science.gov (United States)

    Kappus, Robert

    1938-01-01

    In the following report a complete theory of twisting failure by the energy method is developed, based on substantially the same assumptions as those employed by Wagner and Bleich. Problems treated in detail are: the stress and strain condition under St. Venant twist and in twist with axial constraint; the concept of shear center and the energy method for problems of elastic stability.

  4. Proceedings 3rd Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2014)

    DEFF Research Database (Denmark)

    2014-01-01

    is to foster the convergence on research interests from several communities dealing with graph analysis in all its forms in computer science, with a particular attention to software development and analysis. Graphs are used to represent data and processes in many application areas, and they are subjected......These are the proceedings of the Third Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2014), which took place on April 5, 2014 in Grenoble, France, as a satellite event of the 17th European Joint Conferences on Theory and Practice of Software (ETAPS 2014). The aim of GRAPHITE...... to various computational algorithms in order to analyze them. Just restricting the attention to the analysis of software, graph analysis algorithms are used, for instance, to verify properties using model checking techniques that explore the system's state space graph or static analysis techniques based...

  5. The graph representation approach to topological field theory in 2 + 1 dimensions

    International Nuclear Information System (INIS)

    Martin, S.P.

    1991-02-01

    An alternative definition of topological quantum field theory in 2+1 dimensions is discussed. The fundamental objects in this approach are not gauge fields as in the usual approach, but non-local observables associated with graphs. The classical theory of graphs is defined by postulating a simple diagrammatic rule for computing the Poisson bracket of any two graphs. The theory is quantized by exhibiting a quantum deformation of the classical Poisson bracket algebra, which is realized as a commutator algebra on a Hilbert space of states. The wavefunctions in this ''graph representation'' approach are functionals on an appropriate set of graphs. This is in contrast to the usual ''connection representation'' approach in which the theory is defined in terms of a gauge field and the wavefunctions are functionals on the space of flat spatial connections modulo gauge transformations

  6. Uniform Single Valued Neutrosophic Graphs

    Directory of Open Access Journals (Sweden)

    S. Broumi

    2017-09-01

    Full Text Available In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.

  7. Extremal graph theory

    CERN Document Server

    Bollobas, Bela

    2004-01-01

    The ever-expanding field of extremal graph theory encompasses a diverse array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume, based on a series of lectures delivered to graduate students at the University of Cambridge, presents a concise yet comprehensive treatment of extremal graph theory.Unlike most graph theory treatises, this text features complete proofs for almost all of its results. Further insights into theory are provided by the numerous exercises of varying degrees of difficulty that accompany each chapter. A

  8. Multiple graph regularized protein domain ranking

    KAUST Repository

    Wang, Jim Jing-Yan

    2012-11-19

    Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.

  9. Multiple graph regularized protein domain ranking

    KAUST Repository

    Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

    2012-01-01

    Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.

  10. Multiple graph regularized protein domain ranking

    Directory of Open Access Journals (Sweden)

    Wang Jim

    2012-11-01

    Full Text Available Abstract Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

  11. Canonical Labelling of Site Graphs

    Directory of Open Access Journals (Sweden)

    Nicolas Oury

    2013-06-01

    Full Text Available We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft's partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with "many" automorphisms, and the partition refinement algorithm runs in sub-quadratic time for graphs with "few" bisimulation equivalences. This suite of algorithms was chosen based on the expectation that graphs fall in one of those two categories. If that is the case, a combined algorithm runs in sub-quadratic worst case time. Whether this expectation is reasonable remains an interesting open problem.

  12. Benchmarking Measures of Network Controllability on Canonical Graph Models

    Science.gov (United States)

    Wu-Yan, Elena; Betzel, Richard F.; Tang, Evelyn; Gu, Shi; Pasqualetti, Fabio; Bassett, Danielle S.

    2018-03-01

    The control of networked dynamical systems opens the possibility for new discoveries and therapies in systems biology and neuroscience. Recent theoretical advances provide candidate mechanisms by which a system can be driven from one pre-specified state to another, and computational approaches provide tools to test those mechanisms in real-world systems. Despite already having been applied to study network systems in biology and neuroscience, the practical performance of these tools and associated measures on simple networks with pre-specified structure has yet to be assessed. Here, we study the behavior of four control metrics (global, average, modal, and boundary controllability) on eight canonical graphs (including Erdős-Rényi, regular, small-world, random geometric, Barábasi-Albert preferential attachment, and several modular networks) with different edge weighting schemes (Gaussian, power-law, and two nonparametric distributions from brain networks, as examples of real-world systems). We observe that differences in global controllability across graph models are more salient when edge weight distributions are heavy-tailed as opposed to normal. In contrast, differences in average, modal, and boundary controllability across graph models (as well as across nodes in the graph) are more salient when edge weight distributions are less heavy-tailed. Across graph models and edge weighting schemes, average and modal controllability are negatively correlated with one another across nodes; yet, across graph instances, the relation between average and modal controllability can be positive, negative, or nonsignificant. Collectively, these findings demonstrate that controllability statistics (and their relations) differ across graphs with different topologies and that these differences can be muted or accentuated by differences in the edge weight distributions. More generally, our numerical studies motivate future analytical efforts to better understand the mathematical

  13. Measurement of curvature and twist of a deformed object using digital holography

    International Nuclear Information System (INIS)

    Chen Wen; Quan Chenggen; Cho Jui Tay

    2008-01-01

    Measurement of curvature and twist is an important aspect in the study of object deformation. In recent years, several methods have been proposed to determine curvature and twist of a deformed object using digital shearography. Here we propose a novel method to determine the curvature and twist of a deformed object using digital holography and a complex phasor. A sine/cosine transformation method and two-dimensional short time Fourier transform are proposed subsequently to process the wrapped phase maps. It is shown that high-quality phase maps corresponding to curvature and twist can be obtained. An experiment is conducted to demonstrate the validity of the proposed method

  14. Twisted quantum doubles

    Directory of Open Access Journals (Sweden)

    Daijiro Fukuda

    2004-01-01

    Full Text Available Using diagrammatic pictures of tensor contractions, we consider a Hopf algebra (Aop⊗ℛλA** twisted by an element ℛλ∈A*⊗Aop corresponding to a Hopf algebra morphism λ:A→A. We show that this Hopf algebra is quasitriangular with the universal R-matrix coming from ℛλ when λ2=idA, generalizing the quantum double construction which corresponds to the case λ=idA.

  15. Faucet: streaming de novo assembly graph construction.

    Science.gov (United States)

    Rozov, Roye; Goldshlager, Gil; Halperin, Eran; Shamir, Ron

    2018-01-01

    We present Faucet, a two-pass streaming algorithm for assembly graph construction. Faucet builds an assembly graph incrementally as each read is processed. Thus, reads need not be stored locally, as they can be processed while downloading data and then discarded. We demonstrate this functionality by performing streaming graph assembly of publicly available data, and observe that the ratio of disk use to raw data size decreases as coverage is increased. Faucet pairs the de Bruijn graph obtained from the reads with additional meta-data derived from them. We show these metadata-coverage counts collected at junction k-mers and connections bridging between junction pairs-contain most salient information needed for assembly, and demonstrate they enable cleaning of metagenome assembly graphs, greatly improving contiguity while maintaining accuracy. We compared Fauceted resource use and assembly quality to state of the art metagenome assemblers, as well as leading resource-efficient genome assemblers. Faucet used orders of magnitude less time and disk space than the specialized metagenome assemblers MetaSPAdes and Megahit, while also improving on their memory use; this broadly matched performance of other assemblers optimizing resource efficiency-namely, Minia and LightAssembler. However, on metagenomes tested, Faucet,o outputs had 14-110% higher mean NGA50 lengths compared with Minia, and 2- to 11-fold higher mean NGA50 lengths compared with LightAssembler, the only other streaming assembler available. Faucet is available at https://github.com/Shamir-Lab/Faucet. rshamir@tau.ac.il or eranhalperin@gmail.com. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press.

  16. Structural and electronic transformation in low-angle twisted bilayer graphene

    Science.gov (United States)

    Gargiulo, Fernando; Yazyev, Oleg V.

    2018-01-01

    Experiments on bilayer graphene unveiled a fascinating realization of stacking disorder where triangular domains with well-defined Bernal stacking are delimited by a hexagonal network of strain solitons. Here we show by means of numerical simulations that this is a consequence of a structural transformation of the moiré pattern inherent to twisted bilayer graphene taking place at twist angles θ below a crossover angle θ\\star=1.2\\circ . The transformation is governed by the interplay between the interlayer van der Waals interaction and the in-plane strain field, and is revealed by a change in the functional form of the twist energy density. This transformation unveils an electronic regime characteristic of vanishing twist angles in which the charge density converges, though not uniformly, to that of ideal bilayer graphene with Bernal stacking. On the other hand, the stacking domain boundaries form a distinct charge density pattern that provides the STM signature of the hexagonal solitonic network.

  17. Domination criticality in product graphs

    Directory of Open Access Journals (Sweden)

    M.R. Chithra

    2015-07-01

    Full Text Available A connected dominating set is an important notion and has many applications in routing and management of networks. Graph products have turned out to be a good model of interconnection networks. This motivated us to study the Cartesian product of graphs G with connected domination number, γc(G=2,3 and characterize such graphs. Also, we characterize the k−γ-vertex (edge critical graphs and k−γc-vertex (edge critical graphs for k=2,3 where γ denotes the domination number of G. We also discuss the vertex criticality in grids.

  18. Graph Creation, Visualisation and Transformation

    Directory of Open Access Journals (Sweden)

    Maribel Fernández

    2010-03-01

    Full Text Available We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph rewriting systems. The editor, called GraphPaper, allows users to create and edit graphs and their transformation rules using an intuitive user interface. The editor uses the functionalities of the TULIP system, which gives us access to a wealth of visualisation algorithms. Interaction nets are not only a formalism for the specification of graphs, but also a rewrite-based computation model. We discuss graph rewriting strategies and a language to express them in order to perform strategic interaction net rewriting.

  19. Innovation of Methods for Measurement and Modelling of Twisted Pair Parameters

    Directory of Open Access Journals (Sweden)

    Lukas Cepa

    2011-01-01

    Full Text Available The goal of this paper is to optimize a measurement methodology for the most accurate broadband modelling of characteristic impedance and other parameters for twisted pairs. Measured values and theirs comparison is presented in this article. Automated measurement facility was implemented at the Department of telecommunication of Faculty of electrical engineering of Czech technical university in Prague. Measurement facility contains RF switches allowing measurements up to 300 MHz or 1GHz. Measured twisted pair’s parameters can be obtained by measurement but for purposes of fundamental characteristics modelling is useful to define functions that model the properties of the twisted pair. Its primary and secondary parameters depend mostly on the frequency. For twisted pair deployment, we are interested in a frequency band range from 1 MHz to 100 MHz.

  20. Unconfined twist : a simple method to prepare ultrafine grained metallic materials.

    Energy Technology Data Exchange (ETDEWEB)

    Zhao, Y. (Yonghao); Liao, Xiaozhou; Zhu, Y. T. (Yuntian Theodore)

    2004-01-01

    A new simple method - unconfined twist was employed to prepare ultrafine grained (UFG) Fe,wire. A coarse grained (CG) Fe wire with a diameter of 0.85 mm was fixed at one end, and twisted at the other end. After maximum twist before fracture, in the cross-sectional plane, concentrically deformed layers with a width of several micrometers formed surrounding the center axis of the wire. The near-surface deformed layers consist of lamella grains with a width in submicrometer range. In the longitudinal plane, deformed bands (with a width of several micrometers) formed uniformly, which were composed of lamella crystallites (with a width in submicrometer range). The tensile yield strength and ultimate strength of the twisted Fe wire are increased by about 150% and 100% compared with the values of its CG counterpart.

  1. Graph Colouring Algorithms

    DEFF Research Database (Denmark)

    Husfeldt, Thore

    2015-01-01

    This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...

  2. The fascinating world of graph theory

    CERN Document Server

    Benjamin, Arthur; Zhang, Ping

    2015-01-01

    Graph theory goes back several centuries and revolves around the study of graphs-mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematics-and some of its most famous problems. The Fascinating World of Graph Theory explores the questions and puzzles that have been studied, and often solved, through graph theory. This book looks at graph theory's development and the vibrant individuals responsible for the field's growth. Introducin

  3. Classical dynamics on graphs

    International Nuclear Information System (INIS)

    Barra, F.; Gaspard, P.

    2001-01-01

    We consider the classical evolution of a particle on a graph by using a time-continuous Frobenius-Perron operator that generalizes previous propositions. In this way, the relaxation rates as well as the chaotic properties can be defined for the time-continuous classical dynamics on graphs. These properties are given as the zeros of some periodic-orbit zeta functions. We consider in detail the case of infinite periodic graphs where the particle undergoes a diffusion process. The infinite spatial extension is taken into account by Fourier transforms that decompose the observables and probability densities into sectors corresponding to different values of the wave number. The hydrodynamic modes of diffusion are studied by an eigenvalue problem of a Frobenius-Perron operator corresponding to a given sector. The diffusion coefficient is obtained from the hydrodynamic modes of diffusion and has the Green-Kubo form. Moreover, we study finite but large open graphs that converge to the infinite periodic graph when their size goes to infinity. The lifetime of the particle on the open graph is shown to correspond to the lifetime of a system that undergoes a diffusion process before it escapes

  4. Groupies in multitype random graphs

    OpenAIRE

    Shang, Yilun

    2016-01-01

    A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erd?s-R?nyi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.

  5. Fibonacci number of the tadpole graph

    Directory of Open Access Journals (Sweden)

    Joe DeMaio

    2014-10-01

    Full Text Available In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2 and the Fibonacci number of the cycle graph Cn is the Lucas number Ln. The tadpole graph Tn,k is the graph created by concatenating Cn and Pk with an edge from any vertex of Cn to a pendant of Pk for integers n=3 and k=0. This paper establishes formulae and identities for the Fibonacci number of the tadpole graph via algebraic and combinatorial methods.

  6. Effective potentials for twisted fields

    International Nuclear Information System (INIS)

    Banach, R.

    1981-01-01

    Minus the density of the effective action, evaluated at the lowest eigenfunction of the (space-time) derivative part of the second (functional) derivative of the classical action, is proposed as a generalised definition of the effective potential, applicable to twisted as well as untwisted sectors of a field theory. The proposal is corroborated by several specific calculations in the twisted sector, namely phi 4 theory (real and complex) and wrong-sign-Gordon theory, in an Einstein cylinder, where the exact integrability of the static solutions confirms the effective potential predictions. Both models exhibit a phase transition, which the effective potential locates, and the one-loop quantum shift in the critical radius is computed for the real phi 4 model, being a universal result. Topological mass generation at the classical level is pointed out, and the exactness of the classical effective potential approximation for complex phi 4 is discussed. (author)

  7. On characterizing terrain visibility graphs

    Directory of Open Access Journals (Sweden)

    William Evans

    2015-06-01

    Full Text Available A terrain is an $x$-monotone polygonal line in the $xy$-plane. Two vertices of a terrain are mutually visible if and only if there is no terrain vertex on or above the open line segment connecting them. A graph whose vertices represent terrain vertices and whose edges represent mutually visible pairs of terrain vertices is called a terrain visibility graph. We would like to find properties that are both necessary and sufficient for a graph to be a terrain visibility graph; that is, we would like to characterize terrain visibility graphs.Abello et al. [Discrete and Computational Geometry, 14(3:331--358, 1995] showed that all terrain visibility graphs are “persistent”. They showed that the visibility information of a terrain point set implies some ordering requirements on the slopes of the lines connecting pairs of points in any realization, and as a step towards showing sufficiency, they proved that for any persistent graph $M$ there is a total order on the slopes of the (pseudo lines in a generalized configuration of points whose visibility graph is $M$.We give a much simpler proof of this result by establishing an orientation to every triple of vertices, reflecting some slope ordering requirements that are consistent with $M$ being the visibility graph, and prove that these requirements form a partial order. We give a faster algorithm to construct a total order on the slopes. Our approach attempts to clarify the implications of the graph theoretic properties on the ordering of the slopes, and may be interpreted as defining properties on an underlying oriented matroid that we show is a restricted type of $3$-signotope.

  8. Network reconstruction via graph blending

    Science.gov (United States)

    Estrada, Rolando

    2016-05-01

    Graphs estimated from empirical data are often noisy and incomplete due to the difficulty of faithfully observing all the components (nodes and edges) of the true graph. This problem is particularly acute for large networks where the number of components may far exceed available surveillance capabilities. Errors in the observed graph can render subsequent analyses invalid, so it is vital to develop robust methods that can minimize these observational errors. Errors in the observed graph may include missing and spurious components, as well fused (multiple nodes are merged into one) and split (a single node is misinterpreted as many) nodes. Traditional graph reconstruction methods are only able to identify missing or spurious components (primarily edges, and to a lesser degree nodes), so we developed a novel graph blending framework that allows us to cast the full estimation problem as a simple edge addition/deletion problem. Armed with this framework, we systematically investigate the viability of various topological graph features, such as the degree distribution or the clustering coefficients, and existing graph reconstruction methods for tackling the full estimation problem. Our experimental results suggest that incorporating any topological feature as a source of information actually hinders reconstruction accuracy. We provide a theoretical analysis of this phenomenon and suggest several avenues for improving this estimation problem.

  9. Quantum communication through a spin ring with twisted boundary conditions

    International Nuclear Information System (INIS)

    Bose, S.; Jin, B.-Q.; Korepin, V.E.

    2005-01-01

    We investigate quantum communication between the sites of a spin ring with twisted boundary conditions. Such boundary conditions can be achieved by a magnetic flux through the ring. We find that a nonzero twist can improve communication through finite odd-numbered rings and enable high-fidelity multiparty quantum communication through spin rings (working near perfectly for rings of five and seven spins). We show that in certain cases, the twist results in the complete blockage of quantum-information flow to a certain site of the ring. This effect can be exploited to interface and entangle a flux qubit and a spin qubit without embedding the latter in a magnetic field

  10. Generation of Individual Whole-Brain Atlases With Resting-State fMRI Data Using Simultaneous Graph Computation and Parcellation

    Directory of Open Access Journals (Sweden)

    J. Wang

    2018-05-01

    Full Text Available The human brain can be characterized as functional networks. Therefore, it is important to subdivide the brain appropriately in order to construct reliable networks. Resting-state functional connectivity-based parcellation is a commonly used technique to fulfill this goal. Here we propose a novel individual subject-level parcellation approach based on whole-brain resting-state functional magnetic resonance imaging (fMRI data. We first used a supervoxel method known as simple linear iterative clustering directly on resting-state fMRI time series to generate supervoxels, and then combined similar supervoxels to generate clusters using a clustering method known as graph-without-cut (GWC. The GWC approach incorporates spatial information and multiple features of the supervoxels by energy minimization, simultaneously yielding an optimal graph and brain parcellation. Meanwhile, it theoretically guarantees that the actual cluster number is exactly equal to the initialized cluster number. By comparing the results of the GWC approach and those of the random GWC approach, we demonstrated that GWC does not rely heavily on spatial structures, thus avoiding the challenges encountered in some previous whole-brain parcellation approaches. In addition, by comparing the GWC approach to two competing approaches, we showed that GWC achieved better parcellation performances in terms of different evaluation metrics. The proposed approach can be used to generate individualized brain atlases for applications related to cognition, development, aging, disease, personalized medicine, etc. The major source codes of this study have been made publicly available at https://github.com/yuzhounh/GWC.

  11. Groupies in multitype random graphs.

    Science.gov (United States)

    Shang, Yilun

    2016-01-01

    A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.

  12. An aeroelastic analysis of helicopter rotor blades incorporating piezoelectric fiber composite twist actuation

    Science.gov (United States)

    Wilkie, W. Keats; Park, K. C.

    1996-01-01

    A simple aeroelastic analysis of a helicopter rotor blade incorporating embedded piezoelectric fiber composite, interdigitated electrode blade twist actuators is described. The analysis consist of a linear torsion and flapwise bending model coupled with a nonlinear ONERA based unsteady aerodynamics model. A modified Galerkin procedure is performed upon the rotor blade partial differential equations of motion to develop a system of ordinary differential equations suitable for numerical integration. The twist actuation responses for three conceptual full-scale blade designs with realistic constraints on blade mass are numerically evaluated using the analysis. Numerical results indicate that useful amplitudes of nonresonant elastic twist, on the order of one to two degrees, are achievable under one-g hovering flight conditions for interdigitated electrode poling configurations. Twist actuation for the interdigitated electrode blades is also compared with the twist actuation of a conventionally poled piezoelectric fiber composite blade. Elastic twist produced using the interdigitated electrode actuators was found to be four to five times larger than that obtained with the conventionally poled actuators.

  13. Twist1 suppresses senescence programs and thereby accelerates and maintains mutant Kras-induced lung tumorigenesis.

    Directory of Open Access Journals (Sweden)

    Phuoc T Tran

    Full Text Available KRAS mutant lung cancers are generally refractory to chemotherapy as well targeted agents. To date, the identification of drugs to therapeutically inhibit K-RAS have been unsuccessful, suggesting that other approaches are required. We demonstrate in both a novel transgenic mutant Kras lung cancer mouse model and in human lung tumors that the inhibition of Twist1 restores a senescence program inducing the loss of a neoplastic phenotype. The Twist1 gene encodes for a transcription factor that is essential during embryogenesis. Twist1 has been suggested to play an important role during tumor progression. However, there is no in vivo evidence that Twist1 plays a role in autochthonous tumorigenesis. Through two novel transgenic mouse models, we show that Twist1 cooperates with Kras(G12D to markedly accelerate lung tumorigenesis by abrogating cellular senescence programs and promoting the progression from benign adenomas to adenocarcinomas. Moreover, the suppression of Twist1 to physiological levels is sufficient to cause Kras mutant lung tumors to undergo senescence and lose their neoplastic features. Finally, we analyzed more than 500 human tumors to demonstrate that TWIST1 is frequently overexpressed in primary human lung tumors. The suppression of TWIST1 in human lung cancer cells also induced cellular senescence. Hence, TWIST1 is a critical regulator of cellular senescence programs, and the suppression of TWIST1 in human tumors may be an effective example of pro-senescence therapy.

  14. The Harary index of a graph

    CERN Document Server

    Xu, Kexiang; Trinajstić, Nenad

    2015-01-01

    This is the first book to focus on the topological index, the Harary index, of a graph, including its mathematical properties, chemical applications and some related and attractive open problems. This book is dedicated to Professor Frank Harary (1921—2005), the grandmaster of graph theory and its applications. It has be written by experts in the field of graph theory and its applications. For a connected graph G, as an important distance-based topological index, the Harary index H(G) is defined as the sum of the reciprocals of the distance between any two unordered vertices of the graph G. In this book, the authors report on the newest results on the Harary index of a graph. These results mainly concern external graphs with respect to the Harary index; the relations to other topological indices; its properties and applications to pure graph theory and chemical graph theory; and two significant variants, i.e., additively and multiplicatively weighted Harary indices. In the last chapter, we present a number o...

  15. Geometrically exact nonlinear analysis of pre-twisted composite rotor blades

    Directory of Open Access Journals (Sweden)

    Li'na SHANG

    2018-02-01

    Full Text Available Modeling of pre-twisted composite rotor blades is very complicated not only because of the geometric non-linearity, but also because of the cross-sectional warping and the transverse shear deformation caused by the anisotropic material properties. In this paper, the geometrically exact nonlinear modeling of a generalized Timoshenko beam with arbitrary cross-sectional shape, generally anisotropic material behavior and large deflections has been presented based on Hodges’ method. The concept of decomposition of rotation tensor was used to express the strain in the beam. The variational asymptotic method was used to determine the arbitrary warping of the beam cross section. The generalized Timoshenko strain energy was derived from the equilibrium equations and the second-order asymptotically correct strain energy. The geometrically exact nonlinear equations of motion were established by Hamilton’s principle. The established modeling was used for the static and dynamic analysis of pre-twisted composite rotor blades, and the analytical results were validated based on experimental data. The influences of the transverse shear deformation on the pre-twisted composite rotor blade were investigated. The results indicate that the influences of the transverse shear deformation on the static deformation and the natural frequencies of the pre-twisted composite rotor blade are related to the length to chord ratio of the blade. Keywords: Geometrically exact, Nonlinear, Pre-twisted composite blade, Transverse shear deformation, Variational asymptotic, Warping

  16. A twisted flux-tube model for solar prominences. I. General properties

    International Nuclear Information System (INIS)

    Priest, E.R.; Hood, A.W.; Anzer, U.

    1989-01-01

    It is proposed that a solar prominence consists of cool plasma supported in a large-scale curved and twisted magnetic flux tube. As long as the flux tube is untwisted, its curvature is concave toward the solar surface, and so it cannot support dense plasma against gravity. However, when it is twisted sufficiently, individual field lines may acquire a convex curvature near their summits and so provide support. Cool plasma then naturally tends to accumulate in such field line dips either by injection from below or by thermal condensation. As the tube is twisted up further or reconnection takes place below the prominence, one finds a transition from normal to inverse polarity. When the flux tube becomes too long or is twisted too much, it loses stability and its true magnetic geometry as an erupting prominence is revealed more clearly. 56 refs

  17. Brain Graph Topology Changes Associated with Anti-Epileptic Drug Use

    Science.gov (United States)

    Levin, Harvey S.; Chiang, Sharon

    2015-01-01

    Abstract Neuroimaging studies of functional connectivity using graph theory have furthered our understanding of the network structure in temporal lobe epilepsy (TLE). Brain network effects of anti-epileptic drugs could influence such studies, but have not been systematically studied. Resting-state functional MRI was analyzed in 25 patients with TLE using graph theory analysis. Patients were divided into two groups based on anti-epileptic medication use: those taking carbamazepine/oxcarbazepine (CBZ/OXC) (n=9) and those not taking CBZ/OXC (n=16) as a part of their medication regimen. The following graph topology metrics were analyzed: global efficiency, betweenness centrality (BC), clustering coefficient, and small-world index. Multiple linear regression was used to examine the association of CBZ/OXC with graph topology. The two groups did not differ from each other based on epilepsy characteristics. Use of CBZ/OXC was associated with a lower BC. Longer epilepsy duration was also associated with a lower BC. These findings can inform graph theory-based studies in patients with TLE. The changes observed are discussed in relation to the anti-epileptic mechanism of action and adverse effects of CBZ/OXC. PMID:25492633

  18. Exact parallel maximum clique algorithm for general and protein graphs.

    Science.gov (United States)

    Depolli, Matjaž; Konc, Janez; Rozman, Kati; Trobec, Roman; Janežič, Dušanka

    2013-09-23

    A new exact parallel maximum clique algorithm MaxCliquePara, which finds the maximum clique (the fully connected subgraph) in undirected general and protein graphs, is presented. First, a new branch and bound algorithm for finding a maximum clique on a single computer core, which builds on ideas presented in two published state of the art sequential algorithms is implemented. The new sequential MaxCliqueSeq algorithm is faster than the reference algorithms on both DIMACS benchmark graphs as well as on protein-derived product graphs used for protein structural comparisons. Next, the MaxCliqueSeq algorithm is parallelized by splitting the branch-and-bound search tree to multiple cores, resulting in MaxCliquePara algorithm. The ability to exploit all cores efficiently makes the new parallel MaxCliquePara algorithm markedly superior to other tested algorithms. On a 12-core computer, the parallelization provides up to 2 orders of magnitude faster execution on the large DIMACS benchmark graphs and up to an order of magnitude faster execution on protein product graphs. The algorithms are freely accessible on http://commsys.ijs.si/~matjaz/maxclique.

  19. Graph mining for next generation sequencing: leveraging the assembly graph for biological insights.

    Science.gov (United States)

    Warnke-Sommer, Julia; Ali, Hesham

    2016-05-06

    The assembly of Next Generation Sequencing (NGS) reads remains a challenging task. This is especially true for the assembly of metagenomics data that originate from environmental samples potentially containing hundreds to thousands of unique species. The principle objective of current assembly tools is to assemble NGS reads into contiguous stretches of sequence called contigs while maximizing for both accuracy and contig length. The end goal of this process is to produce longer contigs with the major focus being on assembly only. Sequence read assembly is an aggregative process, during which read overlap relationship information is lost as reads are merged into longer sequences or contigs. The assembly graph is information rich and capable of capturing the genomic architecture of an input read data set. We have developed a novel hybrid graph in which nodes represent sequence regions at different levels of granularity. This model, utilized in the assembly and analysis pipeline Focus, presents a concise yet feature rich view of a given input data set, allowing for the extraction of biologically relevant graph structures for graph mining purposes. Focus was used to create hybrid graphs to model metagenomics data sets obtained from the gut microbiomes of five individuals with Crohn's disease and eight healthy individuals. Repetitive and mobile genetic elements are found to be associated with hybrid graph structure. Using graph mining techniques, a comparative study of the Crohn's disease and healthy data sets was conducted with focus on antibiotics resistance genes associated with transposase genes. Results demonstrated significant differences in the phylogenetic distribution of categories of antibiotics resistance genes in the healthy and diseased patients. Focus was also evaluated as a pure assembly tool and produced excellent results when compared against the Meta-velvet, Omega, and UD-IDBA assemblers. Mining the hybrid graph can reveal biological phenomena captured

  20. A technology mapping based on graph of excitations and outputs for finite state machines

    Science.gov (United States)

    Kania, Dariusz; Kulisz, Józef

    2017-11-01

    A new, efficient technology mapping method of FSMs, dedicated for PAL-based PLDs is proposed. The essence of the method consists in searching for the minimal set of PAL-based logic blocks that cover a set of multiple-output implicants describing the transition and output functions of an FSM. The method is based on a new concept of graph: the Graph of Excitations and Outputs. The proposed algorithm was tested using the FSM benchmarks. The obtained results were compared with the classical technology mapping of FSM.

  1. Enhancement of heat transfer using varying width twisted tape inserts

    African Journals Online (AJOL)

    user

    enhancement of heat transfer with twisted tape inserts as compared to plain ... studies for heat transfer and pressure drop of laminar flow in horizontal tubes ... flow in rectangular and square plain ducts and ducts with twisted-tape inserts .... presence of the insert in the pipe causes resistance to flow and increases turbulence.

  2. Distance-transitive graphs

    NARCIS (Netherlands)

    Cohen, A.M.; Beineke, L.W.; Wilson, R.J.; Cameron, P.J.

    2004-01-01

    In this chapter we investigate the classification of distance-transitive graphs: these are graphs whose automorphism groups are transitive on each of the sets of pairs of vertices at distance i, for i = 0, 1,.... We provide an introduction into the field. By use of the classification of finite

  3. Standard testing procedures for optical fiber and unshielded twisted pair at Sandia National Laboratories

    Energy Technology Data Exchange (ETDEWEB)

    Adams, R.L.

    1993-11-01

    This document will establish a working standard for testing optical fiber and unshielded twisted pair cables included in the Lab-wide telecommunications cabling system. The purpose of these standard testing procedures is to deliver to all Sandians a reliable, low-maintenance, state-of-the-art, ubiquitous telecommunications cabling infrastructure capable of satisfying all current and future telecommunication needs.

  4. TrajGraph: A Graph-Based Visual Analytics Approach to Studying Urban Network Centralities Using Taxi Trajectory Data.

    Science.gov (United States)

    Huang, Xiaoke; Zhao, Ye; Yang, Jing; Zhang, Chong; Ma, Chao; Ye, Xinyue

    2016-01-01

    We propose TrajGraph, a new visual analytics method, for studying urban mobility patterns by integrating graph modeling and visual analysis with taxi trajectory data. A special graph is created to store and manifest real traffic information recorded by taxi trajectories over city streets. It conveys urban transportation dynamics which can be discovered by applying graph analysis algorithms. To support interactive, multiscale visual analytics, a graph partitioning algorithm is applied to create region-level graphs which have smaller size than the original street-level graph. Graph centralities, including Pagerank and betweenness, are computed to characterize the time-varying importance of different urban regions. The centralities are visualized by three coordinated views including a node-link graph view, a map view and a temporal information view. Users can interactively examine the importance of streets to discover and assess city traffic patterns. We have implemented a fully working prototype of this approach and evaluated it using massive taxi trajectories of Shenzhen, China. TrajGraph's capability in revealing the importance of city streets was evaluated by comparing the calculated centralities with the subjective evaluations from a group of drivers in Shenzhen. Feedback from a domain expert was collected. The effectiveness of the visual interface was evaluated through a formal user study. We also present several examples and a case study to demonstrate the usefulness of TrajGraph in urban transportation analysis.

  5. Temporal Representation in Semantic Graphs

    Energy Technology Data Exchange (ETDEWEB)

    Levandoski, J J; Abdulla, G M

    2007-08-07

    A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.

  6. The complexity of the matching-cut problem for planar graphs and other graph classes

    NARCIS (Netherlands)

    Bonsma, P.S.

    2009-01-01

    The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be -complete when restricted to graphs with maximum degree four. In this paper it

  7. PRIVATE GRAPHS – ACCESS RIGHTS ON GRAPHS FOR SEAMLESS NAVIGATION

    Directory of Open Access Journals (Sweden)

    W. Dorner

    2016-06-01

    Full Text Available After the success of GNSS (Global Navigational Satellite Systems and navigation services for public streets, indoor seems to be the next big development in navigational services, relying on RTLS – Real Time Locating Services (e.g. WIFI and allowing seamless navigation. In contrast to navigation and routing services on public streets, seamless navigation will cause an additional challenge: how to make routing data accessible to defined users or restrict access rights for defined areas or only to parts of the graph to a defined user group? The paper will present case studies and data from literature, where seamless and especially indoor navigation solutions are presented (hospitals, industrial complexes, building sites, but the problem of restricted access rights was only touched from a real world, but not a technical perspective. The analysis of case studies will show, that the objective of navigation and the different target groups for navigation solutions will demand well defined access rights and require solutions, how to make only parts of a graph to a user or application available to solve a navigational task. The paper will therefore introduce the concept of private graphs, which is defined as a graph for navigational purposes covering the street, road or floor network of an area behind a public street and suggest different approaches how to make graph data for navigational purposes available considering access rights and data protection, privacy and security issues as well.

  8. Port-Hamiltonian Systems on Open Graphs

    NARCIS (Netherlands)

    Schaft, A.J. van der; Maschke, B.M.

    2010-01-01

    In this talk we discuss how to define in an intrinsic manner port-Hamiltonian dynamics on open graphs. Open graphs are graphs where some of the vertices are boundary vertices (terminals), which allow interconnection with other systems. We show that a directed graph carries two natural Dirac

  9. Gerbes over posets and twisted C*-dynamical systems

    OpenAIRE

    Vasselli, Ezio

    2017-01-01

    A base $\\Delta$ generating the topology of a space $M$ becomes a partially ordered set (poset), when ordered under inclusion of open subsets. Given a precosheaf over $\\Delta$ of fixed-point spaces (typically C*-algebras) under the action of a group $G$, in general one cannot find a precosheaf of $G$-spaces having it as fixed-point precosheaf. Rather one gets a gerbe over $\\Delta$, that is, a "twisted precosheaf" whose twisting is encoded by a cocycle with coefficients in a suitable 2-group. W...

  10. Towards a theory of geometric graphs

    CERN Document Server

    Pach, Janos

    2004-01-01

    The early development of graph theory was heavily motivated and influenced by topological and geometric themes, such as the Konigsberg Bridge Problem, Euler's Polyhedral Formula, or Kuratowski's characterization of planar graphs. In 1936, when Denes Konig published his classical Theory of Finite and Infinite Graphs, the first book ever written on the subject, he stressed this connection by adding the subtitle Combinatorial Topology of Systems of Segments. He wanted to emphasize that the subject of his investigations was very concrete: planar figures consisting of points connected by straight-line segments. However, in the second half of the twentieth century, graph theoretical research took an interesting turn. In the most popular and most rapidly growing areas (the theory of random graphs, Ramsey theory, extremal graph theory, algebraic graph theory, etc.), graphs were considered as abstract binary relations rather than geometric objects. Many of the powerful techniques developed in these fields have been su...

  11. Software for Graph Analysis and Visualization

    Directory of Open Access Journals (Sweden)

    M. I. Kolomeychenko

    2014-01-01

    Full Text Available This paper describes the software for graph storage, analysis and visualization. The article presents a comparative analysis of existing software for analysis and visualization of graphs, describes the overall architecture of application and basic principles of construction and operation of the main modules. Furthermore, a description of the developed graph storage oriented to storage and processing of large-scale graphs is presented. The developed algorithm for finding communities and implemented algorithms of autolayouts of graphs are the main functionality of the product. The main advantage of the developed software is high speed processing of large size networks (up to millions of nodes and links. Moreover, the proposed graph storage architecture is unique and has no analogues. The developed approaches and algorithms are optimized for operating with big graphs and have high productivity.

  12. Factorising the 3D topologically twisted index

    Science.gov (United States)

    Cabo-Bizet, Alejandro

    2017-04-01

    We explore the path integration — upon the contour of hermitian (non-auxliary) field configurations — of topologically twisted N=2 Chern-Simons-matter theory (TTCSM) on {S}_2 times a segment. In this way, we obtain the formula for the 3D topologically twisted index, first as a convolution of TTCSM on {S}_2 times halves of {S}_1 , second as TTCSM on {S}_2 times {S}_1 — with a puncture, — and third as TTCSM on {S}_2× {S}_1 . In contradistinction to the first two cases, in the third case, the vector multiplet auxiliary field D is constrained to be anti-hermitian.

  13. Obstructions for twist star products

    Science.gov (United States)

    Bieliavsky, Pierre; Esposito, Chiara; Waldmann, Stefan; Weber, Thomas

    2018-05-01

    In this short note, we point out that not every star product is induced by a Drinfel'd twist by showing that not every Poisson structure is induced by a classical r-matrix. Examples include the higher genus symplectic Pretzel surfaces and the symplectic sphere S^2.

  14. Text-Filled Stacked Area Graphs

    DEFF Research Database (Denmark)

    Kraus, Martin

    2011-01-01

    -filled stacked area graphs; i.e., graphs that feature stacked areas that are filled with small-typed text. Since these graphs allow for computing the text layout automatically, it is possible to include large amounts of textual detail with very little effort. We discuss the most important challenges and some...... solutions for the design of text-filled stacked area graphs with the help of an exemplary visualization of the genres, publication years, and titles of a database of several thousand PC games....

  15. miR-151-3p Targets TWIST1 to Repress Migration of Human Breast Cancer Cells.

    Directory of Open Access Journals (Sweden)

    Ting-Chih Yeh

    Full Text Available TWIST1 is a highly conserved basic helix-loop-helix transcription factor that contributes to cancer metastasis by promoting an epithelial-mesenchymal transition and repressing E-cadherin gene expression in breast cancer. In this study, we explored the potential role of miR-151 in TWIST1 expression and cancer properties in human breast cancer cells. We found that the human TWIST1 3'UTR contains a potential binging site for miR-151-3p at the putative target sequence 5'-CAGUCUAG-3'. Using a TWIST1-3'UTR luciferase reporter assay, we demonstrated that the target sequence within the TWIST1 3'UTR is required for miR-151-3p regulation of TWIST1 expression. Moreover, we found that ectopic expression of miR-151-3p by infection with adenoviruses expressing miR-151 significantly decreased TWIST1 expression, migration and invasion, but did not affect cell growth and tumorsphere formation of human breast cancer cells. In addition, overexpression of the protein coding region without the 3'UTR of TWIST1 reversed the repression of cell migration by miR-151-3p. Furthermore, knockdown of miR-151-3p increased TWIST1 expression, reduced E-cadherin expression, and enhanced cell migration. In conclusion, these results suggest that miR-151-3p directly regulates TWIST1 expression by targeting the TWIST1 3'UTR and thus repressing the migration and invasion of human breast cancer cells by enhancing E-cadherin expression. Our findings add to accumulating evidence that microRNAs are involved in breast cancer progression by modulating TWIST1 expression.

  16. On Graph Rewriting, Reduction and Evaluation

    DEFF Research Database (Denmark)

    Zerny, Ian

    2010-01-01

    We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter-derive a t......We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter...

  17. PERFORMANCE CHARACTERISTICS OF PARABOLIC SOLAR COLLECTOR WATER HEATER SYSTEM FITTED WITH NAIL TWISTED TAPES ABSORBER

    Directory of Open Access Journals (Sweden)

    K. SYED JAFAR

    2017-03-01

    Full Text Available In this paper, the experimental heat transfer, friction loss and thermal performance data for water flowing through the absorber tube fitted with two different twisted tape configurations in parabolic trough collector (PTC are presented. In the present work, a relative experimental study is carried out to investigate the performance of a PTC influenced by heat transfer through fluidabsorber wall mixing mechanism. The major findings of this experiment show that heat transport enhancement in the nail twisted tape collector perform significantly better than plain twisted tapes and also show that the smallest twisted tape ratio enhances the system performance remarkably maximizing the collector efficiency. The results suggest that the twisted tape and nail twisted tape would be a better option for high thermal energy collection in laminar region of the PTC system.

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

  19. A New Twisting Somersault: 513XD

    Science.gov (United States)

    Tong, William; Dullin, Holger R.

    2017-12-01

    We present the mathematical framework of an athlete modelled as a system of coupled rigid bodies to simulate platform and springboard diving. Euler's equations of motion are generalised to non-rigid bodies and are then used to innovate a new dive sequence that in principle can be performed by real-world athletes. We begin by assuming that shape changes are instantaneous so that the equations of motion simplify enough to be solved analytically, and then use this insight to present a new dive (513XD) consisting of 1.5 somersaults and five twists using realistic shape changes. Finally, we demonstrate the phenomenon of converting pure somersaulting motion into pure twisting motion by using a sequence of impulsive shape changes, which may have applications in other fields such as space aeronautics.

  20. Hover Testing of the NASA/Army/MIT Active Twist Rotor Prototype Blade

    Science.gov (United States)

    Wilbur, Matthew L.; Yeager, William T., Jr.; Wilkie, W. Keats; Cesnik, Carlos E. S.; Shin, Sangloon

    2000-01-01

    Helicopter rotor individual blade control promises to provide a mechanism for increased rotor performance and reduced rotorcraft vibrations and noise. Active material methods, such as piezoelectrically actuated trailing-edge flaps and strain-induced rotor blade twisting, provide a means of accomplishing individual blade control without the need for hydraulic power in the rotating system. Recent studies have indicated that controlled strain induced blade twisting can be attained using piezoelectric active fiber composite technology. In order to validate these findings experimentally, a cooperative effort between NASA Langley Research Center, the Army Research Laboratory, and the MIT Active Materials and Structures Laboratory has been developed. As a result of this collaboration an aeroelastically-scaled active-twist model rotor blade has been designed and fabricated for testing in the heavy gas environment of the Langley Transonic Dynamics Tunnel (TDT). The results of hover tests of the active-twist prototype blade are presented in this paper. Comparisons with applicable analytical predictions of active-twist frequency response in hovering flight are also presented.

  1. Graph transformation tool contest 2008

    NARCIS (Netherlands)

    Rensink, Arend; van Gorp, Pieter

    This special section is the outcome of the graph transformation tool contest organised during the Graph-Based Tools (GraBaTs) 2008 workshop, which took place as a satellite event of the International Conference on Graph Transformation (ICGT) 2008. The contest involved two parts: three “off-line case

  2. On dominator colorings in graphs

    Indian Academy of Sciences (India)

    colors required for a dominator coloring of G is called the dominator .... Theorem 1.3 shows that the complete graph Kn is the only connected graph of order n ... Conversely, if a graph G satisfies condition (i) or (ii), it is easy to see that χd(G) =.

  3. Graphs with branchwidth at most three

    NARCIS (Netherlands)

    Bodlaender, H.L.; Thilikos, D.M.

    1997-01-01

    In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three, if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph

  4. Evolutionary dynamics on graphs: Efficient method for weak selection

    Science.gov (United States)

    Fu, Feng; Wang, Long; Nowak, Martin A.; Hauert, Christoph

    2009-04-01

    Investigating the evolutionary dynamics of game theoretical interactions in populations where individuals are arranged on a graph can be challenging in terms of computation time. Here, we propose an efficient method to study any type of game on arbitrary graph structures for weak selection. In this limit, evolutionary game dynamics represents a first-order correction to neutral evolution. Spatial correlations can be empirically determined under neutral evolution and provide the basis for formulating the game dynamics as a discrete Markov process by incorporating a detailed description of the microscopic dynamics based on the neutral correlations. This framework is then applied to one of the most intriguing questions in evolutionary biology: the evolution of cooperation. We demonstrate that the degree heterogeneity of a graph impedes cooperation and that the success of tit for tat depends not only on the number of rounds but also on the degree of the graph. Moreover, considering the mutation-selection equilibrium shows that the symmetry of the stationary distribution of states under weak selection is skewed in favor of defectors for larger selection strengths. In particular, degree heterogeneity—a prominent feature of scale-free networks—generally results in a more pronounced increase in the critical benefit-to-cost ratio required for evolution to favor cooperation as compared to regular graphs. This conclusion is corroborated by an analysis of the effects of population structures on the fixation probabilities of strategies in general 2×2 games for different types of graphs. Computer simulations confirm the predictive power of our method and illustrate the improved accuracy as compared to previous studies.

  5. Planar graphs theory and algorithms

    CERN Document Server

    Nishizeki, T

    1988-01-01

    Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.

  6. Anomalous phase shift in a twisted quantum loop

    International Nuclear Information System (INIS)

    Taira, Hisao; Shima, Hiroyuki

    2010-01-01

    The coherent motion of electrons in a twisted quantum ring is considered to explore the effect of torsion inherent to the ring. Internal torsion of the ring composed of helical atomic configuration yields a non-trivial quantum phase shift in the electrons' eigenstates. This torsion-induced phase shift causes novel kinds of persistent current flow and an Aharonov-Bohm-like conductance oscillation. The two phenomena can occur even when no magnetic flux penetrates inside the twisted ring, thus being in complete contrast with the counterparts observed in untwisted rings.

  7. Information Graph Flow: A Geometric Approximation of Quantum and Statistical Systems

    Science.gov (United States)

    Vanchurin, Vitaly

    2018-05-01

    Given a quantum (or statistical) system with a very large number of degrees of freedom and a preferred tensor product factorization of the Hilbert space (or of a space of distributions) we describe how it can be approximated with a very low-dimensional field theory with geometric degrees of freedom. The geometric approximation procedure consists of three steps. The first step is to construct weighted graphs (we call information graphs) with vertices representing subsystems (e.g., qubits or random variables) and edges representing mutual information (or the flow of information) between subsystems. The second step is to deform the adjacency matrices of the information graphs to that of a (locally) low-dimensional lattice using the graph flow equations introduced in the paper. (Note that the graph flow produces very sparse adjacency matrices and thus might also be used, for example, in machine learning or network science where the task of graph sparsification is of a central importance.) The third step is to define an emergent metric and to derive an effective description of the metric and possibly other degrees of freedom. To illustrate the procedure we analyze (numerically and analytically) two information graph flows with geometric attractors (towards locally one- and two-dimensional lattices) and metric perturbations obeying a geometric flow equation. Our analysis also suggests a possible approach to (a non-perturbative) quantum gravity in which the geometry (a secondary object) emerges directly from a quantum state (a primary object) due to the flow of the information graphs.

  8. Graph Quasicontinuous Functions and Densely Continuous Forms

    Directory of Open Access Journals (Sweden)

    Lubica Hola

    2017-07-01

    Full Text Available Let $X, Y$ be topological spaces. A function $f: X \\to Y$ is said to be graph quasicontinuous if there is a quasicontinuous function $g: X \\to Y$ with the graph of $g$ contained in the closure of the graph of $f$. There is a close relation between the notions of graph quasicontinuous functions and minimal usco maps as well as the notions of graph quasicontinuous functions and densely continuous forms. Every function with values in a compact Hausdorff space is graph quasicontinuous; more generally every locally compact function is graph quasicontinuous.

  9. The geometrical origin of the strain-twist coupling in double helices

    DEFF Research Database (Denmark)

    Olsen, Kasper; Bohr, Jakob

    2011-01-01

    A simple geometrical explanation for the counterintuitive phenomenon when twist leads to extension in double helices is presented. The coupling between strain and twist is investigated using a tubular description. It is shown that the relation between strain and rotation is universal and depends...

  10. Waveguides with asymptotically diverging twisting

    Czech Academy of Sciences Publication Activity Database

    Krejčiřík, David

    2015-01-01

    Roč. 46, AUG (2015), s. 7-10 ISSN 0893-9659 R&D Projects: GA ČR(CZ) GA14-06818S Institutional support: RVO:61389005 Keywords : quantum waveguide * exploding twisting * Quasi-bounded * Quasi-cylindrical * discrete spectrum Subject RIV: BE - Theoretical Physics Impact factor: 1.659, year: 2015

  11. CORECLUSTER: A Degeneracy Based Graph Clustering Framework

    OpenAIRE

    Giatsidis , Christos; Malliaros , Fragkiskos; Thilikos , Dimitrios M. ,; Vazirgiannis , Michalis

    2014-01-01

    International audience; Graph clustering or community detection constitutes an important task forinvestigating the internal structure of graphs, with a plethora of applications in several domains. Traditional tools for graph clustering, such asspectral methods, typically suffer from high time and space complexity. In thisarticle, we present \\textsc{CoreCluster}, an efficient graph clusteringframework based on the concept of graph degeneracy, that can be used along withany known graph clusteri...

  12. Demonstration of an elastically coupled twist control concept for tilt rotor blade application

    Science.gov (United States)

    Lake, R. C.; Nixon, M. W.; Wilbur, M. L.; Singleton, J. D.; Mirick, P. H.

    1994-01-01

    The purpose of this Note is to present results from an analytic/experimental study that investigated the potential for passively changing blade twist through the use of extension-twist coupling. A set of composite model rotor blades was manufactured from existing blade molds for a low-twist metal helicopter rotor blade, with a view toward establishing a preliminary proof concept for extension-twist-coupled rotor blades. Data were obtained in hover for both a ballasted and unballasted blade configuration in sea-level atmospheric conditions. Test data were compared with results obtained from a geometrically nonlinear analysis of a detailed finite element model of the rotor blade developed in MSC/NASTRAN.

  13. Dynamics and control of twisting bi-stable structures

    Science.gov (United States)

    Arrieta, Andres F.; van Gemmeren, Valentin; Anderson, Aaron J.; Weaver, Paul M.

    2018-02-01

    Compliance-based morphing structures have the potential to offer large shape adaptation, high stiffness and low weight, while reducing complexity, friction, and scalability problems of mechanism based systems. A promising class of structure that enables these characteristics are multi-stable structures given their ability to exhibit large deflections and rotations without the expensive need for continuous actuation, with the latter only required intermittently. Furthermore, multi-stable structures exhibit inherently fast response due to the snap-through instability governing changes between stable states, enabling rapid configuration switching between the discrete number of programmed shapes of the structure. In this paper, the design and utilisation of the inherent nonlinear dynamics of bi-stable twisting I-beam structures for actuation with low strain piezoelectric materials is presented. The I-beam structure consists of three compliant components assembled into a monolithic single element, free of moving parts, and showing large deflections between two stable states. Finite element analysis is utilised to uncover the distribution of strain across the width of the flange, guiding the choice of positioning for piezoelectric actuators. In addition, the actuation authority is maximised by calculating the generalised coupling coefficient for different positions of the piezoelectric actuators. The results obtained are employed to tailor and test I-beam designs exhibiting desired large deflection between stable states, while still enabling the activation of snap-through with the low strain piezoelectric actuators. To this end, the dynamic response of the I-beams to piezoelectric excitation is investigated, revealing that resonant excitations are insufficient to dynamically trigger snap-through. A novel bang-bang control strategy, which exploits the nonlinear dynamics of the structure successfully triggers both single and constant snap-through between the stable states

  14. Coloring sums of extensions of certain graphs

    Directory of Open Access Journals (Sweden)

    Johan Kok

    2017-12-01

    Full Text Available We recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the chromatic number of $G$ and denoted $\\chi(G$. Motivated by the introduction of the concept of the $b$-chromatic sum of a graph the concept of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum are introduced in this paper. The extended graph $G^x$ of a graph $G$ was recently introduced for certain regular graphs. This paper furthers the concepts of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum to extended paths and cycles. Bipartite graphs also receive some attention. The paper concludes with patterned structured graphs. These last said graphs are typically found in chemical and biological structures.

  15. Particle image velocimetry measurements of 2-dimensional velocity field around twisted tape

    Energy Technology Data Exchange (ETDEWEB)

    Song, Min Seop; Park, So Hyun; Kim, Eung Soo, E-mail: kes7741@snu.ac.kr

    2016-11-01

    Highlights: • Measurements of the flow field in a pipe with twisted tape were conducted by particle image velocimetry (PIV). • A novel matching index of refraction technique utilizing 3D printing and oil mixture was adopted to make the test section transparent. • Undistorted particle images were clearly captured in the presence of twisted tape. • 2D flow field in the pipe with twisted tape revealed the characteristic two-peak velocity profile. - Abstract: Twisted tape is a passive component used to enhance heat exchange in various devices. It induces swirl flow that increases the mixing of fluid. Thus, ITER selected the twisted tape as one of the candidates for turbulence promoting in the divertor cooling. Previous study was mainly focused on the thermohydraulic performance of the twisted tape. As detailed data on the velocity field around the twisted tape was insufficient, flow visualization study was performed to provide fundamental data on velocity field. To visualize the flow in a complex structure, novel matching index of refraction technique was used with 3-D printing and mixture of anise and mineral oil. This technique enables the camera to capture undistorted particle image for velocity field measurement. Velocity fields at Reynolds number 1370–9591 for 3 different measurement plane were obtained through particle image velocimetry. The 2-dimensional averaged velocity field data were obtained from 177 pair of instantaneous velocity fields. It reveals the characteristic two-peak flow motion in axial direction. In addition, the normalized velocity profiles were converged with increase of Reynolds numbers. Finally, the uncertainty of the result data was analyzed.

  16. Combining Vertex-centric Graph Processing with SPARQL for Large-scale RDF Data Analytics

    KAUST Repository

    Abdelaziz, Ibrahim

    2017-06-27

    Modern applications, such as drug repositioning, require sophisticated analytics on RDF graphs that combine structural queries with generic graph computations. Existing systems support either declarative SPARQL queries, or generic graph processing, but not both. We bridge the gap by introducing Spartex, a versatile framework for complex RDF analytics. Spartex extends SPARQL to support programs that combine seamlessly generic graph algorithms (e.g., PageRank, Shortest Paths, etc.) with SPARQL queries. Spartex builds on existing vertex-centric graph processing frameworks, such as Graphlab or Pregel. It implements a generic SPARQL operator as a vertex-centric program that interprets SPARQL queries and executes them efficiently using a built-in optimizer. In addition, any graph algorithm implemented in the underlying vertex-centric framework, can be executed in Spartex. We present various scenarios where our framework simplifies significantly the implementation of complex RDF data analytics programs. We demonstrate that Spartex scales to datasets with billions of edges, and show that our core SPARQL engine is at least as fast as the state-of-the-art specialized RDF engines. For complex analytical tasks that combine generic graph processing with SPARQL, Spartex is at least an order of magnitude faster than existing alternatives.

  17. SES Gradients Among Mexicans in the United States and in Mexico: A New Twist to the Hispanic Paradox?

    Science.gov (United States)

    Beltrán-Sánchez, Hiram; Palloni, Alberto; Riosmena, Fernando; Wong, Rebeca

    2016-10-01

    Recent empirical findings have suggested the existence of a twist in the Hispanic paradox, in which Mexican and other Hispanic foreign-born migrants living in the United States experience shallower socioeconomic status (SES) health disparities than those in the U.S. In this article, we seek to replicate this finding and test conjectures that could explain this new observed phenomenon using objective indicators of adult health by educational attainment in several groups: (1) Mexican-born individuals living in Mexico and in the United States, (2) U.S.-born Mexican Americans, and (3) non-Hispanic American whites. Our analytical strategy improves upon previous research on three fronts. First, we derive four hypotheses from a general framework that has also been used to explain the standard Hispanic paradox. Second, we study biomarkers rather than self-reported health and related conditions. Third, we use a binational data platform that includes both Mexicans living in Mexico (Mexican National Health and Nutrition Survey 2006) and Mexican migrants to the United States (NHANES 1999-2010). We find steep education gradients among Mexicans living in Mexico's urban areas in five of six biomarkers of metabolic syndrome (MetS) and in the overall MetS score. Mexican migrants living in the United States experience similar patterns to Mexicans living in Mexico in glucose and obesity biomarkers. These results are inconsistent with previous findings, suggesting that Mexican migrants in the United States experience significantly attenuated health gradients relative to the non-Hispanic white U.S. Our empirical evidence also contradicts the idea that SES-health gradients in Mexico are shallower than those in the United States and could be invoked to explain shallower gradients among Mexicans living in the United States.

  18. Optimization Problems on Threshold Graphs

    Directory of Open Access Journals (Sweden)

    Elena Nechita

    2010-06-01

    Full Text Available During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known, decompositions where the subgraph induced by every subset of the partition must have predeterminate properties, as well as combinations of such decompositions. In this paper we characterize threshold graphs using the weakly decomposition, determine: density and stability number, Wiener index and Wiener polynomial for threshold graphs.

  19. Epigenetic inactivation of TWIST2 in acute lymphoblastic leukemia modulates proliferation, cell survival and chemosensitivity

    Science.gov (United States)

    Thathia, Shabnam H.; Ferguson, Stuart; Gautrey, Hannah E.; van Otterdijk, Sanne D.; Hili, Michela; Rand, Vikki; Moorman, Anthony V.; Meyer, Stefan; Brown, Robert; Strathdee, Gordon

    2012-01-01

    Background Altered regulation of many transcription factors has been shown to be important in the development of leukemia. TWIST2 modulates the activity of a number of important transcription factors and is known to be a regulator of hematopoietic differentiation. Here, we investigated the significance of epigenetic regulation of TWIST2 in the control of cell growth and survival and in response to cytotoxic agents in acute lymphoblastic leukemia. Design and Methods TWIST2 promoter methylation status was assessed quantitatively, by combined bisulfite and restriction analysis (COBRA) and pyrosequencing assays, in multiple types of leukemia and TWIST2 expression was determined by quantitative reverse transcriptase polymerase chain reaction analysis. The functional role of TWIST2 in cell proliferation, survival and response to chemotherapy was assessed in transient and stable expression systems. Results We found that TWIST2 was inactivated in more than 50% of cases of childhood and adult acute lymphoblastic leukemia through promoter hypermethylation and that this epigenetic regulation was especially prevalent in RUNX1-ETV6-driven cases. Re-expression of TWIST2 in cell lines resulted in a dramatic reduction in cell growth and induction of apoptosis in the Reh cell line. Furthermore, re-expression of TWIST2 resulted in increased sensitivity to the chemotherapeutic agents etoposide, daunorubicin and dexamethasone and TWIST2 hypermethylation was almost invariably found in relapsed adult acute lymphoblastic leukemia (91% of samples hypermethylated). Conclusions This study suggests a dual role for epigenetic inactivation of TWIST2 in acute lymphoblastic leukemia, initially through altering cell growth and survival properties and subsequently by increasing resistance to chemotherapy. PMID:22058208

  20. Hierarchy of modular graph identities

    Energy Technology Data Exchange (ETDEWEB)

    D’Hoker, Eric; Kaidi, Justin [Mani L. Bhaumik Institute for Theoretical Physics, Department of Physics and Astronomy,University of California,Los Angeles, CA 90095 (United States)

    2016-11-09

    The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.

  1. Hierarchy of modular graph identities

    International Nuclear Information System (INIS)

    D’Hoker, Eric; Kaidi, Justin

    2016-01-01

    The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.

  2. Well-covered graphs and factors

    DEFF Research Database (Denmark)

    Randerath, Bert; Vestergaard, Preben D.

    2006-01-01

    A maximum independent set of vertices in a graph is a set of pairwise nonadjacent vertices of largest cardinality α. Plummer defined a graph to be well-covered, if every independent set is contained in a maximum independent set of G. Every well-covered graph G without isolated vertices has a perf...

  3. On the centrality of some graphs

    Directory of Open Access Journals (Sweden)

    Vecdi Aytac

    2017-10-01

    Full Text Available A central issue in the analysis of complex networks is the assessment of their stability and vulnerability. A variety of measures have been proposed in the literature to quantify the stability of networks and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. Different measures for graph vulnerability have been introduced so far to study different aspects of the graph behavior after removal of vertices or links such as connectivity, toughness, scattering number, binding number, residual closeness and integrity. In this paper, we consider betweenness centrality of a graph. Betweenness centrality of a vertex of a graph is portion of the shortest paths all pairs of vertices passing through a given vertex. In this paper, we obtain exact values for betweenness centrality for some wheel related graphs namely gear, helm, sunflower and friendship graphs.

  4. Study of Implosion of Twisted Nested Arrays at the Angara-5-1 Facility

    Science.gov (United States)

    Mitrofanov, K. N.; Zukakishvili, G. G.; Aleksandrov, V. V.; Grabovski, E. V.; Frolov, I. N.; Gribov, A. N.

    2018-01-01

    Results are presented from experimental studies of the implosion of twisted nested arrays in which the wires of the outer and inner arrays are twisted about the array axis in opposite directions (clockwise and counterclockwise). Experiments with twisted arrays were carried out at the Angara-5-1 facility at currents of up to 4 MA. The currents through the arrays were switched either simultaneously or the current pulse through the outer array was delayed by 10-15 ns with the help of an anode spark gap. It is shown that, in such arrays, the currents flow along the inclined wires and, accordingly, there are both the azimuthal and axial components of the discharge current. The process of plasma implosion in twisted arrays depends substantially on the value of the axial (longitudinal) magnetic field generated inside the array by the azimuthal currents. Two-dimensional simulations of the magnetic field in twisted nested arrays were performed in the ( r, z) geometry with allowance for the skin effect in the discharge electrodes. It is shown that, depending on the geometry of the discharge electrodes, different configurations of the magnetic field can be implemented inside twisted nested arrays. The calculated magnetic configurations are compared with the results of measurements of the magnetic field inside such arrays. It is shown that the configuration of the axial magnetic field inside a twisted nested array depends substantially on the distribution of the azimuthal currents between the inner and outer arrays.

  5. Realizations of κ-Minkowski space, Drinfeld twists, and related symmetry algebras

    Energy Technology Data Exchange (ETDEWEB)

    Juric, Tajron; Meljanac, Stjepan; Pikutic, Danijel [Ruder Boskovic Institute, Theoretical Physics Division, Zagreb (Croatia)

    2015-11-15

    Realizations of κ-Minkowski space linear in momenta are studied for time-, space- and light-like deformations. We construct and classify all such linear realizations and express them in terms of the gl(n) generators. There are three one-parameter families of linear realizations for timelike and space-like deformations, while for light-like deformations, there are only four linear realizations. The relation between a deformed Heisenberg algebra, the star product, the coproduct of momenta, and the twist operator is presented. It is proved that for each linear realization there exists a Drinfeld twist satisfying normalization and cocycle conditions. κ-Deformed igl(n)-Hopf algebras are presented for all cases. The κ-Poincare-Weyl and κ-Poincare-Hopf algebras are discussed. The left-right dual κ-Minkowski algebra is constructed from the transposed twists. The corresponding realizations are nonlinear. All Drinfeld twists related to κ-Minkowski space are obtained from our construction. Finally, some physical applications are discussed. (orig.)

  6. Realizations of κ-Minkowski space, Drinfeld twists, and related symmetry algebras

    International Nuclear Information System (INIS)

    Juric, Tajron; Meljanac, Stjepan; Pikutic, Danijel

    2015-01-01

    Realizations of κ-Minkowski space linear in momenta are studied for time-, space- and light-like deformations. We construct and classify all such linear realizations and express them in terms of the gl(n) generators. There are three one-parameter families of linear realizations for timelike and space-like deformations, while for light-like deformations, there are only four linear realizations. The relation between a deformed Heisenberg algebra, the star product, the coproduct of momenta, and the twist operator is presented. It is proved that for each linear realization there exists a Drinfeld twist satisfying normalization and cocycle conditions. κ-Deformed igl(n)-Hopf algebras are presented for all cases. The κ-Poincare-Weyl and κ-Poincare-Hopf algebras are discussed. The left-right dual κ-Minkowski algebra is constructed from the transposed twists. The corresponding realizations are nonlinear. All Drinfeld twists related to κ-Minkowski space are obtained from our construction. Finally, some physical applications are discussed. (orig.)

  7. Automatic O(a) improvement for twisted mass QCD in the presence of spontaneous symmetry breaking

    International Nuclear Information System (INIS)

    Aoki, Sinya; Baer, Oliver

    2006-01-01

    In this paper we present a proof for automatic O(a) improvement in twisted mass lattice QCD at maximal twist, which uses only the symmetries of the leading part in the Symanzik effective action. In the process of the proof we clarify that the twist angle is dynamically determined by vacuum expectation values in the Symanzik theory. For maximal twist according to this definition, we show that scaling violations of all quantities which have nonzero values in the continuum limit are even in a. In addition, using Wilson chiral perturbation theory, we investigate this definition for maximal twist and compare it to other definitions which were already employed in actual simulations

  8. Enabling Graph Appliance for Genome Assembly

    Energy Technology Data Exchange (ETDEWEB)

    Singh, Rina [ORNL; Graves, Jeffrey A [ORNL; Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Shankar, Mallikarjun [ORNL

    2015-01-01

    In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to store and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.

  9. On 4-critical t-perfect graphs

    OpenAIRE

    Benchetrit, Yohann

    2016-01-01

    It is an open question whether the chromatic number of $t$-perfect graphs is bounded by a constant. The largest known value for this parameter is 4, and the only example of a 4-critical $t$-perfect graph, due to Laurent and Seymour, is the complement of the line graph of the prism $\\Pi$ (a graph is 4-critical if it has chromatic number 4 and all its proper induced subgraphs are 3-colorable). In this paper, we show a new example of a 4-critical $t$-perfect graph: the complement of the line gra...

  10. Local adjacency metric dimension of sun graph and stacked book graph

    Science.gov (United States)

    Yulisda Badri, Alifiah; Darmaji

    2018-03-01

    A graph is a mathematical system consisting of a non-empty set of nodes and a set of empty sides. One of the topics to be studied in graph theory is the metric dimension. Application in the metric dimension is the navigation robot system on a path. Robot moves from one vertex to another vertex in the field by minimizing the errors that occur in translating the instructions (code) obtained from the vertices of that location. To move the robot must give different instructions (code). In order for the robot to move efficiently, the robot must be fast to translate the code of the nodes of the location it passes. so that the location vertex has a minimum distance. However, if the robot must move with the vertex location on a very large field, so the robot can not detect because the distance is too far.[6] In this case, the robot can determine its position by utilizing location vertices based on adjacency. The problem is to find the minimum cardinality of the required location vertex, and where to put, so that the robot can determine its location. The solution to this problem is the dimension of adjacency metric and adjacency metric bases. Rodrguez-Velzquez and Fernau combine the adjacency metric dimensions with local metric dimensions, thus becoming the local adjacency metric dimension. In the local adjacency metric dimension each vertex in the graph may have the same adjacency representation as the terms of the vertices. To obtain the local metric dimension of values in the graph of the Sun and the stacked book graph is used the construction method by considering the representation of each adjacent vertex of the graph.

  11. Mechatronic modeling and simulation using bond graphs

    CERN Document Server

    Das, Shuvra

    2009-01-01

    Introduction to Mechatronics and System ModelingWhat Is Mechatronics?What Is a System and Why Model Systems?Mathematical Modeling Techniques Used in PracticeSoftwareBond Graphs: What Are They?Engineering SystemsPortsGeneralized VariablesBond GraphsBasic Components in SystemsA Brief Note about Bond Graph Power DirectionsSummary of Bond Direction RulesDrawing Bond Graphs for Simple Systems: Electrical and MechanicalSimplification Rules for Junction StructureDrawing Bond Graphs for Electrical SystemsDrawing Bond Graphs for Mechanical SystemsCausalityDrawing Bond Graphs for Hydraulic and Electronic Components and SystemsSome Basic Properties and Concepts for FluidsBond Graph Model of Hydraulic SystemsElectronic SystemsDeriving System Equations from Bond GraphsSystem VariablesDeriving System EquationsTackling Differential CausalityAlgebraic LoopsSolution of Model Equations and Their InterpretationZeroth Order SystemsFirst Order SystemsSecond Order SystemTransfer Functions and Frequency ResponsesNumerical Solution ...

  12. The $SU(\\infty)$ twisted gradient flow running coupling

    CERN Document Server

    Pérez, Margarita García; Keegan, Liam; Okawa, Masanori

    2015-01-01

    We measure the running of the $SU(\\infty)$ 't Hooft coupling by performing a step scaling analysis of the Twisted Eguchi-Kawai (TEK) model, the SU($N$) gauge theory on a single site lattice with twisted boundary conditions. The computation relies on the conjecture that finite volume effects for SU(N) gauge theories defined on a 4-dimensional twisted torus are controlled by an effective size parameter $\\tilde l = l \\sqrt{N}$, with $l$ the torus period. We set the scale for the running coupling in terms of $\\tilde l$ and use the gradient flow to define a renormalized 't Hooft coupling $\\lambda(\\tilde l)$. In the TEK model, this idea allows the determination of the running of the coupling through a step scaling procedure that uses the rank of the group as a size parameter. The continuum renormalized coupling constant is extracted in the zero lattice spacing limit, which in the TEK model corresponds to the large $N$ limit taken at fixed value of $\\lambda(\\tilde l)$. The coupling constant is thus expected to coinc...

  13. Twist effects in quantum vortices and phase defects

    Science.gov (United States)

    Zuccher, Simone; Ricca, Renzo L.

    2018-02-01

    In this paper we show that twist, defined in terms of rotation of the phase associated with quantum vortices and other physical defects effectively deprived of internal structure, is a property that has observable effects in terms of induced axial flow. For this we consider quantum vortices governed by the Gross-Pitaevskii equation (GPE) and perform a number of test cases to investigate and compare the effects of twist in two different contexts: (i) when this is artificially superimposed on an initially untwisted vortex ring; (ii) when it is naturally produced on the ring by the simultaneous presence of a central straight vortex. In the first case large amplitude perturbations quickly develop, generated by the unnatural setting of the initial condition that is not an analytical solution of the GPE. In the second case much milder perturbations emerge, signature of a genuine physical process. This scenario is confirmed by other test cases performed at higher twist values. Since the second setting corresponds to essential linking, these results provide new evidence of the influence of topology on physics.

  14. Factorising the 3D topologically twisted index

    Energy Technology Data Exchange (ETDEWEB)

    Cabo-Bizet, Alejandro [Instituto de Astronomía y Física del Espacio (CONICET-UBA),Ciudad Universitaria, C.P. 1428, Buenos Aires (Argentina)

    2017-04-20

    We explore the path integration — upon the contour of hermitian (non-auxliary) field configurations — of topologically twisted N=2 Chern-Simons-matter theory (TTCSM) on S{sub 2} times a segment. In this way, we obtain the formula for the 3D topologically twisted index, first as a convolution of TTCSM on S{sub 2} times halves of S{sub 1}, second as TTCSM on S{sub 2} times S{sub 1} — with a puncture, — and third as TTCSM on S{sub 2}×S{sub 1}. In contradistinction to the first two cases, in the third case, the vector multiplet auxiliary field D is constrained to be anti-hermitian.

  15. Leibniz algebroids, twistings and exceptional generalized geometry

    Science.gov (United States)

    Baraglia, D.

    2012-05-01

    We investigate a class of Leibniz algebroids which are invariant under diffeomorphisms and symmetries involving collections of closed forms. Under appropriate assumptions we arrive at a classification which in particular gives a construction starting from graded Lie algebras. In this case the Leibniz bracket is a derived bracket and there are higher derived brackets resulting in an L∞-structure. The algebroids can be twisted by a non-abelian cohomology class and we prove that the twisting class is described by a Maurer-Cartan equation. For compact manifolds we construct a Kuranishi moduli space of this equation which is shown to be affine algebraic. We explain how these results are related to exceptional generalized geometry.

  16. Scaling up graph-based semisupervised learning via prototype vector machines.

    Science.gov (United States)

    Zhang, Kai; Lan, Liang; Kwok, James T; Vucetic, Slobodan; Parvin, Bahram

    2015-03-01

    When the amount of labeled data are limited, semisupervised learning can improve the learner's performance by also using the often easily available unlabeled data. In particular, a popular approach requires the learned function to be smooth on the underlying data manifold. By approximating this manifold as a weighted graph, such graph-based techniques can often achieve state-of-the-art performance. However, their high time and space complexities make them less attractive on large data sets. In this paper, we propose to scale up graph-based semisupervised learning using a set of sparse prototypes derived from the data. These prototypes serve as a small set of data representatives, which can be used to approximate the graph-based regularizer and to control model complexity. Consequently, both training and testing become much more efficient. Moreover, when the Gaussian kernel is used to define the graph affinity, a simple and principled method to select the prototypes can be obtained. Experiments on a number of real-world data sets demonstrate encouraging performance and scaling properties of the proposed approach. It also compares favorably with models learned via l1 -regularization at the same level of model sparsity. These results demonstrate the efficacy of the proposed approach in producing highly parsimonious and accurate models for semisupervised learning.

  17. Expert interpretation of bar and line graphs: The role of graphicacy in reducing the effect of graph format.

    Directory of Open Access Journals (Sweden)

    David ePeebles

    2015-10-01

    Full Text Available The distinction between informational and computational equivalence of representations, first articulated by Larkin and Simon (1987 has been a fundamental principle in the analysis of diagrammatic reasoning which has been supported empirically on numerous occasions. We present an experiment that investigates this principle in relation to the performance of expert graph users of 2 x 2 'interaction' bar and line graphs. The study sought to determine whether expert interpretation is affected by graph format in the same way that novice interpretations are. The findings revealed that, unlike novices - and contrary to the assumptions of several graph comprehension models - experts' performance was the same for both graph formats, with their interpretation of bar graphs being no worse than that for line graphs. We discuss the implications of the study for guidelines for presenting such data and for models of expert graph comprehension.

  18. On the twists of interplanetary magnetic flux ropes observed at 1 AU

    OpenAIRE

    Wang, Yuming; Zhuang, Bin; Hu, Qiang; Liu, Rui; Shen, Chenglong; Chi, Yutian

    2016-01-01

    Magnetic flux ropes (MFRs) are one kind of fundamental structures in the solar physics, and involved in various eruption phenomena. Twist, characterizing how the magnetic field lines wind around a main axis, is an intrinsic property of MFRs, closely related to the magnetic free energy and stableness. So far it is unclear how much amount of twist is carried by MFRs in the solar atmosphere and in heliosphere and what role the twist played in the eruptions of MFRs. Contrasting to the solar MFRs,...

  19. Two-State Intramolecular Charge Transfer (ICT) with 3,5-Dimethyl-4-(dimethylamino)benzonitrile (MMD) and Its Meta-Isomer mMMD. Ground State Amino Twist Not Essential for ICT.

    Science.gov (United States)

    Druzhinin, Sergey I; Galievsky, Victor A; Demeter, Attila; Kovalenko, Sergey A; Senyushkina, Tamara; Dubbaka, Srinivas R; Knochel, Paul; Mayer, Peter; Grosse, Christian; Stalke, Dietmar; Zachariasse, Klaas A

    2015-12-10

    From X-ray structure analysis, amino twist angles of 90.0° for 2,4-dimethyl-3-(dimethylamino)benzonitrile (mMMD), 82.7° for 4-(di-tert-butylamino)benzonitrile (DTABN), and 88.7° for 6-cyanobenzoquinuclidine (CBQ) are determined, all considerably larger than the 57.4° of 3,5-dimethyl-4-(dimethylamino)benzonitrile (MMD). This large twist leads to lengthening of the amino-phenyl bond, 143.5 pm (mMMD), 144.1 pm (DTABN), 144.6 pm (CBQ), and 141.4 pm (MMD), as compared with 136.5 pm for the planar 4-(dimethylamino)benzonitrile (DMABN). As a consequence, the electronic coupling between the amino and phenyl subgroups in mMMD, DTABN, CBQ, and MMD is much weaker than in DMABN, as seen from the strongly reduced molar absorption coefficients. The fluorescence spectrum of MMD in n-hexane at 25 °C consists of two emissions, from a locally excited (LE) and an intramolecular charge transfer (ICT) state, with a fluorescence quantum yield ratio Φ'(ICT)/Φ(LE) of 12.8. In MeCN, a single ICT emission is found. With mMMD in n-hexane, in contrast, only LE fluorescence is observed, whereas the spectrum in MeCN originates from the ICT state. These differences are also seen from the half-widths of the overall fluorescence bands, which in n-hexane are larger for MMD than for mMMD, decreasing with solvent polarity for MMD and increasing for mMMD, reflecting the disappearance of LE and the onset of ICT in the overall spectra, respectively. From solvatochromic measurements the dipole moments μe(ICT) of MMD (16 D) and mMMD (15 D) are obtained. Femtosecond excited state absorption (ESA) spectra at 22 °C, together with the dual (LE + ICT) fluorescence, reveal that MMD in n-hexane undergoes a reversible LE ⇄ ICT reaction, with LE as the precursor, with a forward rate constant ka = 5.6 × 10(12) s(-1) and a back-reaction kd ∼ 0.05 × 10(12) s(-1). With MMD in the strongly polar solvent MeCN, ICT is faster: ka = 10 × 10(12) s(-1). In the case of mMMD in n-hexane, the ESA spectra show

  20. Proving termination of graph transformation systems using weighted type graphs over semirings

    NARCIS (Netherlands)

    Bruggink, H.J.S.; König, B.; Nolte, D.; Zantema, H.; Parisi-Presicce, F.; Westfechtel, B.

    2015-01-01

    We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In this way we obtain a

  1. Applicability of the Directed Graph Methodology

    Energy Technology Data Exchange (ETDEWEB)

    Huszti, Jozsef [Institute of Isotope of the Hungarian Academy of Sciences, Budapest (Hungary); Nemeth, Andras [ESRI Hungary, Budapest (Hungary); Vincze, Arpad [Hungarian Atomic Energy Authority, Budapest (Hungary)

    2012-06-15

    Possible methods to construct, visualize and analyse the 'map' of the State's nuclear infrastructure based on different directed graph approaches are proposed. The transportation and the flow network models are described in detail. The use of the possible evaluation methodologies and the use of available software tools to construct and maintain the nuclear 'map' using pre-defined standard building blocks (nuclear facilities) are introduced and discussed.

  2. Multiple Kernel Learning for adaptive graph regularized nonnegative matrix factorization

    KAUST Repository

    Wang, Jim Jing-Yan; AbdulJabbar, Mustafa Abdulmajeed

    2012-01-01

    Nonnegative Matrix Factorization (NMF) has been continuously evolving in several areas like pattern recognition and information retrieval methods. It factorizes a matrix into a product of 2 low-rank non-negative matrices that will define parts-based, and linear representation of non-negative data. Recently, Graph regularized NMF (GrNMF) is proposed to find a compact representation, which uncovers the hidden semantics and simultaneously respects the intrinsic geometric structure. In GNMF, an affinity graph is constructed from the original data space to encode the geometrical information. In this paper, we propose a novel idea which engages a Multiple Kernel Learning approach into refining the graph structure that reflects the factorization of the matrix and the new data space. The GrNMF is improved by utilizing the graph refined by the kernel learning, and then a novel kernel learning method is introduced under the GrNMF framework. Our approach shows encouraging results of the proposed algorithm in comparison to the state-of-the-art clustering algorithms like NMF, GrNMF, SVD etc.

  3. DIMENSI METRIK GRAPH LOBSTER Ln (q;r

    Directory of Open Access Journals (Sweden)

    PANDE GDE DONY GUMILAR

    2013-05-01

    Full Text Available The metric dimension of connected graph G is the cardinality of minimum resolving set in graph G. In this research, we study how to find the metric dimension of lobster graph Ln (q;r. Lobster graph Ln (q;r is a regular lobster graph with vertices backbone on the main path, every backbone vertex is connected to q hand vertices and every hand vertex is connected to r finger vertices, with n, q, r element of N. We obtain the metric dimension of lobster graph L2 (1;1 is 1, the metric dimension of lobster graph L2 (1;1 for n > 2 is 2.

  4. Inner Surface Chirality of Single-Handed Twisted Carbonaceous Tubular Nanoribbons.

    Science.gov (United States)

    Liu, Dan; Li, Baozong; Guo, Yongmin; Li, Yi; Yang, Yonggang

    2015-11-01

    Single-handed twisted 4,4'-biphenylene-bridged polybissilsesquioxane tubular nanoribbons and single-layered nanoribbons were prepared by tuning the water/ethanol volume ratio in the reaction mixture at pH = 11.6 through a supramolecular templating approach. The single-layered nanoribbons were formed by shrinking tubular nanoribbons after the removal of the templates. In addition, solvent-induced handedness inversion was achieved. The handedness of the polybissilsesquioxanes could be controlled by changing the ethanol/water volume ratio in the reaction mixture. After carbonization at 900 °C for 4.0 h and removal of silica, single-handed twisted carbonaceous tubular nanoribbons and single-layered nanoribbons with micropores in the walls were obtained. X-ray diffraction and Raman spectroscopy analyses indicated that the carbon is predominantly amorphous. The circular dichroism spectra show that the twisted tubular nanoribbons exhibit optical activity, while the twisted single-layered nanoribbons do not. The results shown here indicate that chirality is transferred from the organic self-assemblies to the inner surfaces of the 4,4'-biphenylene-bridged polybissilsesquioxane tubular nanoribbons and subsequently to those of the carbonaceous tubular nanoribbons. © 2015 Wiley Periodicals, Inc.

  5. Summary: beyond fault trees to fault graphs

    International Nuclear Information System (INIS)

    Alesso, H.P.; Prassinos, P.; Smith, C.F.

    1984-09-01

    Fault Graphs are the natural evolutionary step over a traditional fault-tree model. A Fault Graph is a failure-oriented directed graph with logic connectives that allows cycles. We intentionally construct the Fault Graph to trace the piping and instrumentation drawing (P and ID) of the system, but with logical AND and OR conditions added. Then we evaluate the Fault Graph with computer codes based on graph-theoretic methods. Fault Graph computer codes are based on graph concepts, such as path set (a set of nodes traveled on a path from one node to another) and reachability (the complete set of all possible paths between any two nodes). These codes are used to find the cut-sets (any minimal set of component failures that will fail the system) and to evaluate the system reliability

  6. Atomic spectroscopy with twisted photons: Separation of M 1 -E 2 mixed multipoles

    Science.gov (United States)

    Afanasev, Andrei; Carlson, Carl E.; Solyanik, Maria

    2018-02-01

    We analyze atomic photoexcitation into the discrete states by twisted photons, or photons carrying extra orbital angular momentum along their direction of propagation. From the angular momentum and parity considerations, we are able to relate twisted-photon photoexcitation amplitudes to their plane-wave analogs, independently of the details of the atomic wave functions. We analyze the photoabsorption cross sections of mixed-multipolarity E 2 -M 1 transitions in ionized atoms and found fundamental differences coming from the photon topology. Our theoretical analysis demonstrates that it is possible to extract the relative transition rates of different multipolar contributions by measuring the photoexcitation rate as a function of the atom's position (or impact parameter) with respect to the optical vortex center. The proposed technique for separation of multipoles can be implemented if the target's atom position is resolved with subwavelength accuracy; for example, with Paul traps. Numerical examples are presented for Boron-like highly charged ions.

  7. Interactive Graph Layout of a Million Nodes

    Directory of Open Access Journals (Sweden)

    Peng Mi

    2016-12-01

    Full Text Available Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph topology. This algorithm can interactively layout graphs with millions of nodes, and support real-time interaction to explore alternative graph layouts. Users can directly manipulate the layout of vertices in a force-directed fashion. The complexity of traditional repulsive force computation is reduced by approximating calculations based on the hierarchical structure of multi-level clustered graphs. We evaluate the algorithm performance, and demonstrate human-in-the-loop layout in two sensemaking case studies. Moreover, we summarize lessons learned for designing interactive large graph layout algorithms on the GPU.

  8. Eulerian Graphs and Related Topics

    CERN Document Server

    Fleischner, Herbert

    1990-01-01

    The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering walks. They should appeal both to researchers and students, as they contain enough material for an undergraduate or graduate graph theory course which emphasizes Eulerian graphs, and thus can be read by any mathematician not yet familiar with graph theory. But they are also of interest to researchers in graph theory because they contain many recent results, some of which are only partial solutions to more general problems. A number of conjectures have been included as well. Various problems (such a

  9. Osserman and conformally Osserman manifolds with warped and twisted product structure

    OpenAIRE

    Brozos-Vazquez, M.; Garcia-Rio, E.; Vazquez-Lorenzo, R.

    2008-01-01

    We characterize Osserman and conformally Osserman Riemannian manifolds with the local structure of a warped product. By means of this approach we analyze the twisted product structure and obtain, as a consequence, that the only Osserman manifolds which can be written as a twisted product are those of constant curvature.

  10. Degree-based graph construction

    International Nuclear Information System (INIS)

    Kim, Hyunju; Toroczkai, Zoltan; Erdos, Peter L; Miklos, Istvan; Szekely, Laszlo A

    2009-01-01

    Degree-based graph construction is a ubiquitous problem in network modelling (Newman et al 2006 The Structure and Dynamics of Networks (Princeton Studies in Complexity) (Princeton, NJ: Princeton University Press), Boccaletti et al 2006 Phys. Rep. 424 175), ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects that are still open today. Here we give necessary and sufficient conditions for a sequence of nonnegative integers to be realized as a simple graph's degree sequence, such that a given (but otherwise arbitrary) set of connections from an arbitrarily given node is avoided. We then use this result to present a swap-free algorithm that builds all simple graphs realizing a given degree sequence. In a wider context, we show that our result provides a greedy construction method to build all the f-factor subgraphs (Tutte 1952 Can. J. Math. 4 314) embedded within K n setmn S k , where K n is the complete graph and S k is a star graph centred on one of the nodes. (fast track communication)

  11. An improved hazard rate twisting approach for the statistic of the sum of subexponential variates

    KAUST Repository

    Rached, Nadhir B.; Kammoun, Abla; Alouini, Mohamed-Slim; Tempone, Raul

    2015-01-01

    In this letter, we present an improved hazard rate twisting technique for the estimation of the probability that a sum of independent but not necessarily identically distributed subexponential Random Variables (RVs) exceeds a given threshold. Instead of twisting all the components in the summation, we propose to twist only the RVs which have the biggest impact on the right-tail of the sum distribution and keep the other RVs unchanged. A minmax approach is performed to determine the optimal twisting parameter which leads to an asymptotic optimality criterion. Moreover, we show through some selected simulation results that our proposed approach results in a variance reduction compared to the technique where all the components are twisted.

  12. Downhill Domination in Graphs

    Directory of Open Access Journals (Sweden)

    Haynes Teresa W.

    2014-08-01

    Full Text Available A path π = (v1, v2, . . . , vk+1 in a graph G = (V,E is a downhill path if for every i, 1 ≤ i ≤ k, deg(vi ≥ deg(vi+1, where deg(vi denotes the degree of vertex vi ∈ V. The downhill domination number equals the minimum cardinality of a set S ⊆ V having the property that every vertex v ∈ V lies on a downhill path originating from some vertex in S. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number of a graph is at most half its order, and that the downhill domination number of a tree is at most one third its order. We characterize the graphs obtaining each of these bounds

  13. Subsampling for graph power spectrum estimation

    KAUST Repository

    Chepuri, Sundeep Prabhakar; Leus, Geert

    2016-01-01

    In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.

  14. Proving relations between modular graph functions

    International Nuclear Information System (INIS)

    Basu, Anirban

    2016-01-01

    We consider modular graph functions that arise in the low energy expansion of the four graviton amplitude in type II string theory. The vertices of these graphs are the positions of insertions of vertex operators on the toroidal worldsheet, while the links are the scalar Green functions connecting the vertices. Graphs with four and five links satisfy several non-trivial relations, which have been proved recently. We prove these relations by using elementary properties of Green functions and the details of the graphs. We also prove a relation between modular graph functions with six links. (paper)

  15. Subsampling for graph power spectrum estimation

    KAUST Repository

    Chepuri, Sundeep Prabhakar

    2016-10-06

    In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.

  16. Semantic graphs and associative memories

    Science.gov (United States)

    Pomi, Andrés; Mizraji, Eduardo

    2004-12-01

    Graphs have been increasingly utilized in the characterization of complex networks from diverse origins, including different kinds of semantic networks. Human memories are associative and are known to support complex semantic nets; these nets are represented by graphs. However, it is not known how the brain can sustain these semantic graphs. The vision of cognitive brain activities, shown by modern functional imaging techniques, assigns renewed value to classical distributed associative memory models. Here we show that these neural network models, also known as correlation matrix memories, naturally support a graph representation of the stored semantic structure. We demonstrate that the adjacency matrix of this graph of associations is just the memory coded with the standard basis of the concept vector space, and that the spectrum of the graph is a code invariant of the memory. As long as the assumptions of the model remain valid this result provides a practical method to predict and modify the evolution of the cognitive dynamics. Also, it could provide us with a way to comprehend how individual brains that map the external reality, almost surely with different particular vector representations, are nevertheless able to communicate and share a common knowledge of the world. We finish presenting adaptive association graphs, an extension of the model that makes use of the tensor product, which provides a solution to the known problem of branching in semantic nets.

  17. RNA graph partitioning for the discovery of RNA modularity: a novel application of graph partition algorithm to biology.

    Directory of Open Access Journals (Sweden)

    Namhee Kim

    Full Text Available Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in structural biology, structures of molecules can be described, including RNA structures. In our RNA-As-Graphs (RAG framework, we represent RNA structures as tree graphs by translating unpaired regions into vertices and helices into edges. Here we explore the modularity of RNA structures by applying graph partitioning known in graph theory to divide an RNA graph into subgraphs. To our knowledge, this is the first application of graph partitioning to biology, and the results suggest a systematic approach for modular design in general. The graph partitioning algorithms utilize mathematical properties of the Laplacian eigenvector (µ2 corresponding to the second eigenvalues (λ2 associated with the topology matrix defining the graph: λ2 describes the overall topology, and the sum of µ2's components is zero. The three types of algorithms, termed median, sign, and gap cuts, divide a graph by determining nodes of cut by median, zero, and largest gap of µ2's components, respectively. We apply these algorithms to 45 graphs corresponding to all solved RNA structures up through 11 vertices (∼ 220 nucleotides. While we observe that the median cut divides a graph into two similar-sized subgraphs, the sign and gap cuts partition a graph into two topologically-distinct subgraphs. We find that the gap cut produces the best biologically-relevant partitioning for RNA because it divides RNAs at less stable connections while maintaining junctions intact. The iterative gap cuts suggest basic modules and assembly protocols to design large RNA structures. Our graph substructuring thus suggests a systematic approach to explore the modularity of biological networks. In our applications to RNA structures, subgraphs

  18. Effect of Magnetic Twist on Nonlinear Transverse Kink Oscillations of Line-tied Magnetic Flux Tubes

    Science.gov (United States)

    Terradas, J.; Magyar, N.; Van Doorsselaere, T.

    2018-01-01

    Magnetic twist is thought to play an important role in many structures of the solar atmosphere. One of the effects of twist is to modify the properties of the eigenmodes of magnetic tubes. In the linear regime standing kink solutions are characterized by a change in polarization of the transverse displacement along the twisted tube. In the nonlinear regime, magnetic twist affects the development of shear instabilities that appear at the tube boundary when it is oscillating laterally. These Kelvin–Helmholtz instabilities (KHI) are produced either by the jump in the azimuthal component of the velocity at the edge of the sharp boundary between the internal and external part of the tube or by the continuous small length scales produced by phase mixing when there is a smooth inhomogeneous layer. In this work the effect of twist is consistently investigated by solving the time-dependent problem including the process of energy transfer to the inhomogeneous layer. It is found that twist always delays the appearance of the shear instability, but for tubes with thin inhomogeneous layers the effect is relatively small for moderate values of twist. On the contrary, for tubes with thick layers, the effect of twist is much stronger. This can have some important implications regarding observations of transverse kink modes and the KHI itself.

  19. Methods of filtering the graph images of the functions

    Directory of Open Access Journals (Sweden)

    Олександр Григорович Бурса

    2017-06-01

    Full Text Available The theoretical aspects of cleaning raster images of scanned graphs of functions from digital, chromatic and luminance distortions by using computer graphics techniques have been considered. The basic types of distortions characteristic of graph images of functions have been stated. To suppress the distortion several methods, providing for high-quality of the resulting images and saving their topological features, were suggested. The paper describes the techniques developed and improved by the authors: the method of cleaning the image of distortions by means of iterative contrasting, based on the step-by-step increase in image contrast in the graph by 1%; the method of small entities distortion restoring, based on the thinning of the known matrix of contrast increase filter (the allowable dimensions of the nucleus dilution radius convolution matrix, which provide for the retention of the graph lines have been established; integration technique of the noise reduction method by means of contrasting and distortion restoring method of small entities with known σ-filter. Each method in the complex has been theoretically substantiated. The developed methods involve treatment of graph images as the entire image (global processing and its fragments (local processing. The metrics assessing the quality of the resulting image with the global and local processing have been chosen, the substantiation of the choice as well as the formulas have been given. The proposed complex methods of cleaning the graphs images of functions from grayscale image distortions is adaptive to the form of an image carrier, the distortion level in the image and its distribution. The presented results of testing the developed complex of methods for a representative sample of images confirm its effectiveness

  20. Feature selection and multi-kernel learning for adaptive graph regularized nonnegative matrix factorization

    KAUST Repository

    Wang, Jim Jing-Yan

    2014-09-20

    Nonnegative matrix factorization (NMF), a popular part-based representation technique, does not capture the intrinsic local geometric structure of the data space. Graph regularized NMF (GNMF) was recently proposed to avoid this limitation by regularizing NMF with a nearest neighbor graph constructed from the input data set. However, GNMF has two main bottlenecks. First, using the original feature space directly to construct the graph is not necessarily optimal because of the noisy and irrelevant features and nonlinear distributions of data samples. Second, one possible way to handle the nonlinear distribution of data samples is by kernel embedding. However, it is often difficult to choose the most suitable kernel. To solve these bottlenecks, we propose two novel graph-regularized NMF methods, AGNMFFS and AGNMFMK, by introducing feature selection and multiple-kernel learning to the graph regularized NMF, respectively. Instead of using a fixed graph as in GNMF, the two proposed methods learn the nearest neighbor graph that is adaptive to the selected features and learned multiple kernels, respectively. For each method, we propose a unified objective function to conduct feature selection/multi-kernel learning, NMF and adaptive graph regularization simultaneously. We further develop two iterative algorithms to solve the two optimization problems. Experimental results on two challenging pattern classification tasks demonstrate that the proposed methods significantly outperform state-of-the-art data representation methods.