Relevant bibliographies by topics / Graph of discontinuous maps

Academic literature on the topic 'Graph of discontinuous maps'

Author: Grafiati
Published: 14 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graph of discontinuous maps.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Graph of discontinuous maps"

1

Efremova, L. S., and E. N. Makhrova. "One-dimensional dynamical systems." Russian Mathematical Surveys 76, no. 5 (October 1, 2021): 821–81. http://dx.doi.org/10.1070/rm9998.

Full text
Abstract:
Abstract The survey is devoted to the topological dynamics of maps defined on one-dimensional continua such as a closed interval, a circle, finite graphs (for instance, finite trees), or dendrites (locally connected continua without subsets homeomorphic to a circle). Connections between the periodic behaviour of trajectories, the existence of a horseshoe and homoclinic trajectories, and the positivity of topological entropy are investigated. Necessary and sufficient conditions for entropy chaos in continuous maps of an interval, a circle, or a finite graph, and sufficient conditions for entropy chaos in continuous maps of dendrites are presented. Reasons for similarities and differences between the properties of maps defined on the continua under consideration are analyzed. Extensions of Sharkovsky’s theorem to certain discontinuous maps of a line or an interval and continuous maps on a plane are considered. Bibliography: 207 titles.
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Denghui, Zhenbang Cao, Xiaoming Zhang, Celso Grebogi, and Jianhua Xie. "Strange Nonchaotic Attractors From a Family of Quasiperiodically Forced Piecewise Linear Maps." International Journal of Bifurcation and Chaos 31, no. 07 (June 15, 2021): 2150111. http://dx.doi.org/10.1142/s021812742150111x.

Full text
Abstract:
In this paper, a family of quasiperiodically forced piecewise linear maps is considered. It is proved that there exists a unique strange nonchaotic attractor for some set of parameter values. It is the graph of an upper semi-continuous function, which is invariant, discontinuous almost everywhere and attracts almost all orbits. Moreover, both Lyapunov exponents on the attractor is nonpositive. Finally, to demonstrate and validate our theoretical results, numerical simulations are presented to exhibit the corresponding phase portrait and Lyapunov exponents portrait.
APA, Harvard, Vancouver, ISO, and other styles
3

Scott, C. B., and Eric Mjolsness. "Graph diffusion distance: Properties and efficient computation." PLOS ONE 16, no. 4 (April 27, 2021): e0249624. http://dx.doi.org/10.1371/journal.pone.0249624.

Full text
Abstract:
We define a new family of similarity and distance measures on graphs, and explore their theoretical properties in comparison to conventional distance metrics. These measures are defined by the solution(s) to an optimization problem which attempts find a map minimizing the discrepancy between two graph Laplacian exponential matrices, under norm-preserving and sparsity constraints. Variants of the distance metric are introduced to consider such optimized maps under sparsity constraints as well as fixed time-scaling between the two Laplacians. The objective function of this optimization is multimodal and has discontinuous slope, and is hence difficult for univariate optimizers to solve. We demonstrate a novel procedure for efficiently calculating these optima for two of our distance measure variants. We present numerical experiments demonstrating that (a) upper bounds of our distance metrics can be used to distinguish between lineages of related graphs; (b) our procedure is faster at finding the required optima, by as much as a factor of 103; and (c) the upper bounds satisfy the triangle inequality exactly under some assumptions and approximately under others. We also derive an upper bound for the distance between two graph products, in terms of the distance between the two pairs of factors. Additionally, we present several possible applications, including the construction of infinite “graph limits” by means of Cauchy sequences of graphs related to one another by our distance measure.
APA, Harvard, Vancouver, ISO, and other styles
4

ANDRES, JAN, PAVLA ŠNYRYCHOVÁ, and PIOTR SZUCA. "SHARKOVSKII'S THEOREM FOR CONNECTIVITY Gδ-RELATIONS." International Journal of Bifurcation and Chaos 16, no. 08 (August 2006): 2377–93. http://dx.doi.org/10.1142/s0218127406016136.

Full text
Abstract:
A version of Sharkovskii's cycle coexistence theorem is formulated for a composition of connectivity Gδ-relations with closed values. Thus, a multivalued version in [Andres & Pastor, 2005] holding with at most two exceptions for M-maps, jointly with a single-valued version in [Szuca, 2003], for functions with a connectivity Gδ-graph, are generalized. In particular, our statement is applicable to differential inclusions as well as to some discontinuous functions.
APA, Harvard, Vancouver, ISO, and other styles
5

