On the Compatibility of a Ternary Relation with a Binary Fuzzy Relation

2019 ◽  
Vol 27 (04) ◽  
pp. 595-612 ◽  
Author(s):  
Omar Barkat ◽  
Lemnaouar Zedam ◽  
Bernard De Baets
Keyword(s):  
Order Relation ◽  
Fuzzy Relation ◽  
Ternary Relation ◽  
The Given

Recently, De Baets et al. have characterized the fuzzy tolerance relations that a given strict order relation is compatible with. In general, the compatibility of a strict order relation with a binary fuzzy relation guarantees also the compatibility of its associated betweenness relation with that binary fuzzy relation. In this paper, we study the compatibility of an arbitrary ternary relation with a binary fuzzy relation. We prove that this compatibility can be expressed in terms of inclusions of the binary fuzzy relation in the traces of the given ternary relation.

scholarly journals A study on orderings based on fuzzy quasi- order relations

2021 ◽  
Author(s):  
Zhonglin Chai
Keyword(s):  
Partial Order ◽  
Order Relation ◽  
Fuzzy Relation ◽  
Partial Order Relation ◽  
Fuzzy Relations ◽  
Fuzzy Graph ◽  
Feasible Method ◽  
Order Relations ◽  
Finite Set ◽  
Quasi Order

Abstract This paper further studies orderings based on fuzzy quasi-order relations using fuzzy graph. Firstly, a fuzzy relation on a finite set is represented equivalently by a fuzzy graph. Using the graph, some new results on fuzzy relations are derived. In ranking those alternatives, we usually obtain a quasi-order relation, which often has inconsistencies, so it cannot be used for orderings directly. We need to remake it into a reasonable partial order relation for orderings. This paper studies these inconsistencies, and divides them into two types: framework inconsistencies and degree inconsistencies. For the former, a reasonable and feasible method is presented to eliminate them. To eliminate the latter, the concept of complete partial order relation is presented, which is more suitable than partial order relation to rank the alternatives. A method to obtain a reasonable complete partial order relation for a quasi-order relation is given also. An example is given as well to illustrate these discussions. Lastly, the paper discusses the connection between quasi-order relations and preference relations for orderings and some other related problems.

scholarly journals Resolution of Max-Product Fuzzy Relation Equation with Interval-Valued Parameter

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-16
Author(s):  
Xiaobin Yang ◽  
Haitao Lin ◽  
Gang Xiao ◽  
Huanbin Xue ◽  
Xiaopeng Yang
Keyword(s):  
Complete Solution ◽  
Order Relation ◽  
Fuzzy Relation ◽  
Solution Set ◽  
Network System ◽  
Resolution Method ◽  
Index Set ◽  
Fuzzy Relation Equation ◽  
Fuzzy Relation Equations ◽  
Interval Valued

Considering the application background on P2P network system, we investigate the max-product fuzzy relation equation with interval-valued parameter in this paper. Order relation on the set of all interval-valued numbers plays key role in the construction and resolution of the interval-valued-parameter fuzzy relation equation (IPFRE). The basic operations supremum (a∨b) and infimum (a∧b) in the IPFRE should be defined depending on the order relation. A novel total order is introduced for establishing the IPFRE. We also discuss some properties of the IPFRE system, including the consistency and structure of the complete solution set. Concepts of close index set and open index set are defined, helping us to construct the resolution method of the IPFRE system. We further provide a detailed algorithm for obtaining the complete solution set. Besides, the solution set is compared to that of the classical max-T fuzzy relation equations system.

DECOMPOSITION OF MULTIUNIVERSE FUZZY TRUTH FUNCTIONS

2001 ◽  
Vol 09 (05) ◽  
pp. 623-643
Author(s):  
DERYA ALTUNAY ◽  
TURHAN ÇİFTÇİBAŞI
Keyword(s):  
Propositional Logic ◽  
Sufficient Conditions ◽  
Fuzzy Relation ◽  
Necessary And Sufficient Conditions ◽  
Fuzzy Relations ◽  
Decomposition Problem ◽  
The Common ◽  
Necessary And Sufficient ◽  
The Given

This paper focuses on the decomposition problem of fuzzy relations using the concepts of multiuniverse fuzzy propositional logic. Given two fuzzy propositions in different universes, it is always possible to construct a fuzzy relation in the common universe through a prescribed combination. However, the converse is not so obvious, if possible at all. In other words, given a fuzzy relation, how would we know if it really represents a certain relationship between some fuzzy propositions? It is important to recognize whether the given fuzzy relation is a meaningful representation of information according to certain criteria applicable to some fuzzy propositions that constitute the fuzzy relation itself. Two basic structures of decomposition are investigated. Necessary and sufficient conditions for decomposition of multiuniverse fuzzy truth functions in terms of one-universe truth functions are presented. An algorithm for decomposition is proposed.

