• No results found

Binary Relation

On Granularity in Information Systems Based on      Binary Relation

On Granularity in Information Systems Based on Binary Relation

... In this paper, some important issues of granularity are discussed mainly in information systems (ISs) based on binary relation. Firstly, the vector representation method of knowledge granules is proposed in ...

12

Fixed point result and applications on a b-metric space endowed with an arbitrary binary relation

Fixed point result and applications on a b-metric space endowed with an arbitrary binary relation

... concept of α-admissible for a set-valued mapping which is different from the notion of α ∗ -admissible which was provided in []. Subsequently, there are a number of results via the concept of α-admissible mapping in ...

13

Name Entity Recognition and Binary Relation Detection for News Query

Name Entity Recognition and Binary Relation Detection for News Query

... Abstract. This paper proposes an innovative slant on name entity recognition (NER) and binary relation detection (BRD) for current news search and retrieval. The main contribution is to apply MITIE tools to ...

9

Decision Analysis via Granulation Based on General Binary Relation

Decision Analysis via Granulation Based on General Binary Relation

... 2.2.1. Granulation by general relation in multivalued information system. For a general- ized approximation space, Abd El-Monsef [6] defined a multivalued information system. This system is an ordinary information ...

13

Inferring Binary Relation Schemas for Open Information Extraction

Inferring Binary Relation Schemas for Open Information Extraction

... of binary relations with high preci- sion from the web ...extracted relation instance is a triple of the form harg 1 , rel, arg 2 i, where the relation rel is a lexical or syntactic pat- tern, and ...

6

Idempotent Elements Of The Semigroups Bx(D) Defined By Semilattices Of The Class , When

Idempotent Elements Of The Semigroups Bx(D) Defined By Semilattices Of The Class , When

... Let X be an arbitrary nonempty set, D be a X − semilattice of unions, i.e. a nonempty set of subsets of the set X that is closed with respect to the set-theoretic operations of unification of elements from D , f be an ...

10

Deterministic natural language generation from meaning representations for machine translation

Deterministic natural language generation from meaning representations for machine translation

... A binary relation projecting a label beginning CND (conditional) or CRD (coordinating relation) creates an adverbial clause from the first conjunct, with the relation name forming a ...

9

A Comparative Study of TransE and TransH Algorithms
in Spatial Address Representation Learning

A Comparative Study of TransE and TransH Algorithms in Spatial Address Representation Learning

... simple binary relation model to represent the semantic relationships between things, namely us- ing a triple set way of describing things and relationships, gradu- ally of three yuan for the basic unit of ...

11

An element set labelling a Cartesian product by measurable binary relations which leads to postulates of the theory of experience and chance as a theory of co~events

An element set labelling a Cartesian product by measurable binary relations which leads to postulates of the theory of experience and chance as a theory of co~events

... as binary relations because its domains and codomains cannot be sets in usual systems of axiomatic set ...a binary relation «∈», then then for this you will have to de fi ne the domain and the ...

17

Continuity, completeness, betweenness and cone monotonicity

Continuity, completeness, betweenness and cone monotonicity

... reEexive binary relation on the set of lotteries satisfying independence that also satisHes any two of the following three axioms satisHes the third: completeness, Archimedean and mixture ...

15

zlog a prolog toolkit for prototyping z specifications unpublished

zlog a prolog toolkit for prototyping z specifications unpublished

... is binary relation from X to Y such that for every x  X there is a unique y  Y with t(x,y)  ...all relation and set management predicates in ZLOG also work with ...

19

Fixed point results for (αψ,βφ)-contractive mappings for a generalized altering distance

Fixed point results for (αψ,βφ)-contractive mappings for a generalized altering distance

... In [], Samet and Turinci established fixed point results for contractive mappings on met- ric spaces, endowed with an amorphous arbitrary binary relation.. Very recently, this work has [r] ...

18

The existence of optimal approximate solution theorems for generalized α-proximal contraction non-self mappings and applications

The existence of optimal approximate solution theorems for generalized α-proximal contraction non-self mappings and applications

... Inspired by [], we introduce the class of non-self mappings, generalized α-proximal contraction mappings. Also, we establish the existence theorems for a best proximity point for mappings in this class under the ...

21

On new fixed point results for -contractive multi-valued mappings onα-complete metric spaces and their consequences

On new fixed point results for -contractive multi-valued mappings onα-complete metric spaces and their consequences

... In this paper, we establish new fixed point results for (α, ψ, ξ)-contractive multi-valued mappings on α -complete metric spaces by using the idea of α-admissible multi-valued mapping due to Mohammadi et al. []. These ...

15

The donkey strikes back: Extending the dynamic interpretation “constructively”

The donkey strikes back: Extending the dynamic interpretation “constructively”

... The dynamic interpretation of a formula as a binary relation inducing transitions on states is extended by alternative treat- ments of implication, universal quantifi- cation, negation a[r] ...

9

Generalized KKM theorem, minimax inequalities and their applications

Generalized KKM theorem, minimax inequalities and their applications

... As applications of these results to economics and optimization theory, we generalize a class of existence theorems on the maximal elements of a binary relation, price equilibrium, and th[r] ...

16

Simple Algorithms for Complex Relation Extraction with Applications to Biomedical IE

Simple Algorithms for Complex Relation Extraction with Applications to Biomedical IE

... complex relation extrac- tion, the core of which was to factorize complex re- lations into sets of binary relations, learn to identify binary relations and then reconstruct the complex re- lations by ...

8

Functions and Relations.pptx

Functions and Relations.pptx

... A binary relation involves 2 sets and can be described by a set of pairs A ternary relation involves 3 sets and can be described by a set of triples ….. An n-ary relation involves n sets[r] ...

40

3. Relation-theoretic contraction principle in  metric-like spaces

3. Relation-theoretic contraction principle in metric-like spaces

... Abstract. In this paper, we extend the Banach contraction principle to metric-like as well as partial metric spaces (not essentially complete) equipped with an arbitrary binary relation. Thereafter, we ...

11

Characterization of the Generalized Top Choice Assumption (Smith) set

Characterization of the Generalized Top Choice Assumption (Smith) set

... Theorem 5. Let X be a nonempty set of alternatives and let R be a binary relation over X . Then, the GET CHA(R) set is equivalent to the union of maximal elements of all minimal negative consistent ...

9

Show all 10000 documents...

Related subjects