Lexicography minimum solution of fuzzy relation inequalities: applied to optimal control in P2P file sharing system

Lexicography minimum solution of fuzzy relation inequalities: applied to optimal control in P2P... A peer-to-peer (P2P) file sharing system can be reduced into a system of addition-min fuzzy relation inequalities. Concept of lexicography minimum solution is introduced and applied to such system. It is found that the unique lexicography minimum solution can be selected from the minimal solution set of the corresponding fuzzy relation inequalities. However it is difficult to find the minimal solution set which is probably infinite. In order to avoid such difficulty, we propose a so-called Circulation Algorithm to find the unique lexicography minimum solution. The algorithm is developed step by step and illustrated by a numerical application example. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Machine Learning and Cybernetics Springer Journals

Lexicography minimum solution of fuzzy relation inequalities: applied to optimal control in P2P file sharing system

Loading next page...
 
/lp/springer_journal/lexicography-minimum-solution-of-fuzzy-relation-inequalities-applied-qryogEq00A
Publisher
Springer Berlin Heidelberg
Copyright
Copyright © 2016 by Springer-Verlag Berlin Heidelberg
Subject
Engineering; Computational Intelligence; Artificial Intelligence (incl. Robotics); Control, Robotics, Mechatronics; Complex Systems; Systems Biology; Pattern Recognition
ISSN
1868-8071
eISSN
1868-808X
D.O.I.
10.1007/s13042-016-0527-x
Publisher site
See Article on Publisher Site

Abstract

A peer-to-peer (P2P) file sharing system can be reduced into a system of addition-min fuzzy relation inequalities. Concept of lexicography minimum solution is introduced and applied to such system. It is found that the unique lexicography minimum solution can be selected from the minimal solution set of the corresponding fuzzy relation inequalities. However it is difficult to find the minimal solution set which is probably infinite. In order to avoid such difficulty, we propose a so-called Circulation Algorithm to find the unique lexicography minimum solution. The algorithm is developed step by step and illustrated by a numerical application example.

Journal

International Journal of Machine Learning and CyberneticsSpringer Journals

Published: Apr 8, 2016

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off