Margielewicz, J., J. Wojnarowski, and S. Zawiślak. "Numerical Studies of Nonlinear Gearing Models Using Bond Graph Method." International Journal of Applied Mechanics and Engineering 23, no. 4 (November 1, 2018): 885–96. http://dx.doi.org/10.2478/ijame-2018-0049.

Full text
Abstract:
Abstract The present paper is dedicated to computer simulations performed using a numerical model of a one-stage gear. The motion equations were derived utilizing the bond graph method. The formulated model takes into consideration the variable stiffness of toothings as well as an inter-tooth clearance which has been represented via discontinuous elements with so called dead zones. As a result of these assumptions, the nonlinear model was obtained which enables representation of the dynamic phenomena of the considered gear. In the paper, an influence of errors of gear wheels’ co-operation on the character of excited dynamic phenomena was studied. The methodology of the analyses consists in utilization of the following tools: color maps of distribution of the maximal Lapunov coefficient and bifurcation diagrams. Based upon them, the parameters were determined, for which the Poincare portrait represents a structure of the chaotic attractor. For the identified attractors, the initial attractors were calculated numerically - which along with the changes of the control parameters are subjected to multiplication, stretching or rotation.
APA, Harvard, Vancouver, ISO, and other styles
6

Bellettini, Giovanni, Alaa Elshorbagy, Maurizio Paolini, and Riccardo Scala. "On the relaxed area of the graph of discontinuous maps from the plane to the plane taking three values with no symmetry assumptions." Annali di Matematica Pura ed Applicata (1923 -) 199, no. 2 (July 9, 2019): 445–77. http://dx.doi.org/10.1007/s10231-019-00887-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Abello, James. "Hierarchical graph maps." Computers & Graphics 28, no. 3 (June 2004): 345–59. http://dx.doi.org/10.1016/j.cag.2004.03.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bazhenov, Viktor, Olha Pogorelova, and Tetiana Postnikova. "Transient Chaos in Platform-vibrator with Shock." Strength of Materials and Theory of Structures, no. 106 (May 24, 2021): 22–40. http://dx.doi.org/10.32347/2410-2547.2021.106.22-40.

Full text
Abstract:
Platform-vibrator with shock is widely used in the construction industry for compacting and molding large concrete products. Its mathematical model, created in our previous work, meets all the basic requirements of shock-vibration technology for the precast concrete production on low-frequency resonant platform-vibrators. This model corresponds to the two-body 2-DOF vibro-impact system with a soft impact. It is strongly nonlinear non-smooth discontinuous system. This is unusual vibro-impact system due to its specific properties. The upper body, with a very large mass, breaks away from the lower body a very short distance, and then falls down onto the soft constraint that causes a soft impact. Then it bounces and falls again, and so on. A soft impact is simulated with nonlinear Hertzian contact force. This model exhibited many unique phenomena inherent in nonlinear non-smooth dynamical systems with varying control parameters. In this paper, we demonstrate the transient chaos in a vibro-impact system. Our finding of transient chaos in platform-vibrator with shock, besides being a remarkable phenomenon by itself, provides an understanding of the dynamical processes that occur in the platform-vibrator when varying the technological mass of the mold with concrete. Phase trajectories, Poincaré maps, graphs of time series and contact forces, Fourier spectra, the largest Lyapunov exponent, and wavelet characteristics are used in numerical investigations to determine the chaotic and periodic phases of the realization. We show both the dependence of the transient chaos on the control parameter value and the sensitive dependence on the initial conditions. We hope that this analysis can help avoid undesirable platform-vibrator behaviour during design and operation due to inappropriate system parameters, since transient chaos may be a dangerous and unwanted state of a vibro-impact system.
APA, Harvard, Vancouver, ISO, and other styles
9

Bischi, Gian-Italo, Laura Gardini, and Fabio Tramontana. "Bifurcation curves in discontinuous maps." Discrete & Continuous Dynamical Systems - B 13, no. 2 (2010): 249–67. http://dx.doi.org/10.3934/dcdsb.2010.13.249.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pavlovic, Branka. "Discontinuous Maps from Lipschitz Algebras." Journal of Functional Analysis 155, no. 2 (June 1998): 436–54. http://dx.doi.org/10.1006/jfan.1997.3232.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Graph of discontinuous maps"

1

Tealdi, Lucia. "The relaxed area of maps from the plane to the plane with a line discontinuity, and the role of semicartesian surfaces." Doctoral thesis, SISSA, 2015. http://hdl.handle.net/20.500.11767/4846.

