Search results for "Transitive relation"

showing 10 items of 74 documents

Pairwise Learning to Rank by Neural Networks Revisited: Reconstruction, Theoretical Analysis and Practical Performance

2020

We present a pairwise learning to rank approach based on a neural net, called DirectRanker, that generalizes the RankNet architecture. We show mathematically that our model is reflexive, antisymmetric, and transitive allowing for simplified training and improved performance. Experimental results on the LETOR MSLR-WEB10K, MQ2007 and MQ2008 datasets show that our model outperforms numerous state-of-the-art methods, while being inherently simpler in structure and using a pairwise approach only.

Transitive relationPairwise learningTheoretical computer scienceArtificial neural networkAntisymmetric relationComputer scienceRank (computer programming)Structure (category theory)Pairwise comparisonLearning to rank
researchProduct

Tame dynamics and robust transitivity chain-recurrence classes versus homoclinic classes

2014

Transitive relationPure mathematicsChain (algebraic topology)Applied MathematicsGeneral MathematicsDynamics (mechanics)Homoclinic orbitAlgorithmMathematicsTransactions of the American Mathematical Society
researchProduct

Non-wandering sets with non-empty interiors

2003

We study diffeomorphisms of a closed connected manifold whose non-wandering set has a non-empty interior and conjecture that C1-generic diffeomorphisms whose non-wandering set has a non-empty interior are transitive. We prove this conjecture in three cases: hyperbolic diffeomorphisms, partially hyperbolic diffeomorphisms with two hyperbolic bundles, and tame diffeomorphisms (in the first case, the conjecture is folklore; in the second one, it follows by adapting the proof in Brin (1975 Topological transitivity of a certain class of dynamical systems, and flows of frames on manifolds of negative curvature Funct. Anal. Appl. 9 9–19)).We study this conjecture without global assumptions and pro…

Transitive relationPure mathematicsClass (set theory)Mathematics::Dynamical SystemsConjectureDynamical systems theoryApplied MathematicsMathematical analysisGeneral Physics and AstronomyHyperbolic manifoldStatistical and Nonlinear PhysicsManifoldSet (abstract data type)Homoclinic orbitMathematics::Symplectic GeometryMathematical PhysicsMathematicsNonlinearity
researchProduct

Robust existence of nonhyperbolic ergodic measures with positive entropy and full support

2021

We prove that for some manifolds $M$ the set of robustly transitive partially hyperbolic diffeomorphisms of $M$ with one-dimensional nonhyperbolic centre direction contains a $C^1$-open and dense subset of diffeomorphisms with nonhyperbolic measures which are ergodic, fully supported and have positive entropy. To do so, we formulate abstract conditions sufficient for the construction of an ergodic, fully supported measure $\mu$ which has positive entropy and is such that for a continuous function $\phi\colon X\to\mathbb{R}$ the integral $\int\phi\,d\mu$ vanishes. The criterion is an extended version of the control at any scale with a long and sparse tail technique coming from the previous w…

Transitive relationPure mathematicsHyperbolicityMathematics::Dynamical SystemsDense setContinuous function (set theory)[MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS][MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS]Scale (descriptive set theory)Dynamical Systems (math.DS)Measure (mathematics)Theoretical Computer SciencePositive entropyMathematics (miscellaneous)FOS: MathematicsErgodic theory37D25 37D35 37D30 28D99Mathematics - Dynamical SystemsMathematicsCriterion
researchProduct

Partially hyperbolic diffeomorphisms on Heisenberg nilmanifolds and holonomy maps

2014

Abstract In this note we show that all partially hyperbolic automorphisms on a 3-dimensional non-Abelian nilmanifold can be C 1 -approximated by structurally stable C ∞ -diffeomorphisms, whose chain recurrent set consists of one attractor and one repeller. In particular, all these partially hyperbolic automorphisms are not robustly transitive. As a corollary, the holonomy maps of the stable and unstable foliations of the approximating diffeomorphisms are twisted quasiperiodically forced circle homeomorphisms, which are transitive but non-minimal and satisfy certain fiberwise regularity properties.

Transitive relationPure mathematicsMathematics::Dynamical SystemsMathematical analysisHolonomyGeneral MedicineAutomorphismSet (abstract data type)CorollaryChain (algebraic topology)AttractorMathematics::Differential GeometryNilmanifoldMathematics::Symplectic GeometryMathematicsComptes Rendus Mathematique
researchProduct

Projective unification in transitive modal logics

2018

We show that a transitive normal modal logic L enjoys projective unification (i.e. each unifiable formula is projective) if and only if L contains K4D1 ( D1 : ( x → y ) ∨ ( y → x ) ). It means, in particular, that K4D1 (and any of its extensions) is almost structurally complete, i.e. the logic is complete with respect to all non-passive admissible rules. We also characterize non-unifiable formulas and provide an explicit form of the basis for all passive rules over K4G + ( x → x )