scholarly journals Analysis of Economic Relationship Using the Concept of Complex Pythagorean Fuzzy Information

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Naeem Jan ◽  
Saif Ur Rehman ◽  
Abdul Nasir ◽  
Hassen Aydi ◽  
Sami Ullah Khan
Keyword(s):  
Set Theory ◽  
Order Relation ◽  
Equivalence Classes ◽  
Fuzzy Relation ◽  
The Novel ◽  
Fuzzy Logics ◽  
Fuzzy Information ◽  
Economic Parameters ◽  
Economic Relationship ◽  
Novel Concept

Fuzzy set theory and fuzzy logics are the powerful mathematical tools to model the imprecision and vagueness. In this research, the novel concept of complex Pythagorean fuzzy relation (CPFR) is introduced. Furthermore, the types of CPFRs are explained with appropriate examples such as CPF composite relation, CPF equivalence relation, CPF order relation, and CPF equivalence classes. Moreover, numerous results and interesting properties of CPFRs are discussed in detail. Furthermore, the impacts of economic parameters over each other are studied through the proposed concepts of CPFRs. In addition, the application also discusses the effects of economic parameters of one country over the other countries’ economic parameters.

Traces of Fuzzy Relations Under Dual Operations

2005 ◽  
Vol 9 (5) ◽  
pp. 563-569 ◽  
Author(s):  
Hiroshi Hashimoto ◽  
Keyword(s):  
Fuzzy Relation ◽  
Equivalent Transformation ◽  
Matrix Inequality ◽  
Fuzzy Relations ◽  
Matrix Inequalities ◽  
Fuzzy Matrix ◽  
Dual Operations ◽  
The Given ◽  
Standard Operations

We examined dual properties of traces of a fuzzy relation using fuzzy matrices. Traces of a fuzzy relation are reflexive and transitive fuzzy relations obtained from the given fuzzy relation. Under standard operations on fuzzy matrices, fuzzy matrix inequalities and equalities are deduced by applying the well-known equivalent transformation of a fuzzy matrix inequality. We present, in particular, propositions on the construction of transitive fuzzy relations.

INVOLVING FUZZY ORDERS FOR MULTI-OBJECTIVE LINEAR PROGRAMMING

2012 ◽  
Vol 17 (3) ◽  
pp. 366-382 ◽  
Author(s):  
Olga Grigorenko
Keyword(s):  
Linear Programming ◽  
Order Relation ◽  
Fuzzy Relation ◽  
Membership Functions ◽  
Objective Functions ◽  
Solution Approach ◽  
Multi Objective ◽  
Order Relations ◽  
The Individual ◽  
Fuzzy Order

This paper presents a solution approach for multi-objective linear programming problem. We propose to involve fuzzy order relations to describe the objective functions where in ”classical” fuzzy approach the membership functions which illustrate how far the concrete point is from the solution of individual problem are studied. Further the global fuzzy order relation is constructed by aggregating the individual fuzzy order relations. Thus the global fuzzy relation contains the information about all objective functions and in the last step we find a maximum in the set of constrains with respect to the global fuzzy order relation. We illustrate this approach by an example.

Personal Problem Solving of Partners in Divorce Proceedings

2015 ◽  
Vol 36 (1) ◽  
pp. 82-103 ◽  
Author(s):  
Tereza Soukupova ◽  
Petr Goldmann
Keyword(s):  
Gender Differences ◽  
Problem Solving ◽  
Thematic Apperception Test ◽  
Scoring Systems ◽  
Personal Control ◽  
Personality Characteristics ◽  
Personal Problem ◽  
Thematic Apperception ◽  
And Gender ◽  
The Given

Abstract. The Thematic Apperception Test is one of the most frequently administered apperceptive techniques. Formal scoring systems are helpful in evaluating story responses. TAT stories, made by 20 males and 20 females in the situation of legal divorce proceedings, were coded for detection and comparison of their personal problem solving ability. The evaluating instrument utilized was the Personal Problem Solving System-Revised (PPSS-R) as developed by G. F. Ronan. The results indicate that in relation to card 1, men more often than women saw the cause of the problem as removable. With card 6GF, women were more motivated to resolve the given problem than were men, women had a higher personal control and their stories contained more optimism compared to men’s stories. In relation to card 6BM women, more often than men, used emotions generated from the problem to orient themselves within the problem. With card 13MF, the men’s level of stress was less compared to that of the women, and men were more able to plan within the context of problem-solving. Significant differences in the examined groups were found in those cards which depicted significant gender and parental potentials. The TAT can be used to help identify personality characteristics and gender differences.

Pattern Recognition in Histo-Pathology: Basic Considerations

1982 ◽  
Vol 21 (01) ◽  
pp. 15-22 ◽  
Author(s):  
W. Schlegel ◽  
K. Kayser
Keyword(s):  
Pattern Recognition ◽  
Graph Theory ◽  
Normal Tissue ◽  
Diagnostic Procedures ◽  
Minimal Distance ◽  
Malignant Growth ◽  
Colon Tissue ◽  
First Results ◽  
Tissue Structures ◽  
The Given