Full text
Abstract:
In this thesis we study the relaxation of the area functional w.r.t. the L^1 topology of a map from a bounded planar domain with values in the plane and jumping on a segment. We estimate from above the singular contribution of this functional due to the presence of the jump in terms of the infimum of the area among a suitable family of surfaces that we call semicartesian surfaces. In our analysis, we also introduce a different notion of area, namely the relaxation of the area w.r.t. a convergence stronger than the L^1 convergence, whose singular contribution is completely characterized in terms of suitable semicartesian area minimizing problems. We propose also some examples of maps for which the two notions of relaxation are different: these examples underline the highly non-local behaviour of the L^1-relaxation, and justify the introduction of the other functional. Some result about the existence of a semicartesian area-minimizing surface is also provided.
APA, Harvard, Vancouver, ISO, and other styles
2

Pring, Stephen Robert. "Discontinuous maps with applications to impacting systems." Thesis, University of Bath, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.518113.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

McCall, Kevin J. "3-Maps And Their Generalizations." VCU Scholars Compass, 2018. https://scholarscompass.vcu.edu/etd/5581.

Full text
Abstract:
A 3-map is a 3-region colorable map. They have been studied by Craft and White in their paper 3-maps. This thesis introduces topological graph theory and then investigates 3-maps in detail, including examples, special types of 3-maps, the use of 3-maps to find the genus of special graphs, and a generalization known as n-maps.
APA, Harvard, Vancouver, ISO, and other styles
4

OLIVEIRA, CARLOS VINICIUS SOUSA DE. "DISPARITY MAPS USING GRAPH CUTS WITH MULTI-RESOLUTION." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2010. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=16430@1.

Full text
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
Reconstruir a informação 3D de uma cena é uma tarefa bastante comum em Visão Computacional. Uma das técnicas mais utilizadas para realizar esta tarefa é a correspondência por estéreo, que consiste basicamente em, dadas duas imagens referentes a uma mesma cena vista de pontos diferentes, determinar os pontos correspondentes entre essas duas imagens e armazenar essa informação em um mapa de disparidades. Até hoje diversos métodos foram propostos para resolver o problema de estéreo com esforço computacional viável e mantendo a qualidade dos resultados. Essa, entretanto, é uma tarefa bastante árdua e que difícilmente alcança resultados precisos com pouco esforço computacional. Nesse âmbito, uma técnica que tem sido muito estudada são os Cortes de Grafo (Graph Cuts), que almeja resolver o problema de minimização de energia em tempo polinomial. Nesse caso o problema de estéreo é mapeado como um problema de minimização de energia e desta forma solucionado utilizando cortes de grafo. Neste trabalho estudamos as técnicas de cortes de grafo mais recentes e eficientes e propomos um método para a determinação de correspondências entre duas imagens num contexto de multi-resolução, no qual uma pirâmide Gaussiana para as imagens é construída e a técnica de cortes de grafo é aplicada em níveis menores, otimizando a performance e obtendo resultados mais precisos através da utilização do algoritmo de expansão-alfa. São revisadas as técnicas de cortes de grafo e de multi-resolução e os resultados obtidos são apresentados e avaliados em relação a métodos semelhantes.
Reconstructing the 3D information of a scene is a common task in Computer Vision. Stereo matching is one of the most investigated techniques used to perform this task, which basically consists of, given two images of a scene seen from different view points, determining corresponding pixels in these two images and store this information in a disparity map. Several methods have been proposed to solve the stereo problem keeping good performance and giving good quality results. This is however a very arduos task which hardly achieves precise results with low computational power. In this context, the Graph Cuts method has been very much considered, which aims to solve the energy minimization problem in polinomial time. In this case the stereo problem can be modelled as an energy minimization problem and, thus solved using the Graph Cuts technique. In this work we investigate the most recent and efficient Graph Cuts methods and propose a method for establishing the correspondences between two images in the context of multi-resolution, in which a Gaussian pyramid for the input images is built and the Graph Cuts methods is applied in coarser levels, optimizing the performance and getting more precise results through the use of the alfa-expansion algorithm. The Graph Cuts and multi-resolution techniques are reviewed and the results of the proposed method are presented and evaluated compared to similar methods.
APA, Harvard, Vancouver, ISO, and other styles
5

Fu, Xin-Chu. "Dynamical behaviour of a class of discontinuous maps and related topics." Thesis, University of Exeter, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.366618.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Čukić, Sonja. "Topology of discrete structures : graph maps and Bier spheres /." Zürich : ETH, 2006. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=16744.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bolelli, Maria Virginia. "Diffusion Maps for Dimensionality Reduction." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/18246/.

