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)
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
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.
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.
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.)
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.
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)
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
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)
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.
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
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.
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)
Localized topological states in Bragg multihelicoidal fibers with twist defects
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.
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
Greenberger-Horne-Zeilinger paradoxes from qudit graph 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.
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
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
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.
Network-based Arbitrated Quantum Signature Scheme with Graph State
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.
Distributed Graph-Based State Space Generation
Blom, Stefan; Kant, Gijs; Rensink, Arend; De Lara, J.; Varro, D.
LTSMIN provides a framework in which state space generation can be distributed easily over many cores on a single compute node, as well as over multiple compute nodes. The tool works on the basis of a vector representation of the states; the individual cores are assigned the task of computing all
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...
Spectral stability of shifted states on star graphs
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.
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.
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
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.
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.
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)
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∘ .
An Infinite Family of Circulant Graphs with Perfect State Transfer in Discrete Quantum Walks
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$.
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
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
Highly twisted 1,2:8,9-dibenzozethrenes: Synthesis, ground state, and physical properties
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.
Highly twisted 1,2:8,9-dibenzozethrenes: Synthesis, ground state, and physical properties
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.
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.
New Boundary-Driven Twist States in Systems with Broken Spatial Inversion Symmetry
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.
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
'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)
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...
Quantum Experiments and Graphs: Multiparty States as Coherent Superpositions of Perfect Matchings
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).
Quantum Experiments and Graphs: Multiparty States as Coherent Superpositions of Perfect Matchings.
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).
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
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
Energy Minimization of Discrete Protein Titration State Models Using Graph Theory
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
Energy Minimization of Discrete Protein Titration State Models Using Graph Theory.
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.
Identifying patients with Alzheimer's disease using resting-state fMRI and graph theory.
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.
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
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.)
Efficient Sampling of the Structure of Crypto Generators' State Transition Graphs
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.
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.
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.
Moiré-related in-gap states in a twisted MoS2/graphite heterojunction
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.
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
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
Adaptive super twisting vibration control of a flexible spacecraft with state rate estimation
Malekzadeh, Maryam; Karimpour, Hossein
2018-05-01
The robust attitude and vibration control of a flexible spacecraft trying to perform accurate maneuvers in spite of various sources of uncertainty is addressed here. Difficulties for achieving precise and stable pointing arise from noisy onboard sensors, parameters indeterminacy, outer disturbances as well as un-modeled or hidden dynamics interactions. Based on high-order sliding-mode methods, the non-minimum phase nature of the problem is dealt with through output redefinition. An adaptive super-twisting algorithm (ASTA) is incorporated with its observer counterpart on the system under consideration to get reliable attitude and vibration control in the presence of sensor noise and momentum coupling. The closed-loop efficiency is verified through simulations under various indeterminate situations and got compared to other methods.
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.
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
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.
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
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...
The Influence of Preprocessing Steps on Graph Theory Measures Derived from Resting State fMRI.
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.
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.
Graph-based network analysis of resting-state functional MRI.
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.
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.
The Influence of Preprocessing Steps on Graph Theory Measures Derived from Resting State fMRI
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
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.
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
Resting-state theta band connectivity and graph analysis in generalized social anxiety disorder.
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.
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
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
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.
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.
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.)
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.
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.
A technology mapping based on graph of excitations and outputs for finite state machines
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.
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.
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.
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...
Generalised twisted partition functions
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.
Twisted network programming essentials
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
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.
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.
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.
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
Krishnamurthy, K S; Kumar, Pramoda; Kumar, M Vijay
2013-02-01
We report, for a rodlike nematic liquid crystal with small positive dielectric and conductivity anisotropies, and in the 90°-twisted configuration, low frequency (wave electric field generated Carr-Helfrich director modulation appearing transiently over a few seconds at each polarity reversal and vanishing almost completely under steady field conditions. Significantly, the instability is polarity sensitive, with the maximum distortion localized in the vicinity of the negative electrode, rather than in the midplane of the layer. This is revealed by the wave vector alternating in the two halves of the driving cycle between the alignment directions at the two substrates. Besides the Carr-Helfrich mechanism, quadrupolar flexoelectric polarization arising under electric field gradient is strongly indicated as being involved in the development of the transient periodic order. Similar transient instability is also observed in other nematic compounds with varying combinations of dielectric and conductivity anisotropies, showing its general nature. The study also deals with various characteristics of the electro-optic effect that emerge from the temporal variation of optical response for different driving voltages, frequencies, and temperatures.
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
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
Predicting conversion from MCI to AD using resting-state fMRI, graph theoretical approach and SVM.
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.
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...
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.
A Modal-Logic Based Graph Abstraction
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
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.
International Nuclear Information System (INIS)
Vincze, Arpad; Nemeth, Andras
2013-01-01
According to a recent statement, the IAEA seeks to develop a more effective safeguards system to achieve greater deterrence, because deterrence of proliferation is much more effective than detection. To achieve this goal, a less predictive safeguards system is being developed based on the advanced state-level approach that is driven by all available safeguards-relevant information. The 'directed graph analysis' is recommended as a possible methodology to implement acquisition path analysis by the IAEA to support the State evaluation process. The basic methodology is simple, well established, powerful, and its adaptation to the modelling of the nuclear profile of a State requires minimum software development. Based on this methodology the material flow network model has been developed under the Hungarian Support Programme to the IAEA, which is described in detail. In the proposed model, materials in different chemical and physical form can flow through pipes representing declared processes, material transports, diversions or undeclared processes. The nodes of the network are the material types, while the edges of the network are the pipes. A state parameter (p) is assigned to each node and edge representing the probability of their existence in the State. The possible application of this model in the State-level analytical approach will be discussed and outlook for further work will be given. The paper is followed by the slides of the presentation
State Authorization Tracking System (StATS) - Data, Charts and Graphs
U.S. Environmental Protection Agency — The State Authorization Tracking System (StATS) is an information management system designed to document the progress of each state and territory in establishing and...
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 ...
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
A Transformation Called "Twist"
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…
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...
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
International Nuclear Information System (INIS)
Burger, Florian
2012-01-01
In this thesis we report about an investigation of the finite temperature crossover/phase transition of quantum chromodynamics and the evaluation of the thermodynamic equation of state. To this end the lattice method and the Wilson twisted mass discretisation of the quark action are used. This formulation is known to have an automatic improvement of lattice artifacts and thus an improved continuum limit behaviour. This work presents first robust results using this action for the non-vanishing temperature case. We investigate the chiral limit of the two flavour phase transition with several small values of the pion mass in order to address the open question of the order of the transition in the limit of vanishing quark mass. For the currently simulated pion masses in the range of 300 to 700 MeV we present evidence that the finite temperature transition is a crossover transition rather than a genuine phase transition. The chiral limit is investigated by comparing the scaling of the observed crossover temperature with the mass including several possible scenarios. Complementary to this approach the chiral condensate as the order parameter for the spontaneous breaking of chiral symmetry is analysed in comparison with the O(4) universal scaling function which characterises a second order transition. With respect to thermodynamics the equation of state is obtained from the trace anomaly employing the temperature integral method which provides the pressure and energy density in the crossover region. The continuum limit of the trace anomaly is studied by considering several values of N τ and the tree-level correction technique.
Upadhyayula, Srigokul; Nuñez, Vicente; Espinoza, Eli M; Larsen, Jillian M; Bao, Duoduo; Shi, Dewen; Mac, Jenny T; Anvari, Bahman; Vullev, Valentine I
2015-04-01
Cyanine dyes are broadly used for fluorescence imaging and other photonic applications. 3,3'-Diethylthiacyanine (THIA) is a cyanine dye composed of two identical aromatic heterocyclic moieties linked with a single methine, -CH 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 1111111111111111111111111111111111 1111111111111111111111111111111111 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 1111111111111111111111111111111111 1111111111111111111111111111111111 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 0000000000000000000000000000000000 . The torsional degrees of freedom around the methine bonds provide routes for non-radiative decay, responsible for the inherently low fluorescence quantum yields. Using transient absorption spectroscopy, we determined that upon photoexcitation, the excited state relaxes along two parallel pathways producing three excited-state transients that undergo internal conversion to the ground state. The media viscosity impedes the molecular modes of ring rotation and preferentially affects one of the pathways of non-radiative decay, exerting a dominant effect on the emission
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
Electrically Controllable Magnetism in Twisted Bilayer Graphene.
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.
Elder, K. R.; Achim, C. V.; Granato, E.; Ying, S. C.; Ala-Nissila, T.
2017-11-01
Atomistically thin adsorbate layers on surfaces with a lattice mismatch display complex spatial patterns and ordering due to strain-driven self-organization. In this work, a general formalism to model such ultrathin adsorption layers that properly takes into account the competition between strain and adhesion energy of the layers is presented. The model is based on the amplitude expansion of the two-dimensional phase field crystal (PFC) model, which retains atomistic length scales but allows relaxation of the layers at diffusive time scales. The specific systems considered here include cases where both the film and the adsorption potential can have either honeycomb (H) or triangular (T) symmetry. These systems include the so-called (1 ×1 ) , (√{3 }×√{3 }) R 30∘ , (2 ×2 ) , (√{7 }×√{7 }) R 19 .1∘ , and other higher order states that can contain a multitude of degenerate commensurate ground states. The relevant phase diagrams for many combinations of the H and T systems are mapped out as a function of adhesion strength and misfit strain. The coarsening patterns in some of these systems is also examined. The predictions are in good agreement with existing experimental data for selected strained ultrathin adsorption layers.
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...
Resting-state theta band connectivity and graph analysis in generalized social anxiety disorder
Directory of Open Access Journals (Sweden)
Mengqi Xing
2017-01-01
Conclusions: 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.
Electronic and Optical Properties of Twisted Bilayer Graphene
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
Non-parametric Bayesian graph models reveal community structure in resting state fMRI
DEFF Research Database (Denmark)
Andersen, Kasper Winther; Madsen, Kristoffer H.; Siebner, Hartwig Roman
2014-01-01
Modeling of resting state functional magnetic resonance imaging (rs-fMRI) data using network models is of increasing interest. It is often desirable to group nodes into clusters to interpret the communication patterns between nodes. In this study we consider three different nonparametric Bayesian...... models for node clustering in complex networks. In particular, we test their ability to predict unseen data and their ability to reproduce clustering across datasets. The three generative models considered are the Infinite Relational Model (IRM), Bayesian Community Detection (BCD), and the Infinite...... between clusters. BCD restricts the between-cluster link probabilities to be strictly lower than within-cluster link probabilities to conform to the community structure typically seen in social networks. IDM only models a single between-cluster link probability, which can be interpreted as a background...
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.
Gould, Ronald
2012-01-01
This introduction to graph theory focuses on well-established topics, covering primary techniques and including both algorithmic and theoretical problems. The algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as advanced undergraduates and graduate students of topology, algebra, and matrix theory. Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. S
Chartrand, Gary; Zhang, Ping
2010-01-01
Gary Chartrand has influenced the world of Graph Theory for almost half a century. He has supervised more than a score of Ph.D. dissertations and written several books on the subject. The most widely known of these texts, Graphs and Digraphs, … has much to recommend it, with clear exposition, and numerous challenging examples [that] make it an ideal textbook for the advanced undergraduate or beginning graduate course. The authors have updated their notation to reflect the current practice in this still-growing area of study. By the authors' estimation, the 5th edition is approximately 50% longer than the 4th edition. … the legendary Frank Harary, author of the second graph theory text ever produced, is one of the figures profiled. His book was the standard in the discipline for several decades. Chartrand, Lesniak and Zhang have produced a worthy successor.-John T. Saccoman, MAA Reviews, June 2012 (This book is in the MAA's basic library list.)As with the earlier editions, the current text emphasizes clear...
International Nuclear Information System (INIS)
Shindler, A.
2007-07-01
I review the theoretical foundations, properties as well as the simulation results obtained so far of a variant of the Wilson lattice QCD formulation: Wilson twisted mass lattice QCD. Emphasis is put on the discretization errors and on the effects of these discretization errors on the phase structure for Wilson-like fermions in the chiral limit. The possibility to use in lattice simulations different lattice actions for sea and valence quarks to ease the renormalization patterns of phenomenologically relevant local operators, is also discussed. (orig.)
Energy Technology Data Exchange (ETDEWEB)
Shindler, A. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC
2007-07-15
I review the theoretical foundations, properties as well as the simulation results obtained so far of a variant of the Wilson lattice QCD formulation: Wilson twisted mass lattice QCD. Emphasis is put on the discretization errors and on the effects of these discretization errors on the phase structure for Wilson-like fermions in the chiral limit. The possibility to use in lattice simulations different lattice actions for sea and valence quarks to ease the renormalization patterns of phenomenologically relevant local operators, is also discussed. (orig.)
Twist limits for late twisting double somersaults on trampoline.
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.
TEK twisted gradient flow running coupling
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.
Teaching Spatial Awareness for Better Twisting Somersaults.
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)
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
Bipartite separability and nonlocal quantum operations on graphs
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.
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.
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)
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...
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...
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.
Quantum walk on a chimera graph
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.
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.
Scanning tunneling microscopy and spectroscopy of twisted trilayer graphene
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.
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.
Graph visualization (Invited talk)
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.
Some remarks on definability of process graphs
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
Pragmatic Graph Rewriting Modifications
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...
Quick Mining of Isomorphic Exact Large Patterns from Large Graphs
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.
Quick Mining of Isomorphic Exact Large Patterns from Large Graphs
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.
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
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
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.
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...
Directory of Open Access Journals (Sweden)
Wi Hoon eJung
2013-10-01
Full Text Available One major characteristic of experts is intuitive judgment, which is an automatic process whereby patterns stored in memory through long-term training are recognized. Indeed, long-term training may influence brain structure and function. A recent study revealed that chess experts at rest showed differences in structure and functional connectivity (FC in the head of caudate, which is associated with rapid best next-move generation. However, less is known about the structure and function of the brains of Baduk experts compared with those of experts in other strategy games. Therefore, we performed voxel-based morphometry and FC analyses in Baduk experts to investigate structural brain differences and to clarify the influence of these differences on functional interactions. We also conducted graph theoretical analysis to explore the topological organization of whole-brain functional networks. Compared to novices, Baduk experts exhibited decreased and increased gray matter volume in the amygdala and nucleus accumbens, respectively. We also found increased FC between the amygdala and medial orbitofrontal cortex and decreased FC between the nucleus accumbens and medial prefrontal cortex. Further graph theoretical analysis revealed differences in measures of the integration of the network and in the regional nodal characteristics of various brain regions activated during Baduk. This study provides evidence for structural and functional differences as well as altered topological organization of the whole-brain functional networks in Baduk experts. Our findings also offer novel suggestions about the cognitive mechanisms behind Baduk expertise, which involves intuitive decision-making mediated by somatic marker circuitry and visuospatial processing.
Adaptive Graph Convolutional Neural Networks
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...
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.
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.
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.
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,.
Using Canonical Forms for Isomorphism Reduction in Graph-based Model Checking
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
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
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.
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
Graphing Inequalities, Connecting Meaning
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…
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.
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,
Fuzzy Graph Language Recognizability
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.
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
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...
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.
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
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
Obstructions for twist star products
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.
Simplicial complexes of graphs
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.
Introduction to quantum graphs
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...
The Twist Tensor Nuclear Norm for Video Completion.
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.
Wang, Jin-Hui; Zuo, Xi-Nian; Gohel, Suril; Milham, Michael P.; Biswal, Bharat B.; He, Yong
2011-01-01
Graph-based computational network analysis has proven a powerful tool to quantitatively characterize functional architectures of the brain. However, the test-retest (TRT) reliability of graph metrics of functional networks has not been systematically examined. Here, we investigated TRT reliability of topological metrics of functional brain networks derived from resting-state functional magnetic resonance imaging data. Specifically, we evaluated both short-term (5 months apart) TRT reliability for 12 global and 6 local nodal network metrics. We found that reliability of global network metrics was overall low, threshold-sensitive and dependent on several factors of scanning time interval (TI, long-term>short-term), network membership (NM, networks excluding negative correlations>networks including negative correlations) and network type (NT, binarized networks>weighted networks). The dependence was modulated by another factor of node definition (ND) strategy. The local nodal reliability exhibited large variability across nodal metrics and a spatially heterogeneous distribution. Nodal degree was the most reliable metric and varied the least across the factors above. Hub regions in association and limbic/paralimbic cortices showed moderate TRT reliability. Importantly, nodal reliability was robust to above-mentioned four factors. Simulation analysis revealed that global network metrics were extremely sensitive (but varying degrees) to noise in functional connectivity and weighted networks generated numerically more reliable results in compared with binarized networks. For nodal network metrics, they showed high resistance to noise in functional connectivity and no NT related differences were found in the resistance. These findings provide important implications on how to choose reliable analytical schemes and network metrics of interest. PMID:21818285
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)
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)
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
Integer Flows and Circuit Covers of Graphs and Signed Graphs
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
Graphing trillions of triangles.
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.
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.
Pixels to Graphs by Associative Embedding
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.
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.
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
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)
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.
Twisting formula of epsilon factors
Indian Academy of Sciences (India)
Sazzad Ali Biswas
2017-08-07
Aug 7, 2017 ... In this article, we give a generalized twisting formula for ϵ(χ1χ2,ψ), when both χ1 and χ2 are ramified via the following local Jacobi sums. Let UF be the group of units in OF (ring of integers of F). For characters χ1, χ2 of F. × and a positive integer n, we define the local Jacobi sum. Jt(χ1,χ2, n) = ∑ x∈UF. Un.
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...
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...
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.
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
Creating more effective graphs
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
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.
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...
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.
New twist on artificial muscles.
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.
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.
High Dimensional Spectral Graph Theory and Non-backtracking Random Walks on Graphs
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.
A graph rewriting programming language for graph drawing
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...
Modeling and control of active twist aircraft
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.
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...
de Mol, M.J.; Rensink, Arend; Hunt, James J.
This paper introduces an approach for adding graph transformation-based functionality to existing JAVA programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user’s own JAVA class
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
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...
Perepelitsa, VA; Sergienko, [No Value; Kochkarov, AM
1999-01-01
Definitions of prefractal and fractal graphs are introduced, and they are used to formulate mathematical models in different fields of knowledge. The topicality of fractal-graph recognition from the point of view, of fundamental improvement in the efficiency of the solution of algorithmic problems
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...
Packing Degenerate Graphs Greedily
Czech Academy of Sciences Publication Activity Database
Allen, P.; Böttcher, J.; Hladký, J.; Piguet, Diana
2017-01-01
Roč. 61, August (2017), s. 45-51 ISSN 1571-0653 R&D Projects: GA ČR GJ16-07822Y Institutional support: RVO:67985807 Keywords : tree packing conjecture * graph packing * graph processes Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics
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)
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...
Low-Rank Matrix Factorization With Adaptive Graph Regularizer.
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.
Generalized connectivity of graphs
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.
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.
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.)
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
Autoregressive Moving Average Graph Filtering
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...
Graph Treewidth and Geometric Thickness Parameters
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...
Subgraph detection using graph signals
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.
Subgraph detection using graph signals
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.
Device for measuring well twistings
Energy Technology Data Exchange (ETDEWEB)
Kostin, Yu S; Golubin, S V; Keller, V F; Merzheyevskiy, A B; Zdorov, V P
1982-01-01
The device for measuring the well twistings with the use of fluids (poured into a vessel and which leave an imprint on the walls), containing a housing and adapter, is distinguished by the fact that in order to improve the accuracy of measurement by obtaining a clear imprint, it is equipped with cylinder that is spring-loaded in relation to the adapter, forming a vessel for fluid with the adapter. The adapter is made of two parts, one of which is made of neutral metal in relation to the fluid, and the other, from active in relation to the same fluid.
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.
Fiber-Optic Sensors for Measurements of Torsion, Twist and Rotation: A Review †
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
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
Fiber-Optic Sensors for Measurements of Torsion, Twist and Rotation: A Review.
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.
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
Twist-stretch profiles of DNA chains
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.
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.
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
Tailored Random Graph Ensembles
International Nuclear Information System (INIS)
Roberts, E S; Annibale, A; Coolen, A C C
2013-01-01
Tailored graph ensembles are a developing bridge between biological networks and statistical mechanics. The aim is to use this concept to generate a suite of rigorous tools that can be used to quantify and compare the topology of cellular signalling networks, such as protein-protein interaction networks and gene regulation networks. We calculate exact and explicit formulae for the leading orders in the system size of the Shannon entropies of random graph ensembles constrained with degree distribution and degree-degree correlation. We also construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities which converges to a strictly uniform measure and is based on edge swaps that conserve all degrees. The acceptance probabilities can be generalized to define Markov chains that target any alternative desired measure on the space of directed or undirected graphs, in order to generate graphs with more sophisticated topological features.
Alspach, BR
1985-01-01
This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs. Leading researchers in this area present here 3 survey papers and 42 papers containing new results. There is also a collection of unsolved problems.
Wilson, Robin J
1985-01-01
Graph Theory has recently emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. This book provides a comprehensive introduction to the subject.
Hyperbolicity in median graphs
Indian Academy of Sciences (India)
mic problems in hyperbolic spaces and hyperbolic graphs have been .... that in general the main obstacle is that we do not know the location of ...... [25] Jonckheere E and Lohsoonthorn P, A hyperbolic geometry approach to multipath routing,.
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.
Collective Rationality in Graph Aggregation
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
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
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.
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
Quantisation of monotonic twist maps
International Nuclear Information System (INIS)
Boasman, P.A.; Smilansky, U.
1993-08-01
Using an approach suggested by Moser, classical Hamiltonians are generated that provide an interpolating flow to the stroboscopic motion of maps with a monotonic twist condition. The quantum properties of these Hamiltonians are then studied in analogy with recent work on the semiclassical quantization of systems based on Poincare surfaces of section. For the generalized standard map, the correspondence with the usual classical and quantum results is shown, and the advantages of the quantum Moser Hamiltonian demonstrated. The same approach is then applied to the free motion of a particle on a 2-torus, and to the circle billiard. A natural quantization condition based on the eigenphases of the unitary time--development operator is applied, leaving the exact eigenvalues of the torus, but only the semiclassical eigenvalues for the billiard; an explanation for this failure is proposed. It is also seen how iterating the classical map commutes with the quantization. (authors)
Proxy Graph: Visual Quality Metrics of Big Graph Sampling.
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.
On some covering graphs of a graph
Directory of Open Access Journals (Sweden)
Shariefuddin Pirzada
2016-10-01
Full Text Available For a graph $G$ with vertex set $V(G=\\{v_1, v_2, \\dots, v_n\\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\\{u\\in S : uv \\in E(G \\}\\cup \\{v\\}$ be the closed neighbourhood of the vertex $v$ with respect to $S.$ We define a square matrix $A_S(G= (a_{ij},$ by $a_{ij}=1,$ if $\\left |N_S[v_i]\\cap N_S[v_j] \\right| \\geq 1, i\
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.
Fundamentals of algebraic graph transformation
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...
The STAPL Parallel Graph Library
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.
Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs
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.
White, AT
1985-01-01
The field of topological graph theory has expanded greatly in the ten years since the first edition of this book appeared. The original nine chapters of this classic work have therefore been revised and updated. Six new chapters have been added, dealing with: voltage graphs, non-orientable imbeddings, block designs associated with graph imbeddings, hypergraph imbeddings, map automorphism groups and change ringing.Thirty-two new problems have been added to this new edition, so that there are now 181 in all; 22 of these have been designated as ``difficult'''' and 9 as ``unsolved''''. Three of the four unsolved problems from the first edition have been solved in the ten years between editions; they are now marked as ``difficult''''.
Ribes, Luis
2017-01-01
This book offers a detailed introduction to graph theoretic methods in profinite groups and applications to abstract groups. It is the first to provide a comprehensive treatment of the subject. The author begins by carefully developing relevant notions in topology, profinite groups and homology, including free products of profinite groups, cohomological methods in profinite groups, and fixed points of automorphisms of free pro-p groups. The final part of the book is dedicated to applications of the profinite theory to abstract groups, with sections on finitely generated subgroups of free groups, separability conditions in free and amalgamated products, and algorithms in free groups and finite monoids. Profinite Graphs and Groups will appeal to students and researchers interested in profinite groups, geometric group theory, graphs and connections with the theory of formal languages. A complete reference on the subject, the book includes historical and bibliographical notes as well as a discussion of open quest...
Subdominant pseudoultrametric on graphs
Energy Technology Data Exchange (ETDEWEB)
Dovgoshei, A A; Petrov, E A [Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk (Ukraine)
2013-08-31
Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)→R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k≥2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.
Transduction on Directed Graphs via Absorbing Random Walks.
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.
Quantitative graph theory mathematical foundations and applications
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
Cheung, King Sing
2014-01-01
Petri nets are a formal and theoretically rich model for the modelling and analysis of systems. A subclass of Petri nets, augmented marked graphs possess a structure that is especially desirable for the modelling and analysis of systems with concurrent processes and shared resources.This monograph consists of three parts: Part I provides the conceptual background for readers who have no prior knowledge on Petri nets; Part II elaborates the theory of augmented marked graphs; finally, Part III discusses the application to system integration. The book is suitable as a first self-contained volume
Dayal, Amit; Brock, David
2018-01-01
Prashant Chandrasekar, a lead developer for the Social Interactome project, has tasked the team with creating a graph representation of the data collected from the social networks involved in that project. The data is currently stored in a MySQL database. The client requested that the graph database be Cayley, but after a literature review, Neo4j was chosen. The reasons for this shift will be explained in the design section. Secondarily, the team was tasked with coming up with three scena...
Stevanovic, Dragan
2015-01-01
Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. The primer begins with a brief classical review, in order to provide the reader with a foundation for the subsequent chapters. Topics covered include spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem. From this introduction, the
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.)
Twisted Vector Bundles on Pointed Nodal Curves
Indian Academy of Sciences (India)
Abstract. Motivated by the quest for a good compactification of the moduli space of -bundles on a nodal curve we establish a striking relationship between Abramovich's and Vistoli's twisted bundles and Gieseker vector bundles.
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)
Graph embedding with rich information through heterogeneous graph
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
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.
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....
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.
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.
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)
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....
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....
Handbook of graph grammars and computing by graph transformation
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
Topics in graph theory graphs and their Cartesian product
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.
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
Bisseling, R.H.; Byrka, J.; Cerav-Erbas, S.; Gvozdenovic, N.; Lorenz, M.; Pendavingh, R.A.; Reeves, C.; Röger, M.; Verhoeven, A.; Berg, van den J.B.; Bhulai, S.; Hulshof, J.; Koole, G.; Quant, C.; Williams, J.F.
2006-01-01
Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph with vertices representing the programs of the system and arcs representing calls from one program to
Coloring geographical threshold graphs
Energy Technology Data Exchange (ETDEWEB)
Bradonjic, Milan [Los Alamos National Laboratory; Percus, Allon [Los Alamos National Laboratory; Muller, Tobias [EINDHOVEN UNIV. OF TECH
2008-01-01
We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyze the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.
Budhiraja, A.S.; Mukherjee, D.; Wu, R.
2017-01-01
We consider a variation of the supermarket model in which the servers can communicate with their neighbors and where the neighborhood relationships are described in terms of a suitable graph. Tasks with unit-exponential service time distributions arrive at each vertex as independent Poisson
DEFF Research Database (Denmark)
Kucharik, Marcel; Hofacker, Ivo; Stadler, Peter
2014-01-01
of the folding free energy landscape, however, can provide the relevant information. Results We introduce the basin hopping graph (BHG) as a novel coarse-grained model of folding landscapes. Each vertex of the BHG is a local minimum, which represents the corresponding basin in the landscape. Its edges connect...
The STAPL Parallel Graph Library
Harshvardhan,; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence
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
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.
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
Energy Technology Data Exchange (ETDEWEB)
Winlaw, Manda [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); De Sterck, Hans [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Sanders, Geoffrey [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2015-10-26
In very simple terms a network can be de ned as a collection of points joined together by lines. Thus, networks can be used to represent connections between entities in a wide variety of elds including engi- neering, science, medicine, and sociology. Many large real-world networks share a surprising number of properties, leading to a strong interest in model development research and techniques for building synthetic networks have been developed, that capture these similarities and replicate real-world graphs. Modeling these real-world networks serves two purposes. First, building models that mimic the patterns and prop- erties of real networks helps to understand the implications of these patterns and helps determine which patterns are important. If we develop a generative process to synthesize real networks we can also examine which growth processes are plausible and which are not. Secondly, high-quality, large-scale network data is often not available, because of economic, legal, technological, or other obstacles [7]. Thus, there are many instances where the systems of interest cannot be represented by a single exemplar network. As one example, consider the eld of cybersecurity, where systems require testing across diverse threat scenarios and validation across diverse network structures. In these cases, where there is no single exemplar network, the systems must instead be modeled as a collection of networks in which the variation among them may be just as important as their common features. By developing processes to build synthetic models, so-called graph generators, we can build synthetic networks that capture both the essential features of a system and realistic variability. Then we can use such synthetic graphs to perform tasks such as simulations, analysis, and decision making. We can also use synthetic graphs to performance test graph analysis algorithms, including clustering algorithms and anomaly detection algorithms.
Groupies in multitype random graphs
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.
Groupies in multitype random graphs.
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.
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.
A generalization of total graphs
Indian Academy of Sciences (India)
M Afkhami
2018-04-12
Apr 12, 2018 ... product of any lower triangular matrix with the transpose of any element of U belongs to U. The ... total graph of R, which is denoted by T( (R)), is a simple graph with all elements of R as vertices, and ...... [9] Badawi A, On dot-product graph of a commutative ring, Communications in Algebra 43 (2015). 43–50.
Graph transformation tool contest 2008
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
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) =.
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.
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.
Connected Colourings of Complete Graphs and Hypergraphs
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}...
Efficient Graph Computation for Node2Vec
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...
Graph-based semi-supervised learning
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
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...
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.
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
Herdable Systems Over Signed, Directed Graphs
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.
Learning molecular energies using localized graph kernels
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.
Herdable Systems Over Signed, Directed Graphs
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.
graphkernels: R and Python packages for graph comparison.
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.
Szostak, Roman; Shi, Shicheng; Meng, Guangrong; Lalancette, Roger; Szostak, Michal
2016-09-02
Amide N-C(O) bonds are generally unreactive in cross-coupling reactions employing low-valent transition metals due to nN → π*C═O resonance. Herein we demonstrate that N-acyl-tert-butyl-carbamates (Boc) and N-acyl-tosylamides (Ts), two classes of acyclic amides that have recently enabled the development of elusive amide bond N-C cross-coupling reactions with organometallic reagents, are intrinsically twisted around the N-C(O) axis. The data have important implications for the design of new amide cross-coupling reactions with the N-C(O) amide bond cleavage as a key step.
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
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
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....
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.
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.
Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph
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
Graph Sampling for Covariance Estimation
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.
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.
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...
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.
Learning heat diffusion graphs
Thanou, Dorina; Dong, Xiaowen; Kressner, Daniel; Frossard, Pascal
2016-01-01
Effective information analysis generally boils down to properly identifying the structure or geometry of the data, which is often represented by a graph. In some applications, this structure may be partly determined by design constraints or pre-determined sensing arrangements, like in road transportation networks for example. In general though, the data structure is not readily available and becomes pretty difficult to define. In particular, the global smoothness assumptions, that most of the...
Syed, M. Qasim; Lovatt, Ian
2014-01-01
This paper is an addition to the series of papers on the exponential function begun by Albert Bartlett. In particular, we ask how the graph of the exponential function y = e[superscript -t/t] would appear if y were plotted versus ln t rather than the normal practice of plotting ln y versus t. In answering this question, we find a new way to…
Understanding Charts and Graphs.
1987-07-28
Farenheit degrees, which have no Onaturalo zero ); finally, ratio scales have numbers that are ordered so that the magnitudes of differences are important and...system. They have to do with the very nature of how marks serve as meaningful symbols. In the ideal case, a chart or graph will be absolutely unambiguous...and these laws comprise this principle (see Stevens, 1974). Absolute discriminability: A minimal magnitude of a mark is necessary for it to be detected
Integral Twist Actuation of Helicopter Rotor Blades for Vibration Reduction
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
Exclusivity structures and graph representatives of local complementation orbits
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.
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.
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}$.
Denjoy minimal sets and Birkhoff periodic orbits for non-exact monotone twist maps
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.
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)
Factorising the 3D topologically twisted index
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.
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...
X-Graphs: Language and Algorithms for Heterogeneous Graph Streams
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
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
Localization in random bipartite graphs: Numerical and empirical study
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.
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.
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.
Endomorphisms of graph algebras
DEFF Research Database (Denmark)
Conti, Roberto; Hong, Jeong Hee; Szymanski, Wojciech
2012-01-01
We initiate a systematic investigation of endomorphisms of graph C*-algebras C*(E), extending several known results on endomorphisms of the Cuntz algebras O_n. Most but not all of this study is focused on endomorphisms which permute the vertex projections and globally preserve the diagonal MASA D...... that the restriction to the diagonal MASA of an automorphism which globally preserves both D_E and the core AF-subalgebra eventually commutes with the corresponding one-sided shift. Secondly, we exhibit several properties of proper endomorphisms, investigate invertibility of localized endomorphisms both on C...
Yap, Hian-Poh
1996-01-01
This book provides an up-to-date and rapid introduction to an important and currently active topic in graph theory. The author leads the reader to the forefront of research in this area. Complete and easily readable proofs of all the main theorems, together with numerous examples, exercises and open problems are given. The book is suitable for use as a textbook or as seminar material for advanced undergraduate and graduate students. The references are comprehensive and so it will also be useful for researchers as a handbook.
Twist operators in N=4 beta-deformed theory
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
Graph Algorithm Animation with Grrr
Rodgers, Peter; Vidal, Natalia
2000-01-01
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and profiling of Grrr code, but recently it has been extended for the purpose of teaching algorithms to undergraduate students. The animation is restricted to graph based algorithms such as graph drawing, list manipulation or more traditional gra...
Twisted Frobenius Identities from Vertex Operator Superalgebras
Directory of Open Access Journals (Sweden)
Alexander Zuevsky
2017-01-01
Full Text Available In consideration of the continuous orbifold partition function and a generating function for all n-point correlation functions for the rank two free fermion vertex operator superalgebra on the self-sewing torus, we introduce the twisted version of Frobenius identity.
Magnetization Modeling of Twisted Superconducting Filaments
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...
Hilbert's Grand Hotel with a series twist
Wijeratne, Chanakya; Mamolo, Ami; Zazkis, Rina
2014-08-01
This paper presents a new twist on a familiar paradox, linking seemingly disparate ideas under one roof. Hilbert's Grand Hotel, a paradox which addresses infinite set comparisons is adapted and extended to incorporate ideas from calculus - namely infinite series. We present and resolve several variations, and invite the reader to explore his or her own variations.
On the Compton Twist-3 Asymmetries
International Nuclear Information System (INIS)
Korotkiyan, V.M.; Teryaev, O.V.
1994-01-01
The 'fermionic poles' contribution to the twist-3 single asymmetry in the gluon Compton process is calculated. The 'gluonic poles' existence seems to contradict the density matrix positivity. Qualitative predictions for the direct photon and jets asymmetries are presented. 13 refs., 2 figs
Generalized Weyl modules for twisted current algebras
Makedonskyi, I. A.; Feigin, E. B.
2017-08-01
We introduce the notion of generalized Weyl modules for twisted current algebras. We study their representation-theoretic and combinatorial properties and also their connection with nonsymmetric Macdonald polynomials. As an application, we compute the dimension of the classical Weyl modules in the remaining unknown case.
Hardy Inequalities in Globally Twisted Waveguides
Czech Academy of Sciences Publication Activity Database
Briet, Ph.; Hammedi, H.; Krejčiřík, David
2015-01-01
Roč. 105, č. 7 (2015), s. 939-958 ISSN 0377-9017 R&D Projects: GA ČR(CZ) GA14-06818S Institutional support: RVO:61389005 Keywords : quantum waveguides * twisted tubes * Dirichlet Laplacian * Hardy inequality Subject RIV: BE - Theoretical Physics Impact factor: 1.517, year: 2015
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.
Eulerian Graphs and Related Topics
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
Morphing wing structure with controllable twist based on adaptive bending-twist coupling
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.
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)
Energy Technology Data Exchange (ETDEWEB)
Maunz, Peter Lukas Wilhelm [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sterk, Jonathan David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lobser, Daniel [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Parekh, Ojas D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Ryan-Anderson, Ciaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2016-01-01
In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.
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.
ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS
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.
Optics of twisted nematic and supertwisted nematic liquid-crystal displays
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.
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.
Angular momentum transport with twisted exciton wave packets
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.
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.
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)
The One Universal Graph — a free and open graph database
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.
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.
Multigraph: Interactive Data Graphs on the Web
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
A novel role for Twist-1 in pulp homeostasis.
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.
The planar cubic Cayley graphs
Georgakopoulos, Agelos
2018-01-01
The author obtains a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. He obtains counterexamples to conjectures of Mohar, Bonnington and Watkins. The author's analysis makes the involved graphs accessible to computation, corroborating a conjecture of Droms.
Groupies in random bipartite graphs
Yilun Shang
2010-01-01
A vertex $v$ of a graph $G$ is called a groupie if its degree is notless than the average of the degrees of its neighbors. In thispaper we study the influence of bipartition $(B_1,B_2)$ on groupiesin random bipartite graphs $G(B_1,B_2,p)$ with both fixed $p$ and$p$ tending to zero.
Nested Dynamic Condition Response Graphs
DEFF Research Database (Denmark)
Hildebrandt, Thomas; Mukkamala, Raghava Rao; Slaats, Tijs
2012-01-01
We present an extension of the recently introduced declarative process model Dynamic Condition Response Graphs ( DCR Graphs) to allow nested subgraphs and a new milestone relation between events. The extension was developed during a case study carried out jointly with our industrial partner...
Graph Sampling for Covariance Estimation
Chepuri, Sundeep Prabhakar; Leus, Geert
2017-01-01
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
Network reconstruction via graph blending
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.
A cluster algorithm for graphs
S. van Dongen
2000-01-01
textabstractA cluster algorithm for graphs called the emph{Markov Cluster algorithm (MCL~algorithm) is introduced. The algorithm provides basically an interface to an algebraic process defined on stochastic matrices, called the MCL~process. The graphs may be both weighted (with nonnegative weight)
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.
International Nuclear Information System (INIS)
Uren, Kenneth Richard; Schoor, George van
2013-01-01
This second paper in a two part series presents the application of a developed state space model extraction methodology applied to a Brayton cycle-based PCU (power conversion unit) of a PBMR (pebble bed modular reactor). The goal is to investigate if the state space extraction methodology can cope with larger and more complex thermohydraulic systems. In Part I the state space model extraction methodology for the purpose of control was described in detail and a state space representation was extracted for a U-tube system to illustrate the concept. In this paper a 25th order nonlinear state space representation in terms of the different energy domains is extracted. This state space representation is solved and the responses of a number of important states are compared with results obtained from a PBMR PCU Flownex ® model. Flownex ® is a validated thermo fluid simulation software package. The results show that the state space model closely resembles the dynamics of the PBMR PCU. This kind of model may be used for nonlinear MIMO (multi-input, multi-output) type of control strategies. However, there is still a need for linear state space models since many control system design and analysis techniques require a linear state space model. This issue is also addressed in this paper by showing how a linear state space model can be derived from the extracted nonlinear state space model. The linearised state space model is also validated by comparing the state space model to an existing linear Simulink ® model of the PBMR PCU system. - Highlights: • State space model extraction of a pebble bed modular reactor PCU (power conversion unit). • A 25th order nonlinear time varying state space model is obtained. • Linearisation of a nonlinear state space model for use in power output control. • Non-minimum phase characteristic that is challenging in terms of control. • Models derived are useful for MIMO control strategies
Planar graphs theory and algorithms
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.
Quantum chaos on discrete graphs
International Nuclear Information System (INIS)
Smilansky, Uzy
2007-01-01
Adapting a method developed for the study of quantum chaos on quantum (metric) graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76), spectral ζ functions and trace formulae for discrete Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph and obtaining functions which belong to the class of ζ functions proposed originally by Ihara (1966 J. Mat. Soc. Japan 18 219) and expanded by subsequent authors (Stark and Terras 1996 Adv. Math. 121 124, Kotani and Sunada 2000 J. Math. Sci. Univ. Tokyo 7 7). Finally, a model of 'classical dynamics' on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76). (fast track communication)
RJSplot: Interactive Graphs with R.
Barrios, David; Prieto, Carlos
2018-03-01
Data visualization techniques provide new methods for the generation of interactive graphs. These graphs allow a better exploration and interpretation of data but their creation requires advanced knowledge of graphical libraries. Recent packages have enabled the integration of interactive graphs in R. However, R provides limited graphical packages that allow the generation of interactive graphs for computational biology applications. The present project has joined the analytical power of R with the interactive graphical features of JavaScript in a new R package (RJSplot). It enables the easy generation of interactive graphs in R, provides new visualization capabilities, and contributes to the advance of computational biology analytical methods. At present, 16 interactive graphics are available in RJSplot, such as the genome viewer, Manhattan plots, 3D plots, heatmaps, dendrograms, networks, and so on. The RJSplot package is freely available online at http://rjsplot.net. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.
Faucet: streaming de novo assembly graph construction.
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.
Twisted condensates of quantized fields
International Nuclear Information System (INIS)
Gallone, F.; Sparzani, A.; Ubertone, G.; Streater, R.F.
We construct some quasi-free pure states of free quantized fields in 1+1 dimensions, that are localized in the sense of Knight. We consider massless or massive Dirac fields forming a U(n), n >= 1, multiplet and subject it to a local gauge transformation. We also subject a doublet of massive Klein-Gordon fields to local SO(2) transformations. We find the conditions that the resulting automorphism is spatial in Fock space. In some cases the conditions turn out to require that certain parameters, identified as the winding numbers of the gauge, are integers. It is argued that this integer labels states of various charge. (orig.)
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.
Supersymmetric twisting of carbon nanotubes
Czech Academy of Sciences Publication Activity Database
Jakubský, Vít; Plyushchay, M. S.
2012-01-01
Roč. 85, č. 4 (2012), 045035 ISSN 1550-7998 R&D Projects: GA AV ČR GPP203/11/P038 Institutional research plan: CEZ:AV0Z10480505 Keywords : quantum wave-guides * bound-states * condensed-matter Subject RIV: BE - Theoretical Physics Impact factor: 4.691, year: 2012
Graph embedding with rich information through heterogeneous graph
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.
CORECLUSTER: A Degeneracy Based Graph Clustering Framework
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...
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
Quantum walks of two interacting particles on percolation graphs
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.
A New Twisting Somersault: 513XD
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.
Chiral tunneling in a twisted graphene bilayer.
He, Wen-Yu; Chu, Zhao-Dong; He, Lin
2013-08-09
The perfect transmission in a graphene monolayer and the perfect reflection in a Bernal graphene bilayer for electrons incident in the normal direction of a potential barrier are viewed as two incarnations of the Klein paradox. Here we show a new and unique incarnation of the Klein paradox. Owing to the different chiralities of the quasiparticles involved, the chiral fermions in a twisted graphene bilayer show an adjustable probability of chiral tunneling for normal incidence: they can be changed from perfect tunneling to partial or perfect reflection, or vice versa, by controlling either the height of the barrier or the incident energy. As well as addressing basic physics about how the chiral fermions with different chiralities tunnel through a barrier, our results provide a facile route to tune the electronic properties of the twisted graphene bilayer.
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.
IRONY IN CHARLES DICKEN'S OLIVER TWIST
Directory of Open Access Journals (Sweden)
Ika Kana Trisnawati
2016-05-01
Full Text Available This paper describes the types of irony used by Charles Dickens in his notable early work, Oliver Twist, as well as the reasons the irony was chosen. As a figurative language, irony is utilized to express one’s complex feelings without truly saying them. In Oliver Twist, Dickens brought the readers some real social issues wrapped in dark, deep written expressions of irony uttered by the characters of his novel. Undoubtedly, the novel had left an impact to the British society at the time. The irony Dickens displayed here includes verbal, situational, and dramatic irony. His choice of irony made sense as he intended to criticize the English Poor Laws and to touch the public sentiment. He wanted to let the readers go beyond what was literally written and once they discovered what the truth was, they would eventually understand Dickens’ purposes.
Leibniz algebroids, twistings and exceptional generalized geometry
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.
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].
Label Information Guided Graph Construction for Semi-Supervised Learning.
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.
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.
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.
Chiral Tunnelling in Twisted Graphene Bilayer
He, Wen-Yu; Chu, Zhao-Dong; He, Lin
2013-01-01
The perfect transmission in graphene monolayer and the perfect reflection in Bernal graphene bilayer for electrons incident in the normal direction of a potential barrier are viewed as two incarnations of the Klein paradox. Here we show a new and unique incarnation of the Klein paradox. Owing to the different chiralities of the quasiparticles involved, the chiral fermions in twisted graphene bilayer shows adjustable probability of chiral tunnelling for normal incidence: they can be changed fr...
Vacuum expectation value of twist fields
Belitsky, A. V.
2017-09-01
Twist fields emerge in a number of physical applications ranging from entanglement entropy to scattering amplitudes in four-dimensional gauge theories. In this work, their vacuum expectation values are studied in the path integral framework. By performing a gauge transformation, their correlation functions are reduced to field theory of matter fields in external Aharonov-Bohm vortices. The resulting functional determinants are then analyzed within the zeta-function regularization for the spectrum of Bessel zeros, and concise formulas are derived.
Leibniz algebroids, twistings and exceptional generalized geometry
Baraglia, David
2011-01-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_\\infty$-structure. The algebroids can be twisted by a non-abelian cohomology class and we prove that the twis...
System dynamics and control with bond graph modeling
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...
Twisted quantum double model of topological order with boundaries
Bullivant, Alex; Hu, Yuting; Wan, Yidun
2017-10-01
We generalize the twisted quantum double model of topological orders in two dimensions to the case with boundaries by systematically constructing the boundary Hamiltonians. Given the bulk Hamiltonian defined by a gauge group G and a 3-cocycle in the third cohomology group of G over U (1 ) , a boundary Hamiltonian can be defined by a subgroup K of G and a 2-cochain in the second cochain group of K over U (1 ) . The consistency between the bulk and boundary Hamiltonians is dictated by what we call the Frobenius condition that constrains the 2-cochain given the 3-cocyle. We offer a closed-form formula computing the ground-state degeneracy of the model on a cylinder in terms of the input data only, which can be naturally generalized to surfaces with more boundaries. We also explicitly write down the ground-state wave function of the model on a disk also in terms of the input data only.
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.
Semantic graphs and associative memories
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.
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.
Transverse kink oscillations in the presence of twist
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.
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...
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.
XML Graphs in Program Analysis
DEFF Research Database (Denmark)
Møller, Anders; Schwartzbach, Michael I.
2011-01-01
of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey the use of XML graphs for program analysis with four very different languages: XACT (XML in Java), Java Servlets (Web application programming), XSugar......XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...
Rabern, Landon
2007-01-01
We improve upper bounds on the chromatic number proven independently in \\cite{reedNote} and \\cite{ingo}. Our main lemma gives a sufficient condition for two paths in graph to be completely joined. Using this, we prove that if a graph has an optimal coloring with more than $\\frac{\\omega}{2}$ singleton color classes, then it satisfies $\\chi \\leq \\frac{\\omega + \\Delta + 1}{2}$. It follows that a graph satisfying $n - \\Delta < \\alpha + \\frac{\\omega - 1}{2}$ must also satisfy $\\chi \\leq \\frac{\\ome...
Graphs with Eulerian unit spheres
Knill, Oliver
2015-01-01
d-spheres in graph theory are inductively defined as graphs for which all unit spheres S(x) are (d-1)-spheres and that the removal of one vertex renders the graph contractible. Eulerian d-spheres are geometric d-spheres which are d+1 colorable. We prove here that G is an Eulerian sphere if and only if the degrees of all the (d-2)-dimensional sub-simplices in G are even. This generalizes a Kempe-Heawood result for d=2 and is work related to the conjecture that all d-spheres have chromatic numb...
Design optimization for active twist rotor blades
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
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.
Szabó, György; Fáth, Gábor
2007-07-01
Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first four sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fifth section surveys the topological complications implied by non-mean-field-type social network structures in general. The next three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner's Dilemma, the Rock-Scissors-Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.
Bond graph model-based fault diagnosis of hybrid systems
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...
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.
Properly colored connectivity of graphs
Li, Xueliang; Qin, Zhongmei
2018-01-01
A comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security. Beginning with a brief introduction, comprising relevant definitions and preliminary results, this book moves on to consider a variety of properties of graphs that imply bounds on the proper connection number. Detailed proofs of significant advancements toward open problems and conjectures are presented with complete references. Researchers and graduate students with an interest in graph connectivity and colorings will find this book useful as it builds upon fundamental definitions towards modern innovations, strategies, and techniques. The detailed presentation lends to use as an introduction to proper connection of graphs for new and advanced researchers, a solid book for a graduate level topics course, or as a reference for those interested in expanding and further developing research in the area.
Graph anomalies in cyber communications
Energy Technology Data Exchange (ETDEWEB)
Vander Wiel, Scott A [Los Alamos National Laboratory; Storlie, Curtis B [Los Alamos National Laboratory; Sandine, Gary [Los Alamos National Laboratory; Hagberg, Aric A [Los Alamos National Laboratory; Fisk, Michael [Los Alamos National Laboratory
2011-01-11
Enterprises monitor cyber traffic for viruses, intruders and stolen information. Detection methods look for known signatures of malicious traffic or search for anomalies with respect to a nominal reference model. Traditional anomaly detection focuses on aggregate traffic at central nodes or on user-level monitoring. More recently, however, traffic is being viewed more holistically as a dynamic communication graph. Attention to the graph nature of the traffic has expanded the types of anomalies that are being sought. We give an overview of several cyber data streams collected at Los Alamos National Laboratory and discuss current work in modeling the graph dynamics of traffic over the network. We consider global properties and local properties within the communication graph. A method for monitoring relative entropy on multiple correlated properties is discussed in detail.
Open Graphs and Computational Reasoning
Directory of Open Access Journals (Sweden)
Lucas Dixon
2010-06-01
Full Text Available We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of half-edges (edges which are drawn with an unconnected end and enjoy rich compositional principles by connecting graphs along these half-edges. In particular, this allows equations and rewrite rules to be specified between graphs. Particular computational models can then be encoded as an axiomatic set of such rules. Further rules can be derived graphically and rewriting can be used to simulate the dynamics of a computational system, e.g. evaluating a program on an input. Examples of models which can be formalised in this way include traditional electronic circuits as well as recent categorical accounts of quantum information.
Woeginger, G.J.
1998-01-01
In this short note we argue that the toughness of split graphs can be computed in polynomial time. This solves an open problem from a recent paper by Kratsch et al. (Discrete Math. 150 (1996) 231–245).
Generating random networks and graphs
Coolen, Ton; Roberts, Ekaterina
2017-01-01
This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of rand...
Graph theory and its applications
Gross, Jonathan L
2006-01-01
Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.
Twisted Vanes Would Enhance Fuel/Air Mixing In Turbines
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.
A faithful functor among algebras and graphs
Falcón Ganfornina, Óscar Jesús; Falcón Ganfornina, Raúl Manuel; Núñez Valdés, Juan; Pacheco Martínez, Ana María; Villar Liñán, María Trinidad; Vigo Aguiar, Jesús (Coordinador)
2016-01-01
The problem of identifying a functor between the categories of algebras and graphs is currently open. Based on a known algorithm that identifies isomorphisms of Latin squares with isomorphism of vertex-colored graphs, we describe here a pair of graphs that enable us to find a faithful functor between finite-dimensional algebras over finite fields and these graphs.
Graphs with branchwidth at most three
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
Graphs whose complement and square are isomorphic
DEFF Research Database (Denmark)
Pedersen, Anders Sune
2014-01-01
We study square-complementary graphs, that is, graphs whose complement and square are isomorphic. We prove several necessary conditions for a graph to be square-complementary, describe ways of building new square-complementary graphs from existing ones, construct infinite families of square-compl...
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...
Building Scalable Knowledge Graphs for Earth Science
Ramachandran, Rahul; Maskey, Manil; Gatlin, Patrick; Zhang, Jia; Duan, Xiaoyi; Miller, J. J.; Bugbee, Kaylin; Christopher, Sundar; Freitag, Brian
2017-01-01
Knowledge Graphs link key entities in a specific domain with other entities via relationships. From these relationships, researchers can query knowledge graphs for probabilistic recommendations to infer new knowledge. Scientific papers are an untapped resource which knowledge graphs could leverage to accelerate research discovery. Goal: Develop an end-to-end (semi) automated methodology for constructing Knowledge Graphs for Earth Science.
Port-Hamiltonian Systems on Open Graphs
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
Constructing Dense Graphs with Unique Hamiltonian Cycles
Lynch, Mark A. M.
2012-01-01
It is not difficult to construct dense graphs containing Hamiltonian cycles, but it is difficult to generate dense graphs that are guaranteed to contain a unique Hamiltonian cycle. This article presents an algorithm for generating arbitrarily large simple graphs containing "unique" Hamiltonian cycles. These graphs can be turned into dense graphs…
Skew-adjacency matrices of graphs
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
Commuting graphs of matrix algebras
International Nuclear Information System (INIS)
Akbari, S.; Bidkhori, H.; Mohammadian, A.
2006-08-01
The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all non- central elements of R and two distinct vertices x and y are adjacent if and only if xy = yx. The commuting graph of a group G, denoted by Γ(G), is similarly defined. In this paper we investigate some graph theoretic properties of Γ(M n (F)), where F is a field and n ≥ 2. Also we study the commuting graphs of some classical groups such as GL n (F) and SL n (F). We show that Γ(M n (F)) is a connected graph if and only if every field extension of F of degree n contains a proper intermediate field. We prove that apart from finitely many fields, a similar result is true for Γ(GL n (F)) and Γ(SL n (F)). Also we show that for two fields E and F and integers m, n ≥> 2, if Γ(M m (E)) ≅ Γ(M n (F)), then m = n and vertical bar E vertical bar = vertical bar F vertical bar. (author)
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.
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.)
Twisted sigma-model solitons on the quantum projective line
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.
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.
The forwarding indices of graphs - a survey
Directory of Open Access Journals (Sweden)
Jun-Ming Xu
2013-01-01
Full Text Available A routing \\(R\\ of a connected graph \\(G\\ of order \\(n\\ is a collection of \\(n(n-1\\ simple paths connecting every ordered pair of vertices of \\(G\\. The vertex-forwarding index \\(\\xi(G,R\\ of \\(G\\ with respect to a routing \\(R\\ is defined as the maximum number of paths in \\(R\\ passing through any vertex of \\(G\\. The vertex-forwarding index \\(\\xi(G\\ of \\(G\\ is defined as the minimum \\(\\xi(G,R\\ over all routings \\(R\\ of \\(G\\. Similarly, the edge-forwarding index \\(\\pi(G,R\\ of \\(G\\ with respect to a routing \\(R\\ is the maximum number of paths in \\(R\\ passing through any edge of \\(G\\. The edge-forwarding index \\(\\pi(G\\ of \\(G\\ is the minimum \\(\\pi(G,R\\ over all routings \\(R\\ of \\(G\\. The vertex-forwarding index or the edge-forwarding index corresponds to the maximum load of the graph. Therefore, it is important to find routings minimizing these indices and thus has received much research attention for over twenty years. This paper surveys some known results on these forwarding indices, further research problems and several conjectures, also states some difficulty and relations to other topics in graph theory.
Nonlinear and hysteretic twisting effects in ocean cable laying
International Nuclear Information System (INIS)
Shashaty, A.J.
1983-01-01
Armored ocean cable unlays under the action of installation tensions and restraining moments applied by the ocean bottom and the ship's bow sheave. The process of elongation and twist is nonlinear and hysteretic. This process has often been assumed linear and reversible. The equations describing the moment which is developed in laying cable on the ocean bottom are worked out, without assuming linearity and reversibility. These equations are applied to some cases likely to arise. For a typical armored coaxial cable laid in 3700m (2,000 fathoms) depth without bottom tension, a steady-state laying-up moment of 134Nm (99 lbs. ft.) is developed. For the reversible case, no moment is developed. If the bottom tension is increased from zero to 33,375N (7500 lbs.) and then returned to zero, a peak moment of 198Nm (146 lbs. ft.) is developed
Twisting and Writhing with George Ellery Hale
Canfield, Richard C.
2013-06-01
Early in his productive career in astronomy, George Ellery Hale developed innovative solar instrumentation that allowed him to make narrow-band images. Among the solar phenomena he discovered were sunspot vortices, which he attributed to storms akin to cyclones in our own atmosphere. Using the concept of magnetic helicity, physicists and mathematicians describe the topology of magnetic fields, including twisting and writhing. Our contemporary understanding of Hale's vortices as a consequence of large-scale twist in sunspot magnetic fields hinges on a key property of helicity: conservation. I will describe the critical role that this property plays, when applied to twist and writhe, in a fundamental aspect of global solar magnetism: the hemispheric and solar cycle dependences of active region electric currents with respect to magnetic fields. With the advent of unbroken sequences of high-resolution magnetic images, such as those presently available from the Helioseismic and Magnetic Imager on Solar Dynamics Observatory, the flux of magnetic helicity through the photosphere can be observed quantitatively. As magnetic flux tubes buoy up through the convection zone, buffeted and shredded by turbulence, they break up into fragments by repeated random bifurcation. We track these rising flux fragments in the photosphere, and calculate the flux of energy and magnetic helicity there. Using a quantitative model of coronal currents, we also track connections between these fragments to calculate the energy and magnetic helicity stored at topological interfaces that are in some ways analogous to the storage of stress at faults in the Earth's crust. Comparison of these values to solar flares and interplanetary coronal mass ejections implies that this is the primary storage mechanism for energy and magnetic helicity released in those phenomena, and suggests a useful tool for quantitative prediction of geomagnetic storms.
Interactive Graph Layout of a Million Nodes
Peng Mi; Maoyuan Sun; Moeti Masiane; Yong Cao; Chris North
2016-01-01
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 to...
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.
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%.
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.
Twisted Polynomials and Forgery Attacks on GCM
DEFF Research Database (Denmark)
Abdelraheem, Mohamed Ahmed A. M. A.; Beelen, Peter; Bogdanov, Andrey
2015-01-01
Polynomial hashing as an instantiation of universal hashing is a widely employed method for the construction of MACs and authenticated encryption (AE) schemes, the ubiquitous GCM being a prominent example. It is also used in recent AE proposals within the CAESAR competition which aim at providing...... in an improved key recovery algorithm. As cryptanalytic applications of our twisted polynomials, we develop the first universal forgery attacks on GCM in the weak-key model that do not require nonce reuse. Moreover, we present universal weak-key forgeries for the nonce-misuse resistant AE scheme POET, which...
Optical twists in phase and amplitude
DEFF Research Database (Denmark)
Daria, Vincent R.; Palima, Darwin; Glückstad, Jesper
2011-01-01
where both phase and amplitude express a helical profile as the beam propagates in free space. Such a beam can be accurately referred to as an optical twister. We characterize optical twisters and demonstrate their capacity to induce spiral motion on particles trapped along the twisters’ path. Unlike LG...... beams, the far field projection of the twisted optical beam maintains a high photon concentration even at higher values of topological charge. Optical twisters have therefore profound applications to fundamental studies of light and atoms such as in quantum entanglement of the OAM, toroidal traps...
NMSBA - Twist Resist - Rotational Exercise Module
Energy Technology Data Exchange (ETDEWEB)
Walker, Aaron [Twist Resist, Albuquerque, NM (United States); Reece, Blake D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Berger, Jason E. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Guido, Steven Frank [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Linker, Taylor [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2016-08-01
This report contains a summary of the work completed to develop a modular, rotational exercise device. In the report are images, diagrams, and explanations of the efforts contributed to the project since its inception. The purpose of this document is to provide a walk-through of the progress on this project, from the initial design concepts to the final design and work done, so that the customer (Twist Resist), or individuals/firms who work on this project in the future will have a springboard of ideas/concepts to work from.
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.
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...
Processing mechanics of alternate twist ply (ATP) yarn technology
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
Overlapping community detection based on link graph using distance dynamics
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.
Benchmarking Measures of Network Controllability on Canonical Graph Models
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
On reflection algebras and twisted Yangians
International Nuclear Information System (INIS)
Doikou, Anastasia
2005-01-01
It is well known that integrable models associated to rational R matrices give rise to certain non-Abelian symmetries known as Yangians. Analogously boundary symmetries arise when general but still integrable boundary conditions are implemented, as originally argued by Delius, Mackay, and Short from the field theory point of view, in the context of the principal chiral model on the half-line. In the present study we deal with a discrete quantum mechanical system with boundaries, that is the N site gl(n) open quantum spin chain. In particular, the open spin chain with two distinct types of boundary condition known as soliton preserving and soliton nonpreserving is considered. For both types of boundaries we present a unified framework for deriving the corresponding boundary nonlocal charges directly at the quantum level. The nonlocal charges are simply coproduct realizations of particular boundary quantum algebras called boundary or twisted Yangians, depending on the choice of boundary conditions. Finally, with the help of linear intertwining relations between the solutions of the reflection equation and the generators of the boundary or twisted Yangians we are able to exhibit the exact symmetry of the open spin chain, namely we show that a number of the boundary nonlocal charges are in fact conserved quantities
How the embryonic brain tube twists
Chen, Zi; Guo, Qiaohang; Forsch, Nickolas; Taber, Larry
2014-03-01
During early development, the tubular brain of the chick embryo undergoes a combination of progressive ventral bending and rightward torsion. This deformation is one of the major organ-level symmetry-breaking events in development. Available evidence suggests that bending is caused by differential growth, but the mechanism for torsion remains poorly understood. Since the heart almost always loops in the same direction that the brain twists, researchers have speculated that heart looping affects the direction of brain torsion. However, direct evidence is virtually nonexistent, nor is the mechanical origin of such torsion understood. In our study, experimental perturbations show that the bending and torsional deformations in the brain are coupled and that the vitelline membrane applies an external load necessary for torsion to occur. In addition, the asymmetry of the looping heart gives rise to the chirality of the twisted brain. A computational model is used to interpret these findings. Our work clarifies the mechanical origins of brain torsion and the associated left-right asymmetry, reminiscent of D'Arcy Thompson's view of biological form as ``diagram of forces''.
Drag Performance of Twist Morphing MAV Wing
Directory of Open Access Journals (Sweden)
Ismail N.I.
2016-01-01
Full Text Available Morphing wing is one of latest evolution found on MAV wing. However, due to few design problems such as limited MAV wing size and complicated morphing mechanism, the understanding of its aerodynamic behaviour was not fully explored. In fact, the basic drag distribution induced by a morphing MAV wing is still remained unknown. Thus, present work is carried out to compare the drag performance between a twist morphing wing with membrane and rigid MAV wing design. A quasi-static aeroelastic analysis by using the Ansys-Fluid Structure Interaction (FSI method is utilized in current works to predict the drag performance a twist morphing MAV wing design. Based on the drag pattern study, the results exhibits that the morphing wing has a partial similarities in overall drag pattern with the baseline (membrane and rigid wing. However, based CD analysis, it shows that TM wing induced higher CD magnitude (between 25% to 82% higher than to the baseline wing. In fact, TM wing also induced the largest CD increment (about 20% to 27% among the wings. The visualization on vortex structure revealed that TM wing also produce larger tip vortex structure (compared to baseline wings which presume to promote higher induce drag component and subsequently induce its higher CD performance.
Strong CP, flavor, and twisted split fermions
International Nuclear Information System (INIS)
Harnik, Roni; Perez, Gilad; Schwartz, Matthew D.; Shirman, Yuri
2005-01-01
We present a natural solution to the strong CP problem in the context of split fermions. By assuming CP is spontaneously broken in the bulk, a weak CKM phase is created in the standard model due to a twisting in flavor space of the bulk fermion wavefunctions. But the strong CP phase remains zero, being essentially protected by parity in the bulk and CP on the branes. As always in models of spontaneous CP breaking, radiative corrections to theta bar from the standard model are tiny, but even higher dimension operators are not that dangerous. The twisting phenomenon was recently shown to be generic, and not to interfere with the way that split fermions naturally weaves small numbers into the standard model. It follows that out approach to strong CP is compatible with flavor, and we sketch a comprehensive model. We also look at deconstructed version of this setup which provides a viable 4D model of spontaneous CP breaking which is not in the Nelson-Barr class. (author)
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.
Eigenfunction statistics on quantum graphs
International Nuclear Information System (INIS)
Gnutzmann, S.; Keating, J.P.; Piotet, F.
2010-01-01
We investigate the spatial statistics of the energy eigenfunctions on large quantum graphs. It has previously been conjectured that these should be described by a Gaussian Random Wave Model, by analogy with quantum chaotic systems, for which such a model was proposed by Berry in 1977. The autocorrelation functions we calculate for an individual quantum graph exhibit a universal component, which completely determines a Gaussian Random Wave Model, and a system-dependent deviation. This deviation depends on the graph only through its underlying classical dynamics. Classical criteria for quantum universality to be met asymptotically in the large graph limit (i.e. for the non-universal deviation to vanish) are then extracted. We use an exact field theoretic expression in terms of a variant of a supersymmetric σ model. A saddle-point analysis of this expression leads to the estimates. In particular, intensity correlations are used to discuss the possible equidistribution of the energy eigenfunctions in the large graph limit. When equidistribution is asymptotically realized, our theory predicts a rate of convergence that is a significant refinement of previous estimates. The universal and system-dependent components of intensity correlation functions are recovered by means of an exact trace formula which we analyse in the diagonal approximation, drawing in this way a parallel between the field theory and semiclassics. Our results provide the first instance where an asymptotic Gaussian Random Wave Model has been established microscopically for eigenfunctions in a system with no disorder.
Directory of Open Access Journals (Sweden)
Andreas P. Braun
2016-04-01
Full Text Available Box graphs succinctly and comprehensively characterize singular fibers of elliptic fibrations in codimension two and three, as well as flop transitions connecting these, in terms of representation theoretic data. We develop a framework that provides a systematic map between a box graph and a crepant algebraic resolution of the singular elliptic fibration, thus allowing an explicit construction of the fibers from a singular Weierstrass or Tate model. The key tool is what we call a fiber face diagram, which shows the relevant information of a (partial toric triangulation and allows the inclusion of more general algebraic blowups. We shown that each such diagram defines a sequence of weighted algebraic blowups, thus providing a realization of the fiber defined by the box graph in terms of an explicit resolution. We show this correspondence explicitly for the case of SU(5 by providing a map between box graphs and fiber faces, and thereby a sequence of algebraic resolutions of the Tate model, which realizes each of the box graphs.
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)
Hierarchical organisation of causal graphs
International Nuclear Information System (INIS)
Dziopa, P.
1993-01-01
This paper deals with the design of a supervision system using a hierarchy of models formed by graphs, in which the variables are the nodes and the causal relations between the variables of the arcs. To obtain a representation of the variables evolutions which contains only the relevant features of their real evolutions, the causal relations are completed with qualitative transfer functions (QTFs) which produce roughly the behaviour of the classical transfer functions. Major improvements have been made in the building of the hierarchical organization. First, the basic variables of the uppermost level and the causal relations between them are chosen. The next graph is built by adding intermediary variables to the upper graph. When the undermost graph has been built, the transfer functions parameters corresponding to its causal relations are identified. The second task consists in the upwelling of the information from the undermost graph to the uppermost one. A fusion procedure of the causal relations has been designed to compute the QFTs relevant for each level. This procedure aims to reduce the number of parameters needed to represent an evolution at a high level of abstraction. These techniques have been applied to the hierarchical modelling of nuclear process. (authors). 8 refs., 12 figs
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...
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...
A twisted generalization of Novikov-Poisson algebras
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.
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)
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.
Graph based techniques for tag cloud generation
DEFF Research Database (Denmark)
Leginus, Martin; Dolog, Peter; Lage, Ricardo Gomes
2013-01-01
Tag cloud is one of the navigation aids for exploring documents. Tag cloud also link documents through the user defined terms. We explore various graph based techniques to improve the tag cloud generation. Moreover, we introduce relevance measures based on underlying data such as ratings...... or citation counts for improved measurement of relevance of tag clouds. We show, that on the given data sets, our approach outperforms the state of the art baseline methods with respect to such relevance by 41 % on Movielens dataset and by 11 % on Bibsonomy data set....
Gaussian tunneling model of c-axis twist Josephson junctions
International Nuclear Information System (INIS)
Bille, A.; Klemm, R.A.; Scharnberg, K.
2001-01-01
We calculate the critical current density J c J ((var p hi) 0 ) for Josephson tunneling between identical high-temperature superconductors twisted an angle (var p hi) 0 about the c axis. Regardless of the shape of the two-dimensional Fermi surface and for very general tunneling matrix elements, an order parameter (OP) with general d-wave symmetry leads to J c J (π/4)=0. This general result is inconsistent with the data of Li et al. [Phys. Rev. Lett. 83, 4160 (1999)] on Bi 2 Sr 2 CaCu 2 O 8+δ (Bi2212), which showed J c J to be independent of (var p hi) 0 . If the momentum parallel to the barrier is conserved in the tunneling process, J c J should vary substantially with the twist angle (var p hi) 0 when the tight-binding Fermi surface appropriate for Bi2212 is taken into account, even if the OP is completely isotropic. We quantify the degree of momentum nonconservation necessary to render J c J ((var p hi) 0 ) constant within experimental error for a variety of pair states by interpolating between the coherent and incoherent limits using five specific models to describe the momentum dependence of the tunneling matrix element squared. From the data of Li et al., we conclude that the c-axis tunneling in Bi2212 must be very nearly incoherent, and that the OP must have a nonvanishing Fermi-surface average for T c . We further show that the apparent conventional sum-rule violation observed by Basov et al. [Science 283, 49 (1999)] can be consistent with such strongly incoherent c-axis tunneling.
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 ...
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)
Graph modeling systems and methods
Neergaard, Mike
2015-10-13
An apparatus and a method for vulnerability and reliability modeling are provided. The method generally includes constructing a graph model of a physical network using a computer, the graph model including a plurality of terminating vertices to represent nodes in the physical network, a plurality of edges to represent transmission paths in the physical network, and a non-terminating vertex to represent a non-nodal vulnerability along a transmission path in the physical network. The method additionally includes evaluating the vulnerability and reliability of the physical network using the constructed graph model, wherein the vulnerability and reliability evaluation includes a determination of whether each terminating and non-terminating vertex represents a critical point of failure. The method can be utilized to evaluate wide variety of networks, including power grid infrastructures, communication network topologies, and fluid distribution systems.
Feder, Tomá s; Motwani, Rajeev
2009-01-01
Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.
Feder, Tomás
2009-06-01
Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.
Negation switching invariant signed graphs
Directory of Open Access Journals (Sweden)
Deepa Sinha
2014-04-01
Full Text Available A signed graph (or, $sigraph$ in short is a graph G in which each edge x carries a value $\\sigma(x \\in \\{-, +\\}$ called its sign. Given a sigraph S, the negation $\\eta(S$ of the sigraph S is a sigraph obtained from S by reversing the sign of every edge of S. Two sigraphs $S_{1}$ and $S_{2}$ on the same underlying graph are switching equivalent if it is possible to assign signs `+' (`plus' or `-' (`minus' to vertices of $S_{1}$ such that by reversing the sign of each of its edges that has received opposite signs at its ends, one obtains $S_{2}$. In this paper, we characterize sigraphs which are negation switching invariant and also see for what sigraphs, S and $\\eta (S$ are signed isomorphic.
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.)
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...
The fascinating world of graph theory
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
Graph-based modelling in engineering
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. .
XML Graphs in Program Analysis
DEFF Research Database (Denmark)
Møller, Anders; Schwartzbach, Michael Ignatieff
2007-01-01
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...... of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey four very different applications: XML in Java, Java Servlets and JSP, transformations between XML and non-XML data, and XSLT....
Cyclic graphs and Apery's theorem
International Nuclear Information System (INIS)
Sorokin, V N
2002-01-01
This is a survey of results about the behaviour of Hermite-Pade approximants for graphs of Markov functions, and a survey of interpolation problems leading to Apery's result about the irrationality of the value ζ(3) of the Riemann zeta function. The first example is given of a cyclic graph for which the Hermite-Pade problem leads to Apery's theorem. Explicit formulae for solutions are obtained, namely, Rodrigues' formulae and integral representations. The asymptotic behaviour of the approximants is studied, and recurrence formulae are found
Interacting particle systems on graphs
Sood, Vishal
In this dissertation, the dynamics of socially or biologically interacting populations are investigated. The individual members of the population are treated as particles that interact via links on a social or biological network represented as a graph. The effect of the structure of the graph on the properties of the interacting particle system is studied using statistical physics techniques. In the first chapter, the central concepts of graph theory and social and biological networks are presented. Next, interacting particle systems that are drawn from physics, mathematics and biology are discussed in the second chapter. In the third chapter, the random walk on a graph is studied. The mean time for a random walk to traverse between two arbitrary sites of a random graph is evaluated. Using an effective medium approximation it is found that the mean first-passage time between pairs of sites, as well as all moments of this first-passage time, are insensitive to the density of links in the graph. The inverse of the mean-first passage time varies non-monotonically with the density of links near the percolation transition of the random graph. Much of the behavior can be understood by simple heuristic arguments. Evolutionary dynamics, by which mutants overspread an otherwise uniform population on heterogeneous graphs, are studied in the fourth chapter. Such a process underlies' epidemic propagation, emergence of fads, social cooperation or invasion of an ecological niche by a new species. The first part of this chapter is devoted to neutral dynamics, in which the mutant genotype does not have a selective advantage over the resident genotype. The time to extinction of one of the two genotypes is derived. In the second part of this chapter, selective advantage or fitness is introduced such that the mutant genotype has a higher birth rate or a lower death rate. This selective advantage leads to a dynamical competition in which selection dominates for large populations
Critical Behavior of the Annealed Ising Model on Random Regular Graphs
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.
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.
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.
On the twisted N=2 superconformal structure in 2d gravity coupled to matter
International Nuclear Information System (INIS)
Panda, S.; Roy, S.
1993-05-01
It is shown that the two dimensional gravity, described either in the conformal gauge (Liouville theory) or in the light cone gauge, when coupled to matter processes an infinite number of twisted N=2 superconformal symmetries. The central charges of the N=2 algebra for the two gauge choices are in general different. Further, it is argued that the physical states in the light cone gauge theory can be obtained from the Liouville theory by a field redefinition. (author). 18 refs
Multiple graph regularized protein domain ranking
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.
Multiple graph regularized protein domain ranking
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.
Multiple graph regularized protein domain ranking.
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.
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.
Bianisotropic metamaterials based on twisted asymmetric crosses
International Nuclear Information System (INIS)
Reyes-Avendaño, J A; Sampedro, M P; Juárez-Ruiz, E; Pérez-Rodríguez, F
2014-01-01
The effective bianisotropic response of 3D periodic metal-dielectric structures, composed of crosses with asymmetrically-cut wires, is investigated within a general homogenization theory using the Fourier formalism and the form-factor division approach. It is found that the frequency dependence of the effective permittivity for a system of periodically-repeated layers of metal crosses exhibits two strong resonances, whose separation is due to the cross asymmetry. Besides, bianisotropic metamaterials, having a base of four twisted asymmetric crosses, are proposed. The designed metamaterials possess negative refractive index at frequencies determined by the cross asymmetry, the gap between the arms of adjacent crosses lying on the same plane, and the type of Bravais lattice. (papers)
Band engineering in twisted molybdenum disulfide bilayers
Zhao, Yipeng; Liao, Chengwei; Ouyang, Gang
2018-05-01
In order to explore the theoretical relationship between interlayer spacing, interaction and band offset at the atomic level in vertically stacked two-dimensional (2D) van der Waals (vdW) structures, we propose an analytical model to address the evolution of interlayer vdW coupling with random stacking configurations in MoS2 bilayers based on the atomic-bond-relaxation correlation mechanism. We found that interlayer spacing changes substantially with respect to the orientations, and the bandgap increases from 1.53 eV (AB stacking) to 1.68 eV (AA stacking). Our results reveal that the evolution of interlayer vdW coupling originates from the interlayer interaction, leading to interlayer separations and electronic properties changing with stacking configurations. Our predictions constitute a demonstration of twist engineering the band shift in the emergent class of 2D crystals, transition-metal dichalcogenides.
Unusual presentation of twisted ovarian cyst
Directory of Open Access Journals (Sweden)
Vineet V Mishra
2016-01-01
Full Text Available Ovarian torsion (also termed as adnexal torsion refers to partial or complete rotation of the ovary and a portion of fallopian tube along its supplying vascular pedicle. It occurs commonly in reproductive age group; more on the right side (60% and often presents with acute lower abdominal pain lasting for few hours and up to 24 h, accounting for 2.7% of acute gynecological conditions. It is one of the devastating conditions, hampering blood supply of ovary which may lead to total necrosis of ovarian tissue and complications, if not diagnosed and managed in time. Hence, we present a case on a twisted ovarian cyst in postmenopausal woman with unusual symptomatology leading to delayed diagnosis and loss of an ovary.
International Nuclear Information System (INIS)
Obregon, Octavio; Quevedo, Hernando; Ryan, Michael P.
2004-01-01
We construct a family of time and angular dependent, regular S-brane solutions which corresponds to a simple analytical continuation of the Zipoy-Voorhees 4-dimensional vacuum spacetime. The solutions are asymptotically flat and turn out to be free of singularities without requiring a twist in space. They can be considered as the simplest non-singular generalization of the singular S0-brane solution. We analyze the properties of a representative of this family of solutions and show that it resembles to some extent the asymptotic properties of the regular Kerr S-brane. The R-symmetry corresponds, however, to the general lorentzian symmetry. Several generalizations of this regular solution are derived which include a charged S-brane and an additional dilatonic field. (author)
Dynamics and control of twisting bi-stable structures
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
Dynamical twisted mass fermions and baryon spectroscopy
International Nuclear Information System (INIS)
Drach, V.
2010-06-01
The aim of this work is an ab initio computation of the baryon masses starting from quantum chromodynamics (QCD). This theory describes the interaction between quarks and gluons and has been established at high energy thanks to one of its fundamental properties: the asymptotic freedom. This property predicts that the running coupling constant tends to zero at high energy and thus that perturbative expansions in the coupling constant are justified in this regime. On the contrary the low energy dynamics can only be understood in terms of a non perturbative approach. To date, the only known method that allows the computation of observables in this regime together with a control of its systematic effects is called lattice QCD. It consists in formulating the theory on an Euclidean space-time and to evaluating numerically suitable functional integrals. First chapter is an introduction to the QCD in the continuum and on a discrete space time. The chapter 2 describes the formalism of maximally twisted fermions used in the European Twisted Mass (ETM) collaboration. The chapter 3 deals with the techniques needed to build hadronic correlator starting from gauge configuration. We then discuss how we determine hadron masses and their statistical errors. The numerical estimation of functional integral is explained in chapter 4. It is stressed that it requires sophisticated algorithm and massive parallel computing on Blue-Gene type architecture. Gauge configuration production is an important part of the work realized during my Ph.D. Chapter 5 is a critical review on chiral perturbation theory in the baryon sector. The two last chapter are devoted to the analysis in the light and strange baryon sector. Systematics and chiral extrapolation are extensively discussed. (author)
Bioinspired twisted composites based on Bouligand structures
Pinto, F.; Iervolino, O.; Scarselli, G.; Ginzburg, D.; Meo, M.
2016-04-01
The coupling between structural support and protection makes biological systems an important source of inspiration for the development of advanced smart composite structures. In particular, some particular material configurations can be implemented into traditional composites in order to improve their impact resistance and the out-of-plane properties, which represents one of the major weakness of commercial carbon fibres reinforced polymers (CFRP) structures. Based on this premise, a three-dimensional twisted arrangement shown in a vast multitude of biological systems (such as the armoured cuticles of Scarabei, the scales of Arapaima Gigas and the smashing club of Odontodactylus Scyllarus) has been replicated to develop an improved structural material characterised by a high level of in-plane isotropy and a higher interfacial strength generated by the smooth stiffness transition between each layer of fibrils. Indeed, due to their intrinsic layered nature, interlaminar stresses are one of the major causes of failure of traditional CFRP and are generated by the mismatch of the elastic properties between plies in a traditional laminate. Since the energy required to open a crack or a delamination between two adjacent plies is due to the difference between their orientations, the gradual angle variation obtained by mimicking the Bouligand Structures could improve energy absorption and the residual properties of carbon laminates when they are subjected to low velocity impact event. Two different bioinspired laminates were manufactured following a double helicoidal approach and a rotational one and were subjected to a complete test campaign including low velocity impact loading and compared to a traditional quasi-isotropic panel. Fractography analysis via X-Ray tomography was used to understand the mechanical behaviour of the different laminates and the residual properties were evaluated via Compression After Impact (CAI) tests. Results confirmed that the biological
Constructing Knowledge Graphs of Depression
Huang, Zhisheng; Yang, Jie; van Harmelen, Frank; Hu, Qing
2017-01-01
Knowledge Graphs have been shown to be useful tools for integrating multiple medical knowledge sources, and to support such tasks as medical decision making, literature retrieval, determining healthcare quality indicators, co-morbodity analysis and many others. A large number of medical knowledge
Partitioning graphs into connected parts
Hof, van 't P.; Paulusma, D.; Woeginger, G.J.; Frid, A.; Morozov, A.S.; Rybalchenko, A.; Wagner, K.W.
2009-01-01
The 2-DISJOINT CONNECTED SUBGRAPHS problem asks if a given graph has two vertex-disjoint connected subgraphs containing pre-specified sets of vertices. We show that this problem is NP-complete even if one of the sets has cardinality 2. The LONGEST PATH CONTRACTIBILITY problem asks for the largest
Isoperimetric inequalities for minimal graphs
International Nuclear Information System (INIS)
Pacelli Bessa, G.; Montenegro, J.F.
2007-09-01
Based on Markvorsen and Palmer's work on mean time exit and isoperimetric inequalities we establish slightly better isoperimetric inequalities and mean time exit estimates for minimal graphs in N x R. We also prove isoperimetric inequalities for submanifolds of Hadamard spaces with tamed second fundamental form. (author)
Ancestral Genres of Mathematical Graphs
Gerofsky, Susan
2011-01-01
Drawing from sources in gesture studies, cognitive science, the anthropology of religion and art/architecture history, this article explores cultural, bodily and cosmological resonances carried (unintentionally) by mathematical graphs on Cartesian coordinates. Concepts of asymmetric bodily spaces, grids, orthogonality, mapping and sacred spaces…
Humidity Graphs for All Seasons.
Esmael, F.
1982-01-01
In a previous article in this journal (Vol. 17, p358, 1979), a wet-bulb depression table was recommended for two simple experiments to determine relative humidity. However, the use of a graph is suggested because it gives the relative humidity directly from the wet and dry bulb readings. (JN)
Contracting a planar graph efficiently
DEFF Research Database (Denmark)
Holm, Jacob; Italiano, Giuseppe F.; Karczmarz, Adam
2017-01-01
the data structure, we can achieve optimal running times for decremental bridge detection, 2-edge connectivity, maximal 3-edge connected components, and the problem of finding a unique perfect matching for a static planar graph. Furthermore, we improve the running times of algorithms for several planar...
Graph Model Based Indoor Tracking
DEFF Research Database (Denmark)
Jensen, Christian Søndergaard; Lu, Hua; Yang, Bin
2009-01-01
The tracking of the locations of moving objects in large indoor spaces is important, as it enables a range of applications related to, e.g., security and indoor navigation and guidance. This paper presents a graph model based approach to indoor tracking that offers a uniform data management...
A graph with fractional revival
Bernard, Pierre-Antoine; Chan, Ada; Loranger, Érika; Tamon, Christino; Vinet, Luc
2018-02-01
An example of a graph that admits balanced fractional revival between antipodes is presented. It is obtained by establishing the correspondence between the quantum walk on a hypercube where the opposite vertices across the diagonals of each face are connected and, the coherent transport of single excitations in the extension of the Krawtchouk spin chain with next-to-nearest neighbour interactions.
Fixation Time for Evolutionary Graphs
Nie, Pu-Yan; Zhang, Pei-Ai
Evolutionary graph theory (EGT) is recently proposed by Lieberman et al. in 2005. EGT is successful for explaining biological evolution and some social phenomena. It is extremely important to consider the time of fixation for EGT in many practical problems, including evolutionary theory and the evolution of cooperation. This study characterizes the time to asymptotically reach fixation.
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...
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...
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.
Mathematical Minute: Rotating a Function Graph
Bravo, Daniel; Fera, Joseph
2013-01-01
Using calculus only, we find the angles you can rotate the graph of a differentiable function about the origin and still obtain a function graph. We then apply the solution to odd and even degree polynomials.
Towards a theory of geometric graphs
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...
Bounds on Gromov hyperbolicity constant in graphs
Indian Academy of Sciences (India)
Infinite graphs; Cartesian product graphs; independence number; domin- ation number; geodesics ... the secure transmission of information through the internet (see [15, 16]). In particular, ..... In particular, δ(G) is an integer multiple of 1/4.
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
Torsional rigidity, isospectrality and quantum graphs
International Nuclear Information System (INIS)
Colladay, Don; McDonald, Patrick; Kaganovskiy, Leon
2017-01-01
We study torsional rigidity for graph and quantum graph analogs of well-known pairs of isospectral non-isometric planar domains. We prove that such isospectral pairs are distinguished by torsional rigidity. (paper)
Graph theory with applications
Vasudev, C
2006-01-01
Salient Features Over 1500 problems are used to illustrate concepts, related to different topics, and introduce applications. Over 1000 exercises in the text with many different types of questions posed. Precise mathematical language is used without excessive formalism and abstraction. Care has been taken to balance the mix of notation and words in mathematical statements. Problem sets are stated clearly and unambiguously, and all are carefully graded for various levels of difficulty. This text has been carefully designed for flexible use.
Visibility Graph Based Time Series Analysis.
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.
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.
Conical twist fields and null polygonal Wilson loops
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.
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
Bond graph modeling of centrifugal compression systems
Uddin, Nur; Gravdahl, Jan Tommy
2015-01-01
A novel approach to model unsteady fluid dynamics in a compressor network by using a bond graph is presented. The model is intended in particular for compressor control system development. First, we develop a bond graph model of a single compression system. Bond graph modeling offers a different perspective to previous work by modeling the compression system based on energy flow instead of fluid dynamics. Analyzing the bond graph model explains the energy flow during compressor surge. Two pri...
A Graph Calculus for Predicate Logic
Directory of Open Access Journals (Sweden)
Paulo A. S. Veloso
2013-03-01
Full Text Available We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents bottom. Our calculus establishes that a graph has empty extension by converting it to a normal form, which is expanded to other graphs until we can recognize conflicting situations (equivalent to a formula and its negation.
Sphere and dot product representations of graphs
R.J. Kang (Ross); T. Müller (Tobias)
2012-01-01
textabstractA graph $G$ is a $k$-sphere graph if there are $k$-dimensional real vectors $v_1,\\dots,v_n$ such that $ij\\in E(G)$ if and only if the distance between $v_i$ and $v_j$ is at most $1$. A graph $G$ is a $k$-dot product graph if there are $k$-dimensional real vectors $v_1,\\dots,v_n$ such
Deep Learning with Dynamic Computation Graphs
Looks, Moshe; Herreshoff, Marcello; Hutchins, DeLesley; Norvig, Peter
2017-01-01
Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different shape and size for every input, such networks do not directly support batched training or inference. They are also difficult to implement in popular deep learning libraries, which are based on static data-flow graphs. We introduce a technique called dynami...
Constructs for Programming with Graph Rewrites
Rodgers, Peter
2000-01-01
Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifications to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language. The constructs we present are once only nodes, attractor nodes and single match rewrites. We illustrate the operation of the constructs by example. The advantages of adding these new rewrite modifiers is to reduce t...
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....
Combinatorics and graph theory
Vasudev, C
2007-01-01
About the Book: This text has been carefully designed for flexible use for First Semester M.C.A. course of Uttar Pradesh Technical University (U.P.T.U.), and it contains the following features: Precise mathematical language is used without excessive formalism and abstraction. Over 900 exercises (problem sets) in the text with many different types of questions posed. Care has been taken to balance the mix of notation and words in mathematical statements. Problem sets (exercises) are stated clearly and unambiguously and all are carefully graded for various levels of difficulty. Contents:
McMillen, Sue; McMillen, Beth
2010-01-01
Connecting stories to qualitative coordinate graphs has been suggested as an effective instructional strategy. Even students who are able to "create" bar graphs may struggle to correctly "interpret" them. Giving children opportunities to work with qualitative graphs can help them develop the skills to interpret, describe, and compare information…
The groupies of random multipartite graphs
Portmann, Marius; Wang, Hongyun
2012-01-01
If a vertex $v$ in a graph $G$ has degree larger than the average of the degrees of its neighbors, we call it a groupie in $G$. In the current work, we study the behavior of groupie in random multipartite graphs with the link probability between sets of nodes fixed. Our results extend the previous ones on random (bipartite) graphs.
Modeling Software Evolution using Algebraic Graph Rewriting
Ciraci, Selim; van den Broek, Pim
We show how evolution requests can be formalized using algebraic graph rewriting. In particular, we present a way to convert the UML class diagrams to colored graphs. Since changes in software may effect the relation between the methods of classes, our colored graph representation also employs the
A Type Graph Model for Java Programs
Rensink, Arend; Zambon, Eduardo
2009-01-01
In this report we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java
An intersection graph of straight lines
DEFF Research Database (Denmark)
Thomassen, Carsten
2002-01-01
G. Ehrlich, S. Even, and R.E. Tarjan conjectured that the graph obtained from a complete 3 partite graph K4,4,4 by deleting the edges of four disjoint triangles is not the intersection graph of straight line segments in the plane. We show that it is....
Girth 5 graphs from relative difference sets
DEFF Research Database (Denmark)
Jørgensen, Leif Kjær
2005-01-01
We consider the problem of construction of graphs with given degree $k$ and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed ...
Cycles in weighted graphs and related topics
Zhang, Shenggui
2002-01-01
This thesis contains results on paths andcycles in graphs andon a more or less relatedtopic, the vulnerability of graphs. In the first part of the thesis, Chapters 2 through 5, we concentrate on paths andcycles in weightedgraphs. A number of sufficient conditions are presentedfor graphs to contain
Graph Transformation Semantics for a QVT Language
Rensink, Arend; Nederpel, Ronald; Bruni, Roberto; Varró, Dániel
It has been claimed by many in the graph transformation community that model transformation, as understood in the context of Model Driven Architecture, can be seen as an application of graph transformation. In this paper we substantiate this claim by giving a graph transformation-based semantics to
Girth 5 graphs from relative difference sets
DEFF Research Database (Denmark)
Jørgensen, Leif Kjær
We consider the problem of construction of graphs with given degree and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed by G...
Improper colouring of (random) unit disk graphs
Kang, R.J.; Müller, T.; Sereni, J.S.
2008-01-01
For any graph G, the k-improper chromatic number ¿k(G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree k. We investigate ¿k for unit disk graphs and random unit disk graphs to generalise results of McDiarmid and Reed
Alliances and Bisection Width for Planar Graphs
DEFF Research Database (Denmark)
Olsen, Martin; Revsbæk, Morten
2013-01-01
An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show that any planar graph with minimum degree at least 4 can be split into two alliances in polyn...
A Type Graph Model for Java Programs
Rensink, Arend; Zambon, Eduardo; Lee, D.; Lopes, A.; Poetzsch-Heffter, A.
2009-01-01
In this work we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java syntax
RATGRAPH: Computer Graphing of Rational Functions.
Minch, Bradley A.
1987-01-01
Presents an easy-to-use Applesoft BASIC program that graphs rational functions and any asymptotes that the functions might have. Discusses the nature of rational functions, graphing them manually, employing a computer to graph rational functions, and describes how the program works. (TW)
A new cluster algorithm for graphs
S. van Dongen
1998-01-01
textabstractA new cluster algorithm for graphs called the emph{Markov Cluster algorithm ($MCL$ algorithm) is introduced. The graphs may be both weighted (with nonnegative weight) and directed. Let~$G$~be such a graph. The $MCL$ algorithm simulates flow in $G$ by first identifying $G$ in a
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...