Search results for "Graph theory"

showing 10 items of 784 documents

A Concept for Quantitative Comparison of Mathematical and Natural Language and its possible Effect on Learning

2017

Starting with the question whether there is a connection between the mathematical capabilities of a person and his or her mother tongue, we introduce a new modeling approach to quantitatively compare natural languages with mathematical language. The question arises from educational assessment studies that indicate such a relation. Texts written in natural languages can be deconstructed into a dependence graph, in simple cases a dependence tree. The same kind of deconstruction is also possible for mathematical texts. This gives an idea of how to quantitatively compare mathematical and natural language. To that end, we develop algorithms to define the distance between graphs. In this paper, w…

Structure (mathematical logic)Theoretical computer scienceDistance matrixRelation (database)Simple (abstract algebra)Computer scienceFirst languageLanguage of mathematicsTree (graph theory)Natural language
researchProduct

Reassessing the evidence for tree-growth and inferred temperature change during the Common Era in Yamalia, northwest Siberia

2013

AbstractThe development of research into the history of tree growth and inferred summer temperature changes in Yamalia spanning the last 2000 years is reviewed. One focus is the evolving production of tree-ring width (TRW) and tree-ring maximum-latewood density (MXD) larch (Larix sibirica) chronologies, incorporating different applications of Regional Curve Standardisation (RCS). Another focus is the comparison of independent data representing past tree growth in adjacent Yamalia areas: Yamal and Polar Urals, and the examination of the evidence for common growth behaviour at different timescales. The sample data we use are far more numerous and cover a longer time-span at Yamal compared to …

Summer temperatureArcheologyGlobal and Planetary ChangebiologyYamalDendroclimatologyClimate reconstructionGeologyDendroclimatologyMedieval Warm Periodbiology.organism_classificationTree (graph theory)Larix sibiricaClimatologyLarchPolar UralsIndependent dataMedieval warm periodGeologyEcology Evolution Behavior and SystematicsChronologySampling biasQuaternary Science Reviews
researchProduct

Disordered hyperuniformity in superconducting vortex lattices

2020

Particles occupying sites of a random lattice present density fluctuations at all length scales. It has been proposed that increasing interparticle interactions reduces long range density fluctuations, deviating from random behaviour. This leads to power laws in the structure factor and the number variance that can be used to characterize deviations from randomness which eventually lead to disordered hyperuniformity. It is not yet fully clear how to link density fluctuations with interactions in a disordered hyperuniform system. Interactions between superconducting vortices are very sensitive to vortex pinning, to the crystal structure of the superconductor and to the value of the magnetic …

Superconducting VorticesFOS: Physical sciencesCondensed Matter - Soft Condensed MatterCurrent Carrying Capability01 natural sciences010305 fluids & plasmasSuperconductivity (cond-mat.supr-con)Physics::Fluid DynamicsCondensed Matter::Superconductivity0103 physical sciences010306 general physicsCondensed Matter - Statistical MechanicsPinning StrengthSuperconductivityPhysicsStatistical Mechanics (cond-mat.stat-mech)Degree (graph theory)Condensed matter physicsDensity FluctuationCondensed Matter - SuperconductivityType II SuperconductorsFísicaCritical TemperaturesVortexStructure FactorsVortex ArrangementsSoft Condensed Matter (cond-mat.soft)Physical Review Research
researchProduct

Two View Line-Based Motion and Structure Estimation for Planar Scenes

2012

We present an algorithm for reconstruction of piece-wise planar scenes from only two views and based on minimum line correspondences. We first recover camera rotation by matching vanishing points based on the methods already exist in the literature and then recover the camera translation by searching among a family of hypothesized planes passing through one line. Unlike algorithms based on line segments, the presented algorithm does not require an overlap between two line segments or more that one line correspon- dence across more than two views to recover the translation and achieves the goal by exploiting photometric constraints of the surface around the line. Experimental results on real…