Full text
Abstract:
In this thesis we present the diffusion maps, a framework based on diffusion processes for finding meaningful geometric descriptions of data sets. A diffusion process can be described via an iterative application of the heat kernel which has two main characteristics: it satisfies a Markov semigroup property and its level sets encode all geometric features of the space. This process, well known in regular manifolds, has been extended to general data set by Coifman and Lafon. They define a diffusion kernel starting from the geometric properties of the data and their density properties. This kernel will be a compact operator, and the projection on its eigenvectors at different instant of time, provides a family of embeddings of a dataset into a suitable Euclidean space. The projection on the first eigenvectors, naturally leads to a dimensionality reduction algorithm. Numerical implementation is provided on different data set.
APA, Harvard, Vancouver, ISO, and other styles
8

Sadikhov, Teymur. "Stability, dissipativity, and optimal control of discontinuous dynamical systems." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/53635.

Full text
Abstract:
Discontinuous dynamical systems and multiagent systems are encountered in numerous engineering applications. This dissertation develops stability and dissipativity of nonlinear dynamical systems with discontinuous right-hand sides, optimality of discontinuous feed-back controllers for Filippov dynamical systems, almost consensus protocols for multiagent systems with innaccurate sensor measurements, and adaptive estimation algorithms using multiagent network identifiers. In particular, we present stability results for discontinuous dynamical systems using nonsmooth Lyapunov theory. Then, we develop a constructive feedback control law for discontinuous dynamical systems based on the existence of a nonsmooth control Lyapunov function de fined in the sense of generalized Clarke gradients and set-valued Lie derivatives. Furthermore, we develop dissipativity notions and extended Kalman-Yakubovich-Popov conditions and apply these results to develop feedback interconnection stability results for discontinuous systems. In addition, we derive guaranteed gain, sector, and disk margins for nonlinear optimal and inverse optimal discontinuous feedback regulators that minimize a nonlinear-nonquadratic performance functional for Filippov dynamical systems. Then, we provide connections between dissipativity and optimality of nonlinear discontinuous controllers for Filippov dynamical systems. Furthermore, we address the consensus problem for a group of agent robots with uncertain interagent measurement data, and show that the agents reach an almost consensus state and converge to a set centered at the centroid of agents initial locations. Finally, we develop an adaptive estimation framework predicated on multiagent network identifiers with undirected and directed graph topologies that identifies the system state and plant parameters online.
APA, Harvard, Vancouver, ISO, and other styles
9

Juher, Barrot David. "Set of periods, topological entropy and combinatorial dynamics for tree and graph maps." Doctoral thesis, Universitat Autònoma de Barcelona, 2003. http://hdl.handle.net/10803/3078.