A basic concept for the automatic diagnosis of histo-pathological specimen is presented. The algorithm is based on tissue structures of the original organ. Low power magnification was used to inspect the specimens. The form of the given tissue structures, e. g. diameter, distance, shape factor and number of neighbours, is measured. Graph theory is applied by using the center of structures as vertices and the shortest connection of neighbours as edges. The algorithm leads to two independent sets of parameters which can be used for diagnostic procedures. First results with colon tissue show significant differences between normal tissue, benign and malignant growth. Polyps form glands that are twice as wide as normal and carcinomatous tissue. Carcinomas can be separated by the minimal distance of the glands formed. First results of pattern recognition using graph theory are discussed.

Coordinating Medical Literature with Patient Care

1977 ◽  
Vol 16 (04) ◽  
pp. 234-240 ◽  
Author(s):  
Joann Gustafson ◽  
J. Nelson ◽  
Ann Buller
Keyword(s):  
Health Care ◽  
Medical Staff ◽  
Medical Information ◽  
Medical Literature ◽  
Medical Information System ◽  
Staff Members ◽  
Information Displays ◽  
Medical Displays ◽  
Computerized Medical Information ◽  
The Given

The contribution of a special library project to a computerized problem-oriented medical information system (PROMIS) is discussed. Medical information displays developed by the PROMIS medical staff are accessible to the health care provider via touch screen cathode terminals. Under PROMIS, members of the library project developed two information services, one concerned with the initial building of the medical displays and the other with the updating of this information. Information from 88 medical journals is disseminated to physicians involved in the building of the medical displays. Articles meeting predetermined selection criteria are abstracted and the abstracts are made available by direct selective dissemination or via a problem-oriented abstract file. The updating service involves comparing the information contained in the selected articles with the computerized medical displays on the given topic. Discrepancies are brought to the attention of PROMIS medical staff members who evaluate the information and make appropriate changes in the displays. Thus a feedback loop is maintained which assures the completeness, accuracy, and currency of the computerized medical information. The development of this library project and its interface with the computerized health care system thus attempts to deal with the problems in the generation, validation, dissemination, and application of medical literature.

Identification and Transformation of Terminal Morphemes in Medical English

1969 ◽  
Vol 8 (02) ◽  
pp. 84-90 ◽  
Author(s):  
A. W. Pratt ◽  
M. Pacak
Keyword(s):  
Word Form ◽  
Subsequent Transformation ◽  
Part Of Speech ◽  
Morphological Segmentation ◽  
Medical English ◽  
Nominal Form ◽  
Admissible Path ◽  
Near Future ◽  
The Given ◽  
Admissible Sequences

The system for the identification and subsequent transformation of terminal morphemes in medical English is a part of the information system for processing pathology data which was developed at the National Institutes of Health.The recognition and transformation of terminal morphemes is restricted to classes of adjectivals including the -ING and -ED forms, nominals and homographic adjective/noun forms.The adjective-to-noun and noun-to-noun transforms consist basically of a set of substitutions of adjectival and certain nominal suffixes by a set of suffixes which indicate the corresponding nominal form(s).The adjectival/nominal suffix has a polymorphosyntactic transformational function if it has the property of being transformed into more than one nominalizing suffix (e.g., the adjectival suffix -IC can be substituted by a set of nominalizing suffixes -Ø, -A, -E, -Y, -IS, -IA, -ICS): the adjectival suffix has a monomorphosyntactic transformational property if there is only one admissible transform (e.g., -CIC → -X).The morphological segmentation and the subsequent transformations are based on the following principles:a. The word form is segmented according to the principle of »double consonant cut,« i.e., terminal characters following the last set of double consonants are analyzed and treated as a potential suffix. For practical purposes only such terminal suffixes of a maximum length of four have been analyzed.b. The principle that the largest segment of a word form common to both adjective and noun or to both noun stems is retained as a word base for transformational operations, and the non-identical segment is considered to be a »suffix.«The backward right-to-left character search is initiated by the identification of the terminal grapheme of the given word form and is extended to certain admissible sequences of immediately preceding graphemes.The nodes which represent fixed sequences of graphemes are labeled according to their recognition and/or transformation properties.The tree nodes are divided into two groups:a. productive or activatedb. non-productive or non-activatedThe productive (activated) nodes are sequences of sets of graphemes which possess certain properties, such as the indication about part-of-speech class membership, the transformation properties, or both. The non-productive (non-activated) nodes have the function of connectors, i.e., they specify the admissible path to the productive nodes.The computer program for the identification and transformation of the terminal morphemes is open-ended and is already operational. It will be extended to other sub-fields of medicine in the near future.

Sign in / Sign up

Export Citation Format

Share Document