Transitive relationPure mathematicsUnificationunificationLogic010102 general mathematics02 engineering and technology01 natural sciencescanonical modelModal0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingprajective unifier0101 mathematicsProjective testMathematicsmodal logicLogic Journal of the IGPL
researchProduct

A generalized transitive closure for relational queries

1988

We augment relational algebra with a generalized transitive closure operator that allows for the efficient evaluation of a subclass of recursive queries. The operator is based on a composition operator which is as general as possible when the operator is required to be associative and when only relational algebra operators are used in its definition. The closure of such a composition can be computed using the well-known efficient algorithms designed for the computation of the usual transitive closure. Besides the case in which complete materialization of recursive relations are required, our strategy also yields an efficient solution in the case in which a selection is applied to the closur…

Transitive relationSelection (relational algebra)Closure (topology)Transitive closure020207 software engineering02 engineering and technologyTransitive setRelational algebraTransitive reductionAlgebraTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESOperator (computer programming)TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS020204 information systems0202 electrical engineering electronic engineering information engineeringMathematicsProceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '88
researchProduct

Automatic Extraction of Semantic Roles in Support Verb Constructions

2021

This paper deals with paraphrastic relations in Italian. In the following sentences: (a) Max strappò delle lacrime a Sara 'Max moved Sara to tears' and (b) Max fece piangere Sara 'Max made Sara cry', the verbs differ syntactically and semantically. Strappare 'tear/rip/wring' is transitive, fare ‘have/make’ is a causative, and piangere 'cry' is intransitive. Despite this, a translation of (a) as (b) is legitimate and therefore (a) is a paraphrase of (b). In theoretical linguistics this raises an issue concerning the relationship between strappare and fare/piangere in Italian, and that in English between move and make. In computational linguistics, can such paraphrases be obtained automatical…

Transitive relationSemantic role labelingParaphrase Entailments Meaning Extraction Automatic Detection of Semantic RolesTheoretical linguisticsVerbCausativeComputational linguisticsPsychologyParaphraseLinguisticsSettore L-LIN/01 - Glottologia E LinguisticaInternational Journal on Natural Language Computing
researchProduct

Probabilistic semantics for categorical syllogisms of Figure II

2018

A coherence-based probability semantics for categorical syllogisms of Figure I, which have transitive structures, has been proposed recently (Gilio, Pfeifer, & Sanfilippo [15]). We extend this work by studying Figure II under coherence. Camestres is an example of a Figure II syllogism: from Every P is M and No S is M infer No S is P. We interpret these sentences by suitable conditional probability assessments. Since the probabilistic inference of \(\bar{P}|S\) from the premise set \(\{M|P,\bar{M}|S\}\) is not informative, we add \(p(S|(S \vee P))>0\) as a probabilistic constraint (i.e., an “existential import assumption”) to obtain probabilistic informativeness. We show how to propagate the…

Transitive relationSequenceSettore MAT/06 - Probabilita' E Statistica MatematicaProbabilistic logicSyllogismConditional probability02 engineering and technologyCoherence (philosophical gambling strategy)Imprecise probabilityCombinatoricscoherence conditional events defaults generalized quantifiers imprecise probability.020204 information systems0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingCategorical variableMathematics
researchProduct

Action Observation Network Activity Related to Object-Directed and Socially-Directed Actions in Adolescents

2020

The human action observation network (AON) encompasses brain areas consistently engaged when we observe other's actions. Although the core nodes of the AON are present from childhood, it is not known to what extent they are sensitive to different action features during development. Because social cognitive abilities continue to mature during adolescence, the AON response to socially-oriented actions, but not to object-related actions, may differ in adolescents and adults. To test this hypothesis, we scanned with functional magnetic resonance imaging (fMRI) male and female typically-developing teenagers (n= 28; 13 females) and adults (n= 25; 14 females) while they passively watched videos of…

Transitive relationmedicine.diagnostic_testBrain activity and meditationSocial perceptionmedia_common.quotation_subject[SCCO.NEUR]Cognitive science/NeuroscienceGeneral Neuroscience05 social sciencesObject (grammar)050105 experimental psychology03 medical and health sciences0302 clinical medicineAction (philosophy)Perception[SCCO.PSYC]Cognitive science/Psychologymedicine0501 psychology and cognitive sciencesPsychologyFunctional magnetic resonance imaging030217 neurology & neurosurgerySocial cognitive theoryResearch Articlesmedia_commonCognitive psychologyThe Journal of Neuroscience
researchProduct