Full text
Abstract:
La tesi versa sobre sistemes dinàmics discrets 1-dimensionals, des d'un punt de vista combinatori i topològic. Estem interessats en les òrbites periòdiques i l'entropia topològica de les aplicacions contínues definides en arbres i grafs.
El problema central és la caracterització del conjunt de períodes de totes les òrbites periòdiques d'una aplicació contínua d'un arbre en ell mateix. El teorema de Sharkovskii (1964) fou el primer resultat remarcable en aquest sentit. Aquest bonic teorema estableix que el conjunt de períodes d'una aplicació de l'interval és un segment inicial d'un ordre lineal (ordre de Sharkovskii). Recíprocament, donat qualsevol segment inicial d'aquest ordre, existeix una aplicació de l'interval que el té com a conjunt de períodes.
Durant les darreres dècades hi ha hagut diversos intents de trobar resultats similars al de Sharkovskii per a altres espais 1-dimensionals. Recentment, el cas d'arbres ha estat tractat especialment. El Teorema de Baldwin (1991) resol el problema en el cas de les n-estrelles i ha estat un dels avenços més significatius en aquesta direcció. Aquest resultat estableix que el conjunt de períodes per a una aplicació de la n-estrella és unió finita de segments inicials de n ordres parcials (ordres de Baldwin), i recíprocament.
El nostre objectiu principal és descriure l'estructura del conjunt de períodes de qualsevol aplicació contínua d'un arbre T en termes de les propietats combinatòries i topològiques de T: quantitat i disposició d'extrems, vèrtexs i arestes. En el capítol 1 discutim detalladament la manera més natural d'atacar el problema, i proposem una estratègia consistent en tres etapes consecutives. L'eina principal d'aquesta estratègia són els models minimals de patrons. Aquestes nocions es van desenvolupar i utilitzar durant les darreres dècades en el context de l'interval. En canvi, no es disposava de definicions operatives equivalents per a arbres, fins que al 1997 Alseda, Guaschi, Los, Manyosas i Mumbru proposaren de definir el patró d'un conjunt finit invariant P essencialment com una classe d'homotopia d'aplicacions relativa a P, i provaren (constructivament) que sempre existeix un model P-canònic amb propietats de minimalitat dinàmica.
L'objectiu del capítol 2 és implementar completament el programa proposat, duent a terme les etapes 2 i 3. El resultat principal d'aquest capítol diu que, donada una aplicació g definida en un arbre T, existeix un conjunt S de successions finites d'enters positius tal que el conjunt de períodes de g és (excepte un conjunt finit explícitament acotat) una unió finita de segments inicials d'ordres de Baldwin donats en termes del conjunt S, que depèn de les propietats combinatòries de l'arbre T. També provem el recíproc.
En el capítol 3 duem a terme experiments informàtics sobre la minimalitat dinàmica dels models canònics. En un esperit de programació modular, hem dissenyat moltes funcions autocontingudes que poden ser usades per implementar una gran varietat d'aplicacions d'ús divers. Entre altres, tenim funcions que calculen el model canònic d'un patró donat per l'usuari, calculen la matriu de Markov associada a un model monòton a trossos i extreuen tots els llaços simples d'una matriu de transició de Markov.
Finalment, en el capítol 4 generalitzem alguns resultats de Block i Coven, Misiurewicz i Nitecki i Takahashi, en els quals l'entropia topològica d'una aplicació de l'interval s'aproxima per les entropies de les seves òrbites periòdiques. Hem provat relacions anàlogues en el context de les aplicacions de grafs.
This memoir deals with one-dimensional discrete dynamical systems, from both a topological and a combinatorial point of view. We are interested in the periodic orbits and topological entropy of continuous self-maps defined on trees and graphs.
The central problem is the characterisation of the set of periods of all periodic orbits exhibited by any continuous map from a tree into itself. The Sharkovskii's Theorem (1964) was the first remarkable result in this setting. This theorem states that the set of periods of any interval map is an initial segment of a linear ordering (the so-called Sharkovskii ordering). Conversely, given any initial segment of the Sharkovskii ordering, there exists an interval map whose set of periods coincides with it.
During the last decades there have been several attempts to find results similar to that of Sharkovskii for other one-dimensional spaces. Recently, the case of maps defined on general trees has been specially treated. Baldwin's Theorem (1991), which solves the problem in the case of n-stars for any n, has been one of the most significant advances in this direction. This result states that the set of periods of any n-star map is a finite union of initial segments of n-many partial orderings (the Baldwin orderings). The converse is also true.
Our main purpose is to describe the generic structure of the set of periods of any continuous self-map defined on a tree T in terms of the combinatorial and topological properties of T: amount and arrangement of endpoints, vertices and edges. In Chapter 1 we make a detailed discussion about which is the more natural approach to this problem, and we propose a strategy consisting on three consecutive stages and using minimal models of patterns as the main tool. These notions were developed in the context of interval maps and widely used in a number of papers during the last two decades. However, equivalent operative definitions for tree maps were not available until 1997, when Alseda, Guaschi, Los, Manosas and Mumbru proposed to define the pattern of a finite invariant set P essentially as a homotopy class of maps relative to the points of P, and proved (constructively) that there always exists a P-canonical model displaying dynamic minimality properties.
The goal of Chapter 2 is to implement in full the above programme by completing stages 2 and 3. The main result of Chapter 2 tells us that for each tree map g defined on a tree T there exists a finite set S of sequences of positive integers such that the set of periods of g is (up to an explicitly bounded finite set) a finite union of initial segments of Baldwin orderings, given in terms of the set S, which depends on the combinatorial properties of the tree T. We also prove the converse result.
In Chapter 3 we report some computer experiments on the minimality of the dynamics of canonical models. In a spirit of modular programming, we have designed lots of self-contained functions which can be used to implement a wide variety of several-purpose software. Among other, we have functions that: compute the canonical model of a pattern provided by the user, calculate the Markov transition matrix associated to a piecewise monotone tree map and extract all the simple loops of a given length from a Markov transition matrix.
Finally, in Chapter 4 we generalize some results of Block & Coven, Misiurewicz & Nitecki and Takahashi, where the topological entropy of an interval map was approximated by the entropies of its periodic orbits. We prove analogous relations in the setting of graph maps.
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Cheng. "Continuous and quad-graph integrable models with a boundary : reflection maps and 3D-boundary consistency." Thesis, City University London, 2013. http://openaccess.city.ac.uk/3016/.

