Search results for " set"

showing 10 items of 2095 documents

Roots in the mapping class groups

2006

The purpose of this paper is the study of the roots in the mapping class groups. Let $\Sigma$ be a compact oriented surface, possibly with boundary, let $\PP$ be a finite set of punctures in the interior of $\Sigma$, and let $\MM (\Sigma, \PP)$ denote the mapping class group of $(\Sigma, \PP)$. We prove that, if $\Sigma$ is of genus 0, then each $f \in \MM (\Sigma)$ has at most one $m$-root for all $m \ge 1$. We prove that, if $\Sigma$ is of genus 1 and has non-empty boundary, then each $f \in \MM (\Sigma)$ has at most one $m$-root up to conjugation for all $m \ge 1$. We prove that, however, if $\Sigma$ is of genus $\ge 2$, then there exist $f,g \in \MM (\Sigma, \PP)$ such that $f^2=g^2$, $…

Class (set theory)Pure subgroupGeneral MathematicsBoundary (topology)SigmaGeometric Topology (math.GT)Group Theory (math.GR)Surface (topology)Mapping class groupCombinatoricsMathematics - Geometric Topology57M99Genus (mathematics)FOS: MathematicsMathematics - Group TheoryFinite setMathematicsProceedings of the London Mathematical Society
researchProduct

A new paradigm for pattern classification: Nearest Border Techniques

2013

Published version of a chapter in the book: AI 2013: Advances in Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-319-03680-9_44 There are many paradigms for pattern classification. As opposed to these, this paper introduces a paradigm that has not been reported in the literature earlier, which we shall refer to as the Nearest Border (NB) paradigm. The philosophy for developing such a NB strategy is as follows: Given the training data set for each class, we shall first attempt to create borders for each individual class. After that, we advocate that testing is accomplished by assigning the test sample to the class whose border it lies closest to…

Class (set theory)Training setPattern ClassificationComputer sciencebusiness.industrySVMVDP::Mathematics and natural science: 400::Information and communication science: 420::Algorithms and computability theory: 422Centroid02 engineering and technology01 natural sciencesVDP::Mathematics and natural science: 400::Mathematics: 410::Analysis: 411Support vector machine010104 statistics & probabilityExperimental testingOutlier0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingArtificial intelligence0101 mathematics10. No inequalitySet (psychology)businessTest sampleBorder Identification
researchProduct

Analytic high-order Douglas–Kroll–Hess electric field gradients

2007

In this work we present a comprehensive study of analytical electric field gradients in hydrogen halides calculated within the high-order Douglas-Kroll-Hess (DKH) scalar-relativistic approach taking picture-change effects analytically into account. We demonstrate the technical feasibility and reliability of a high-order DKH unitary transformation for the property integrals. The convergence behavior of the DKH property expansion is discussed close to the basis set limit and conditions ensuring picture-change-corrected results are determined. Numerical results are presented, which show that the DKH property expansion converges rapidly toward the reference values provided by four-component met…

Classical mechanicsChemistryOperator (physics)Convergence (routing)General Physics and AstronomyApplied mathematicsUnitary matrixLimit (mathematics)Perturbation theory (quantum mechanics)Physical and Theoretical ChemistryUnitary transformationParametrizationBasis set
researchProduct

Rough Search of Vague Knowledge

2017

This chapter presents the theoretical basis of the vague knowledge search algorithmization of a rough method. It introduces some data granulation method which aggregates this data as rough sets of data or ways to search this data in the semantic networks. As a result of this method is the possibility of the rough sets description, analogically to sets in the classical theory of sets. We try to answer the question how the agent searching some knowledge can conceive the search of vague knowledge in the semantic networks: (1) if it can, accordingly to the semantic and the conceiving rules, describe the relationships between nodes in this semantic network which are identified as ways of searchi…

Classical theoryInformation retrievalKnowledge SearchBasis (linear algebra)Computer scienceRough setSemantic network
researchProduct

On the chromatic number of disk graphs

1998

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their different generalizations. For all these graphs including the most general class of the double disk (DD) graphs, it is shown that X(G) ≤ c.ω(G) for a constant c. Several coloring algorithms are analyzed for disk graphs, aiming to improve the bounds on X(G). We find that their worst-case performance expressed in the number of used colors is indeed reached in some instances.

Clique-sumComputer Networks and CommunicationsTrapezoid graph1-planar graphMetric dimensionCombinatoricsIndifference graphPathwidthHardware and ArchitectureChordal graphMaximal independent setSoftwareMathematicsofComputing_DISCRETEMATHEMATICSInformation SystemsMathematicsNetworks
researchProduct

Semmes surfaces and intrinsic Lipschitz graphs in the Heisenberg group

2018

A Semmes surface in the Heisenberg group is a closed set $S$ that is upper Ahlfors-regular with codimension one and satisfies the following condition, referred to as Condition B. Every ball $B(x,r)$ with $x \in S$ and $0 < r < \operatorname{diam} S$ contains two balls with radii comparable to $r$ which are contained in different connected components of the complement of $S$. Analogous sets in Euclidean spaces were introduced by Semmes in the late $80$'s. We prove that Semmes surfaces in the Heisenberg group are lower Ahlfors-regular with codimension one and have big pieces of intrinsic Lipschitz graphs. In particular, our result applies to the boundary of chord-arc domains and of redu…

