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)
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.)
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)
Graph Subsumption in Abstract State Space Exploration
Zambon, Eduardo; Rensink, Arend; Wijs, A.; Bosnacki, D.; Edelkamp, S.
In this paper we present the extension of an existing method for abstract graph-based state space exploration, called neighbourhood abstraction, with a reduction technique based on subsumption. Basically, one abstract state subsumes another when it covers more concrete states; in such a case, the
Efficient quantum pseudorandomness with simple graph states
Mezher, Rawad; Ghalbouni, Joe; Dgheim, Joseph; Markham, Damian
2018-02-01
Measurement based (MB) quantum computation allows for universal quantum computing by measuring individual qubits prepared in entangled multipartite states, known as graph states. Unless corrected for, the randomness of the measurements leads to the generation of ensembles of random unitaries, where each random unitary is identified with a string of possible measurement results. We show that repeating an MB scheme an efficient number of times, on a simple graph state, with measurements at fixed angles and no feedforward corrections, produces a random unitary ensemble that is an ɛ -approximate t design on n qubits. Unlike previous constructions, the graph is regular and is also a universal resource for measurement based quantum computing, closely related to the brickwork state.
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)
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
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.
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.
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.
Twisted injectivity in projected entangled pair states and the classification of quantum phases
Buerschaper, Oliver
2014-12-01
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).
Efficient generation of graph states for quantum computation
International Nuclear Information System (INIS)
Clark, S R; Alves, C Moura; Jaksch, D
2005-01-01
We present an entanglement generation scheme which allows arbitrary graph states to be efficiently created in a linear quantum register via an auxiliary entangling bus (EB). The dynamical evolution of the EB is described by an effective non-interacting fermionic system undergoing mirror-inversion in which qubits, encoded as local fermionic modes, become entangled purely by Fermi statistics. We discuss a possible implementation using two species of neutral atoms stored in an optical lattice and find that the scheme is realistic in its requirements even in the presence of noise
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
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.
Mikl, Joanne; Rye, David C
2016-02-01
The twisting somersault is a key skill in diving and gymnastics. The components of twist and somersault are defined with respect to anatomical axes, and combinations of multiples of half rotations of twist and somersault define specific twisting somersault skills. To achieve a twisting somersault skill twist must be continuous; otherwise oscillations in twist while somersaulting may be observed. The posture-dependent inertial properties of the athlete and the initial conditions determine if continuous or oscillating twist is observed. The paper derives equations for the amount of somersault required per half twist, or per twist oscillation, without making assumptions about the relative magnitudes of the moments of inertia. From these equations the skills achievable may be determined. The error associated with the common assumption that the medial and transverse principal moments of inertia are equal is explored. It is concluded that the error grows as the number of twists per somersault decreases, when the medial and transverse moments of inertia diverge, and when the longitudinal moment of inertia approaches either the medial or transverse moment of inertia. Inertial property data for an example athlete are used to illustrate the various rotational states that can occur. Copyright © 2015 Elsevier B.V. All rights reserved.
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
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.
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...
A structural analysis of the A5/1 state transition graph
Directory of Open Access Journals (Sweden)
Andreas Beckmann
2012-10-01
Full Text Available We describe efficient algorithms to analyze the cycle structure of the graph induced by the state transition function of the A5/1 stream cipher used in GSM mobile phones and report on the results of the implementation. The analysis is performed in five steps utilizing HPC clusters, GPGPU and external memory computation. A great reduction of this huge state transition graph of 2^64 nodes is achieved by focusing on special nodes in the first step and removing leaf nodes that can be detected with limited effort in the second step. This step does not break the overall structure of the graph and keeps at least one node on every cycle. In the third step the nodes of the reduced graph are connected by weighted edges. Since the number of nodes is still huge an efficient bitslice approach is presented that is implemented with NVIDIA's CUDA framework and executed on several GPUs concurrently. An external memory algorithm based on the STXXL library and its parallel pipelining feature further reduces the graph in the fourth step. The result is a graph containing only cycles that can be further analyzed in internal memory to count the number and size of the cycles. This full analysis which previously would take months can now be completed within a few days and allows to present structural results for the full graph for the first time. The structure of the A5/1 graph deviates notably from the theoretical results for random mappings.
On thermodynamic states of the Ising model on scale-free graphs
Directory of Open Access Journals (Sweden)
Yu. Kozitsky
2013-06-01
Full Text Available There is proposed a model of scale-free random graphs which are locally close to the uncorrelated complex random networks with divergent 2> studied in, e.g., S. N. Dorogovtsev et al, Rev. Mod. Phys., 80, 1275 (2008. It is shown that the Ising model on the proposed graphs with interaction intensities of arbitrary signs with probability one is in a paramagnetic state at sufficiently high finite values of the temperature. For the same graphs, the bond percolation model with probability one is in a nonpercolative state for positive values of the percolation probability. These results and their possible extensions are also discussed.
DEFF Research Database (Denmark)
Merker, Martin
The topic of this PhD thesis is graph decompositions. While there exist various kinds of decompositions, this thesis focuses on three problems concerning edgedecompositions. Given a family of graphs H we ask the following question: When can the edge-set of a graph be partitioned so that each part...... k(T)-edge-connected graph whose size is divisible by the size of T admits a T-decomposition. This proves a conjecture by Barát and Thomassen from 2006. Moreover, we introduce a new arboricity notion where we restrict the diameter of the trees in a decomposition into forests. We conjecture......-connected planar graph contains two edge-disjoint 18/19 -thin spanning trees. Finally, we make progress on a conjecture by Baudon, Bensmail, Przybyło, and Wozniak stating that if a graph can be decomposed into locally irregular graphs, then there exists such a decomposition with at most 3 parts. We show...
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.)
Coquelle, Nicolas; Sliwa, Michel; Woodhouse, Joyce; Schirò, Giorgio; Adam, Virgile; Aquila, Andrew; Barends, Thomas R. M.; Boutet, Sébastien; Byrdin, Martin; Carbajo, Sergio; de La Mora, Eugenio; Doak, R. Bruce; Feliks, Mikolaj; Fieschi, Franck; Foucar, Lutz; Guillon, Virginia; Hilpert, Mario; Hunter, Mark S.; Jakobs, Stefan; Koglin, Jason E.; Kovacsova, Gabriela; Lane, Thomas J.; Lévy, Bernard; Liang, Mengning; Nass, Karol; Ridard, Jacqueline; Robinson, Joseph S.; Roome, Christopher M.; Ruckebusch, Cyril; Seaberg, Matthew; Thepaut, Michel; Cammarata, Marco; Demachy, Isabelle; Field, Martin; Shoeman, Robert L.; Bourgeois, Dominique; Colletier, Jacques-Philippe; Schlichting, Ilme; Weik, Martin
2018-01-01
Chromophores absorb light in photosensitive proteins and thereby initiate fundamental biological processes such as photosynthesis, vision and biofluorescence. An important goal in their understanding is the provision of detailed structural descriptions of the ultrafast photochemical events that they undergo, in particular of the excited states that connect chemistry to biological function. Here we report on the structures of two excited states in the reversibly photoswitchable fluorescent protein rsEGFP2. We populated the states through femtosecond illumination of rsEGFP2 in its non-fluorescent off state and observed their build-up (within less than one picosecond) and decay (on the several picosecond timescale). Using an X-ray free-electron laser, we performed picosecond time-resolved crystallography and show that the hydroxybenzylidene imidazolinone chromophore in one of the excited states assumes a near-canonical twisted configuration halfway between the trans and cis isomers. This is in line with excited-state quantum mechanics/molecular mechanics and classical molecular dynamics simulations. Our new understanding of the structure around the twisted chromophore enabled the design of a mutant that displays a twofold increase in its off-to-on photoswitching quantum yield.
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
A Visualization System for Predicting Learning Activities Using State Transition Graphs
Okubo, Fumiya; Shimada, Atsushi; Taniguchi, Yuta
2017-01-01
In this paper, we present a system for visualizing learning logs of a course in progress together with predictions of learning activities of the following week and the final grades of students by state transition graphs. Data are collected from 236 students attending the course in progress and from 209 students attending the past course for…
On the ground state of quantum graphs with attractive delta-coupling
Czech Academy of Sciences Publication Activity Database
Exner, Pavel; Jex, M.
2012-01-01
Roč. 376, č. 5 (2012), s. 713-717 ISSN 0375-9601 R&D Projects: GA MŠk LC06002; GA ČR GAP203/11/0701 Institutional support: RVO:61389005 Keywords : quantum graph * attractive delta coupling * ground state Subject RIV: BE - Theoretical Physics Impact factor: 1.766, year: 2012
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.
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.
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
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, [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.
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
Graph network analysis of immediate motor-learning induced changes in resting state BOLD
Directory of Open Access Journals (Sweden)
Saber eSami
2013-05-01
Full Text Available Recent studies have demonstrated that following learning tasks, changes in the resting state activity of the brain shape regional connections in functionally specific circuits. Here we expand on these findings by comparing changes induced in the resting state immediately following four motor tasks. Two groups of participants performed a visuo-motor joystick task with one group adapting to a transformed relationship between joystick and cursor. Two other groups were trained in either explicit or implicit procedural sequence learning. Resting state BOLD data were collected immediately before and after the tasks. We then used graph theory-based approaches that include statistical measures of functional integration and segregation to characterise changes in biologically plausible brain connectivity networks within each group. Our results demonstrate that motor learning reorganizes resting brain networks with an increase in local information transfer, as indicated by local efficiency measures that affect the brain's small world network architecture. This was particularly apparent when comparing two distinct forms of explicit motor learning: procedural learning and the joystick learning task. Both groups showed notable increases in local efficiency. However changes in local efficiency in the inferior frontal and cerebellar regions also distinguishes between the two learning tasks. Additional graph analytic measures on the "non-learning" visuo-motor performance task revealed reversed topological patterns in comparison with the three learning tasks. These findings underscore the utility of graph-based network analysis as a novel means to compare both regional and global changes in functional brain connectivity in the resting state following motor learning tasks.
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...
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.
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
Seiller, Thomas
2014-01-01
In two previous papers, we exposed a combinatorial approach to the program of Geometry of Interaction, a program initiated by Jean-Yves Girard. The strength of our approach lies in the fact that we interpret proofs by simpler structures - graphs - than Girard's constructions, while generalizing the latter since they can be recovered as special cases of our setting. This third paper extends this approach by considering a generalization of graphs named graphings, which is in some way a geometri...
State exact reconstruction for switched linear systems via a super-twisting algorithm
Bejarano, Francisco J.; Fridman, Leonid
2011-05-01
This article discusses the problem of state reconstruction synthesis for switched linear systems. Based only on the continuous output information, an observer is proposed ensuring the reconstruction of the entire state (continuous and discrete) in finite time. For the observer design an exact sliding mode differentiator is used, which allows the finite time convergence of the observer trajectories to the actual trajectories. The design scheme includes both cases: zero control input and nonzero control input. Simulations illustrate the effectiveness of the proposed observer.
State Tracking and Fault Diagnosis for Dynamic Systems Using Labeled Uncertainty Graph.
Zhou, Gan; Feng, Wenquan; Zhao, Qi; Zhao, Hongbo
2015-11-05
Cyber-physical systems such as autonomous spacecraft, power plants and automotive systems become more vulnerable to unanticipated failures as their complexity increases. Accurate tracking of system dynamics and fault diagnosis are essential. This paper presents an efficient state estimation method for dynamic systems modeled as concurrent probabilistic automata. First, the Labeled Uncertainty Graph (LUG) method in the planning domain is introduced to describe the state tracking and fault diagnosis processes. Because the system model is probabilistic, the Monte Carlo technique is employed to sample the probability distribution of belief states. In addition, to address the sample impoverishment problem, an innovative look-ahead technique is proposed to recursively generate most likely belief states without exhaustively checking all possible successor modes. The overall algorithms incorporate two major steps: a roll-forward process that estimates system state and identifies faults, and a roll-backward process that analyzes possible system trajectories once the faults have been detected. We demonstrate the effectiveness of this approach by applying it to a real world domain: the power supply control unit of a spacecraft.
Noble, S D; Welsh, D J A
2000-01-01
We consider the equivalence classes of graphs induced by the unsigned versions of the Reidemeister moves on knot diagrams. Any graph which is reducible by some finite sequence of these moves, to a graph with no edges is called a knot graph. We show that the class of knot graphs strictly contains the set of delta-wye graphs. We prove that the dimension of the intersection of the cycle and cocycle spaces is an effective numerical invariant of these classes.
On non-Cayley vertex-transitive graphs and the Meta-Cayley graphs ...
African Journals Online (AJOL)
The pursuit to identify vertex-transitive non-Cayley graphs has been deliberate for some time now. In that vein, Alspach and Parsons [1] introduced metacirculant graphs. They are de ned on two cyclic groups with adjacency re-sembling twisting that is typically used in de ning semi-direct products of groups. In this sequel we ...
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.
Dereka, Bogdan; Svechkarev, Denis; Rosspeintner, Arnulf; Tromayer, Maximilian; Liska, Robert; Mohs, Aaron M; Vauthey, Eric
2017-11-22
The excited-state dynamics of an aniline-triazine electron donor-acceptor dyad with an alkyne spacer has been investigated using a combination of ultrafast broadband mid-IR and visible transient absorption and fluorescence spectroscopies. The transient IR data reveal the occurrence of an efficient alkyne to allene isomerization of the spacer with a time constant increasing from a few hundreds of femtoseconds to a few picoseconds with solvent viscosity. This process is faster than the vibrational cooling of the Franck-Condon excited state, indicative of nonequilibrium dynamics. The transient electronic absorption and fluorescence data evidence that this transformation is accompanied by a charge separation between the donor and the acceptor subunits. The allene character of the spacer implies an orthogonal orientation of the donor and acceptor moieties, similar to that proposed for twisted intramolecular charge-transfer states. Such states are often invoked in the excited-state dynamics of donor-acceptor dyads, but their involvement could never be unambiguously evidenced spectroscopically. The alkyne-allene isomerization involves not only a torsional motion but also a bending of the molecule due to the sp to sp 2 rehybridization of one of the alkyne carbon atoms. This twisted and rehybridized intramolecular charge transfer ("TRICT") state decays back to the planar and linear alkyne ground state on a time scale decreasing from a few hundred to ten picoseconds upon going from weakly to highly polar solvents. The different solvent dependencies reveal that the dynamics of the allene buildup are controlled by the structural changes, whereas the decay is limited by the charge recombination step.
Meljanac, Daniel; Meljanac, Stjepan; Mignemi, Salvatore; Pikutić, Danijel; Štrajn, Rina
2018-03-01
We construct the twist operator for the Snyder space. Our starting point is a non-associative star product related to a Hermitian realisation of the noncommutative coordinates originally introduced by Snyder. The corresponding coproduct of momenta is non-coassociative. The twist is constructed using a general definition of the star product in terms of a bi-differential operator in the Hopf algebroid approach. The result is given by a closed analytical expression. We prove that this twist reproduces the correct coproducts of the momenta and the Lorentz generators. The twisted Poincaré symmetry is described by a non-associative Hopf algebra, while the twisted Lorentz symmetry is described by the undeformed Hopf algebra. This new twist might be important in the construction of different types of field theories on Snyder space.
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.
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.
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
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
-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...... volunteers using a 3T MRI scanner. The identification of nine networks was performed by a multiple-template matching procedure and a subsequent component classification based on the network “neuronal” properties. Second, for each of the identified networks, the nodes were defined as 1,015 anatomically...
DEFF Research Database (Denmark)
Hartnell, B.L.; Vestergaard, Preben Dahl
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 graph that remains can still be decomposed (such graphs are called or ). In this paper we consider the follwing variation. Given a fixed graph H, determine which graphs (call them ) have the property that every edge disjoint packing with H is maximum. In the case that the graph H is isomorphic...... to the path on 3 nodes, we characterize the equipackable graphs of girth 5 or more. randomly packable randomly decomposable equipackable maximal...
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 graph that remains can still be decomposed (such graphs are called randomly packable or randomly decomposable). In this paper we consider the following variation. Given a fixed graph H, determine which graphs (call them equipackable) have the property that every maximal edge disjoint packing with H...... is maximum. In the case that the graph H is isomorphic to the path on 3 nodes, we characterize the equipackable graphs of girth 5 or more....
Energy Technology Data Exchange (ETDEWEB)
Bolte, Jens, E-mail: jens.bolte@rhul.ac.uk [Department of Mathematics, Royal Holloway, University of London, Egham TW20 0EX (United Kingdom); Kerner, Joachim, E-mail: joachim.kerner@fernuni-hagen.de [Department of Mathematics and Computer Science, FernUniversität in Hagen, Hagen 58084 (Germany)
2016-04-15
In this paper we investigate Bose-Einstein condensation into the one-particle ground state in interacting quantum many-particle systems on graphs. We extend previous results obtained for particles on an interval and show that even arbitrarily small repulsive two-particle interactions destroy the condensate in the one-particle ground state present in the non-interacting Bose gas. Our results also cover singular two-particle interactions, such as the well-known Lieb-Liniger model, in the thermodynamic limit.
Using Graph Transformations and Graph Abstractions for Software Verification
Zambon, Eduardo; Rensink, Arend
In this paper we describe our intended approach for the verification of software written in imperative programming languages. We base our approach on model checking of graph transition systems, where each state is a graph and the transitions are specified by graph transformation rules. We believe
Du, Hai-Xiao; Liao, Xu-Hong; Lin, Qi-Xiang; Li, Gu-Shu; Chi, Yu-Ze; Liu, Xiang; Yang, Hua-Zhong; Wang, Yu; Xia, Ming-Rui
2015-10-01
The combination of resting-state functional MRI (R-fMRI) technique and graph theoretical approaches has emerged as a promising tool for characterizing the topological organization of brain networks, that is, functional connectomics. In particular, the construction and analysis of high-resolution brain connectomics at a voxel scale are important because they do not require prior regional parcellations and provide finer spatial information about brain connectivity. However, the test-retest reliability of voxel-based functional connectomics remains largely unclear. This study tended to investigate both short-term (∼20 min apart) and long-term (6 weeks apart) test-retest (TRT) reliability of graph metrics of voxel-based brain networks. Based on graph theoretical approaches, we analyzed R-fMRI data from 53 young healthy adults who completed two scanning sessions (session 1 included two scans 20 min apart; session 2 included one scan that was performed after an interval of ∼6 weeks). The high-resolution networks exhibited prominent small-world and modular properties and included functional hubs mainly located at the default-mode, salience, and executive control systems. Further analysis revealed that test-retest reliabilities of network metrics were sensitive to the scanning orders and intervals, with fair to excellent long-term reliability between Scan 1 and Scan 3 and lower reliability involving Scan 2. In the long-term case (Scan 1 and Scan 3), most network metrics were generally test-retest reliable, with the highest reliability in global metrics in the clustering coefficient and in the nodal metrics in nodal degree and efficiency. We showed high test-retest reliability for graph properties in the high-resolution functional connectomics, which provides important guidance for choosing reliable network metrics and analysis strategies in future studies. © 2015 John Wiley & Sons Ltd.
Pattern-Based Graph Abstraction
Rensink, Arend; Zambon, Eduardo; Ehrig, H; Engels, G.; Kreowski, H.J.; Rozenberg, G.
We present a new abstraction technique for the exploration of graph transformation systems with infinite state spaces. This technique is based on patterns, simple graphs describing structures of interest that should be preserved by the abstraction. Patterns are collected into pattern graphs, layered
Graph passing in graph transformation
Ghamarian, A.H.; Rensink, Arend; Fish, Andrew; Lambers, Leen
Graph transformation works under the whole world assumption. Therefore, in realistic systems, both the individual graphs and the set of all such graphs can grow very large. In reactive formalisms such as process algebra, on the other hand, each system is split into smaller components which
Graph Passing in Graph Transformation
Ghamarian, A.H.; Rensink, Arend
2012-01-01
Graph transformation works under the whole world assumption. Therefore, in realistic systems, both the individual graphs and the set of all such graphs can grow very large. In reactive formalisms such as process algebra, on the other hand, each system is split into smaller components which
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
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.
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.
Kronberg, Max; Soomro, Muhammad Afzal; Top, Jaap
2017-10-01
In this note we extend the theory of twists of elliptic curves as presented in various standard texts for characteristic not equal to two or three to the remaining characteristics. For this, we make explicit use of the correspondence between the twists and the Galois cohomology set H^1\\big({G}_{\\overline{K}/K}, \\operatorname{Aut}_{\\overline{K}}(E)\\big). The results are illustrated by examples.
Twisted radio waves and twisted thermodynamics.
Kish, Laszlo B; Nevels, Robert D
2013-01-01
We present and analyze a gedanken experiment and show that the assumption that an antenna operating at a single frequency can transmit more than two independent information channels to the far field violates the Second Law of Thermodynamics. Transmission of a large number of channels, each associated with an angular momenta 'twisted wave' mode, to the far field in free space is therefore not possible.
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
Summary 2: Graph Grammar Verification through Abstraction
Baldan, P.; Koenig, B.; Rensink, A.; Rensink, Arend; König, B.; Montanari, U.; Gardner, P.
2005-01-01
Until now there have been few contributions concerning the verification of graph grammars, specifically of infinite-state graph grammars. This paper compares two existing approaches, based on abstractions of graph transformation systems. While in the unfolding approach graph grammars are
Clemens, B; Puskás, S; Besenyei, M; Spisák, T; Opposits, G; Hollódy, K; Fogarasi, A; Fekete, I; Emri, M
2013-10-01
The neuronal mechanisms of enduring seizure propensity and seizure precipitation in juvenile myoclonic epilepsy (JME) are not known. We investigated these issues, within the framework of the "network concept" of epilepsy. Design1: 19, unmedicated JME patients were compared with nineteen, age-, and sex-matched normal control persons (NC). A total of 120s, artifact-free, paroxysm-free, eyes-closed, resting state EEG background activity was analyzed for each person. Design2: interictal and immediate preictal periods of the JME patients were compared in order to explore interictal-preictal network differences. For both comparison designs, statistically significant differences of EEG functional connectivity (EEGfC), nodal and global graph parameters were evaluated. Design1: maximum abnormalities were: increased delta, theta, alpha1 EEGfC and decreased alpha2 and beta EEGfC in the JME group as compared to the NC group, mainly among cortical areas that are involved in sensory-motor integration. Nodal degree and efficiency of three, medial, basal frontal nodes were greater in JME than in NC, in the alpha1 band. Design2: preictal delta EEGfC showed further increase in the above-mentioned areas, as compared to the interictal state. Increased EEGfC indicates a hypercoupled state among the specified cortical areas. This interictal abnormality further increases in the preictal state. Nodal graph statistics indicates abnormal neuronal dynamics in the cortical area that is the ictal onset zone in JME. Interictal and preictal neuronal dysfunction has been described in terms of network dynamics and topography in JME patients. Forthcoming investigations of seizure precipitation and therapeutic drug effects are encouraged on this basis. Copyright © 2013 Elsevier B.V. All rights reserved.
Graph Abstraction and Abstract Graph Transformation
Boneva, I.B.; Rensink, Arend; Kurban, M.E.; Bauer, J.
2007-01-01
Many important systems like concurrent heap-manipulating programs, communication networks, or distributed algorithms are hard to verify due to their inherent dynamics and unboundedness. Graphs are an intuitive representation of states of these systems, where transitions can be conveniently described
Rensink, Arend; Schmidt, David
2004-01-01
Graphs are an intuitive model for states of a (software) system that include pointer structures | for instance, object-oriented programs. However, a naive encoding results in large individual states and large, or even unbounded, state spaces. As usual, some form of abstraction is necessary in order
Rensink, Arend; Schmidt, D.A.
2004-01-01
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding results in large individual states and large, or even unbounded, state spaces. As usual, some form of abstraction is necessary
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
Geometry of Graph Edit Distance Spaces
Jain, Brijnesh J.
2015-01-01
In this paper we study the geometry of graph spaces endowed with a special class of graph edit distances. The focus is on geometrical results useful for statistical pattern recognition. The main result is the Graph Representation Theorem. It states that a graph is a point in some geometrical space, called orbit space. Orbit spaces are well investigated and easier to explore than the original graph space. We derive a number of geometrical results from the orbit space representation, translate ...
Efficiently Controllable Graphs.
Gokler, Can; Lloyd, Seth; Shor, Peter; Thompson, Kevin
2017-06-30
We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that, when a controllable quantum network is described by such a graph and the gaps in eigenfrequencies and in transition frequencies are bounded exponentially in the number of vertices, the network is efficiently controllable, in the sense that universal quantum computation can be performed using a control sequence polynomial in the size of the network while controlling a vanishingly small fraction of subsystems. We show that networks corresponding to finite-dimensional lattices are efficiently controllable and explore generalizations to percolation clusters and random graphs. We show that the classical computational complexity of estimating the ground state of Hamiltonians described by controllable graphs is polynomial in the number of subsystems or qubits.
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...
Twisted Winged Endoparasitoids
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 9; Issue 10. Twisted Winged Endoparasitoids - An Enigma for Entomologists. Alpana Mazumdar. General Article Volume 9 Issue 10 October 2004 pp 19-24. Fulltext. Click here to view fulltext PDF. Permanent link:
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...
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
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.
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 ...
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.
Twisted holomorphic forms on generalized flag varieties
Indian Academy of Sciences (India)
R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22
As a corollary of Theorem 1 and Proposition 2, we get the following vanishing theorem: ..... easily what the maximum positive value is which can occur in (µ, α∨ ... Twisted holomorphic forms on generalized flag varieties. 129. The following observation will be useful in writing down the conditions stated in the proposition.
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
Using Graph Transformations and Graph Abstractions for Software Verification
Zambon, Eduardo; Ehrig, Hartmut; Rensink, Arend; Rozenberg, Grzegorz; Schurr, Andy
In this abstract we present an overview of our intended approach for the verification of software written in imperative programming languages. This approach is based on model checking of graph transition systems (GTS), where each program state is modeled as a graph and the exploration engine is
Graph network analysis of immediate motor-learning induced changes in resting state BOLD
Sami, S.; Miall, R. C.
2013-01-01
Recent studies have demonstrated that following learning tasks, changes in the resting state activity of the brain shape regional connections in functionally specific circuits. Here we expand on these findings by comparing changes induced in the resting state immediately following four motor tasks. Two groups of participants performed a visuo-motor joystick task with one group adapting to a transformed relationship between joystick and cursor. Two other groups were trained in either explicit ...
Tejedor, Alejandro; Longjas, Anthony; Zaliapin, Ilya; Foufoula-Georgiou, Efi
2015-06-01
River deltas are intricate landscapes with complex channel networks that self-organize to deliver water, sediment, and nutrients from the apex to the delta top and eventually to the coastal zone. The natural balance of material and energy fluxes, which maintains a stable hydrologic, geomorphologic, and ecological state of a river delta, is often disrupted by external perturbations causing topological and dynamical changes in the delta structure and function. A formal quantitative framework for studying delta channel network connectivity and transport dynamics and their response to change is lacking. Here we present such a framework based on spectral graph theory and demonstrate its value in computing delta's steady state fluxes and identifying upstream (contributing) and downstream (nourishment) areas and fluxes from any point in the network. We use this framework to construct vulnerability maps that quantify the relative change of sediment and water delivery to the shoreline outlets in response to possible perturbations in hundreds of upstream links. The framework is applied to the Wax Lake delta in the Louisiana coast of the U.S. and the Niger delta in West Africa. In a companion paper, we present a comprehensive suite of metrics that quantify topologic and dynamic complexity of delta channel networks and, via application to seven deltas in diverse environments, demonstrate their potential to reveal delta morphodynamics and relate to notions of vulnerability and robustness.
Folded supersymmetry with a twist
Energy Technology Data Exchange (ETDEWEB)
Cohen, Timothy [Department of Physics, Princeton University,Princeton, NJ 08544 (United States); School of Natural Sciences, Institute for Advanced Study,Princeton, NJ 08540 (United States); Institute of Theoretical Science, University of Oregon,Eugene, OR 97403 (United States); Craig, Nathaniel [Department of Physics, University of California,Santa Barbara, CA 93106 (United States); Lou, Hou Keong [Department of Physics, Princeton University,Princeton, NJ 08544 (United States); Pinner, David [Princeton Center for Theoretical Science, Princeton University,Princeton, NJ 08544 (United States)
2016-03-30
Folded supersymmetry (f-SUSY) stabilizes the weak scale against radiative corrections from the top sector via scalar partners whose gauge quantum numbers differ from their Standard Model counterparts. This non-trivial pairing of states can be realized in extra-dimensional theories with appropriate supersymmetry-breaking boundary conditions. We present a class of calculable f-SUSY models that are parametrized by a non-trivial twist in 5D boundary conditions and can accommodate the observed Higgs mass and couplings. Although the distinctive phenomenology associated with the novel folded states should provide strong evidence for this mechanism, the most stringent constraints are currently placed by conventional supersymmetry searches. These models remain minimally fine-tuned in light of LHC8 data and provide a range of both standard and exotic signatures accessible at LHC13.
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...
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.
Graph Processing on GPUs: A Survey
DEFF Research Database (Denmark)
Shi, Xuanhua; Zheng, Zhigao; Zhou, Yongluan
2018-01-01
In the big data era, much real-world data can be naturally represented as graphs. Consequently, many application domains can be modeled as graph processing. Graph processing, especially the processing of the large-scale graphs with the number of vertices and edges in the order of billions or even......, 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...
Active-Twist Rotor Control Applications for UAVs
National Research Council Canada - National Science Library
Wilbur, Matthew L; Wilkie, W. K
2004-01-01
The current state-of-the-art in active-twist rotor control is discussed using representative examples from analytical and experimental studies, and the application to rotary-wing UAVs is considered...
Perugini, G.; Ricci-Tersenghi, F.
2018-01-01
We first present an empirical study of the Belief Propagation (BP) algorithm, when run on the random field Ising model defined on random regular graphs in the zero temperature limit. We introduce the notion of extremal solutions for the BP equations, and we use them to fix a fraction of spins in their ground state configuration. At the phase transition point the fraction of unconstrained spins percolates and their number diverges with the system size. This in turn makes the associated optimization problem highly non trivial in the critical region. Using the bounds on the BP messages provided by the extremal solutions we design a new and very easy to implement BP scheme which is able to output a large number of stable fixed points. On one hand this new algorithm is able to provide the minimum energy configuration with high probability in a competitive time. On the other hand we found that the number of fixed points of the BP algorithm grows with the system size in the critical region. This unexpected feature poses new relevant questions about the physics of this class of models.
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs
R.C. Laskar (R.C.); H.M. Mulder (Martyn); B. Novick (Beth)
2011-01-01
textabstractMaximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices, two of these being adjacent
Goto, Hiroyuki
We provide a useful method for calculating the state vector of a state equation efficiently in a max-plus algebraic system. For a discrete event system whose precedence relationships are represented by a directed acyclic graph, computing the transition matrix, which includes the Kleene star operation of a weighted adjacency matrix, is occasionally the bottleneck. On the other hand, the common objective is to compute the state equation, rather than the transition matrix itself. Since the state equation is essentially the multiplication of the transition matrix and vector, we propose algorithms for efficiently calculating the multiplication and left division of the Kleene star of an adjacency matrix and a vector.
Aschieri, Paolo; Dimitrijević, Marija; Meyer, Frank; Schraml, Stefan; Wess, Julius
2006-10-01
Gauge theories on a space-time that is deformed by the Moyal-Weyl product are constructed by twisting the coproduct for gauge transformations. This way a deformed Leibniz rule is obtained, which is used to construct gauge invariant quantities. The connection will be enveloping algebra valued in a particular representation of the Lie algebra. This gives rise to additional fields, which couple only weakly via the deformation parameter θ and reduce in the commutative limit to free fields. Consistent field equations that lead to conservation laws are derived and some properties of such theories are discussed.
Twisting of paramodular vectors
Johnson-Leung, Jennifer; Roberts, Brooks
2013-01-01
Let $F$ be a non-archimedean local field of characteristic zero, let $(\\pi,V)$ be an irreducible, admissible representation of $\\GSp(4,F)$ with trivial central character, and let $\\chi$ be a quadratic character of $F^\\times$ with conductor $c(\\chi)>1$. We define a twisting operator $T_\\chi$ from paramodular vectors for $\\pi$ of level $n$ to paramodular vectors for $\\chi \\otimes \\pi$ of level $\\max(n+2c(\\chi),4c(\\chi))$, and prove that this operator has properties analogous to the well-known $...
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.)
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...
CHARACTERISATION OF REGULAR GRAPHS AS LOOP GRAPHS ...
African Journals Online (AJOL)
There have been various generalisations of Cayley graphs, prototypes of transitive graphs. The most generalised is the description of graphs on general groupoids. What has clearly emerged in this exercise is that the philosophy of constructing graphs on groupoids offers a fruitful avenue from which we may understand ...
De Bruijn graphs and DNA graphs
Pendavingh, Rudi; Schuurman, Petra; Woeginger, Gerhard; Brandstädt, Andreas; Le, Van Bang
2001-01-01
In this paper we prove the NP-hardness of various recognition problems for subgraphs of De Bruijn graphs. In particular, the recognition of DNA graphs is shown to be NP-hard; DNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet. As a consequence, two open
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)
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.
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
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...
DEFF Research Database (Denmark)
Randrup, Thomas; Røgen, Peter
1996-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...
Twisting formula of epsilon factors
Indian Academy of Sciences (India)
For characters of a non-Archimedean local field we have explicit formula for epsilon factors. But in general, we do not have any generalized twisting formula of epsilon factors. In this paper, we give a generalized twisting formula of epsilon factorsvia local Jacobi sums.
Graph reconstruction with a betweenness oracle
DEFF Research Database (Denmark)
Abrahamsen, Mikkel; Bodwin, Greg; Rotenberg, Eva
2016-01-01
Graph reconstruction algorithms seek to learn a hidden graph by repeatedly querying a blackbox oracle for information about the graph structure. Perhaps the most well studied and applied version of the problem uses a distance oracle, which can report the shortest path distance between any pair....... Despite this, we are able to develop betweenness reconstruction algorithms that match the current state of the art for distance reconstruction, and even improve it for certain types of graphs. We obtain the following algorithms: 1. Reconstruction of general graphs in O(n2) queries 2. Reconstruction...... of degree-bounded graphs in Õ(n3/2) queries 3. Reconstruction of geodetic degree-bounded graphs in Õ(n) queries In addition to being a fundamental graph theoretic problem with some natural applications, our new results shed light on some avenues for progress in the distance reconstruction problem....
Active-Twist Rotor Control Applications for UAVs
Wilbur, Matthew L.; Wilkie, W. Keats
2004-01-01
The current state-of-the-art in active-twist rotor control is discussed using representative examples from analytical and experimental studies, and the application to rotary-wing UAVs is considered. Topics include vibration and noise reduction, rotor performance improvement, active blade tracking, stability augmentation, and rotor blade de-icing. A review of the current status of piezoelectric fiber composite actuator technology, the class of piezoelectric actuators implemented in active-twist rotor systems, is included.
Diestel, Reinhard
2012-01-01
HauptbeschreibungThis standard textbook of modern graph theory, now in its fourth edition, combinesthe authority of a classic with the engaging freshness of style that is the hallmarkof active mathematics. It covers the core material of the subject with concise yetreliably complete proofs, while offering glimpses of more advanced methodsin 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 graduatetext, and for self-study. Rezension"Deep, clear, wonderful. This is a serious book about the
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.
Graph limits and hereditary properties
Janson, Svante
2011-01-01
We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes defined by forbidden subgraphs and some classes of intersection graphs, including triangle-free graphs, chordal graphs, cographs, interval graphs, unit interval graphs, threshold graphs, and line graphs.
Cycle decompositions: From graphs to continua.
Georgakopoulos, Agelos
2012-01-30
We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and replace the cycle space of a graph by a new homology group for continua which is a quotient of the first singular homology group [Formula: see text]. This homology seems to be particularly apt for studying spaces with infinitely generated [Formula: see text], e.g. infinite graphs or fractals.
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...
Gusfield, Dan
2010-03-01
The Multi-State Perfect Phylogeny Problem is an extension of the Binary Perfect Phylogeny Problem, allowing characters to take on more than two states. In this article, we consider three problems that extend the utility of the multi-state perfect phylogeny model: (1) the Missing Data (MD) Problem, where some entries in the input are missing and the question is whether (bounded) values for the missing data can be imputed so that the resulting data has a multi-state perfect phylogeny; (2) the Character-Removal (CR) Problem, where we want to minimize the number of characters to remove from the data so that the resulting data has a multi-state perfect phylogeny; and (3) the Missing-Data Character-Removal (MDCR) Problem, where the input has missing data and we want to impute values for the missing data to minimize the solution to the resulting Character-Removal Problem. We discuss Integer Linear Programming (ILP) solutions to these problems for the special case of three, four, and five permitted states per character, and we report on extensive empirical testing of these solutions. Then we develop a general theory to solve the MD problem for an arbitrary number of permitted states, using chordal graph theory and results on minimal triangulation of non-chordal graphs. This establishes new necessary and sufficient conditions for the existence of a perfect phylogeny with (or without) missing data. We implement the general theory using integer linear programming, although other optimization methods are possible. We extensively explore the empirical behavior of the general solution, showing that the methods are very practical for data of size and complexity that is characteristic of many current applications in phylogenetics. Some of the empirical results for the MD problem with an arbitrary number of permitted states are very surprising, suggesting the existence of additional combinatorial structure in multi-state perfect phylogenies. Finally, we note some relationships
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.
Zhou, Feng; de la Torre, Fernando
2015-11-19
Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix; (2) The factorization allows the use of a path-following optimization algorithm, that leads to improved optimization strategies and matching performance; (3) Given the factorization, it becomes straight-forward to incorporate geometric transformations (rigid and non-rigid) to the GM problem. (4) Using a matrix formulation for the GM problem and the factorization, it is easy to reveal commonalities and differences between different GM methods. The factorization also provides a clean connection with other matching algorithms such as iterative closest point; Experimental results on synthetic and real databases illustrate how FGM outperforms state-of-the-art algorithms for GM. The code is available at http://humansensing.cs.cmu.edu/fgm.
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.
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...
Exact zero vacuum energy in twisted SU(N) principal chiral field
Energy Technology Data Exchange (ETDEWEB)
Leurent, Sebastien [Univ. de Bourgogne Franche-Comte, Dijon (France). Inst. de Mathematique de Bourgogne; Sobko, Evgeny [DESY, Hamburg (Germany). Theory Group
2015-11-15
We present a finite set of equations for twisted PCF model. At the special twist in the root of unity we demonstrate that the vacuum energy is exactly zero at any size L. Also in SU(2) case we numerically calculate the energy of the single particle state with zero rapidity, as a function of L.
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.
Twist1- and Twist2-haploinsufficiency results in reduced bone formation.
Directory of Open Access Journals (Sweden)
Yanyu Huang
Full Text Available Twist1 and Twist2 are highly homologous bHLH transcription factors that exhibit extensive highly overlapping expression profiles during development. While both proteins have been shown to inhibit osteogenesis, only Twist1 haploinsufficiency is associated with the premature synostosis of cranial sutures in mice and humans. On the other hand, biallelic Twist2 deficiency causes only a focal facial dermal dysplasia syndrome or additional cachexia and perinatal lethality in certain mouse strains. It is unclear how these proteins cooperate to synergistically regulate bone formation.Twist1 floxed mice (Twist1(f/f were bred with Twist2-Cre knock-in mice (Twist2(Cre/+ to generate Twist1 and Twist2 haploinsufficient mice (Twist1(f/+; Twist2(Cre/+. X-radiography, micro-CT scans, alcian blue/alizarin red staining, trap staining, BrdU labeling, immunohistochemistry, in situ hybridizations, real-time PCR and dual luciferase assay were employed to investigate the overall skeletal defects and the bone-associated molecular and cellular changes of Twist1(f/+;Twist2(Cre/+ mice.Twist1 and Twist2 haploinsufficient mice did not present with premature ossification and craniosynostosis; instead they displayed reduced bone formation, impaired proliferation and differentiation of osteoprogenitors. These mice exhibited decreased expressions of Fgf2 and Fgfr1-4 in bone, resulting in a down-regulation of FGF signaling. Furthermore, in vitro studies indicated that both Twist1 and Twist2 stimulated 4.9 kb Fgfr2 promoter activity in the presence of E12, a Twist binding partner.These data demonstrated that Twist1- and Twist2-haploinsufficiency caused reduced bone formation due to compromised FGF signaling.
"Oliver Twist": A Teacher's Guide.
Cashion, Carol; Fischer, Diana
This teacher's guide for public television's 3-part adaptation of Charles Dickens's "Oliver Twist" provides information that will help enrich students' viewing of the series, whether or not they read the novel. The guide includes a wide range of discussion and activity ideas; there is also a series Web site and a list of Web resources.…
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.
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
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.
Graph abstraction and abstract graph transformations (Amended version)
Boneva, I.B.; Kreiker, Jörg; Kurban, M.E.; Rensink, Arend; Zambon, Eduardo
2012-01-01
Many important systems such as concurrent heap-manipulating programs, communication networks, or distributed algorithms, are hard to verify due to their inherent dynamics and unboundedness. Graphs are an intuitive representation for the states of these systems, where transitions can be conveniently
Twist buckling behavior of arteries.
Garcia, Justin R; Lamm, Shawn D; Han, Hai-Chao
2013-10-01
Arteries are often subjected to torsion due to body movement and surgical procedures. While it is essential that arteries remain stable and patent under twisting loads, the stability of arteries under torsion is poorly understood. The goal of this work was to experimentally investigate the buckling behavior of arteries under torsion and to determine the critical buckling torque, the critical buckling twist angle, and the buckling shape. Porcine common carotid arteries were slowly twisted in vitro until buckling occurred while subjected to a constant axial stretch ratio (1.1, 1.3, 1.5 (in vivo level) and 1.7) and lumen pressure (20, 40, 70 and 100 mmHg). Upon buckling, the arteries snapped to form a kink. For a group of six arteries, the axial stretch ratio significantly affected the critical buckling torque ([Formula: see text]) and the critical buckling twist angle ([Formula: see text]). Lumen pressure also significantly affected the critical buckling torque ([Formula: see text]) but had no significant effect on the critical twist angle ([Formula: see text]). Convex material constants for a Fung strain energy function were determined and fit well with the axial force, lumen pressure, and torque data measured pre-buckling. The material constants are valid for axial stretch ratios, lumen pressures, and rotation angles of 1.3-1.5, 20-100 mmHg, and 0-270[Formula: see text], respectively. The current study elucidates the buckling behavior of arteries under torsion and provides new insight into mechanical instability of blood vessels.
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.
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)
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
Integral trees and integral graphs
Wang, Ligong
2005-01-01
This monograph deals with integral graphs, Laplacian integral regular graphs, cospectral graphs and cospectral integral graphs. The organization of this work, which consists of eight chapters, is as follows.
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.
Loukas, A.
2015-01-01
We have recently seen a surge of research focusing on the processing of graph data. The emerging field of signal processing on graphs focuses on the extension of classical discrete signal processing techniques to the graph setting. Arguably, the greatest breakthrough of the field has been the
Indian Academy of Sciences (India)
IAS Admin
graph. We also note before closing this general discus- sion that among the family of regular and connected graphs, the graphs in the family of SRGs are character- ized by having exactly three distinct eigenvalues of the adjacency matrix. The friendship theorem asserts that if friendship in a community is a symmetric relation ...
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
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…
Pluhař, Z; Weidenmüller, H A
2014-04-11
For time-reversal invariant graphs we prove the Bohigas-Giannoni-Schmit conjecture in its most general form: For graphs that are mixing in the classical limit, all spectral correlation functions coincide with those of the Gaussian orthogonal ensemble of random matrices. For open graphs, we derive the analogous identities for all S-matrix correlation functions.
Sotirov, Renata
2017-01-01
The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation for the graph bisection problem with a matrix variable of
Hyperbolicity in median graphs
Indian Academy of Sciences (India)
If is hyperbolic, we denote by () the sharp hyperbolicity constant of , i.e., ( X ) = inf { ≥ 0 : X is − hyperbolic } . In this paper we study the hyperbolicity of median graphs and we also obtain some results about general hyperbolic graphs. In particular, we prove that a median graph is hyperbolic if and only if its ...
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.
Hydrogen bonds and twist in cellulose microfibrils.
Kannam, Sridhar Kumar; Oehme, Daniel P; Doblin, Monika S; Gidley, Michael J; Bacic, Antony; Downton, Matthew T
2017-11-01
There is increasing experimental and computational evidence that cellulose microfibrils can exist in a stable twisted form. In this study, atomistic molecular dynamics (MD) simulations are performed to investigate the importance of intrachain hydrogen bonds on the twist in cellulose microfibrils. We systematically enforce or block the formation of these intrachain hydrogen bonds by either constraining dihedral angles or manipulating charges. For the majority of simulations a consistent right handed twist is observed. The exceptions are two sets of simulations that block the O2-O6' intrachain hydrogen bond, where no consistent twist is observed in multiple independent simulations suggesting that the O2-O6' hydrogen bond can drive twist. However, in a further simulation where exocyclic group rotation is also blocked, right-handed twist still develops suggesting that intrachain hydrogen bonds are not necessary to drive twist in cellulose microfibrils. Copyright © 2017 Elsevier Ltd. All rights reserved.
Jung, Wi Hoon; Kim, Sung Nyun; Lee, Tae Young; Jang, Joon Hwan; Choi, Chi-Hoon; Kang, Do-Hyung; Kwon, Jun Soo
2013-01-01
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 (BEs) compared with those of experts in other strategy games. Therefore, we performed voxel-based morphometry (VBM) and FC analyses in BEs to investigate structural brain differences and to clarify the influence of these differences on functional interactions. We also conducted graph theoretical analysis (GTA) to explore the topological organization of whole-brain functional networks. Compared to novices, BEs exhibited decreased and increased gray matter volume (GMV) in the amygdala and nucleus accumbens (NA), respectively. We also found increased FC between the amygdala and medial orbitofrontal cortex (mOFC) and decreased FC between the NA and medial prefrontal cortex (mPFC). Further GTA 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 BEs. 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.
Gross, Jonathan L
2003-01-01
The Handbook of Graph Theory is the most comprehensive single-source guide to graph theory ever published. Best-selling authors Jonathan Gross and Jay Yellen assembled an outstanding team of experts to contribute overviews of more than 50 of the most significant topics in graph theory-including those related to algorithmic and optimization approaches as well as ""pure"" graph theory. They then carefully edited the compilation to produce a unified, authoritative work ideal for ready reference.Designed and edited with non-experts in mind, the Handbook of Graph Theory makes information easy to fi
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
Wong, Pak C.; Mackey, Patrick S.; Perrine, Kenneth A.; Foote, Harlan P.; Thomas, James J.
2008-12-23
Methods for visualizing a graph by automatically drawing elements of the graph as labels are disclosed. In one embodiment, the method comprises receiving node information and edge information from an input device and/or communication interface, constructing a graph layout based at least in part on that information, wherein the edges are automatically drawn as labels, and displaying the graph on a display device according to the graph layout. In some embodiments, the nodes are automatically drawn as labels instead of, or in addition to, the label-edges.
(3, 1)*-Choosability of graphs of nonnegative characteristic without ...
Indian Academy of Sciences (India)
G denote the family of graphs with nonnegative characteristic containing no intersecting. 3-, 4- and 5-cycles. The main result is to show that every graph in G is (3, 1)∗-choosable. In order to prove the main theorem, we use the technique of discharging to obtain several forbidden configurations for the graphs in G and state a ...
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)
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.
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.
Koike, Yuji; Pitonyak, Daniel; Yoshida, Shinsuke
2016-08-01
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 → → h X. 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.
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.
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.
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.
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.
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)
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
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
Uncertain Graph Sparsification
Parchas, Panos; Papailiou, Nikolaos; Papadias, Dimitris; Bonchi, Francesco
2016-01-01
Uncertain graphs are prevalent in several applications including communications systems, biological databases and social networks. The ever increasing size of the underlying data renders both graph storage and query processing extremely expensive. Sparsification has often been used to reduce the size of deterministic graphs by maintaining only the important edges. However, adaptation of deterministic sparsification methods fails in the uncertain setting. To overcome this problem, we introduce...
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.
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
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...
DEFF Research Database (Denmark)
Thomassen, Carsten
2014-01-01
We prove a general result on graph factors modulo k . A special case says that, for each natural number k , every (12k−7)-edge-connected graph with an even number of vertices contains a spanning subgraph in which each vertex has degree congruent to k modulo 2k.......We prove a general result on graph factors modulo k . A special case says that, for each natural number k , every (12k−7)-edge-connected graph with an even number of vertices contains a spanning subgraph in which each vertex has degree congruent to k modulo 2k....
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
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.
Characterisations of Intersection Graphs by Vertex Orderings
Wood, David R.
2004-01-01
Characterisations of interval graphs, comparability graphs, co-comparability graphs, permutation graphs, and split graphs in terms of linear orderings of the vertex set are presented. As an application, it is proved that interval graphs, co-comparability graphs, AT-free graphs, and split graphs have bandwidth bounded by their maximum degree.
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.
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
NOUS: A Knowledge Graph Management System
Energy Technology Data Exchange (ETDEWEB)
2017-06-26
Knowledge graphs represent information as entities and relationships between them. For tasks such as natural language question answering or automated analysis of text, a knowledge graph provides valuable context to establish the specific type of entities being discussed. It allow us to derive better context about newly arriving information and leads to intelligent reasoning capabilities. We address two primary needs: A) Automated construction of knowledge graphs is a technically challenging, expensive process; and B) The ability to synthesize new information by monitoring newly emerging knowledge is a transformational capability that does not exist in state of the art systems.
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...
b-Tree Facets for the Simple Graph Partitioning Polytope
DEFF Research Database (Denmark)
Sørensen, Michael Malmros
2000-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...
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.
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.
Horstmann, Marie-Therese; Bialonski, Stephan; Noennig, Nina; Mai, Heinke; Prusseit, Jens; Wellmer, Jörg; Hinrichs, Hermann; Lehnertz, Klaus
2010-02-01
To investigate whether functional brain networks of epilepsy patients treated with antiepileptic medication differ from networks of healthy controls even during the seizure-free interval. We applied different rules to construct binary and weighted networks from EEG and MEG data recorded under a resting-state eyes-open and eyes-closed condition from 21 epilepsy patients and 23 healthy controls. The average shortest path length and the clustering coefficient served as global statistical network characteristics. Independent on the behavioral condition, epileptic brains exhibited a more regular functional network structure. Similarly, the eyes-closed condition was characterized by a more regular functional network structure in both groups. The amount of network reorganization due to behavioral state changes was similar in both groups. Consistent findings could be achieved for networks derived from EEG but hardly from MEG recordings, and network construction rules had a rather strong impact on our findings. Despite the locality of the investigated processes epileptic brain networks differ in their global characteristics from non-epileptic brain networks. Further methodological developments are necessary to improve the characterization of disturbed and normal functional networks. An increased regularity and a diminished modulation capability appear characteristic of epileptic brain networks. Copyright (c) 2009 International Federation of Clinical Neurophysiology. Published by Elsevier Ireland Ltd. All rights reserved.
Directory of Open Access Journals (Sweden)
A. Assari
2016-01-01
Full Text Available In this paper, a graph is assigned to any probability measure on the σ-algebra of Borel sets of a topological space. Using this construction, it is proved that given any number n (finite or infinite there exists a nonregular graph such that its clique, chromatic, and dominating number equals n.
De Jong, Marvin L.
1993-01-01
Describes the powerful graphing ability of computer algebra systems (CAS) to create three-dimensional graphs or surface graphics of electric potentials. Provides equations along with examples of the printouts. Lists the programs Mathematica, Maple, Derive, Theorist, MathCad, and MATLAB as promising CAS systems. (MVL)
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
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
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...
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
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...
Moment graphs and representations
DEFF Research Database (Denmark)
Jantzen, Jens Carsten
2012-01-01
Moment graphs and sheaves on moment graphs are basically combinatorial objects that have be used to describe equivariant intersectiion cohomology. In these lectures we are going to show that they can be used to provide a direct link from this cohomology to the representation theory of simple Lie...
Directory of Open Access Journals (Sweden)
Behnaz Tolue
2018-07-01
Full Text Available In this paper we introduce stable subgroup graph associated to the group $G$. It is a graph with vertex set all subgroups of $G$ and two distinct subgroups $H_1$ and $H_2$ are adjacent if $St_{G}(H_1\\cap H_2\
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.
Large N reduction on a twisted torus
International Nuclear Information System (INIS)
Gonzalez-Arroyo, A.; Narayanan, R.; Neuberger, H.
2005-01-01
We consider SU(N) lattice gauge theory at infinite N defined on a torus with a CP invariant twist. Massless fermions are incorporated in an elegant way, while keeping them quenched. We present some numerical results which suggest that twisting can make numerical simulations of planar QCD more efficient
Energetics Underlying Twist Polymorphisms in Amyloid Fibrils
Periole, Xavier; Huber, Thomas; Bonito-Oliva, Alessandra; Aberg, Karina C; van der Wel, Patrick C A; Sakmar, Thomas P; Marrink, Siewert J
2018-01-01
Amyloid fibrils are highly ordered protein aggregates associated with more than 40 human diseases. The exact conditions in which the fibrils are grown determine many types of reported fibril polymorphism, including different twist patterns. Twist-based polymorphs display unique mechanical properties
Twist buckling of veins under torsional loading.
Garcia, Justin R; Sanyal, Arnav; Fatemifar, Fatemeh; Mottahedi, Mohammad; Han, Hai-Chao
2017-06-14
Veins are often subjected to torsion and twisted veins can hinder and disrupt normal blood flow but their mechanical behavior under torsion is poorly understood. The objective of this study was to investigate the twist deformation and buckling behavior of veins under torsion. Twist buckling tests were performed on porcine internal jugular veins (IJVs) and human great saphenous veins (GSVs) at various axial stretch ratio and lumen pressure conditions to determine their critical buckling torques and critical buckling twist angles. The mechanical behavior under torsion was characterized using a two-fiber strain energy density function and the buckling behavior was then simulated using finite element analysis. Our results demonstrated that twist buckling occurred in all veins under excessive torque characterized by a sudden kink formation. The critical buckling torque increased significantly with increasing lumen pressure for both porcine IJV and human GSV. But lumen pressure and axial stretch had little effect on the critical twist angle. The human GSVs are stiffer than the porcine IJVs. Finite element simulations captured the buckling behavior for individual veins under simultaneous extension, inflation, and torsion with strong correlation between predicted critical buckling torques and experimental data (R 2 =0.96). We conclude that veins can buckle under torsion loading and the lumen pressure significantly affects the critical buckling torque. These results improve our understanding of vein twist behavior and help identify key factors associated in the formation of twisted veins. Copyright © 2017 Elsevier Ltd. All rights reserved.
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.
Product of Locally Primitive Graphs
Directory of Open Access Journals (Sweden)
Amir Assari
2014-01-01
Full Text Available Many large graphs can be constructed from existing smaller graphs by using graph operations, such as the product of two graphs. Many properties of such large graphs are closely related to those of the corresponding smaller ones. In this paper we consider the product of two locally primitive graphs and prove that only tensor product of them will also be locally primitive.
Bildsoe, Heidi; Loebel, David A F; Jones, Vanessa J; Hor, Angelyn C C; Braithwaite, Antony W; Chen, You-Tzung; Behringer, Richard R; Tam, Patrick P L
2013-02-15
The basic helix-loop-helix transcription factor Twist1 is a key regulator of craniofacial development. Twist1-null mouse embryos exhibit failure of cephalic neural tube closure and abnormal head development and die at E11.0. To dissect the function of Twist1 in the cranial mesoderm beyond mid-gestation, we used Mesp1-Cre to delete Twist1 in the anterior mesoderm, which includes the progenitors of the cranial mesoderm. Deletion of Twist1 in mesoderm cells resulted in loss and malformations of the cranial mesoderm-derived skeleton. Loss of Twist1 in the mesoderm also resulted in a failure to fully segregate the mesoderm and the neural crest cells, and the malformation of some cranial neural crest-derived tissues. The development of extraocular muscles was compromised whereas the differentiation of branchial arch muscles was not affected, indicating a differential requirement for Twist1 in these two types of craniofacial muscle. A striking effect of the loss of Twist1 was the inability of the mesodermal cells to maintain their mesenchymal characteristics, and the acquisition of an epithelial-like morphology. Our findings point to a role of Twist1 in maintaining the mesenchyme architecture and the progenitor state of the mesoderm, as well as mediating mesoderm-neural crest interactions in craniofacial development. Copyright © 2012 Elsevier Inc. All rights reserved.
Sudden polarization effect in methyl-substituted twisted polyenes
International Nuclear Information System (INIS)
Baraldi, I.; Bruni, M.C.; Momicchioli, F.; Ponterini, G.
1981-01-01
Sudden polarization effect was investigated for a special type of nonsymmetric biradical systems, i.e. terminally twisted polyenes methyl substituted at the rotated CH 2 group. Systems with 2 to 4 conjugated double bonds were studied. Dipole moments of S 0 , S 1 and S 2 states were calculated within the framework of the INDO approximations, by using a dual basis of SCF MOs (open shell and closed shell) and performing differently sized CIs (selected with reference to the basic 3 x 3 CI biradical description). The resulting excited-state polarization characteristics (size and suddenness) are discussed with reference to the previously studied unsubstituted polyenes. In this respect the most important point is that CH 3 substitution at the terminal twisted methylene markedly enhances the polarization size (approximately 2D). This indicates that small perturbations occurring at one radical site may cause unexpectedly large changes in charge distributions of excited biradicals. (author)
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.
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
Hirao, Yasukazu; Nagamachi, Nobuhiro; Hosoi, Katsuma; Kubo, Takashi
2018-03-02
The twisted form of bianthrone is known as a metastable state provided by a photo-induced or thermal-induced isomerization of the folded form, and thus prevents the isolation and the detailed analysis of its electronic structure. In this study, an unsymmetrical bianthrone (2), consisting of the electron-withdrawing anthrone and electron-donating acridane, have been synthesized and shown to exhibit a solvent-polarity-dependent isomerization reaction between the folded and twisted isomers. With increasing the polarity of the solvent, 2 showed an isomerization reaction from the folded form to the twisted form. The stabilization of the twisted isomer in polar solvents can be interpreted as proof of its relatively large zwitterionic character. The DMF solution of 2 displayed paramagnetically-broadened NMR signals from the thermally populated triplet state resulting from rotation of the weakened ethylenic double bond of the twisted isomer. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.
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.
Graph representation of protein free energy landscape
International Nuclear Information System (INIS)
Li, Minghai; Duan, Mojie; Fan, Jue; Huo, Shuanghong; Han, Li
2013-01-01
The thermodynamics and kinetics of protein folding and protein conformational changes are governed by the underlying free energy landscape. However, the multidimensional nature of the free energy landscape makes it difficult to describe. We propose to use a weighted-graph approach to depict the free energy landscape with the nodes on the graph representing the conformational states and the edge weights reflecting the free energy barriers between the states. Our graph is constructed from a molecular dynamics trajectory and does not involve projecting the multi-dimensional free energy landscape onto a low-dimensional space defined by a few order parameters. The calculation of free energy barriers was based on transition-path theory using the MSMBuilder2 package. We compare our graph with the widely used transition disconnectivity graph (TRDG) which is constructed from the same trajectory and show that our approach gives more accurate description of the free energy landscape than the TRDG approach even though the latter can be organized into a simple tree representation. The weighted-graph is a general approach and can be used on any complex system
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...... conjectured by Baudon et al. that every undirected graph admits a decomposition into at most three locally irregular graphs, except for a well-characterized set of indecomposable graphs. We herein consider an oriented version of this conjecture. Namely, can every oriented graph be decomposed into at most...... three locally irregular oriented graphs, i.e. whose adjacent vertices have distinct outdegrees? We start by supporting this conjecture by verifying it for several classes of oriented graphs. We then prove a weaker version of this conjecture. Namely, we prove that every oriented graph can be decomposed...
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.
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.
Learning Probabilistic Decision Graphs
DEFF Research Database (Denmark)
Jaeger, Manfred; Dalgaard, Jens; Silander, Tomi
2004-01-01
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence relations that cannot be captured in a Bayesian network structure, and can sometimes provide computationally more...
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.
Interaction Graphs: Exponentials
Seiller, Thomas
2013-01-01
This paper is the fourth of a series exposing a systematic combinatorial approach to Girard's Geometry of Interaction program. This program aims at obtaining particular realizability models for linear logic that accounts for the dynamics of cut-elimination. This fourth paper tackles the complex issue of defining exponential connectives in this framework. In order to succeed in this, we use the notion of graphings, a generalization of graphs which was defined in earlier work. We explain how we...
DEFF Research Database (Denmark)
Bakhshesh, Davood; Barba, Luis; Bose, Prosenjit
2018-01-01
In this paper, we introduce a variation of the well-studied Yao graphs. Given a set of points S⊂R2 and an angle 0Yao graph cY(θ) with vertex set S and angle θ as follows. For each p,q∈S, we add an edge from p to q in cY(θ) if there exists a cone with apex p...
Spin squeezing in a generalized one-axis twisting model
Jin, Guang-Ri; Liu, Yong-Chun; Liu, Wu-Ming
2009-07-01
We investigate the dependence of spin squeezing on the polar angle of the initial coherent spin state |θ0, phi0rang in a generalized one-axis twisting model, where the detuning δ is taken into account. We show explicitly that regardless of δ and phi0, previous results of the ideal one-axis twisting are recovered as long as θ0=π/2. For a small departure of θ0 from π/2, however, the achievable variance (V -)min ~N2/3, which is larger than the ideal case N1/3. We also find that the maximal squeezing time tmin scales as N-5/6. Analytic expressions of (V-)min and tmin are presented and they agree with numerical simulations.
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.
Local Interaction on Random Graphs
Directory of Open Access Journals (Sweden)
Hans Haller
2010-08-01
Full Text Available We analyze dynamic local interaction in population games where the local interaction structure (modeled as a graph can change over time: A stochastic process generates a random sequence of graphs. This contrasts with models where the initial interaction structure (represented by a deterministic graph or the realization of a random graph cannot change over time.
Rashmanlou, Hossein; Samanta, Sovan; Pal, Madhumangal; Borzooei, R A
2016-01-01
The main purpose of this paper is to introduce the notion of vague h-morphism on vague graphs and regular vague graphs. The action of vague h-morphism on vague strong regular graphs are studied. Some elegant results on weak and co weak isomorphism are derived. Also, [Formula: see text]-complement of highly irregular vague graphs are defined.
Categorical constructions in graph theory
Directory of Open Access Journals (Sweden)
Richard T. Bumby
1986-01-01
Full Text Available This paper presents some graph-theoretic questions from the viewpoint of the portion of category theory which has become common knowledge. In particular, the reader is encouraged to consider whether there is only one natural category of graphs and how theories of directed graphs and undirected graphs are related.
Reversal of helicoidal twist handedness near point defects of confined chiral liquid crystals.
Ackerman, Paul J; Smalyukh, Ivan I
2016-05-01
Handedness of the director twist in cholesteric liquid crystals is commonly assumed to be the same throughout the medium, determined solely by the chirality of constituent molecules or chiral additives, albeit distortions of the ground-state helicoidal configuration often arise due to the effects of confinement and external fields. We directly probe the twist directionality of liquid crystal director structures through experimental three-dimensional imaging and numerical minimization of the elastic free energy and show that spatially localized regions of handedness opposite to that of the chiral liquid crystal ground state can arise in the proximity of twisted-soliton-bound topological point defects. In chiral nematic liquid crystal confined to a film that has a thickness less than the cholesteric pitch and perpendicular surface boundary conditions, twisted solitonic structures embedded in a uniform unwound far-field background with chirality-matched handedness locally relieve confinement-imposed frustration and tend to be accompanied by point defects and smaller geometry-required, energetically costly regions of opposite twist handedness. We also describe a spatially localized structure, dubbed a "twistion," in which a twisted solitonic three-dimensional director configuration is accompanied by four point defects. We discuss how our findings may impinge on the stability of localized particlelike director field configurations in chiral and nonchiral liquid crystals.
Commuting projections on graphs
Energy Technology Data Exchange (ETDEWEB)
Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). Center for Applied Scientific Computing; Zikatanov, Ludmil T. [Pennsylvania State Univ., University Park, PA (United States). Dept. of Mathematics
2013-02-19
For a given (connected) graph, we consider vector spaces of (discrete) functions defined on its vertices and its edges. These two spaces are related by a discrete gradient operator, Grad and its adjoint, ₋Div, referred to as (negative) discrete divergence. We also consider a coarse graph obtained by aggregation of vertices of the original one. Then a coarse vertex space is identified with the subspace of piecewise constant functions over the aggregates. We consider the ℓ_{2}-projection Q_{H} onto the space of these piecewise constants. In the present paper, our main result is the construction of a projection π _{H} from the original edge-space onto a properly constructed coarse edge-space associated with the edges of the coarse graph. The projections π _{H} and Q_{H} commute with the discrete divergence operator, i.e., we have div π _{H} = Q_{H} div. The respective pair of coarse edge-space and coarse vertexspace offer the potential to construct two-level, and by recursion, multilevel methods for the mixed formulation of the graph Laplacian which utilizes the discrete divergence operator. The performance of one two-level method with overlapping Schwarz smoothing and correction based on the constructed coarse spaces for solving such mixed graph Laplacian systems is illustrated on a number of graph examples.
Hierarchy of graph matchbox manifolds
Lukina, Olga
2011-01-01
We study a class of graph foliated spaces, or graph matchbox manifolds, initially constructed by Kenyon and Ghys. For graph foliated spaces we introduce a quantifier of dynamical complexity which we call its level. We develop the fusion construction, which allows us to associate to every two graph foliated spaces a third one which contains the former two in its closure. Although the underlying idea of the fusion is simple, it gives us a powerful tool to study graph foliated spaces. Using fusi...
Linear representation of a graph
Directory of Open Access Journals (Sweden)
Eduardo Montenegro
2019-10-01
Full Text Available In this paper the linear representation of a graph is defined. A linear representation of a graph is a subgroup of $GL(p,\\mathbb{R}$, the group of invertible matrices of order $ p $ and real coefficients. It will be demonstrated that every graph admits a linear representation. In this paper, simple and finite graphs will be used, framed in the graphs theory's area
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.
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.
Spintronics: A new twist in electronics
Indian Academy of Sciences (India)
BIPUL PAL
Semiconductor Nanostructures. Ultrafast Laser Spectroscopy. Spintronics: A new twist in electronics. Bipul Pal. Indian Institute of Science Education & Research – Kolkata. 02/07/09. 1st Platinum Jubilee Meeting of the Indian Academy of Sciences ...
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)
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....
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.
Report on twisted nematic and supertwisted nematic device characterization program
1995-01-01
In this study we measured the optical characteristics of normally white twisted nematic (NWTN) and super twisted nematic (STN ) cells. Though no dynamic computer model was available, the static observations were compared with computer simulated behavior. The measurements were taken as a function of both viewing angle and applied voltage and included in the static case not only luminance but also contrast ratio and chromaticity . We employed the computer model Twist Cell Optics, developed at Kent State in conjunction with this study, and whose optical modeling foundation, Iike the ViDEOS program, is the 4 x 4 matrix method of Berreman. In order to resolve discrepancies between the experimental and modeled data the optical parameters of the individual cell components, where not known, were determined using refractometry, profilometry, and various forms of ellipsometry. The resulting agreement between experiment and model is quite good due primarily to a better understanding of the structure and optics of dichroic sheet polarizers. A description of the model and test cells employed are given in section 2. Section 3 contains the experimental data gathered and section 4 gives examples of the fit between model and experiment. Also included with this report are a pair of papers which resulted from the research and which detail the polarizer properties and some of the cell characterization methods.
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.
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.
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...
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
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...
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''''.
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.
Graph Edge Coloring Vizing's Theorem and Goldberg's Conjecture
Stiebitz, Michael; Toft, Bjarne; Favrholdt, Lene M
2012-01-01
Features recent advances and new applications in graph edge coloring Reviewing recent advances in the Edge Coloring Problem, Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture provides an overview of the current state of the science, explaining the interconnections among the results obtained from important graph theory studies. The authors introduce many new improved proofs of known results to identify and point to possible solutions for open problems in edge coloring. The book begins with an introduction to graph theory and the concept of edge coloring. Subsequent chapters explor
Graph theory and interconnection networks
Hsu, Lih-Hsing
2008-01-01
The advancement of large scale integrated circuit technology has enabled the construction of complex interconnection networks. Graph theory provides a fundamental tool for designing and analyzing such networks. Graph Theory and Interconnection Networks provides a thorough understanding of these interrelated topics. After a brief introduction to graph terminology, the book presents well-known interconnection networks as examples of graphs, followed by in-depth coverage of Hamiltonian graphs. Different types of problems illustrate the wide range of available methods for solving such problems. The text also explores recent progress on the diagnosability of graphs under various models.
Restriction of molecular twisting on a gold nanoparticle surface.
Debnath, Tushar; Dana, Jayanta; Maity, Partha; Lobo, Hyacintha; Shankarling, Ganapati S; Ghosh, Hirendra N
2015-04-07
To understand the photophysical properties of intramolecular charge transfer (ICT) and twisted intramolecular charge transfer (TICT) states on a gold nanoparticle (Au NP) surface, we have designed and synthesized a new coumarin molecule (C3) that exists both as ICT and TICT states in its excited state in a polar environment. On a Au NP surface, an excited C3 molecule only exists as an ICT state owing to restricted molecular rotation of a diethylamino group; as a result, no conversion from the ICT to TICT state was observed. Selection of the preferential state of a molecule with dual emitting states can be helpful for selected biological applications. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
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......_E of C*(E). Our results pertain both automorphisms and proper endomorphisms. Firstly, the Weyl group and the restricted Weyl group of a graph C*-algebra are introduced and investigated. In particular, criteria of outerness for automorphisms in the restricted Weyl group are found. We also show...
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
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
Hierarchical graphs for rule-based modeling of biochemical systems.
Lemons, Nathan W; Hu, Bin; Hlavacek, William S
2011-02-02
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. 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. 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 specifying rule-based models, such as the BioNetGen language
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.
Homotopy Type of Neighborhood Complexes of Kneser Graphs, KG
Indian Academy of Sciences (India)
3
2017-04-12
Apr 12, 2017 ... Keywords : Hom complexes, Kneser Graphs, Discrete Morse theory. 2000 Mathematics Subject Classification primary 05C15, secondary 57M15. 1 Introduction. Lovász in 1978, proved the Kneser Conjecture ([7]), which states that the chromatic number of the Kneser graph KGn,k is k + 2. In this proof, he.
On toughness and hamiltonicity of 2K2-free graphs
Broersma, Haitze J.; Patel, Viresh; Pyatkin, Artem
The toughness of a (noncomplete) graph G is the minimum value of t for which there is a vertex cut A whose removal yields |A|/t components. Determining toughness is an NP-hard problem for general input graphs. The toughness conjecture of Chvátal, which states that there exists a constant t such that
Robustness of random graphs based on graph spectra.
Wu, Jun; Barahona, Mauricio; Tan, Yue-Jin; Deng, Hong-Zhong
2012-12-01
It has been recently proposed that the robustness of complex networks can be efficiently characterized through the natural connectivity, a spectral property of the graph which corresponds to the average Estrada index. The natural connectivity corresponds to an average eigenvalue calculated from the graph spectrum and can also be interpreted as the Helmholtz free energy of the network. In this article, we explore the use of this index to characterize the robustness of Erdős-Rényi (ER) random graphs, random regular graphs, and regular ring lattices. We show both analytically and numerically that the natural connectivity of ER random graphs increases linearly with the average degree. It is also shown that ER random graphs are more robust than the corresponding random regular graphs with the same number of vertices and edges. However, the relative robustness of ER random graphs and regular ring lattices depends on the average degree and graph size: there is a critical graph size above which regular ring lattices are more robust than random graphs. We use our analytical results to derive this critical graph size as a function of the average degree.
Codes related to line graphs of triangular graphs and permutation ...
African Journals Online (AJOL)
For any prime p, we consider p-ary linear codes obtained from the row span of incidence matrices of line graphs of triangular graphs and adjacency matrices of their line graphs. We determine parameters of the codes, their automorphism groups and exhibit permutation decoding sets (PD-sets) for partial permutation ...
Mesoscale mechanics of twisting carbon nanotube yarns.
Mirzaeifar, Reza; Qin, Zhao; Buehler, Markus J
2015-03-12
Fabricating continuous macroscopic carbon nanotube (CNT) yarns with mechanical properties close to individual CNTs remains a major challenge. Spinning CNT fibers and ribbons for enhancing the weak interactions between the nanotubes is a simple and efficient method for fabricating high-strength and tough continuous yarns. Here we investigate the mesoscale mechanics of twisting CNT yarns using full atomistic and coarse grained molecular dynamics simulations, considering concurrent mechanisms at multiple length-scales. To investigate the mechanical response of such a complex structure without losing insights into the molecular mechanism, we applied a multiscale strategy. The full atomistic results are used for training a coarse grained model for studying larger systems consisting of several CNTs. The mesoscopic model parameters are updated as a function of the twist angle, based on the full atomistic results, in order to incorporate the atomistic scale deformation mechanisms in larger scale simulations. By bridging across two length scales, our model is capable of accurately predicting the mechanical behavior of twisted yarns while the atomistic level deformations in individual nanotubes are integrated into the model by updating the parameters. Our results focused on studying a bundle of close packed nanotubes provide novel mechanistic insights into the spinning of CNTs. Our simulations reveal how twisting a bundle of CNTs improves the shear interaction between the nanotubes up to a certain level due to increasing the interaction surface. Furthermore, twisting the bundle weakens the intertube interactions due to excessive deformation in the cross sections of individual CNTs in the bundle.
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.
Visualizing automorphisms of graph algebras
DEFF Research Database (Denmark)
Avery, James Emil; Johansen, Rune; Szymanski, Wojciech
2018-01-01
Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a graph C*-algebra as a labeled directed multigraph...... that gives a visual representation of the endomorphism and facilitates computations. Combinatorial criteria have previously been developed for deciding when such an endomorphism is an automorphism, but here the question is reformulated in terms of the permutation graph and new proofs are given. Furthermore......, it is shown how to use permutation graphs to efficiently generate exhaustive collections of permutative automorphisms. Permutation graphs provide a natural link to the textile systems representing induced endomorphisms on the edge shift of the given graph, and this allows the powerful tools of the theory...
Dujmović, Vida; Sidiropoulos, Anastasios; Wood, David R.
2015-01-01
Bourgain and Yehudayoff recently constructed $O(1)$-monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we construct 3-monotone bipartite expanders, which is best possible. We then show that the same graphs admit 3-page book embeddings, 2-queue layouts, 4-track layouts, and have simple thickness 2. All these results are best possible.
S.M. Heditniemi (Sandra); R.C. Laskar (R.C.); H.M. Mulder (Martyn)
2012-01-01
textabstractLet $G = (V,E)$ be a graph. A partition $\\pi = \\{V_1, V_2, \\ldots, V_k \\}$ of the vertices $V$ of $G$ into $k$ {\\it color classes} $V_i$, with $1 \\leq i \\leq k$, is called a {\\it quorum coloring} if for every vertex $v \\in V$, at least half of the vertices in the closed neighborhood
Cooper, Carol
1975-01-01
Teachers of an integrated elementary classroom used cookie-sharing time as a learning experience for students. Responsible for dividing varying amounts of cookies daily, the students learned to translate their experiences to graphs of differing sophistication and analyses. Further interpretation and application were done by individual students…
Grabmayer, C.A.; van Oostrom, V.
2014-01-01
We report on work in progress on `nested term graphs' for formalizing higher-order terms (e.g. finite or infinite lambda-terms), including those expressing recursion (e.g. terms in the lambda-calculus with letrec). The idea is to represent the nested scope structure of a higher-order term by a
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 8; Issue 9. Decoding Codes on Graphs - Low Density Parity Check Codes. A S Madhu Aditya Nori. General Article Volume 8 Issue 9 September 2003 pp 49-59. Fulltext. Click here to view fulltext PDF. Permanent link:
Energy Technology Data Exchange (ETDEWEB)
Simmons, G.J.
1985-01-01
Given a graph G and an ordering phi of the vertices, V(G), we define a parsimonious proper coloring (PPC) of V(G) under phi to be a proper coloring of V(G) in the order phi, where a new color is introduced only when a vertex cannot be properly colored in its order with any of the colors already used.
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.
On dominator colorings in graphs
Indian Academy of Sciences (India)
Graph coloring and domination are two major areas in graph theory that have been ... independent set if no two vertices in S are adjacent. ... independent set. The corona G1 ◦ G2 of two graphs G1 and G2 is defined to be the graph. G obtained by taking one copy of G1 and |V(G1)| copies of G2, and then joining the i-th.
Hamiltonian paths on Platonic graphs
Directory of Open Access Journals (Sweden)
Brian Hopkins
2004-07-01
Full Text Available We develop a combinatorial method to show that the dodecahedron graph has, up to rotation and reflection, a unique Hamiltonian cycle. Platonic graphs with this property are called topologically uniquely Hamiltonian. The same method is used to demonstrate topologically distinct Hamiltonian cycles on the icosahedron graph and to show that a regular graph embeddable on the 2-holed torus is topologically uniquely Hamiltonian.
Toussaint, Paule-Joanne; Maiz, Sofiane; Coynel, David; Doyon, Julien; Messé, Arnaud; de Souza, Leonardo Cruz; Sarazin, Marie; Perlbarg, Vincent; Habert, Marie-Odile; Benali, Habib
2014-11-01
Cognitive decline in normal ageing and Alzheimer's disease (AD) emerges from functional disruption in the coordination of large-scale brain systems sustaining cognition. Integrity of these systems can be examined by correlation methods based on analysis of resting state functional magnetic resonance imaging (fMRI). Here we investigate functional connectivity within the default mode network (DMN) in normal ageing and AD using resting state fMRI. Images from young and elderly controls, and patients with AD were processed using spatial independent component analysis to identify the DMN. Functional connectivity was quantified using integration and indices derived from graph theory. Four DMN sub-systems were identified: Frontal (medial and superior), parietal (precuneus-posterior cingulate, lateral parietal), temporal (medial temporal), and hippocampal (bilateral). There was a decrease in antero-posterior interactions (lower global efficiency), but increased interactions within the frontal and parietal sub-systems (higher local clustering) in elderly compared to young controls. This decreased antero-posterior integration was more pronounced in AD patients compared to elderly controls, particularly in the precuneus-posterior cingulate region. Conjoint knowledge of integration measures and graph indices in the same data helps in the interpretation of functional connectivity results, as comprehension of one measure improves with understanding of the other. The approach allows for complete characterisation of connectivity changes and could be applied to other resting state networks and different pathologies. Copyright © 2014 Elsevier Inc. All rights reserved.
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.
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.
TWIST is Expressed in Human Gliomas, Promotes Invasion
Directory of Open Access Journals (Sweden)
Maria C. Elias
2005-09-01
Full Text Available TWIST is a basic helix-loop-helix (bHLH transcription factor that regulates mesodermal development, promotes tumor cell metastasis, and, in response to cytotoxic stress, enhances cell survival. Our screen for bHLH gene expression in rat C6 glioma revealed TWIST. To delineate a possible oncogenic role for TWIST in the human central nervous system (CNS, we analyzed TWIST message, protein expression in gliomas, normal brain. TWIST was detected in the large majority of human glioma-derived cell lines, human gliomas examined. Increased TWIST mRNA levels were associated with the highest grade gliomas, increased TWIST expression accompanied transition from low grade to high grade in vivo, suggesting a role for TWIST in promoting malignant progression. In accord, elevated TWIST mRNA abundance preceded the spontaneous malignant transformation of cultured mouse astrocytes hemizygous for p53. Overexpression of TWIST protein in a human glioma cell line significantly enhanced tumor cell invasion, a hallmark of high-grade gliomas. These findings support roles for TWIST both in early glial tumorigenesis, subsequent malignant progression. TWIST was also expressed in embryonic, fetal human brain, in neurons, but not glia, of mature brain, indicating that, in gliomas, TWIST may promote the functions also critical for CNS development or normal neuronal physiology.
Analysis of gun barrel rifling twist
Sun, Jia; Chen, Guangsong; Qian, Linfang; Liu, Taisu
2017-05-01
Aiming at the problem of gun barrel rifling twist, the constraint relation between rifling and projectile is investigated. The constraint model of rifling and projectile is established and the geometric relation between the twist and the motion of projectile is analyzed. Based on the constraint model, according to the rotating band that is fired, the stress and the motion law of the rotating band in bore are analyzed. The effects to rotating band (double rotating band or wide driving band) caused by different rifling (rib rifling, increasing rifling and combined rifling) are also investigated. The model is demonstrated by several examples. The results of numerical examples and the constraint mode show that the uncertainty factors will be brought in the increasing rifling and combined rifling during the projectile move in the bore. According to the amplitude and the strength of the twist acting on rotating band, the steady property of rotational motion of the projectile, the rib rifling is a better choose.
Nullspace embeddings for outerplanar graphs
L. Lovász (László); A. Schrijver (Alexander)
2017-01-01
textabstractWe study relations between geometric embeddings of graphs and the spectrum of associated matrices, focusing on outerplanar embeddings of graphs. For a simple connected graph G=(V,E), we define a "good" G-matrix as a V×V matrix with negative entries corresponding to adjacent nodes, zero
Nullspace embeddings for outerplanar graphs
L. Lovász (László); A. Schrijver (Alexander); M. Loebl (Martin); J. Nešetřil (Jaroslav); R. Thomas (Robin)
2017-01-01
htmlabstractWe study relations between geometric embeddings of graphs and the spectrum of associated matrices, focusing on outerplanar embeddings of graphs. For a simple connected graph G = (V, E), we define a "good” G-matrix as a V × V matrix with negative
Nullspace embeddings for outerplanar graphs
Lovász, L.; Schrijver, A.; Loebl, M.; Nešetřil, J.; Thomas, R.
2017-01-01
We study relations between geometric embeddings of graphs and the spectrum of associated matrices, focusing on outerplanar embeddings of graphs. For a simple connected graph G = (V, E), we define a “good” G-matrix as a V × V matrix with negative entries corresponding to adjacent nodes, zero entries
Generalised compositionality in graph transformation
Ghamarian, A.H.; Rensink, Arend; Ehrig, H; Engels, G.; Kreowski, H.J.; Rozenberg, G.
We present a notion of composition applying both to graphs and to rules, based on graph and rule interfaces along which they are glued. The current paper generalises a previous result in two different ways. Firstly, rules do not have to form pullbacks with their interfaces; this enables graph
Hopkins, Brian
2004-01-01
The interconnected world of actors and movies is a familiar, rich example for graph theory. This paper gives the history of the "Kevin Bacon Game" and makes extensive use of a Web site to analyze the underlying graph. The main content is the classroom development of the weighted average to determine the best choice of "center" for the graph. The…
Mining and Indexing Graph Databases
Yuan, Dayu
2013-01-01
Graphs are widely used to model structures and relationships of objects in various scientific and commercial fields. Chemical molecules, proteins, malware system-call dependencies and three-dimensional mechanical parts are all modeled as graphs. In this dissertation, we propose to mine and index those graph data to enable fast and scalable search.…
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
Submanifolds weakly associated with graphs
Indian Academy of Sciences (India)
We establish an interesting link between differential geometry and graph theory by defining submanifolds weakly associated with graphs. We prove that, in a local sense, every submanifold satisfies such an association, and other general results. Finally, we study submanifolds associated with graphs either in low ...
Probabilistic Transcriptome Assembly and Variant Graph Genotyping
DEFF Research Database (Denmark)
Sibbesen, Jonas Andreas
that this approach outperforms existing state-of-the-art methods measured using sensitivity and precision on both simulated and real data. The second is a novel probabilistic method that uses exact alignment of k-mers to a set of variants graphs to provide unbiased estimates of genotypes in a population...
Towards information inequalities for generalized graph entropies.
Directory of Open Access Journals (Sweden)
Lavanya Sivakumar
Full Text Available In this article, we discuss the problem of establishing relations between information measures for network structures. Two types of entropy based measures namely, the Shannon entropy and its generalization, the Rényi entropy have been considered for this study. Our main results involve establishing formal relationships, by means of inequalities, between these two kinds of measures. Further, we also state and prove inequalities connecting the classical partition-based graph entropies and partition-independent entropy measures. In addition, several explicit inequalities are derived for special classes of graphs.
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
Asteroidal Quadruples in non Rooted Path Graphs
Directory of Open Access Journals (Sweden)
Gutierrez Marisa
2015-11-01
Full Text Available A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to find such characterizations for rooted path graphs. For this purpose, we are studying in this paper directed path graphs that are non rooted path graphs. We prove that such graphs always contain an asteroidal quadruple.
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.
On support relations and semantic scene graphs
Yang, Michael Ying; Liao, Wentong; Ackermann, Hanno; Rosenhahn, Bodo
2017-09-01
Scene understanding is one of the essential and challenging topics in computer vision and photogrammetry. Scene graph provides valuable information for such scene understanding. This paper proposes a novel framework for automatic generation of semantic scene graphs which interpret indoor environments. First, a Convolutional Neural Network is used to detect objects of interest in the given image. Then, the precise support relations between objects are inferred by taking two important auxiliary information in the indoor environments: the physical stability and the prior support knowledge between object categories. Finally, a semantic scene graph describing the contextual relations within a cluttered indoor scene is constructed. In contrast to the previous methods for extracting support relations, our approach provides more accurate results. Furthermore, we do not use pixel-wise segmentation to obtain objects, which is computation costly. We also propose different methods to evaluate the generated scene graphs, which lacks in this community. Our experiments are carried out on the NYUv2 dataset. The experimental results demonstrated that our approach outperforms the state-of-the-art methods in inferring support relations. The estimated scene graphs are accurately compared with ground truth.
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.
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.
On the Symmetric Properties for the Generalized Twisted Bernoulli Polynomials
Directory of Open Access Journals (Sweden)
Kim Taekyun
2009-01-01
Full Text Available We study the symmetry for the generalized twisted Bernoulli polynomials and numbers. We give some interesting identities of the power sums and the generalized twisted Bernoulli polynomials using the symmetric properties for the -adic invariant integral.
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
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.
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....
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.
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.
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.
Directory of Open Access Journals (Sweden)
Burhan Selçuk
2017-06-01
Full Text Available Hypercube is a popular interconnection network. Due to the popularity of hypercube, more researchers pay a great effort to develop the different variants of hypercube. In this paper, we have proposed a variant of hypercube which is called as “Connected Cubic Network Graphs”, and have investigated the Hamilton-like properties of Connected Cubic Network Graphs (CCNG. Firstly, we defined CCNG and showed the characteristic analyses of CCNG. Then, we showed that the CCNG has the properties of Hamilton graph, and can be labeled using a Gray coding based recursive algorithm. Finally, we gave the comparison results, a routing algorithm and a bitonic sort algorithm for CCNG. In case of sparsity and cost, CCNG is better than Hypercube.
Twisted surfaces in the Pseudo-Galilean space
Directory of Open Access Journals (Sweden)
Ahmet Kazan
2017-10-01
Full Text Available In this paper, we construct the twisted surfaces according to the supporting plane and type of rotations in pseudo-Galilean space G13. Also, we find the Gaussian curvatures and mean curvatures of the different types of these twisted surfaces and draw some figures for these twisted surfaces.
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…
Directory of Open Access Journals (Sweden)
Falcon Seth
2007-09-01
Full Text Available Abstract Graph theoretical concepts are useful for the description and analysis of interactions and relationships in biological systems. We give a brief introduction into some of the concepts and their areas of application in molecular biology. We discuss software that is available through the Bioconductor project and present a simple example application to the integration of a protein-protein interaction and a co-expression network.
2010-12-02
evaluating the function ΘP (A) for any fixed A,P is equivalent to solving the so-called Quadratic Assignment Problem ( QAP ), and thus we can employ various...tractable linear programming, spectral, and SDP relaxations of QAP [40, 11, 33]. In particular we discuss recent work [14] on exploiting group...symmetry in SDP relaxations of QAP , which is useful for approximately computing elementary convex graph invariants in many interesting cases. Finally in
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.
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
DeMarco, Frederick
2010-01-01
This article describes an art activity on self-portraiture inspired by artist Tim Hawkinson. Hawkinson created a sculpture titled "Emoter" in which his face, moved by motors, twisted and contorted based on random signals from a TV. This art activity incorporates technology into the art room, brings the work of practicing artists alive, and is a…
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...
Bildsoe, Heidi; Fan, Xiaochen; Wilkie, Emilie E; Ashoti, Ator; Jones, Vanessa J; Power, Melinda; Qin, Jing; Wang, Junwen; Tam, Patrick P L; Loebel, David A F
2016-10-01
TWIST1, a basic helix-loop-helix transcription factor is essential for the development of cranial mesoderm and cranial neural crest-derived craniofacial structures. We have previously shown that, in the absence of TWIST1, cells within the cranial mesoderm adopt an abnormal epithelial configuration via a process reminiscent of a mesenchymal to epithelial transition (MET). Here, we show by gene expression analysis that loss of TWIST1 in the cranial mesoderm is accompanied by a reduction in the expression of genes that are associated with cell-extracellular matrix interactions and the acquisition of mesenchymal characteristics. By comparing the transcriptional profiles of cranial mesoderm-specific Twist1 loss-of-function mutant and control mouse embryos, we identified a set of genes that are both TWIST1-dependent and predominantly expressed in the mesoderm. ChIP-seq was used to identify TWIST1-binding sites in an in vitro model of a TWIST1-dependent mesenchymal cell state, and the data were combined with the transcriptome data to identify potential target genes. Three direct transcriptional targets of TWIST1 (Ddr2, Pcolce and Tgfbi) were validated by ChIP-PCR using mouse embryonic tissues and by luciferase assays. Our findings reveal that the mesenchymal properties of the cranial mesoderm are likely to be regulated by a network of TWIST1 targets that influences the extracellular matrix and cell-matrix interactions, and collectively they are required for the morphogenesis of the craniofacial structures. Copyright © 2016 Elsevier Inc. All rights reserved.
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)
Gildersleeve, Robert; Williams, Jill
The intramural program at Arizona State University has recently undergone major reorganization. Three highlights of this year's program were the "Run to Tucson," the powerlifting meet, and the rodeo. The "Run to Tucson" involved a 126-mile football relay race from Arizona State University's campus in Tempe to the University of…
String graph construction using incremental hashing.
Ben-Bassat, Ilan; Chor, Benny
2014-12-15
New sequencing technologies generate larger amount of short reads data at decreasing cost. De novo sequence assembly is the problem of combining these reads back to the original genome sequence, without relying on a reference genome. This presents algorithmic and computational challenges, especially for long and repetitive genome sequences. Most existing approaches to the assembly problem operate in the framework of de Bruijn graphs. Yet, a number of recent works use the paradigm of string graph, using a variety of methods for storing and processing suffixes and prefixes, like suffix arrays, the Burrows-Wheeler transform or the FM index. Our work is motivated by a search for new approaches to constructing the string graph, using alternative yet simple data structures and algorithmic concepts. We introduce a novel hash-based method for constructing the string graph. We use incremental hashing, and specifically a modification of the Karp-Rabin fingerprint, and Bloom filters. Using these probabilistic methods might create false-positive and false-negative edges during the algorithm's execution, but these are all detected and corrected. The advantages of the proposed approach over existing methods are its simplicity and the incorporation of established probabilistic techniques in the context of de novo genome sequencing. Our preliminary implementation is favorably comparable with the first string graph construction of Simpson and Durbin (2010) (but not with subsequent improvements). Further research and optimizations will hopefully enable the algorithm to be incorporated, with noticeable performance improvement, in state-of-the-art string graph-based assemblers. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.
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}$.
Dual-Band Notch Filter Based on Twist Split Ring Resonators
Directory of Open Access Journals (Sweden)
Haibin Sun
2014-01-01
Full Text Available A novel dual-band rectangular waveguide notch filter is experimentally investigated in this paper. Such filter is realized by integrating two pairs of split ring resonators (SRRs printed on the two sides of a dielectric slab with twist angles and separated as a distance in the center of the rectangular waveguide. Due to the coupling effects between the twist SRRs and between the original SRRs and their mirror images generated by the metallic walls perpendicular to the E-field direction, it can flexibly contribute two disjunct resonance states and result in the dual-band notch properties. Furthermore, the two resonance frequencies can be controlled by changing the twist angles, resulting in the shifts of notch frequency bands.
Metastable states in magnetic nanorings
DEFF Research Database (Denmark)
Castaño, F. J.; Ross, C. A.; Frandsen, Cathrine
2003-01-01
Magnetization states and hysteresis behavior of small ferromagnetic rings, of diameters 180-520 nm, have been investigated using magnetic force microscopy. In addition to the expected bi-domain ("onion") and flux-closed ("vortex") magnetization states, a metastable state has been found....... This "twisted" state contains a 360degrees domain wall which can exist over a wide range of applied fields. Four possible configurations of the twisted state are possible. Micromagnetic modeling shows that the twisted state is stabilised in small diameter, narrow rings. Additionally, more complex configurations...... such as double twisted states with two 360degrees walls have been observed....
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.
X-Graphs: Language and Algorithms for Heterogeneous Graph Streams
2017-09-01
parallel implementations for many key graph algorithms, conversions between tables and graphs and Python language bindings. SNAP is widely deployed...1. We have used Delite to develop a suite of DSLs for data analysis (query processing, machine learning , and graph processing). Approved for Public...range of users, interested in network analysis: support for Python - a major programming language for data scientists, documentation, tutorials, and
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.
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.
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.
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.)
Burleigh, Scott C.
2011-01-01
Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic
Graphs Theory and Applications
Fournier, Jean-Claude
2008-01-01
This book provides a pedagogical and comprehensive introduction to graph theory and its applications. It contains all the standard basic material and develops significant topics and applications, such as: colorings and the timetabling problem, matchings and the optimal assignment problem, and Hamiltonian cycles and the traveling salesman problem, to name but a few. Exercises at various levels are given at the end of each chapter, and a final chapter presents a few general problems with hints for solutions, thus providing the reader with the opportunity to test and refine their knowledge on the
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
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...... Exformatics, a danish provider of case and workflow management systems. We formalize the semantics by giving first a map from Nested to (flat) DCR Graphs with milestones, and then extending the previously given mapping from DCR Graphs to Buchi-automata to include the milestone relation....
Spectral partitioning in equitable graphs.
Barucca, Paolo
2017-06-01
Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e., random graphs with a block-regular structure, is studied, for which analytical results can be obtained. In particular, the spectral density of this ensemble is computed exactly for a modular and bipartite structure. Kesten-McKay's law for random regular graphs is found analytically to apply also for modular and bipartite structures when blocks are homogeneous. An exact solution to graph partitioning for two equal-sized communities is proposed and verified numerically, and a conjecture on the absence of an efficient recovery detectability transition in equitable graphs is suggested. A final discussion summarizes results and outlines their relevance for the solution of graph partitioning problems in other graph ensembles, in particular for the study of detectability thresholds and resolution limits in stochastic block models.
HREM of general and twist grain boundaries.
Energy Technology Data Exchange (ETDEWEB)
Merkle, K. L.; Thompson, L. J.
1999-03-10
The observation of atomic-scale structures of grain boundaries (GBs) via axial illumination HREM has been largely restricted to tilt GBs, due to the requirement that the electron beam be parallel to a low-index zone axis on both sides of the interface. This condition can be fulfilled for all tilt GBs with disorientation about a low-index direction. The information obtained through HREM studies in many materials has brought important insights concerning the atomic-scale structure of such boundaries. However, it is well known that tilt GBs occupy only an infinitesimally small fraction of the 5-dimensional phase space which describes the macroscopic geometry of all GBs. Therefore, although tilt GBs are very important due to their low energy, it would be useful to also study twist GBs and general GBs that contain twist and tilt components.
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.
MAGNETIC FIELD TWISTING BY INTERGRANULAR DOWNDRAFTS
Energy Technology Data Exchange (ETDEWEB)
Taroyan, Youra; Williams, Thomas [Department of Physics, IMPACS, Aberystwyth University, Aberystwyth (United Kingdom)
2016-10-01
The interaction of an intergranular downdraft with an embedded vertical magnetic field is examined. It is demonstrated that the downdraft may couple to small magnetic twists leading to an instability. The descending plasma exponentially amplifies the magnetic twists when it decelerates with depth due to increasing density. Most efficient amplification is found in the vicinity of the level, where the kinetic energy density of the downdraft reaches equipartition with the magnetic energy density. Continual extraction of energy from the decelerating plasma and growth in the total azimuthal energy occurs as a consequence of the wave-flow coupling along the downdraft. The presented mechanism may drive vortices and torsional motions that have been detected between granules and in simulations of magnetoconvection.
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%.
ILIGRA : An Efficient Inverse Line Graph Algorithm
Liu, D.; Trajanovski, S.; Van Mieghem, P.
2014-01-01
This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H, ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H. If ILIGRA does not know whether the given graph H is a line graph, it firstly
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 third style of graph reduction: a graph evaluator....
ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS
Broumi, Said; Talea, Mohamed; Bakali, Assia; Smarandache, Florentin
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.
Kirchhoff index of graphs and some graph operations
Indian Academy of Sciences (India)
We define the -repetition of to be the graph obtained by joining y i to x j for each i ∈ V ( T ) and each child of . In this paper, we compute the Kirchhoff index of the -repetition of in terms of parameters of and . Also we study how K f ( G ) behaves under some graph operations such as joining vertices or ...
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...
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.
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.
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)
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.
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
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.
Chordal Graphs and Semidefinite Optimization
DEFF Research Database (Denmark)
Vandenberghe, Lieven; Andersen, Martin Skovgaard
2015-01-01
Chordal graphs play a central role in techniques for exploiting sparsity in large semidefinite optimization problems and in related con-vex optimization problems involving sparse positive semidefinite matrices. Chordal graph properties are also fundamental to several classical results in combinat...
DYNAMICALLY MAINTAINING THE VISIBILITY GRAPH
VEGTER, G
1991-01-01
An algorithm is presented to maintain the visibility graph of a set of N line segments in the plane in O(log2 N + K log N) time, where K is the total number of arcs of the visibility graph that are destroyed or created upon insertion or deletion of a line segment. The line segments should be
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)
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.
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.
Hoede, C.; Liu, X
1998-01-01
In continuation of the paper of Hoede and Li on word graphs for a set of prepositions, word graphs are given for adjectives, adverbs and Chinese classifier words. It is argued that these three classes of words belong to a general class of words that may be called adwords. These words express the
2005-06-01
relationship, trust, etc.) between people. • User Psychology : Clickstream graphs are bipartite graphs connecting Internet users to the websites they visit...document groups (say, science fiction novels and thrillers ), based on the word groups that occur most frequently in them. A user who prefers one
Submanifolds weakly associated with graphs
Indian Academy of Sciences (India)
theory by defining submanifolds weakly associated with graphs. We prove that, in a local sense, every submanifold satisfies such an association, and other general results. Finally, we study submanifolds associated with graphs either in low dimensions or belonging to some special families. Keywords. Almost Hermitian ...
Subgraph Enumeration in Massive Graphs
DEFF Research Database (Denmark)
Silvestri, Francesco
We consider the problem of enumerating all instances of a given sample graph in a large data graph. Our focus is on determining the input/output (I/O) complexity of this problem. Let $E$ be the number of edges in the data graph, $k=\\BO{1}$ be the number of vertexes in the sample graph, $B......$ be the block length, and $M$ be the main memory size. The main result of the paper is a randomized algorithm that enumerates all instances of the sample graph in $\\BO{E^{k/2}/\\left(BM^{k/2-1}\\right)}$ expected I/Os if the maximum vertex degree of the data graph is $\\sqrt{EM}$. Under some assumptions, the same...... bound also applies with high probability. Our algorithm is I/O optimal, in the worst-case, when the sample graph belongs to the Alon class, which includes cliques, cycles and every graph with a perfect matching: indeed, we show that any algorithm enumerating $T$ instances must always use $\\BOM...
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.
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.
A Collection of Features for Semantic Graphs
Energy Technology Data Exchange (ETDEWEB)
Eliassi-Rad, T; Fodor, I K; Gallagher, B
2007-05-02
Semantic graphs are commonly used to represent data from one or more data sources. Such graphs extend traditional graphs by imposing types on both nodes and links. This type information defines permissible links among specified nodes and can be represented as a graph commonly referred to as an ontology or schema graph. Figure 1 depicts an ontology graph for data from National Association of Securities Dealers. Each node type and link type may also have a list of attributes. To capture the increased complexity of semantic graphs, concepts derived for standard graphs have to be extended. This document explains briefly features commonly used to characterize graphs, and their extensions to semantic graphs. This document is divided into two sections. Section 2 contains the feature descriptions for static graphs. Section 3 extends the features for semantic graphs that vary over time.
Directory of Open Access Journals (Sweden)
Marco Raberto
Full Text Available In this paper, we outline a model of graph (or network dynamics based on two ingredients. The first ingredient is a Markov chain on the space of possible graphs. The second ingredient is a semi-Markov counting process of renewal type. The model consists in subordinating the Markov chain to the semi-Markov counting process. In simple words, this means that the chain transitions occur at random time instants called epochs. The model is quite rich and its possible connections with algebraic geometry are briefly discussed. Moreover, for the sake of simplicity, we focus on the space of undirected graphs with a fixed number of nodes. However, in an example, we present an interbank market model where it is meaningful to use directed graphs or even weighted graphs.
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.
Quantum chaos on discrete graphs
Energy Technology Data Exchange (ETDEWEB)
Smilansky, Uzy [Department of Physics of Complex Systems, Weizmann Institute of Science, Rehovot 76100 (Israel); Isaac Newton Institute for Mathematical Sciences, 20 Clarkson Road, Cambridge CB3 0EH (United Kingdom)
2007-07-06
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 {zeta} 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 {zeta} 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)
Directory of Open Access Journals (Sweden)
I. Sahul Hamid
2016-07-01
Full Text Available A set D of vertices of a graph G is called a dominating set of G if every vertex in V(G−D is adjacent to a vertex in D. A dominating set S such that the subgraph 〈S〉 induced by S has at least one isolated vertex is called an isolate dominating set. An isolate dominating set none of whose proper subset is an isolate dominating set is a minimal isolate dominating set. The minimum and maximum cardinality of a minimal isolate dominating set are called the isolate domination number γ0 and the upper isolate domination number Γ0 respectively. In this paper we initiate a study on these parameters.
Environmental evolutionary graph theory.
Maciejewski, Wes; Puleo, Gregory J
2014-11-07
Understanding the influence of an environment on the evolution of its resident population is a major challenge in evolutionary biology. Great progress has been made in homogeneous population structures while heterogeneous structures have received relatively less attention. Here we present a structured population model where different individuals are best suited to different regions of their environment. The underlying structure is a graph: individuals occupy vertices, which are connected by edges. If an individual is suited for their vertex, they receive an increase in fecundity. This framework allows attention to be restricted to the spatial arrangement of suitable habitat. We prove some basic properties of this model and find some counter-intuitive results. Notably, (1) the arrangement of suitable sites is as important as their proportion, and (2) decreasing the proportion of suitable sites may result in a decrease in the fixation time of an allele. Copyright © 2014 Elsevier Ltd. All rights reserved.
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.
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.
Entanglement of bosonic modes in symmetric graphs
International Nuclear Information System (INIS)
Asoudeh, M.; Karimipour, V.
2005-01-01
The ground and thermal states of a quadratic Hamiltonian representing the interaction of bosonic modes or particles are always Gaussian states. We investigate the entanglement properties of these states for the case where the interactions are represented by harmonic forces acting along the edges of symmetric graphs - i.e., one-, two-, and three-dimensional rectangular lattices, mean-field clusters, and platonic solids. We determine the entanglement of formation (EOF) as a function of the interaction strength, calculate the maximum EOF in each case, and compare these values with the bounds found previously for quadratic Hamiltonians
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.
On some properties of doughnut graphs
Directory of Open Access Journals (Sweden)
Md. Rezaul Karim
2016-08-01
Full Text Available The class of doughnut graphs is a subclass of 5-connected planar graphs. It is known that a doughnut graph admits a straight-line grid drawing with linear area, the outerplanarity of a doughnut graph is 3, and a doughnut graph is k-partitionable. In this paper we show that a doughnut graph exhibits a recursive structure. We also give an efficient algorithm for finding a shortest path between any pair of vertices in a doughnut graph. We also propose a nice application of a doughnut graph based on its properties.
Completeness and regularity of generalized fuzzy graphs.
Samanta, Sovan; Sarkar, Biswajit; Shin, Dongmin; Pal, Madhumangal
2016-01-01
Fuzzy graphs are the backbone of many real systems like networks, image, scheduling, etc. But, due to some restriction on edges, fuzzy graphs are limited to represent for some systems. Generalized fuzzy graphs are appropriate to avoid such restrictions. In this study generalized fuzzy graphs are introduced. In this study, matrix representation of generalized fuzzy graphs is described. Completeness and regularity are two important parameters of graph theory. Here, regular and complete generalized fuzzy graphs are introduced. Some properties of them are discussed. After that, effective regular graphs are exemplified.
Comparison and Enumeration of Chemical Graphs
Akutsu, Tatsuya; Nagamochi, Hiroshi
2013-01-01
Chemical compounds are usually represented as graph structured data in computers. In this review article, we overview several graph classes relevant to chemical compounds and the computational complexities of several fundamental problems for these graph classes. In particular, we consider the following problems: determining whether two chemical graphs are identical, determining whether one input chemical graph is a part of the other input chemical graph, finding a maximum common part of two input graphs, finding a reaction atom mapping, enumerating possible chemical graphs, and enumerating stereoisomers. We also discuss the relationship between the fifth problem and kernel functions for chemical compounds. PMID:24688697
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.
Twisted rudder for reducing fuel-oil consumption
Directory of Open Access Journals (Sweden)
Kim Jung-Hun
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
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.
Twisted rudder for reducing fuel-oil consumption
Kim, Jung-Hun; Choi, Jung-Eun; Choi, Bong-Jun; Chung, Seok-Ho
2014-09-01
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.)
Colored graphs and matrix integrals
International Nuclear Information System (INIS)
Artamkin, I.V.
2007-12-01
In this article we discuss two different asymptotic expansions of matrix integrals. The original approach using the so-called Feynman diagram techniques leads to sums over isomorphism classes of ribbon graphs. Asymptotic expansions of more general Gaussian integrals are sums over isomorphism classes of colored graphs without ribbon structure. Here we derive the former expansion from the latter one. This provides an independent proof for the expansion used by Kontsevich. It might be very interesting to compare the algebra arising in these two approaches. The asymptotic expansion using ribbon graphs leads to the tau function of the KDV hierarchy while the sums over colored graphs satisfy simple partial differential equations which generalize the Burgers equation. We describe the general approach using colored graphs in the second section. In the third section we specialize the results of the second section for the matrix integral. In this section we also derive the expansion over ribbon graphs. The proof is based on simple topological considerations which are contained in section 5. In the last section we give an explicit calculation of the first term of the expansion using colored graphs
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.
Identifying vertex covers in graphs
DEFF Research Database (Denmark)
Henning, Michael A.; Yeo, Anders
2012-01-01
An identifying vertex cover in a graph G is a subset T of vertices in G that has a nonempty intersection with every edge of G such that T distinguishes the edges, that is, e∩T ≠ 0 for every edge e in G and e∩T ≠ f∩T for every two distinct edges e and f in G. The identifying vertex cover number TD......(G) of G is the minimum size of an identifying vertex cover in G. We observe that TD(G)+ρ(G) = |V (G)|, where ρ(G) denotes the packing number of G. We conjecture that if G is a graph of order n and size m with maximum degree Δ, then TD(G) ≤(Δ(Δ-1)/ Δ2+1)n + (2/Δ2+1) m. If the conjecture is true......, then the bound is best possible for all Δ ≥ 1. We prove this conjecture when Δ ≥ 1 and G is a Δ-regular graph. The three known Moore graphs of diameter 2, namely the 5-cycle, the Petersen graph and the Hoffman-Singleton graph, are examples of regular graphs that achieves equality in the upper bound. We also...
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
Electrostatic twisted modes in multi-component dusty plasmas
International Nuclear Information System (INIS)
Ayub, M. K.; Ali, S.; Ikram, M.
2016-01-01
Various electrostatic twisted modes are re-investigated with finite orbital angular momentum in an unmagnetized collisionless multi-component dusty plasma, consisting of positive/negative charged dust particles, ions, and electrons. For this purpose, hydrodynamical equations are employed to obtain paraxial equations in terms of density perturbations, while assuming the Gaussian and Laguerre-Gaussian (LG) beam solutions. Specifically, approximated solutions for potential problem are studied by using the paraxial approximation and expressed the electric field components in terms of LG functions. The energy fluxes associated with these modes are computed and corresponding expressions for orbital angular momenta are derived. Numerical analyses reveal that radial/angular mode numbers as well as dust number density and dust charging states strongly modify the LG potential profiles attributed to different electrostatic modes. Our results are important for understanding particle transport and energy transfer due to wave excitations in multi-component dusty plasmas
Coined quantum walks on weighted graphs
Wong, Thomas G.
2017-11-01
We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy’s quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has l integer self-loops, can be generalized to a quantum walk where each vertex has a single self-loop of real-valued weight l. We apply this real-valued lackadaisical quantum walk to two problems. First, we analyze it on the line or one-dimensional lattice, showing that it is exactly equivalent to a continuous deformation of the three-state Grover walk with faster ballistic dispersion. Second, we generalize Grover’s algorithm, or search on the complete graph, to have a weighted self-loop at each vertex, yielding an improved success probability when l < 3 + 2\\sqrt{2} ≈ 5.828 .
XML Graphs in Program Analysis
DEFF Research Database (Denmark)
Møller, Anders; Schwartzbach, Michael I.
2011-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 the use of XML graphs for program analysis with four very different languages: XACT (XML in Java), Java Servlets (Web application programming), XSugar...... (transformations between XML and non-XML data), and XSLT (stylesheets for transforming XML documents)....
Large networks and graph limits
Lovász, László
2012-01-01
Recently, it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks. Developing a mathematical theory of very large networks is an important challenge. This book describes one recent approach to this theory, the limit theory of graphs, which has emerged over the last decade. The theory has rich connections with other approaches to the study of large networks, such as "property testing" in computer science and regularity partition in graph theory. It has several applications in extremal graph theory, including the exact for
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.
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.
Kirchhoff index of graphs and some graph operations
Indian Academy of Sciences (India)
Abstract. Let T be a rooted tree, G a connected graph, x,y ∈ V(G) be fixed and Gi's be |V(T )| disjoint copies of G with xi and yi denoting the corresponding copies of x and y in Gi, respectively. We define the T -repetition of G to be the graph obtained by joining yi to xj for each i ∈ V(T ) and each child j of i. In this paper, we ...
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...
Hyperspectral image classification through bilayer graph-based learning.
Gao, Yue; Ji, Rongrong; Cui, Peng; Dai, Qionghai; Hua, Gang
2014-07-01
Hyperspectral image classification with limited number of labeled pixels is a challenging task. In this paper, we propose a bilayer graph-based learning framework to address this problem. For graph-based classification, how to establish the neighboring relationship among the pixels from the high dimensional features is the key toward a successful classification. Our graph learning algorithm contains two layers. The first-layer constructs a simple graph, where each vertex denotes one pixel and the edge weight encodes the similarity between two pixels. Unsupervised learning is then conducted to estimate the grouping relations among different pixels. These relations are subsequently fed into the second layer to form a hypergraph structure, on top of which, semisupervised transductive learning is conducted to obtain the final classification results. Our experiments on three data sets demonstrate the merits of our proposed approach, which compares favorably with state of the art.
CUBu: Universal Real-Time Bundling for Large Graphs.
van der Zwan, Matthew; Codreanu, Valeriu; Telea, Alexandru
2016-12-01
Visualizing very large graphs by edge bundling is a promising method, yet subject to several challenges: speed, clutter, level-of-detail, and parameter control. We present CUBu, a framework that addresses the above problems in an integrated way. Fully GPU-based, CUBu bundles graphs of up to a million edges at interactive framerates, being over 50 times faster than comparable state-of-the-art methods, and has a simple and intuitive control of bundling parameters. CUBu extends and unifies existing bundling techniques, offering ways to control bundle shapes, separate bundles by edge direction, and shade bundles to create a level-of-detail visualization that shows both the graph core structure and its details. We demonstrate CUBu on several large graphs extracted from real-life application domains.
Graph theory and combinatorial optimization
Marcotte, Odile; Avis, David
2006-01-01
A current treatment of cutting-edge topics in Graph Theory and Combinatorial Optimization by leading researchersIncludes heuristic advances and novel approaches to solving combinatorial optimization problems.
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.
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...... infrastructure for different symbolic positioning technologies, e.g., Bluetooth and RFID. More specifically, the paper proposes a model of indoor space that comprises a base graph and mappings that represent the topology of indoor space at different levels. The resulting model can be used for one or several...... indoor positioning technologies. Focusing on RFID-based positioning, an RFID specific reader deployment graph model is built from the base graph model. This model is then used in several algorithms for constructing and refining trajectories from raw RFID readings. Empirical studies with implementations...
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...
Submanifolds weakly associated with graphs
Indian Academy of Sciences (India)
Leuven: Katholieke Universiteit Leuven). (1990). [5] Etayo F, On quasi-slant submanifolds of an almost Hermitian manifold, Publ. Math. Debrecen 53 (1998) 217–223. [6] Harary F, Graph Theory (Reading: Addison-Wesley) (1972). [7] Papaghiuc N ...
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.
A contribution to queens graphs
DEFF Research Database (Denmark)
Barat, Janos
A graph $G$ is a queens graph if the vertices of $G$ can be mapped to queens on the chessboard such that two vertices are adjacent if and only if the corresponding queens attack each other, i.e. they are in horizontal, vertical or diagonal position. We prove a conjecture of Beineke, Broere...... and Henning that the Cartesian product of an odd cycle and a path is a queens graph. We show that the same does not hold for two odd cycles. % is not representable in the same way. The representation of the Cartesian product of an odd cycle and an even cycle remains an open problem. We also prove...... constructively that any finite subgraph of the grid or the hexagonal grid is a queens graph....
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.
Computational design of an automotive twist beam
Directory of Open Access Journals (Sweden)
Benki Aalae
2016-07-01
Full Text Available In recent years, the automotive industry has known a remarkable development in order to satisfy the customer requirements. In this paper, we will study one of the components of the automotive which is the twist beam. The study is focused on the multicriteria design of the automotive twist beam undergoing linear elastic deformation (Hooke׳s law. Indeed, for the design of this automotive part, there are some criteria to be considered as the rigidity (stiffness and the resistance to fatigue. Those two criteria are known to be conflicting, therefore, our aim is to identify the Pareto front of this problem. To do this, we used a Normal Boundary Intersection (NBI algorithm coupling with a radial basis function (RBF metamodel in order to reduce the high calculation time needed for solving the multicriteria design problem. Otherwise, we used the free form deformation (FFD technique for the generation of the 3D shapes of the automotive part studied during the optimization process.
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''.
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)
Needleless electrospinning with twisted wire spinneret
International Nuclear Information System (INIS)
Holopainen, Jani; Penttinen, Toni; Santala, Eero; Ritala, Mikko
2015-01-01
A needleless electrospinning setup named ‘Needleless Twisted Wire Electrospinning’ was developed. The polymer solution is electrospun from the surface of a twisted wire set to a high voltage and collected on a cylindrical collector around the wire. Multiple Taylor cones are simultaneously self-formed on the downward flowing solution. The system is robust and simple with no moving parts aside from the syringe pump used to transport the solution to the top of the wire. The structure and process parameters of the setup and the results on the preparation of polyvinyl pyrrolidone (PVP), hydroxyapatite (HA) and bioglass fibers with the setup are presented. PVP fiber sheets with areas of 40 × 120 cm 2 and masses up to 1.15 g were prepared. High production rates of 5.23 g h −1 and 1.40 g h −1 were achieved for PVP and HA respectively. The major limiting factor of the setup is drying of the polymer solution on the wire during the electrospinning process which will eventually force to interrupt the process for cleaning of the wire. Possible solutions to this problem and other ways to develop the setup are discussed. The presented system provides a simple way to increase the production rate and area of fiber sheet as compared with the conventional needle electrospinning. (paper)
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.
SOUR graphs for efficient completion
Lynch, Christopher; Strogova, Polina
1998-01-01
International audience; We introduce a data structure called \\emphSOUR graphs and present an efficient Knuth-Bendix completion procedure based on it. \\emphSOUR graphs allow for a maximal structure sharing of terms in rewriting systems. The term representation is a dag representation, except that edges are labelled with equational constraints and variable renamings. The rewrite rules correspond to rewrite edges, the unification problems to unification edges. The Critical Pair and Simplificatio...
Rectilinear Graphs and Angular Resolution
Bodlaender, H.L.; Tel, G.
2003-01-01
In this note we show that a planar graph with angular resolution at least π/2 can be drawn with all angles an integer multiple of π/2, that is, in a rectilinear manner. Moreover, we show that for d ≠ 4, d › 2, having an angular resolution of 2π/d does not imply that the graph can be drawn with all
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.
On dominator colorings in graphs
Indian Academy of Sciences (India)
A dominator coloring of a graph G is a proper coloring of G in which every vertex dominates every vertex of at least one color class. The minimum number of colors required for a dominator coloring of G is called the dominator chromatic number of G and is denoted by χd(G). In this paper we present several results on graphs ...
a generalization of total graphs
Indian Academy of Sciences (India)
8
Abstract. Let R be a commutative ring with nonzero identity, Ln(R) be the set of all lower triangular n × n matrices, and U be a triangular subset of. Rn i.e. the product of any lower triangular matrix with the transpose of any element of U, belongs to U. The graph GTn. U (Rn) is a simple graph whose ver- tices consists of all ...
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
On Graph Rewriting, Reduction and Evaluation
DEFF Research Database (Denmark)
Zerny, Ian
2009-01-01
We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also inter-derive a graph evaluator....
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
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.
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…
Hard graphs for the maximum clique problem
Hoede, C.
1988-01-01
The maximum clique problem is one of the NP-complete problems. There are graphs for which a reduction technique exists that transforms the problem for these graphs into one for graphs with specific properties in polynomial time. The resulting graphs do not grow exponentially in order and number.
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...
Design optimization of a twist compliant mechanism with nonlinear stiffness
Tummala, Y.; Frecker, M. I.; Wissa, A. A.; Hubbard, J. E., Jr.
2014-10-01
A contact-aided compliant mechanism called a twist compliant mechanism (TCM) is presented in this paper. This mechanism has nonlinear stiffness when it is twisted in both directions along its axis. The inner core of the mechanism is primarily responsible for its flexibility in one twisting direction. The contact surfaces of the cross-members and compliant sectors are primarily responsible for its high stiffness in the opposite direction. A desired twist angle in a given direction can be achieved by tailoring the stiffness of a TCM. The stiffness of a compliant twist mechanism can be tailored by varying thickness of its cross-members, thickness of the core and thickness of its sectors. A multi-objective optimization problem with three objective functions is proposed in this paper, and used to design an optimal TCM with desired twist angle. The objective functions are to minimize the mass and maximum von-Mises stress observed, while minimizing or maximizing the twist angles under specific loading conditions. The multi-objective optimization problem proposed in this paper is solved for an ornithopter flight research platform as a case study, with the goal of using the TCM to achieve passive twisting of the wing during upstroke, while keeping the wing fully extended and rigid during the downstroke. Prototype TCMs have been fabricated using 3D printing and tested. Testing results are also presented in this paper.
Design optimization of a twist compliant mechanism with nonlinear stiffness
International Nuclear Information System (INIS)
Tummala, Y; Frecker, M I; Wissa, A A; Hubbard, J E Jr
2014-01-01
A contact-aided compliant mechanism called a twist compliant mechanism (TCM) is presented in this paper. This mechanism has nonlinear stiffness when it is twisted in both directions along its axis. The inner core of the mechanism is primarily responsible for its flexibility in one twisting direction. The contact surfaces of the cross-members and compliant sectors are primarily responsible for its high stiffness in the opposite direction. A desired twist angle in a given direction can be achieved by tailoring the stiffness of a TCM. The stiffness of a compliant twist mechanism can be tailored by varying thickness of its cross-members, thickness of the core and thickness of its sectors. A multi-objective optimization problem with three objective functions is proposed in this paper, and used to design an optimal TCM with desired twist angle. The objective functions are to minimize the mass and maximum von-Mises stress observed, while minimizing or maximizing the twist angles under specific loading conditions. The multi-objective optimization problem proposed in this paper is solved for an ornithopter flight research platform as a case study, with the goal of using the TCM to achieve passive twisting of the wing during upstroke, while keeping the wing fully extended and rigid during the downstroke. Prototype TCMs have been fabricated using 3D printing and tested. Testing results are also presented in this paper. (paper)
Two new twisted helical nickel (II) and cobalt (III) octahedral ...
Indian Academy of Sciences (India)
Home; Journals; Journal of Chemical Sciences; Volume 126; Issue 6. Two new twisted helical nickel(II) and cobalt(III) octahedral monomer complexes: Synthesis and structural characterization. Malay Dolai ... Keywords. Coordination chemistry; nickel(II); cobalt(III); Schiff base; twisted helicity; supramolecular interactions.
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)
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...
Twisted tubular photobioreactor fluid dynamics evaluation for energy consumption minimization
Gómez-Pérez, C.A.; Espinosa Oviedo, J.J.; Montenegro Ruiz, L.C.; Boxtel, van A.J.B.
2017-01-01
This paper discusses a new tubular PhotoBioReactor (PBR) called twisted tubular PBR. The geometry of a twisted tubular PBR induces swirl mixing to guarantee good exposure of microalgae to Light-Dark (LD) cycles and to the nutrients and dissolved CO 2 . The paper analyses the energy uptake for fluid
KINEMATIC PROFILES OF DUMBBELL GALAXIES WITH TWISTED RADIO JETS
BALCELLS, M; MORGANTI, R; OOSTERLOO, T; PEREZFOURNON, [No Value; GONZALEZSERRANO, JI
1995-01-01
We study the orbital properties of dumbbell galaxies which harbor twisted radio jets. Velocity and velocity dispersion profiles for four dumbbell pairs (3C66B, 3C75, 3C449, 0326+39) are presented. We analyze optical CCD images in search of isophote off-centering and large isophote twists. Combining
Twists of genus three curves over finite fields
Meagher, Stephen; Top, Jakob
In this article we recall how to describe the twists of a curve over a finite field and we show how to compute the number of rational points on such a twist by methods of linear algebra We illustrate this in the case of plane quartic curves with at least 16 automorphisms In particular we treat the
Enhancement of heat transfer using varying width twisted tape inserts
African Journals Online (AJOL)
Enhancement of heat transfer using varying width twisted tape inserts. ... International Journal of Engineering, Science and Technology ... The present work shows the results obtained from experimental investigations of the augmentation of turbulent flow heat transfer in a horizontal tube by means of varying width twisted ...
Dynamic Programming on Nominal Graphs
Directory of Open Access Journals (Sweden)
Nicklas Hoch
2015-04-01
Full Text Available Many optimization problems can be naturally represented as (hyper graphs, where vertices correspond to variables and edges to tasks, whose cost depends on the values of the adjacent variables. Capitalizing on the structure of the graph, suitable dynamic programming strategies can select certain orders of evaluation of the variables which guarantee to reach both an optimal solution and a minimal size of the tables computed in the optimization process. In this paper we introduce a simple algebraic specification with parallel composition and restriction whose terms up to structural axioms are the graphs mentioned above. In addition, free (unrestricted vertices are labelled with variables, and the specification includes operations of name permutation with finite support. We show a correspondence between the well-known tree decompositions of graphs and our terms. If an axiom of scope extension is dropped, several (hierarchical terms actually correspond to the same graph. A suitable graphical structure can be found, corresponding to every hierarchical term. Evaluating such a graphical structure in some target algebra yields a dynamic programming strategy. If the target algebra satisfies the scope extension axiom, then the result does not depend on the particular structure, but only on the original graph. We apply our approach to the parking optimization problem developed in the ASCENS e-mobility case study, in collaboration with Volkswagen. Dynamic programming evaluations are particularly interesting for autonomic systems, where actual behavior often consists of propagating local knowledge to obtain global knowledge and getting it back for local decisions.
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.
String Theory, Strongly Correlated Systems, and Duality Twists
Torres Chicon, Nesty Ray
In the first part of this dissertation (Chapter 1), I present a construction of a six dimensional (2,0)-theory model that describes the dynamics of the Fractional Quantum Hall Effect (FQHE). The FQHE appears as part of the low energy description of the Coulomb branch of the A1 (2,0)-theory formulated on a geometry (S 1 x R2)/Zk. At low-energy, the configuration is described in terms of a 4+1D supersymmetric Yang-Mills (SYM) theory on a cone (R2/Z k) with additional 2+1D degrees of freedom at the tip of the cone that include fractionally charged particles. These fractionally charged "quasi-particles" are BPS strings of the (2,0)-theory wrapped on short cycles. In this framework, a W-boson can be modeled as a bound state of k quasi-particles, which can be used to understand the dynamics of the FQHE. In the second part of this dissertation (Chapters 2-3), I investigate the N=4 SYM theory compactified on a circle, with a varying coupling constant (Janus configuration) and an S-duality twist. I relate this setup to a three dimensional topological theory and to a dual string theory. The equality of these descriptions is exhibited by matching the operator algebra, and the dimensions of the Hilbert space. Additionally, this dissertation addresses a classic result in number theory, called quadratic reciprocity, using string theory language. I present a proof that quadratic reciprocity is a direct consequence of T-duality of Type-II string theory. This is demonstrated by analyzing a partition function of abelian N=4 SYM theory on a certain supersymmetry-preserving four-manifold with variable coupling constant and a SL(2,Z)-duality twist.
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.
On P-transitive graphs and applications
Directory of Open Access Journals (Sweden)
Giacomo Lenzi
2011-06-01
Full Text Available We introduce a new class of graphs which we call P-transitive graphs, lying between transitive and 3-transitive graphs. First we show that the analogue of de Jongh-Sambin Theorem is false for wellfounded P-transitive graphs; then we show that the mu-calculus fixpoint hierarchy is infinite for P-transitive graphs. Both results contrast with the case of transitive graphs. We give also an undecidability result for an enriched mu-calculus on P-transitive graphs. Finally, we consider a polynomial time reduction from the model checking problem on arbitrary graphs to the model checking problem on P-transitive graphs. All these results carry over to 3-transitive graphs.
Phage, Itumeleng B.; Lemmer, Miriam; Hitge, Mariette
2017-01-01
Students' graph comprehension may be affected by the background of the students who are the readers or interpreters of the graph, their knowledge of the context in which the graph is set, and the inferential processes required by the graph operation. This research study investigated these aspects of graph comprehension for 152 first year…
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 ...
Order reconstruction in inverse twisted nematic cell with an applied electric field
Sun, Yang; Ye, Wenjiang; Zhang, Zhidong
2016-05-01
Order reconstruction in an inverse twisted nematic (ITN) liquid crystal cell with an applied electric field is investigated based on Landau-de Gennes theory and the two-dimensional finite-difference iterative method. Twice eigenvalue exchange in three-axis layer configuration, thrice eigenvalue exchange in four-axis layer configuration, and negative order parameter uniaxial twisted state exist in this cell, which can be described by the order parameter tensor Q in equilibrium state. The twice eigenvalue exchange also has two degenerate configurations with reduced electric field E from 0.8 to 2.8 in 10ξ cell (ξ is the biaxial correlation length). Moreover, two critical cell gaps dc* * = 7 ξ and dc* = 12 ξ are included in the study of the ITN cell. When d ≤ dc* * , only the eigenvalue change state exists. When d ≥ dc*, only a positive order parameter uniaxial twisted state exists near the threshold electric field. When dc* * concept of eigenvalue exchange.
MHD Sausage Waves in Compressible Magnetically Twisted Flux Tubes
Fedun, Viktor
Recent high-resolution satellites clearly prove the existence of various types of theoretically predicted MHD waves in solar atmospheric magnetic structures (loops, arcades ets). Oscillations of magnetic flux tubes are of great importance as they contain information about the geometry and fine structure of the flux tubes. In this work we study the details of the effects caused by the presence of magnetic twist in flux tubes. The propagation of surface and body linear MHD modes in a twisted magnetic flux tube embedded in a magnetically twisted plasma environment is considered. We derive and analytically solve the linear governing equations of wave propagation for sausage surface and body modes of a magnetically-twisted compressible flux tube embedded in a compressible uniformly-magnetized plasma environment in cylindrical geometry in terms of Kummer's functions. Numerical solutions for the phase velocity are obtained for a wide range of wavenumbers and for varying magnetic twist. The effect of magnetic twist on the period of oscillations of sausage surface modes for different values of the wavenumber and vertical magnetic field strength is calculated for representative photospheric and coronal conditions. These results generalize and extend previous studies of MHD waves obtained for incompressible or compressible but non-twisted flux tubes. It is found that magnetic twist may change the period of sausage surface waves by the order of a few per cent when compared to counterparts in straight non-twisted flux tubes. This information will be most relevant, when high-resolution observations are used for diagnostic exploration of MHD wave guides in analogy to solar-interior studies by means of global eigenoscillations in helioseismology. Further detailed analysis is necessary in order to find the dispersion relation for more realistic cases, where the magnetic twist diminishes with distance from the tube. Finally, observational relevances will be discussed in light of the
Expression of EMT Markers SLUG and TWIST in Breast Cancer.
Grzegrzolka, Jedrzej; Biala, Martyna; Wojtyra, Patrycja; Kobierzycki, Christopher; Olbromski, Mateusz; Gomulkiewicz, Agnieszka; Piotrowska, Aleksandra; Rys, Janusz; Podhorska-Okolow, Marzena; Dziegiel, Piotr
2015-07-01
The epithelial-mesenchymal transition (EMT) has been observed in progression of in situ breast cancer to the invasive form and might be initiated by snail family zinc finger 2 (SLUG) and twist family bHLH transcription factor 1 (TWIST) protein overexpression. During this phenomenon, cells lose their epithelial phenotype and acquire mesenchymal features. The aim of the study was to examine the association of EMT markers SLUG and TWIST with clinicopathological data and the possibility of using these proteins as prognostic markers of breast cancer. Immunohistochemical analysis (IHC) of SLUG and TWIST expression was performed on archival paraffin samples of 19 cases with fibrocystic breast changes (control group), 148 cases of invasive ductal breast cancer (IDC) and 26 of invasive lobular breast cancer (ILC). Laser capture microdissection for isolation of cells from 17 frozen samples of IDC was employed and subsequently SLUG and TWIST mRNA expression in cancer and stromal cells was detected separately by real-time polymerase chain reaction. SLUG and TWIST expression in IDC was significant higher in stromal cells regardless of the method of quantification used (pSLUG mRNA, and pSLUG IHC, TWIST IHC and TWIST mRNA expression). Positive correlation of SLUG and TWIST protein and mRNA expression was observed in stromal cells of IDC (r=0.347; p<0.0001 and r=0.704; p<0.01, respectively). Expression of TWIST protein in IDC was higher in cancer cells of cases with shorter event-free survival period, as well as in stromal cells of cases with shorter overall survival period (p<0.05 for both). Stromal cells could play a role in the regulation of EMT in breast cancer. Copyright© 2015 International Institute of Anticancer Research (Dr. John G. Delinassios), All rights reserved.
GraphMeta: Managing HPC Rich Metadata in Graphs
Energy Technology Data Exchange (ETDEWEB)
Dai, Dong; Chen, Yong; Carns, Philip; Jenkins, John; Zhang, Wei; Ross, Robert
2016-01-01
High-performance computing (HPC) systems face increasingly critical metadata management challenges, especially in the approaching exascale era. These challenges arise not only from exploding metadata volumes, but also from increasingly diverse metadata, which contains data provenance and arbitrary user-defined attributes in addition to traditional POSIX metadata. This ‘rich’ metadata is becoming critical to supporting advanced data management functionality such as data auditing and validation. In our prior work, we identified a graph-based model as a promising solution to uniformly manage HPC rich metadata due to its flexibility and generality. However, at the same time, graph-based HPC rich metadata anagement also introduces significant challenges to the underlying infrastructure. In this study, we first identify the challenges on the underlying infrastructure to support scalable, high-performance rich metadata management. Based on that, we introduce GraphMeta, a graphbased engine designed for this use case. It achieves performance scalability by introducing a new graph partitioning algorithm and a write-optimal storage engine. We evaluate GraphMeta under both synthetic and real HPC metadata workloads, compare it with other approaches, and demonstrate its advantages in terms of efficiency and usability for rich metadata management in HPC systems.
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.
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
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)
Twisted Polynomials and Forgery Attacks on GCM
DEFF Research Database (Denmark)
Abdelraheem, Mohamed Ahmed A. M. A.; Beelen, Peter; Bogdanov, Andrey
2015-01-01
nonce misuse resistance, such as POET. The algebraic structure of polynomial hashing has given rise to security concerns: At CRYPTO 2008, Handschuh and Preneel describe key recovery attacks, and at FSE 2013, Procter and Cid provide a comprehensive framework for forgery attacks. Both approaches rely...... heavily on the ability to construct forgery polynomials having disjoint sets of roots, with many roots (“weak keys”) each. Constructing such polynomials beyond naïve approaches is crucial for these attacks, but still an open problem. In this paper, we comprehensively address this issue. We propose to use...... 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...
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)
Chiral Response of Twisted Bilayer Graphene
Stauber, T.; Low, T.; Gómez-Santos, G.
2018-01-01
We present an effective (minimal) theory for chiral two-dimensional materials. These materials possess an electromagnetic coupling without exhibiting a topological gap. As an example, we study the response of doped twisted bilayers, unveiling unusual phenomena in the zero frequency limit. An in-plane magnetic field induces a huge paramagnetic response at the neutrality point and, upon doping, also gives rise to a substantial longitudinal Hall response. The system also accommodates nontrivial longitudinal plasmonic modes that are associated with a longitudinal magnetic moment, thus endowing them with a chiral character. Finally, we note that the optical activity can be considerably enhanced upon doping and our general approach would enable systematic exploration of 2D material heterostructures with optical activity.
Emission of twisted photons from quantum vacuum
Mendonça, J. T.
2017-12-01
Emission of twisted photons, carrying orbital angular momentum, from QED vacuum is considered. This is a new type of radiation which can be excited by a Gaussian laser pulse propagating along the axis of a magnetic wiggler. We consider quantum vacuum as described by the Heisenberg-Euler Lagrangian, and assume propagation of an ultra-intense laser pulse in a static magnetic structure. We show that, in such a configuration, vacuum emission of electromagnetic vortices can occur, at a frequency much larger than that of the intense laser pulse, which can eventually be tuned from the visible up to the XUV range. This new configuration could eventually be useful to reduce classical noise in future experiments.
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)
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.
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
Algorithms for Planar Graphs and Graphs in Metric Spaces
DEFF Research Database (Denmark)
Wulff-Nilsen, Christian
preprocessing time, an O(n log n) time algorithm for the replacement paths problem, and a min st-cut oracle with nearlinear preprocessing time. We also give improved time bounds for computing various graph invariants such as diameter and girth. In the second part, we consider stretch factor problems...... a graph with new edges while minimizing stretch factor. The third and final part of the thesis deals with the Steiner tree problem in the plane equipped with a weighted fixed orientation metric. Here, we give an improved theoretical analysis of the strength of pruning techniques applied by many Steiner...
Quantum spin Hall effect in twisted bilayer graphene
Finocchiaro, F.; Guinea, F.; San-Jose, P.
2017-06-01
Motivated by a recent experiment (Sanchez-Yamagishi et al 2016 Nat. Nanotechnol. 214) reporting evidence of helical spin-polarized edge states in layer-biased twisted bilayer graphene under a magnetic flux, we study the possibility of stabilising a quantum spin Hall (QSH) phase in such a system, without Zeeman or spin-orbit couplings, and with a QSH gap induced instead by electronic interactions. We analyse how magnetic flux, electric field, interlayer rotation angle, and interactions (treated at a mean field level) combine to produce a pseudo-QSH with broken time-reversal symmetry, and spin-polarized helical edge states. The effect is a consequence of a robust interaction-induced ferrimagnetic ordering of the quantum Hall ground state under an interlayer bias, provided the two rotated layers are effectively decoupled at low energies. We discuss in detail the electronic structure and the constraints on system parameters, such as the angle, interactions and magnetic flux, required to reach the pseudo-QSH phase. We find, in particular, that purely local electronic interactions are not sufficient to account for the experimental observations, which demand at least nearest-neighbour interactions to be included.
An algebraic approach to graph codes
DEFF Research Database (Denmark)
Pinero, Fernando
theory as evaluation codes. Chapter three consists of the introduction to graph based codes, such as Tanner codes and graph codes. In Chapter four, we compute the dimension of some graph based codes with a result combining graph based codes and subfield subcodes. Moreover, some codes in chapter four...... are optimal or best known for their parameters. In chapter five we study some graph codes with Reed–Solomon component codes. The underlying graph is well known and widely used for its good characteristics. This helps us to compute the dimension of the graph codes. We also introduce a combinatorial concept...... related to the iterative encoding of graph codes with MDS component code. The last chapter deals with affine Grassmann codes and Grassmann codes. We begin with some previously known codes and prove that they are also Tanner codes of the incidence graph of the point–line partial geometry...
Structural and electron diffraction scaling of twisted graphene bilayers
Zhang, Kuan; Tadmor, Ellad B.
2018-03-01
Multiscale simulations are used to study the structural relaxation in twisted graphene bilayers and the associated electron diffraction patterns. The initial twist forms an incommensurate moiré pattern that relaxes to a commensurate microstructure comprised of a repeating pattern of alternating low-energy AB and BA domains surrounding a high-energy AA domain. The simulations show that the relaxation mechanism involves a localized rotation and shrinking of the AA domains that scales in two regimes with the imposed twist. For small twisting angles, the localized rotation tends to a constant; for large twist, the rotation scales linearly with it. This behavior is tied to the inverse scaling of the moiré pattern size with twist angle and is explained theoretically using a linear elasticity model. The results are validated experimentally through a simulated electron diffraction analysis of the relaxed structures. A complex electron diffraction pattern involving the appearance of weak satellite peaks is predicted for the small twist regime. This new diffraction pattern is explained using an analytical model in which the relaxation kinematics are described as an exponentially-decaying (Gaussian) rotation field centered on the AA domains. Both the angle-dependent scaling and diffraction patterns are in quantitative agreement with experimental observations. A Matlab program for extracting the Gaussian model parameters accompanies this paper.
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....
Nodal Statistics on Quantum Graphs
Alon, Lior; Band, Ram; Berkolaiko, Gregory
2018-03-01
It has been suggested that the distribution of the suitably normalized number of zeros of Laplacian eigenfunctions contains information about the geometry of the underlying domain. We study this distribution (more precisely, the distribution of the "nodal surplus") for Laplacian eigenfunctions of a metric graph. The existence of the distribution is established, along with its symmetry. One consequence of the symmetry is that the graph's first Betti number can be recovered as twice the average nodal surplus of its eigenfunctions. Furthermore, for graphs with disjoint cycles it is proven that the distribution has a universal form—it is binomial over the allowed range of values of the surplus. To prove the latter result, we introduce the notion of a local nodal surplus and study its symmetry and dependence properties, establishing that the local nodal surpluses of disjoint cycles behave like independent Bernoulli variables.
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
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.
Topological duality twist and brane instantons in F-theory
Martucci, Luca
2014-06-01
A variant of the topological twist, involving SL(2, ℤ) dualities and hence named topological duality twist, is introduced and explicitly applied to describe a U(1) N = 4 super Yang-Mills theory on a Kähler space with holomorphically space-dependent coupling. Three-dimensional duality walls and two-dimensional chiral theories naturally enter the formulation of the duality twisted theory. Appropriately generalized, this theory is relevant for the study of Euclidean D3-brane instantons in F-theory compactifications. Some of its properties and implications are discussed.
Conformal invariance and pion wave functions of nonleading twist
International Nuclear Information System (INIS)
Braun, V.M.; Filyanov, I.E.
1989-01-01
The restrictions are studied for the general structure of pion wave functions of twist 3 and twist 4 imposed by the conformal symmetry and the equations of motion. A systematic expansion of wave functions in the conformal spin is built and the first order corrections to asymptotic formulae are calculated by the QCD sum rule method. In particular, we have found a multiplicatively renormalizable contribution into the two-particle wave function of twist 4 which cannot be expanded in a finite set of Gegenbauer polynomials. 19 refs.; 5 figs
Wheeler graphs: A framework for BWT-based data structures.
Gagie, Travis; Manzini, Giovanni; Sirén, Jouni
2017-10-25
The famous Burrows-Wheeler Transform (BWT) was originally defined for a single string but variations have been developed for sets of strings, labeled trees, de Bruijn graphs, etc. In this paper we propose a framework that includes many of these variations and that we hope will simplify the search for more. We first define Wheeler graphs and show they have a property we call path coherence . We show that if the state diagram of a finite-state automaton is a Wheeler graph then, by its path coherence, we can order the nodes such that, for any string, the nodes reachable from the initial state or states by processing that string are consecutive. This means that even if the automaton is non-deterministic, we can still store it compactly and process strings with it quickly. We then rederive several variations of the BWT by designing straightforward finite-state automata for the relevant problems and showing that their state diagrams are Wheeler graphs.
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...... transition systems. We exemplify how deadlines can introduce time-locks and deadlocks and violate liveness. We then prove that the general technique for safe distribution of DCR Graphs provided in previous work can be extended to timed DCR Graphs. We exemplify the use of timed DCR Graphs and the distribution...... technique in praxis on a timed extension of a cross-organizational case management process arising from a previous case study. The example shows how a timed DCR Graph can be used to describe the global contract for a timed workflow process involving several organizations, which can then be distributed...
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.
Flexible Manifold Learning With Optimal Graph for Image and Video Representation.
Wang, Wei; Yan, Yan; Nie, Feiping; Yan, Shuicheng; Sebe, Nicu
2018-06-01
Graph-based dimensionality reduction techniques have been widely and successfully applied to clustering and classification tasks. The basis of these algorithms is the constructed graph which dictates their performance. In general, the graph is defined by the input affinity matrix. However, the affinity matrix derived from the data is sometimes suboptimal for dimension reduction as the data used are very noisy. To address this issue, we propose the projective unsupervised flexible embedding models with optimal graph (PUFE-OG). We build an optimal graph by adjusting the affinity matrix. To tackle the out-of-sample problem, we employ a linear regression term to learn a projection matrix. The optimal graph and the projection matrix are jointly learned by integrating the manifold regularizer and regression residual into a unified model. The experimental results on the public benchmark datasets demonstrate that the proposed PUFE-OG outperforms state-of-the-art methods.
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
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.......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....
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....
Andersson, Mattias
2011-01-01
A star graph consists of a vertex to which a set of edges are connected. Such an object can be used to, among other things, model the electromagnetic properties of quantum wires. A scalar field theory is constructed on the star graph and its properties are investigated. It turns out that there exist Kirchoff's rules for the conserved charges in the system leading to restrictions of the possible type of boundary conditions at the vertex. Scale invariant boundary conditions are investigated in...
Completely Described Undirected Graph Structure
Directory of Open Access Journals (Sweden)
G. S. Ivanova
2016-01-01
Full Text Available The objects of research are undirected graphs. The paper considers a problem of their isomorphism. A literature analysis of its solution, has shown that there is no way to define a complete graph invariant in the form of unique structural characteristics of each its vertex, which has a computational complexity of definition better than О (n 4 .The work objective is to provide the characteristics of the graph structure, which could be used to solve the problem of their isomorphism for a time better than О (n 4 . As such characteristics, the paper proposes to use the set of codes of tree roots of all the shortest - in terms of the number of edges - paths from each vertex to the others, uniquely defining the structure of each tree. It proves the theorem that it is possible to reduce the problem of isomorphism of the undirected graphs to the isomorphism problem of their splitting into the trees of all the shortest - in terms of the number of edges - paths of each vertex to the others. An algorithm to construct the shortest paths from each vertex to all others and to compute codes of their vertices has been developed. As the latter, are used Aho-codes, which find application in recognising the isomorphism of trees. The computational complexity to obtain structural characteristics of vertices has been estimated to be about О (n 3 .The pilot studies involved the full-scale experiment using the developed complex programmes to generate raw data, i.e. analytic representation of the graph with the number of vertices equal to 1200, and a programme to provide codes of the tree roots. To have an estimate of - "the worst" in terms of time - complexity of expansion algorithm of graphs into trees of the shortest paths and define the codes of their roots has been an experimentally studied how the number of tree vertices depends on the graph density. For the worst case was obtained a dependence of the number of tree vertices on the number of graph vertices
Some Invariants of Jahangir Graphs
Directory of Open Access Journals (Sweden)
Mobeen Munir
2017-01-01
Full Text Available In this report, we compute closed forms of M-polynomial, first and second Zagreb polynomials and forgotten polynomial for Jahangir graphs Jn,m for all values of m and n. From the M-polynomial, we recover many degree-based topological indices such as first and second Zagreb indices, modified Zagreb index, Symmetric division index, etc. We also compute harmonic index, first and second multiple Zagreb indices and forgotten index of Jahangir graphs. Our results are extensions of many existing results.
Effect of Turbulence on Power for Bend-Twist Coupled Blades
DEFF Research Database (Denmark)
Stäblein, Alexander; Hansen, Morten Hartvig
2016-01-01
that it might be related to the dynamic response of bend-twist coupled blades in turbulent flow. This paper contains estimations of the power curve from nonlinear time simulations, a linear frequency domain based method and a normal distribution weighted average method. It is shown that the frequency domain...... that changes in power due to turbulence are similar for coupled and uncoupled blades. Power gains at low wind speeds are related to the curvature of the steady state power curve. Losses around rated wind speed are caused by the effects of controller switching between partial and full power operation.......Bend-twist coupling of wind turbine blades reduces the structural loads of the turbine but it also results in a decrease of the annual energy production. The main part of the power loss can be mitigated by pretwisting the blade, but some power loss remains and previous studies indicate...
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-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.
Twisted Soft Photon Hair Implants on Black Holes
Tamburini, Fabrizio; Laurentis, Mariafelicia; Licata, Ignazio; Thidé, Bo
2017-08-01
The Hawking-Perry-Strominger (HPS) work [1] states a new controversial idea about the black hole (BH) information paradox [2-5] where BHs maximally entropize and encode information in their event horizon area [6,7], with no "hair" were thought to reveal information outside but angular momentum, mass and electric charge only [8,9] in a unique quantum gravity (QG) vacuum state. This new idea invokes new conservation laws involving gravitation and electromagnetism [10,11], to generate different QG vacua and preserve more information in hair implants. In the context of black holes and the HPS proposal we find that BH photon hair implants can be spatially shaped ad hoc and encode structured and densely organized information on the event horizon involving novel aspect in the discussion a particular aspect of EM fields, namely the spatial information of the field associated to its orbital angular momentum. BHs can have "curly", twisted, soft-hair implants with vorticity where structured information is holographically encoded in the event horizon in an organized way.
Blossier, BenoÃ®t.; Brinet, Mariane; Guichon, Pierre; Morénas, Vincent; Pène, Olivier; Rodríguez-Quintero, Jose; Zafeiropoulos, Savvas
2015-06-01
We present a precise nonperturbative determination of the renormalization constants in the mass independent RI'-MOM scheme. The lattice implementation uses the Iwasaki gauge action and four degenerate dynamical twisted-mass fermions. The gauge configurations are provided by the ETM Collaboration. Renormalization constants for scalar, pseudoscalar, vector and axial operators, as well as the quark propagator renormalization, are computed at three different values of the lattice spacing, two volumes and several twisted-mass parameters. The method we developed allows for a precise cross-check of the running, thanks to the particular proper treatment of hypercubic artifacts. Results for the twist-2 operator O44 are also presented.
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...
DEFF Research Database (Denmark)
Kucharik, Marcel; Hofacker, Ivo; Stadler, Peter
2014-01-01
Motivation RNA folding is a complicated kinetic process. The minimum free energy structure provides only a static view of the most stable conformational state of the system. It is insufficient to give detailed insights into the dynamic behavior of RNAs. A sufficiently sophisticated analysis...
Õnnetu saatusega Oliver Twist Polanski meelevallas / Andres Laasik
Laasik, Andres, 1960-2016
2005-01-01
Mängufilm Charles Dickensi romaani järgi "Oliver Twist" : stsenarist Ronald Harwood : režissöör Roman Polanski : nimiosas Barney Clark, Fagin - Ben Kingsley : Suurbritannia - Tšehhi - Prantsusmaa - Itaalia 2005
Polanski lavastas filmi "Oliver Twist" oma lastele / Andres Laasik
Laasik, Andres, 1960-2016
2005-01-01
Mängufilm "Oliver Twist" Charles Dickensi romaani ainetel esilinastus Prahas, kus toimusid ka filmivõtted. Tšehhi, Suurbritannia, Prantsusmaa ja Itaalia koostöös valminud filmi lavastas Roman Polanski
Twisted Masses and Enhanced Symmetries: the A&D Series
Orlando, Domenico
2012-01-01
We study new symmetries between A and D type quiver gauge theories with different numbers of colors. We realize these gauge theories with twisted masses via a brane construction that reproduces all the parameters of the Gauge/Bethe correspondence.
A Novel Wavelength Demodulation Method Using Twisted High Birefringence Fiber
International Nuclear Information System (INIS)
Niu, L Y; Yang, H Y; Wu, F; Li, Z Q
2006-01-01
The mathematical model of twisted high birefringence fiber was established through theoretical analysis. A novel FBG wavelength demodulation method was put forward, by using the twisted high birefringence fiber. The numerical simulation and the experiments were carried out to the system. The standard cosine relationship was observed between the output intensity of polarization analyzer and the twist angle for the signal light with different wavelengths. When the twist angle of the high birefringence fiber is 0 and π/2, the output intensity ratio of the system presents the linear relationship with the wavelength approximately. The experiment shows that system is in agreement very well with theoretical analysis to demodulate guasi-linearly FBG wavelength shift in range of about 10 nm
Determination of Elastic Twist in Horizontal Axis Wind Turbines (HAWTs)
Energy Technology Data Exchange (ETDEWEB)
Stoddard, F.; Nelson, V.; Starcher, K.; Andrews, B.
2006-06-01
This report presents the results of a project at the Alternative Energy Institute (AEI) which measured and calculated the elastic twist of three representative composite horizontal-axis blades: Carter 300, Gougeon ESI 54, and UTRC 8 kW.
Use of Spatial Transformations in Graph Comprehension
National Research Council Canada - National Science Library
Trickett, Susan B; Trafton, J. G
2004-01-01
Current theories of graph comprehension are largely silent about the processes by which inferences are made from graphs, although it is apparent that people are able to make such inferences. In Trickett & Trafton (2004...
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)
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 12; Issue 1. A Problem in Graph Theory. K P Savithri. Think It Over Volume 12 Issue 1 January 2007 pp 81-81. Fulltext. Click here to view fulltext PDF. Permanent link: http://www.ias.ac.in/article/fulltext/reso/012/01/0081-0081. Author Affiliations.
Box graphs and singular fibers
International Nuclear Information System (INIS)
Hayashi, Hirotaka; Lawrie, Craig; Morrison, David R.; Schäfer-Nameki, Sakura
2014-01-01
We determine the higher codimension fibers of elliptically fibered Calabi-Yau fourfolds with section by studying the three-dimensional N=2 supersymmetric gauge theory with matter which describes the low energy effective theory of M-theory compactified on the associated Weierstrass model, a singular model of the fourfold. Each phase of the Coulomb branch of this theory corresponds to a particular resolution of the Weierstrass model, and we show that these have a concise description in terms of decorated box graphs based on the representation graph of the matter multiplets, or alternatively by a class of convex paths on said graph. Transitions between phases have a simple interpretation as “flopping' of the path, and in the geometry correspond to actual flop transitions. This description of the phases enables us to enumerate and determine the entire network between them, with various matter representations for all reductive Lie groups. Furthermore, we observe that each network of phases carries the structure of a (quasi-)minuscule representation of a specific Lie algebra. Interpreted from a geometric point of view, this analysis determines the generators of the cone of effective curves as well as the network of flop transitions between crepant resolutions of singular elliptic Calabi-Yau fourfolds. From the box graphs we determine all fiber types in codimensions two and three, and we find new, non-Kodaira, fiber types for E 6 , E 7 and E 8
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…
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
Contracting a planar graph efficiently
DEFF Research Database (Denmark)
Holm, Jacob; Italiano, Giuseppe F.; Karczmarz, Adam
2017-01-01
We present a data structure that can maintain a simple planar graph under edge contractions in linear total time. The data structure supports adjacency queries and provides access to neighbor lists in O(1) time. Moreover, it can report all the arising self-loops and parallel edges. By applying th...
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.
Indian Academy of Sciences (India)
Examples: Some explicit computations. Throughout this section, we will assume that ( , μ) is a finite, connected, weighted graph. The adjacency matrix of (which, by abuse of notation, will also be denoted by ) is, as usual, the symmetric matrix with rows and columns indexed by the vertex set V of and. (v, w) = |{e ∈ E : s(e) = v, ...
Affect and Graphing Calculator Use
McCulloch, Allison W.
2011-01-01
This article reports on a qualitative study of six high school calculus students designed to build an understanding about the affect associated with graphing calculator use in independent situations. DeBellis and Goldin's (2006) framework for affect as a representational system was used as a lens through which to understand the ways in which…
On dominator colorings in graphs
Indian Academy of Sciences (India)
A dominator coloring of a graph is a proper coloring of in which every vertex dominates every vertex of at least one color class. The minimum number of colors required for a dominator coloring of is called the dominator chromatic number of and is denoted by d ( G ) . In this paper we present several results on ...
Czech Academy of Sciences Publication Activity Database
Hussein, A.; Krejčiřík, David; Siegl, P.
2015-01-01
Roč. 367, č. 4 (2015), s. 2921-2957 ISSN 0002-9947 R&D Projects: GA ČR GAP203/11/0701 Institutional support: RVO:61389005 Keywords : Laplacians on metric graphs * non-self-adjoint boundary conditions * similarity transforms to self-adjoint operators * Riesz basis Subject RIV: BE - Theoretical Physics Impact factor: 1.196, year: 2015
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.
Energy Spectrum and Quantum Hall Effect in Twisted Bilayer Graphene
Moon, Pilkyung; Koshino, Mikito
2012-01-01
We investigate the electronic spectra and quantum Hall effect in twisted bilayer graphenes with various rotation angles under magnetic fields, using a model rigorously including the interlayer interaction. We describe the spectral evolution from discrete Landau levels in the weak field regime to the fractal band structure in the strong field regime, and estimate the quantized Hall conductivity for each single gap. In weak magnetic fields, the low-energy conduction band of the twisted bilayer ...
Polarisation of microwave emission from reconnecting twisted coronal loops
Gordovskyy, M.; Browning, P. K.; Kontar, E. P.
2017-08-01
Context. Magnetic reconnection and particle acceleration due to the kink instability in twisted coronal loops can be a viable scenario for confined solar flares. Detailed investigation of this phenomenon requires reliable methods for observational detection of magnetic twist in solar flares, which may not be possible solely through extreme UV and soft X-ray thermal emission. Polarisation of microwave emission in flaring loops can be used as one of the detection criteria. Aims: The aim of this study is to investigate the effect of magnetic twist in flaring coronal loops on the polarisation of gyro-synchrotron microwave (GSMW) emission, and determine whether it could provide a means for magnetic twist detection. Methods: We consider time-dependent magnetohydrodynamic and test-particle models developed using the LARE3D and GCA codes to investigate twisted coronal loops that relax after kink instability. Synthetic GSMW emission maps (I and V Stokes components) are calculated using GX simulator. Results: It is found that flaring twisted coronal loops produce GSMW radiation with a gradient of circular polarisation across the loop. However, these patterns may be visible only for a relatively short period of time owing to fast magnetic reconfiguration after the instability. Their visibility also depends on the orientation and position of the loop on the solar disk. Typically, it would be difficult to see these characteristic polarisation patterns in a twisted loop seen from the top (I.e. close to the centre of the solar disk), but easier in a twisted loop seen from the side (I.e. observed very close to the limb).
Wear characteristics of UHMW polyethylene by twist method
Chișiu, G.; Popescu, A. M.; Tudor, A.; Petrescu, A. M.; Stoica, G. F.; Subhi, K. A.
2018-01-01
A wear test of the twist movement was performed as a new method to estimate the in vivo wear behavior of an acetabular cup material for total knee replacements. A series of UHMWPE samples was used to evaluate the dynamic coefficient of friction in twist movement in contact with steel. The experimental data were conducted to validate the related theoretical model developed in the present study.
Study of twist boundaries in aluminium. Structure and intergranular diffusion
International Nuclear Information System (INIS)
Lemuet, Daniel
1981-01-01
This research thesis addresses the study of grain boundaries in oriented crystals, and more particularly the systematic calculation of intergranular structures and energies of twist boundaries of <001> axis in aluminium, the determination of intergranular diffusion coefficients of zinc in a set of twist bi-crystals of same axis encompassing a whole range of disorientations, and the search for a correlation between these experimental results and calculated structures
Application of graph database for analytical tasks
Günzl, Richard
2014-01-01
This diploma thesis is about graph databases, which belong to the category of database systems known as NoSQL databases, but graph databases are beyond NoSQL databases. Graph databases are useful in many cases thanks to native storing of interconnections between data, which brings advantageous properties in comparison with traditional relational database system, especially in querying. The main goal of the thesis is: to describe principles, properties and advantages of graph database; to desi...
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.
Unsupervised Deep Haar Scattering on Graphs
Chen, Xu; Cheng, Xiuyuan; Mallat, Stéphane
2014-01-01
The classification of high-dimensional data defined on graphs is particularly difficult when the graph geometry is unknown. We introduce a Haar scattering transform on graphs, which computes invariant signal descriptors. It is implemented with a deep cascade of additions, subtractions and absolute values, which iteratively compute orthogonal Haar wavelet transforms. Multiscale neighborhoods of unknown graphs are estimated by minimizing an average total variation, with a pair matching algorith...
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.
Twisting short dsDNA with applied tension
Zoli, Marco
2018-02-01
The twisting deformation of mechanically stretched DNA molecules is studied by a coarse grained Hamiltonian model incorporating the fundamental interactions that stabilize the double helix and accounting for the radial and angular base pair fluctuations. The latter are all the more important at short length scales in which DNA fragments maintain an intrinsic flexibility. The presented computational method simulates a broad ensemble of possible molecule conformations characterized by a specific average twist and determines the energetically most convenient helical twist by free energy minimization. As this is done for any external load, the method yields the characteristic twist-stretch profile of the molecule and also computes the changes in the macroscopic helix parameters i.e. average diameter and rise distance. It is predicted that short molecules under stretching should first over-twist and then untwist by increasing the external load. Moreover, applying a constant load and simulating a torsional strain which over-twists the helix, it is found that the average helix diameter shrinks while the molecule elongates, in agreement with the experimental trend observed in kilo-base long sequences. The quantitative relation between percent relative elongation and superhelical density at fixed load is derived. The proposed theoretical model and computational method offer a general approach to characterize specific DNA fragments and predict their macroscopic elastic response as a function of the effective potential parameters of the mesoscopic Hamiltonian.
Twist decomposition of Drell-Yan structure functions: phenomenological implications
Energy Technology Data Exchange (ETDEWEB)
Brzemiński, Dawid [Institute of Physics, Jagiellonian University,S. Łojasiewicza 11, 30-348 Kraków (Poland); Cavendish Laboratory, University of Cambridge,19 J.J. Thomson Avenue, Cambridge CB3 0HE (United Kingdom); Motyka, Leszek; Sadzikowski, Mariusz; Stebel, Tomasz [Institute of Physics, Jagiellonian University,S. Łojasiewicza 11, 30-348 Kraków (Poland)
2017-01-02
The forward Drell-Yan process in pp scattering at the LHC at √S=14 TeV is considered. We analyze the Drell-Yan structure functions assuming the dominance of a Compton-like emission of a virtual photon from a fast quark scattering off the small x gluons. The color dipole framework is applied to perform quantitatively the twist decomposition of all the Drell-Yan structure functions. Two models of the color dipole scattering are applied: the Golec-Biernat-Wüsthoff model and the dipole cross section obtained from the Balitsky-Fadin-Kuraev-Lipatov evolution equation. The two models have essentially different higher twist content and the gluon transverse momentum distribution and lead to different significant effects beyond the collinear leading twist description. It is found that the gluon transverse momentum effects are significant in the Drell-Yan structure functions for all Drell-Yan pair masses M, and the higher twist effects become important for M≲10 GeV. It is found that the structure function W{sub TT} related to the A{sub 2} angular coefficient and the Lam-Tung observable A{sub 0}−A{sub 2} are particularly sensitive to the gluon k{sub T} effects and to the higher twist effects. A procedure is suggested how to disentangle the higher twist effects from the gluon transverse momentum effects.
How the embryonic chick brain twists
Guo, Qiaohang; Dai, Eric; Forsch, Nickolas; Taber, Larry A.
2016-01-01
During early development, the tubular embryonic chick brain undergoes a combination of progressive ventral bending and rightward torsion, one of the earliest organ-level left–right asymmetry events in development. Existing evidence suggests that bending is caused by differential growth, but the mechanism for the predominantly rightward torsion of the embryonic brain tube remains poorly understood. Here, we show through a combination of in vitro experiments, a physical model of the embryonic morphology and mechanics analysis that the vitelline membrane (VM) exerts an external load on the brain that drives torsion. Our theoretical analysis showed that the force is of the order of 10 micronewtons. We also designed an experiment to use fluid surface tension to replace the mechanical role of the VM, and the estimated magnitude of the force owing to surface tension was shown to be consistent with the above theoretical analysis. We further discovered that the asymmetry of the looping heart determines the chirality of the twisted brain via physical mechanisms, demonstrating the mechanical transfer of left–right asymmetry between organs. Our experiments also implied that brain flexure is a necessary condition for torsion. Our work clarifies the mechanical origin of torsion and the development of left–right asymmetry in the early embryonic brain. PMID:28334695
Twisted conformal field theories and Morita equivalence
Energy Technology Data Exchange (ETDEWEB)
Marotta, Vincenzo [Dipartimento di Scienze Fisiche, Universita di Napoli ' Federico II' and INFN, Sezione di Napoli, Compl. universitario M. Sant' Angelo, Via Cinthia, 80126 Napoli (Italy); Naddeo, Adele [CNISM, Unita di Ricerca di Salerno and Dipartimento di Fisica ' E.R. Caianiello' , Universita degli Studi di Salerno, Via Salvador Allende, 84081 Baronissi (Italy); Dipartimento di Scienze Fisiche, Universita di Napoli ' Federico II' , Compl. universitario M. Sant' Angelo, Via Cinthia, 80126 Napoli (Italy)], E-mail: adelenaddeo@yahoo.it
2009-04-01
The Morita equivalence for field theories on noncommutative two-tori is analysed in detail for rational values of the noncommutativity parameter {theta} (in appropriate units): an isomorphism is established between an Abelian noncommutative field theory (NCFT) and a non-Abelian theory of twisted fields on ordinary space. We focus on a particular conformal field theory (CFT), the one obtained by means of the m-reduction procedure [V. Marotta, J. Phys. A 26 (1993) 3481; V. Marotta, Mod. Phys. Lett. A 13 (1998) 853; V. Marotta, Nucl. Phys. B 527 (1998) 717; V. Marotta, A. Sciarrino, Mod. Phys. Lett. A 13 (1998) 2863], and show that it is the Morita equivalent of a NCFT. Finally, the whole m-reduction procedure is shown to be the image in the ordinary space of the Morita duality. An application to the physics of a quantum Hall fluid at Jain fillings {nu}=m/(2pm+1) is explicitly discussed in order to further elucidate such a correspondence and to clarify its role in the physics of strongly correlated systems. A new picture emerges, which is very different from the existing relationships between noncommutativity and many body systems [A.P. Polychronakos, arXiv: 0706.1095].
The Latest Twists in Chromatin Remodeling.
Blossey, Ralf; Schiessel, Helmut
2018-01-05
In its most restrictive interpretation, the notion of chromatin remodeling refers to the action of chromatin-remodeling enzymes on nucleosomes with the aim of displacing and removing them from the chromatin fiber (the effective polymer formed by a DNA molecule and proteins). This local modification of the fiber structure can have consequences for the initiation and repression of the transcription process, and when the remodeling process spreads along the fiber, it also results in long-range effects essential for fiber condensation. There are three regulatory levels of relevance that can be distinguished for this process: the intrinsic sequence preference of the histone octamer, which rules the positioning of the nucleosome along the DNA, notably in relation to the genetic information coded in DNA; the recognition or selection of nucleosomal substrates by remodeling complexes; and, finally, the motor action on the nucleosome exerted by the chromatin remodeler. Recent work has been able to provide crucial insights at each of these three levels that add new twists to this exciting and unfinished story, which we highlight in this perspective. Copyright © 2017 Biophysical Society. Published by Elsevier Inc. All rights reserved.
On m-Neighbourly Irregular Instuitionistic Fuzzy Graphs
N.R.Santhi Maheswari; C.Sekar
2016-01-01
In this paper, m-neighbourly irregular intuitionistic fuzzy graphs and m- neighbourly totally irregular intuitionistic fuzzy graphs are defined. Relation between m-neighbourly irregular intuitionistic fuzzy graph and m-neighbourly totally irregular intuitionistic fuzzy graph are discussed.
Construction of cycle double covers for certain classes of graphs
Hoede, C.; Kriesell, M.; Uttuggadewa, S.
2000-01-01
We introduce two classes of graphs, Indonesian graphs and $k$-doughnut graphs. Cycle double covers are constructed for these classes. In case of doughnut graphs this is done for the values $k=1,2,3$ and 4.
Graph Partitioning Models for Parallel Computing
Energy Technology Data Exchange (ETDEWEB)
Hendrickson, B.; Kolda, T.G.
1999-03-02
Calculations can naturally be described as graphs in which vertices represent computation and edges reflect data dependencies. By partitioning the vertices of a graph, the calculation can be divided among processors of a parallel computer. However, the standard methodology for graph partitioning minimizes the wrong metric and lacks expressibility. We survey several recently proposed alternatives and discuss their relative merits.
Modeling Software Evolution using Algebraic Graph Rewriting
Ciraci, S.; van den Broek, P.M.; Avgeriou, P.; Zdun, U.; Borne, I.
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
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…
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
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
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
Collaborative Robotic Instruction: A Graph Teaching Experience
Mitnik, Ruben; Recabarren, Matias; Nussbaum, Miguel; Soto, Alvaro
2009-01-01
Graphing is a key skill in the study of Physics. Drawing and interpreting graphs play a key role in the understanding of science, while the lack of these has proved to be a handicap and a limiting factor in the learning of scientific concepts. It has been observed that despite the amount of previous graph-working experience, students of all ages…
Integral complete r-partite graphs
Wang, Ligong; Li, Xueliang; Hoede, C.
2004-01-01
A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper, we give a useful sufficient and necessary condition for complete r-partite graphs to be integral, from which we can construct infinite many new classes of such integral graphs. It is proved that