Full text
Abstract:
This thesis is focusing on boundary problems for various classical integrable schemes. First, we consider the vector nonlinear Schrodinger (NLS) equation on the halfline. Using a Backlund transformation method which explores the folding symmetry of the system, classes of integrable boundary conditions (BCs) are derived. These BCs coincide with the linearizable BCs obtained using the unified transform method developed by Fokas. The notion of integrability is argued by constructing an explicit generating function for conserved quantities. Then, by adapting a mirror image technique, an inverse scattering method with an integrable boundary is constructed in order to obtain N-soliton solutions on the half-line, i.e. N-soliton reflections. An interesting phenomenon of transmission between different components of vector solitons before and after interacting with the boundary is demonstrated. Next, in light of the fact that the soliton-soliton interactions give rise to Yang-Baxter maps, we realize that the soliton-boundary interactions that are extracted from the N-soliton reflections can be translated into maps satisfying the set-theoretical counterpart of the quantum reflection equation. Solutions of the set-theoretical reflection equation are referred to as reflection maps. Both the Yang-Baxter maps and the reflection maps guarantee the factorization of the soliton-soliton and soliton-boundary interactions for vector NLS solitons on the half-line. Indeed, reflection maps represent a novel mathematical structure. Basic notions such as parametric reflection maps, their graphic representations and transfer maps are also introduced. As a natural extension, this object is studied in the context of quadrirational Yang-Baxter maps, and a classification of quadrirational reflection maps is obtained. Finally, boundaries are added to discrete integrable systems on quad-graphs. Triangle configurations are used to discretize quad-graphs with boundaries. Relations involving vertices of the triangles give rise to boundary equations that are used to described BCs. We introduce the notion of integrable BCs by giving a three-dimensional boundary consistency as a criterion for integrability. By exploring the correspondence between the quadrirational Yang-Baxter maps and the so-called ABS classification, we also show that quadrirational reflection maps can be used as a systematic tool to generate integrable boundary equations for the equations from the ABS classification.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Graph of discontinuous maps"

1

Institute, SAS, ed. SAS/GRAPH user's guide, release 6.03 edition. Cary, N.C: SAS Institute, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Institute, SAS, ed. SAS/GRAPH software, map data sets: Release 6.06. Cary, NC: SAS Institute, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yap, H. P. Total colourings of graphs. Berlin: Springer, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

I, Visentin Terry, ed. An atlas of the smaller maps in orientable and nonorientable surfaces. Boca Raton, FL: Chapman & Hall/CRC, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Schurz, Henri, Philip J. Feinsilver, Gregory Budzban, and Harry Randolph Hughes. Probability on algebraic and geometric structures: International research conference in honor of Philip Feinsilver, Salah-Eldin A. Mohammed, and Arunava Mukherjea, June 5-7, 2014, Southern Illinois University, Carbondale, Illinois. Edited by Mohammed Salah-Eldin 1946- and Mukherjea Arunava 1941-. Providence, Rhode Island: American Mathematical Society, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Harley, Eric Richard. Graph algorithms for assembling integrated genome maps. 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gardini, Laura, Viktor Avrutin, Michael Schanz, and Irina Sushko. Continuous and Discontinuous Piecewise-Smooth One-Dimensional Maps: Invariant Sets and Bifurcation Structures. World Scientific Publishing Co Pte Ltd, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Press, Midori No Me. Fantasy Maps: 150 Page 5x5 Grid Graph Paper. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Smoothing point data into maps using SAS/GRAPH software. [Ogden, UT]: U.S. Dept. of Agriculture, Forest Service, Intermountain Research Station, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Montes, J. Dungeons Maps: Graph Paper for Tabletop Games and Adventures. Independently Published, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Graph of discontinuous maps"

1

Bonnington, C. Paul, and Charles H. C. Little. "Maps." In The Foundations of Topological Graph Theory, 23–37. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-2540-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bies, Sandra, and Marc van Kreveld. "Time-Space Maps from Triangulations." In Graph Drawing, 511–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36763-2_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hayman, Jonathan, and Tobias Heindel. "On Pushouts of Partial Maps." In Graph Transformation, 177–91. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09108-2_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gansner, Emden R., Yifan Hu, and Stephen G. Kobourov. "GMap: Drawing Graphs as Maps." In Graph Drawing, 405–7. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11805-0_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Milea, Tal, Okke Schrijvers, Kevin Buchin, and Herman Haverkort. "Shortest-Paths Preserving Metro Maps." In Graph Drawing, 445–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25878-7_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gronemann, Martin, and Michael Jünger. "Drawing Clustered Graphs as Topographic Maps." In Graph Drawing, 426–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36763-2_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fink, Martin, Herman Haverkort, Martin Nöllenburg, Maxwell Roberts, Julian Schuhmann, and Alexander Wolff. "Drawing Metro Maps Using Bézier Curves." In Graph Drawing, 463–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36763-2_41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Fischer, Ingrid. "Modeling Discontinuous Constituents with Hypergraph Grammars." In Applications of Graph Transformations with Industrial Relevance, 163–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-25959-6_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gansner, Emden R., Yifan Hu, and Stephen North. "Visualizing Streaming Text Data with Dynamic Graphs and Maps." In Graph Drawing, 439–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36763-2_39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bekos, Michael A., Michael Kaufmann, Antonios Symvonis, and Alexander Wolff. "Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps." In Graph Drawing, 49–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31843-9_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graph of discontinuous maps"