Surface (mathematics)Computer engineering. Computer hardwareMatching (graph theory)Line correspondenceComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION02 engineering and technologyVideo AnalysisTranslation (geometry)[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]TK7885-7895Motion[INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Line segment0202 electrical engineering electronic engineering information engineeringComputer visionVanishing pointComputingMilieux_MISCELLANEOUSMathematicsTwo viewsbusiness.industryTracking[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]020207 software engineeringKeywordsQA75.5-76.953D and StereoReal imageElectronic computers. Computer scienceLine (geometry)Piece-wise planar scene020201 artificial intelligence & image processingComputer Vision and Pattern RecognitionArtificial intelligencebusinessStructure and MotionRotation (mathematics)Software
researchProduct

Topological classification of 4-dimensional complete intersections

1996

Let X,,(d) C C P "+r denote a complete intersection, the transversal intersection of r hypersurfaces in C P ~+r defined by r homogeneous polynomials of degrees (d l , . . . ,dr) =: d, with dld2...d,. =: d the total degree. It is well-known that the diffeomorphism type of X,,(d) is determined by n and d. In [7] and [8], Libgober and Wood showed that in dimension n -~ 2, there exist k distinct multidegrees ibr any integer k 6 N such that the corresponding complete intersections are all diffeomorphic. For n = 1,3, the diffeomorphism classification of Xn(d) is well-known by surface theory and the classification of 1-connected six-manifolds [12] respectively. For 7z = 2, at least the topological…

Surface (mathematics)Discrete mathematicsExact sequenceIntersectionDegree (graph theory)General MathematicsTransversal (combinatorics)Complete intersectionAlgebraic geometryHomeomorphismMathematicsManuscripta Mathematica
researchProduct

Subdivisions of Ring Dupin Cyclides Using Bézier Curves with Mass Points

2021

Dupin cyclides are algebraic surfaces introduced for the first time in 1822 by the French mathematician Pierre-Charles Dupin. A Dupin cyclide can be defined as the envelope of a one-parameter family of oriented spheres, in two different ways. R. Martin is the first author who thought to use these surfaces in CAD/CAM and geometric modeling. The Minkowski-Lorentz space is a generalization of the space-time used in Einstein’s theory, equipped of the non-degenerate indefinite quadratic form $$Q_{M} ( \vec{u} ) = x^{2} + y^{2} + z^{2} - c^{2} t^{2}$$ where (x, y, z) are the spacial components of the vector $$ \vec{u}$$ and t is the time component of $$ \vec{u}$$ and c is the constant of the spee…

Surface (mathematics)Pure mathematicsDegree (graph theory)Euclidean spaceGeneral MathematicsDupin cyclide020207 software engineering010103 numerical & computational mathematics02 engineering and technologyQuadratic form (statistics)16. Peace & justice01 natural sciences[INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]Conic sectionNull vectorAlgebraic surface0202 electrical engineering electronic engineering information engineeringMathematics::Differential Geometry0101 mathematicsMathematics
researchProduct

On the arithmetic of a family of degree-two K3 surfaces

2018

Let $\mathbb{P}$ denote the weighted projective space with weights $(1,1,1,3)$ over the rationals, with coordinates $x,y,z,$ and $w$; let $\mathcal{X}$ be the generic element of the family of surfaces in $\mathbb{P}$ given by \begin{equation*} X\colon w^2=x^6+y^6+z^6+tx^2y^2z^2. \end{equation*} The surface $\mathcal{X}$ is a K3 surface over the function field $\mathbb{Q}(t)$. In this paper, we explicitly compute the geometric Picard lattice of $\mathcal{X}$, together with its Galois module structure, as well as derive more results on the arithmetic of $\mathcal{X}$ and other elements of the family $X$.

Surface (mathematics)Rational numberPure mathematicsDegree (graph theory)Mathematics - Number TheoryGeneral Mathematics010102 general mathematics11G35 14J2801 natural sciencesMathematics - Algebraic GeometryTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY0103 physical sciencesFOS: Mathematics010307 mathematical physicsNumber Theory (math.NT)0101 mathematicsArithmeticElement (category theory)Weighted projective spaceAlgebraic Geometry (math.AG)Mathematics
researchProduct

An Automatic Three-Dimensional Fuzzy Edge Detector

2009

Three-dimensional object analysis is of particular interest in many research fields. In this context, the most common data representation is boundary mesh, namely, 2D surface embedded in 3D space. We will investigate the problem of 3D edge extraction, that is, salient surface regions characterized by high flexure. Our automatic edge detection method assigns a value, proportional to the local bending of the surface, to the elements of the mesh. Moreover, a proper scanning window, centered on each element, is used to discriminate between smooth zones of the surface and its edges. The algorithm does not require input parameters and returns a set of elements that represent the salient features …

Surface (mathematics)Settore INF/01 - InformaticaMatching (graph theory)Winged edgeComputer sciencebusiness.industryBoundary (topology)Context (language use)Surface segmentationEdge detectionAutomatic three-dimensional edge detectionSalientCanny edge detectorComputer visionArtificial intelligencebusinessAlgorithmComputingMethodologies_COMPUTERGRAPHICS
researchProduct

Controlling the Interactions between Soft Colloids via Surface Adsorption

2013

By employing monomer-resolved computer simulations and analytical considerations based on polymer scaling theory, we analyze the conformations and interactions of multiarm star polymers strongly adsorbed on a smooth, two-dimensional plane. We find a stronger stretching of the arms as well as a stronger repulsive, effective interaction than in the three dimensional case. In particular, the star size scales with the number of arms $f$ as $\sim f^{1/4}$ and the effective interaction as $\sim f^{2}$, as opposed to $\sim f^{1/5}$ and $\sim f^{3/2}$, respectively, in three dimensions. Our results demonstrate the dramatic effect that geometric confinement can have on the effective interactions and…

Surface (mathematics)chemistry.chemical_classificationMaterials sciencePolymers and PlasticsPlane (geometry)Organic ChemistryFOS: Physical sciences02 engineering and technologyPolymerStar (graph theory)Condensed Matter - Soft Condensed Matter021001 nanoscience & nanotechnologyScaling theory01 natural sciencesInorganic ChemistryColloidAdsorptionchemistryStar polymerChemical physics0103 physical sciencesMaterials ChemistrySoft Condensed Matter (cond-mat.soft)010306 general physics0210 nano-technology
researchProduct

A surface hopping algorithm for nonadiabatic minimum energy path calculations

2015

The article introduces a robust algorithm for the computation of minimum energy paths transiting along regions of near-to or degeneracy of adiabatic states. The method facilitates studies of excited state reactivity involving weakly avoided crossings and conical intersections. Based on the analysis of the change in the multiconfigurational wave function the algorithm takes the decision whether the optimization should continue following the same electronic state or switch to a different state. This algorithm helps to overcome convergence difficulties near degeneracies. The implementation in the MOLCAS quantum chemistry package is discussed. To demonstrate the utility of the proposed procedur…

Surface PropertiesComputationSurface hoppingCASSCFretinalHeterocyclic Compounds 1-RingHeterocyclic CompoundsasulamConvergence (routing)dioxetaneAdiabatic processWave functionSchiff BasesChemistrysurface hopping algorithmGeneral ChemistryKineticsComputational MathematicsExcited statePath (graph theory)RetinaldehydeQuantum TheoryThermodynamicsCarbamatesCASSCF; asulam; dioxetane; minimum energy path; retinal; surface hopping algorithm; thymineProtonsDegeneracy (mathematics)Algorithmminimum energy pathAlgorithmsThymineJournal of Computational Chemistry
researchProduct