Closed setApplied MathematicsGeneral Mathematics010102 general mathematicsBoundary (topology)Metric Geometry (math.MG)CodimensionLipschitz continuitySurface (topology)01 natural sciencesCombinatorics28A75 (Primary) 28A78 (Secondary)Mathematics - Metric GeometryMathematics - Classical Analysis and ODEsClassical Analysis and ODEs (math.CA)FOS: MathematicsHeisenberg groupMathematics::Metric Geometrymittateoria[MATH]Mathematics [math]0101 mathematicsIsoperimetric inequalityComputingMilieux_MISCELLANEOUSMathematicsComplement (set theory)Transactions of the American Mathematical Society
researchProduct

Differential properties of the Moreau envelope

2014

International audience; In a vector space endowed with a uniformly Gâteaux differentiable norm, it is proved that the Moreau envelope enjoys many remarkable differential properties and that its subdifferential can be completely described through a certain approximate proximal mapping. This description shows in particular that the Moreau envelope is essentially directionally smooth. New differential properties are derived for the distance function associated with a closed set. Moreover, the analysis, when applied to the investigation of the convexity of Tchebyshev sets, allows us to recover several known results in the literature and to provide some new ones.

Closed setNorm (mathematics)Mathematical analysisDifferentiable functionSubderivative[MATH]Mathematics [math]16. Peace & justiceAnalysisConvexityVector spaceMathematics
researchProduct

Singular solutions to p-Laplacian type equations

1999

We construct singular solutions to equations $div\mathcal{A}(x,\nabla u) = 0,$ similar to the p-Laplacian, that tend to ∞ on a given closed set of p-capacity zero. Moreover, we show that every Gδ-set of vanishing p-capacity is the infinity set of some A-superharmonic function.

Closed setSingular functionSingular solutionGeneral MathematicsMathematical analysisMathematics::Analysis of PDEsZero (complex analysis)p-LaplacianNabla symbolFunction (mathematics)Type (model theory)MathematicsArkiv för Matematik
researchProduct

Rural settlement in the territorium of Ilici: the Roman farm of The Cabezo-Clot de Galvany (Elx, Alicante)

2015

Situado en el territorium de Ilici, en el paraje de El Clot de Galvany (Elx), junto a un humedal de tierras pobres, presentamos una granja romana (ss. I-III d.C.). Su posición periférica respecto al área centuriada ilicitana, los restos materiales aparecidos (molinos, ausencia de estructuras de transformación, aislamiento relativo) y la gran simplicidad estructural y funcional del conjunto remarcan el carácter autosuficiente de este núcleo. El área arqueológica tras la época romana queda deshabitada y sólo volvió a frecuentarse a partir del s. XVII, coincidiendo con el crecimiento demográfico de época moderna, como muestra la construcción de una ermita. Todo ello nos lleva a plantear cuesti…

Clot de GalvanyArcheologyGranja romanaUNESCO::HISTORIAIliciHumanidadesAugustusArchaeologyHistoriaPeasantRoman farmGeographyAugustoHuman settlementNatural parkPoblamiento ruralRural settlementChapel:HISTORIA [UNESCO]Historia AntiguacomputerVillacomputer.programming_languageSAGVNTVM. Papeles del Laboratorio de Arqueología de Valencia
researchProduct

SMART: Unique splitting-while-merging framework for gene clustering

2014

© 2014 Fa et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Successful clustering algorithms are highly dependent on parameter settings. The clustering performance degrades significantly unless parameters are properly set, and yet, it is difficult to set these parameters a priori. To address this issue, in this paper, we propose a unique splitting-while-merging clustering framework, named "splitting merging awareness tactics" (SMART), which does not require any a priori knowledge of either the number …

Clustering algorithmsMicroarrayslcsh:MedicineGene ExpressionBioinformaticscomputer.software_genreCell SignalingData MiningCluster Analysislcsh:ScienceFinite mixture modelOligonucleotide Array Sequence AnalysisPhysicsMultidisciplinarySMART frameworkConstrained clusteringCompetitive learning modelBioassays and Physiological AnalysisMultigene FamilyCanopy clustering algorithmEngineering and TechnologyData miningInformation TechnologyGenomic Signal ProcessingAlgorithmsResearch ArticleSignal TransductionComputer and Information SciencesFuzzy clusteringCorrelation clusteringResearch and Analysis MethodsClusteringMolecular GeneticsCURE data clustering algorithmGeneticsGene RegulationCluster analysista113Gene Expression Profilinglcsh:RBiology and Life SciencesComputational BiologyCell BiologyDetermining the number of clusters in a data setComputingMethodologies_PATTERNRECOGNITIONSplitting-merging awareness tactics (SMART)Signal ProcessingAffinity propagationlcsh:QGene expressionClustering frameworkcomputer
researchProduct