1

Garzón, J., J. Galeano, C. López, and D. Duque. "Correction of discontinuous phase maps in structured light perfilometry." In Frontiers in Optics. Washington, D.C.: OSA, 2007. http://dx.doi.org/10.1364/fio.2007.jsua18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Papoutsakis, Andreas, Sergei Sazhin, Steven Begg, Ionut Danaila, and Francky Luddens. "A new approach to modelling the two way coupling for momentum transfer in a hollow-cone spray." In ILASS2017 - 28th European Conference on Liquid Atomization and Spray Systems. Valencia: Universitat Politècnica València, 2017. http://dx.doi.org/10.4995/ilass2017.2017.4671.

Full text
Abstract:
A new approach to modelling the interaction between droplets and the carrier phase is suggested. The new model isapplied to the analysis of a spray injected into a chamber of quiescent air, using an Eulerian-Lagrangian approach. The conservative formulation of the equations for mass, momentum and energy transport is used for the analysis of the carrier phase. The dispersed phase is modelled using the Lagrangian approach with droplets represented by individual parcels.The implementation of the Discontinuous Galerkin method (ForestDG), based on a topological representation of the computational mesh by a hierarchical structure consisting of oct- quad- and binary trees, is used in our analysis. Adaptive mesh refinement (h-refinement) enables us to increase the spatial resolution for the computational mesh in the vicinity of the points of interest such as interfaces, geometrical features, or flow discontinuities. The local increase in the expansion order (p-refinement) at areas of high strain rates or vorticity magnitude results in an increase of the order of the accuracy of discretisation of shear layers and vortices.The initial domain consists of a graph of unitarian-trees representing hexahedral, prismatic and tetrahedral elements. The ancestral elements of the mesh can be split into self-similar elements allowing each tree to grow branches to an arbitrary level of refinement. The connectivity of the elements, their genealogy and their partitioning are described by linked lists of pointers. These are attached to the tree data structure which facilitates the on-the-fly splitting, merging and repartitioning of the computational mesh by rearranging the links of each node of the tree. This enables us to refine the computational mesh in the vicinity of the droplet parcels aiming to accurately resolve the coupling betweenthe two phases.DOI: http://dx.doi.org/10.4995/ILASS2017.2017.4671
APA, Harvard, Vancouver, ISO, and other styles
3

Moll, S. "Some remarks providing discontinuous maps on some Cp(X) spaces." In Function Spaces VIII. Warsaw: Institute of Mathematics Polish Academy of Sciences, 2007. http://dx.doi.org/10.4064/bc79-0-10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zouaq, Amal, Dragan Gasevic, and Marek Hatala. "Ontologizing concept maps using graph theory." In the 2011 ACM Symposium. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1982185.1982537.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jackson, B. N., S. Aluru, and P. S. Schnable. "Consensus genetic maps: a graph theoretic approach." In 2005 IEEE Computational Systems Bioinformatics Conference (CSB'05). IEEE, 2005. http://dx.doi.org/10.1109/csb.2005.26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

YANG, HANBIAO, and LIU YANG. "A TOPOLOGICAL POSITION OF THE SET OF STRONGLY DISCONTINUOUS MAPS IN THE SET OF UPPER SEMI-CONTINUOUS MAPS." In Proceedings of the QL&SC 2012. WORLD SCIENTIFIC, 2012. http://dx.doi.org/10.1142/9789814401531_0082.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Derrow-Pinion, Austin, Jennifer She, David Wong, Oliver Lange, Todd Hester, Luis Perez, Marc Nunkesser, et al. "ETA Prediction with Graph Neural Networks in Google Maps." In CIKM '21: The 30th ACM International Conference on Information and Knowledge Management. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3459637.3481916.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Aldibaja, Mohammad, Ryo Yanase, Tae Hyon Kim, Akisue Kuramoto, Keisuke Yoneda, and Noaki Suganuma. "Accurate Elevation Maps based Graph-Slam Framework for Autonomous Driving*." In 2019 IEEE Intelligent Vehicles Symposium (IV). IEEE, 2019. http://dx.doi.org/10.1109/ivs.2019.8814007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Carter, Andrew, Andrew Rodriguez, Yiming Yang, and Scott Meyer. "Nanosecond Indexing of Graph Data With Hash Maps and VLists." In SIGMOD/PODS '19: International Conference on Management of Data. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3299869.3314044.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lin, Zhixing, Chundi Xiu, Wei Yang, and Dongkai Yang. "A Graph-Based Topological Maps Generation Method for Indoor Localization." In 2018 Ubiquitous Positioning, Indoor Navigation and Location-Based Services (UPINLBS). IEEE, 2018. http://dx.doi.org/10.1109/upinlbs.2018.8559830.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Graph of discontinuous maps"

1

Baader, Franz. Least common subsumers, most specific concepts, and role-value-maps in a description logic with existential restrictions and terminological cycles. Technische Universität Dresden, 2002. http://dx.doi.org/10.25368/2022.125.

Full text
Abstract:
In a previous report we have investigates subsumption in the presence of terminological cycles for the description logic EL, which allows conjunctions, existential restrictions, and the top concept, and have shown that the subsumption problem remains polynomial for all three types of semantics usually considered for cyclic definitions in description logics. This result depends on a characterization of subsumption through the existence of certain simulation relations on the graph associated with a terminology. In the present report we will use this characterization to show how the most specific concept and the least common subsumer can be computed in EL with cyclic definitions. In addition, we show that subsumption in EL (with or without cyclic definitions) remains polynomial even if one adds a certain restricted form of global role-value-maps to EL. In particular, this kind of role-value-maps can express transitivity of roles.
APA, Harvard, Vancouver, ISO, and other styles
2

Nieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 18. Hilbert Press, 2018. http://dx.doi.org/10.56441/hilbertpress.1818.9585.

Full text
Abstract:
CONN is a Matlab-based cross-platform software for the computation, display, and analysis of functional connectivity in fMRI (fcMRI). Connectivity measures include seed-to-voxel connectivity maps, ROI-to- ROI connectivity matrices, graph properties of connectivity networks, generalized psychophysiological interaction models (gPPI), intrinsic connectivity, local correlation and other voxel-to-voxel measures, independent component analyses (ICA), and dynamic component analyses (dyn-ICA). CONN is available for resting state data (rsfMRI) as well as task-related designs. It covers the entire pipeline from raw fMRI data to hypothesis testing, including spatial coregistration, ART-based scrubbing, aCompCor strategy for control of physiological and movement confounds, first-level connectivity estimation, and second-level random-effect analyses and hypothesis testing.
APA, Harvard, Vancouver, ISO, and other styles
3

Nieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 20. Hilbert Press, 2020. http://dx.doi.org/10.56441/hilbertpress.2048.3738.

Full text
Abstract:
CONN is a Matlab-based cross-platform software for the computation, display, and analysis of functional connectivity in fMRI (fcMRI). Connectivity measures include seed-to-voxel connectivity maps, ROI-to- ROI connectivity matrices, graph properties of connectivity networks, generalized psychophysiological interaction models (gPPI), intrinsic connectivity, local correlation and other voxel-to-voxel measures, independent component analyses (ICA), and dynamic component analyses (dyn-ICA). CONN is available for resting state data (rsfMRI) as well as task-related designs. It covers the entire pipeline from raw fMRI data to hypothesis testing, including spatial coregistration, ART-based scrubbing, aCompCor strategy for control of physiological and movement confounds, first-level connectivity estimation, and second-level random-effect analyses and hypothesis testing.
APA, Harvard, Vancouver, ISO, and other styles
4

Nieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 19. Hilbert Press, 2019. http://dx.doi.org/10.56441/hilbertpress.1927.9364.

Full text
Abstract:
CONN is a Matlab-based cross-platform software for the computation, display, and analysis of functional connectivity in fMRI (fcMRI). Connectivity measures include seed-to-voxel connectivity maps, ROI-to- ROI connectivity matrices, graph properties of connectivity networks, generalized psychophysiological interaction models (gPPI), intrinsic connectivity, local correlation and other voxel-to-voxel measures, independent component analyses (ICA), and dynamic component analyses (dyn-ICA). CONN is available for resting state data (rsfMRI) as well as task-related designs. It covers the entire pipeline from raw fMRI data to hypothesis testing, including spatial coregistration, ART-based scrubbing, aCompCor strategy for control of physiological and movement confounds, first-level connectivity estimation, and second-level random-effect analyses and hypothesis testing.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Graph of discontinuous maps' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography