具有加法-最小积组合的模糊关系不等式系统的字典最小解

IF 11.9 1区计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

IEEE Transactions on Fuzzy Systems Pub Date : 2024-12-11 DOI:10.1109/TFUZZ.2024.3514746

Qianyu Shu;Guocheng Zhu;Xingming Wang;Xiaopeng Yang

{"title":"具有加法-最小积组合的模糊关系不等式系统的字典最小解","authors":"Qianyu Shu;Guocheng Zhu;Xingming Wang;Xiaopeng Yang","doi":"10.1109/TFUZZ.2024.3514746","DOIUrl":null,"url":null,"abstract":"The addition-min-product fuzzy relation inequalities were recently introduced to model peer-to-peer file-sharing systems, considering scenarios where the terminals transmit their local file data at varying quality levels. Previous research primarily focused on min–max fuzzy relation programming, which assumed equal treatment for all terminals. However, this approach is inadequate when the terminals need to be differentiated or assigned fixed priority grades. To address network congestion while considering terminal priority, this study explores the lexicographic minimum solution for the addition-min-product FRIs. We propose a detailed algorithm to compute the lexicographic minimum solution, associated with a numerical illustrative example.","PeriodicalId":13212,"journal":{"name":"IEEE Transactions on Fuzzy Systems","volume":"33 3","pages":"1088-1098"},"PeriodicalIF":11.9000,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lexicographic Minimum Solution to the System of Fuzzy Relation Inequalities With Addition-Min-Product Composition\",\"authors\":\"Qianyu Shu;Guocheng Zhu;Xingming Wang;Xiaopeng Yang\",\"doi\":\"10.1109/TFUZZ.2024.3514746\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The addition-min-product fuzzy relation inequalities were recently introduced to model peer-to-peer file-sharing systems, considering scenarios where the terminals transmit their local file data at varying quality levels. Previous research primarily focused on min–max fuzzy relation programming, which assumed equal treatment for all terminals. However, this approach is inadequate when the terminals need to be differentiated or assigned fixed priority grades. To address network congestion while considering terminal priority, this study explores the lexicographic minimum solution for the addition-min-product FRIs. We propose a detailed algorithm to compute the lexicographic minimum solution, associated with a numerical illustrative example.\",\"PeriodicalId\":13212,\"journal\":{\"name\":\"IEEE Transactions on Fuzzy Systems\",\"volume\":\"33 3\",\"pages\":\"1088-1098\"},\"PeriodicalIF\":11.9000,\"publicationDate\":\"2024-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Fuzzy Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10787442/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Fuzzy Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10787442/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}

引用次数: 0

摘要

考虑到终端以不同的质量水平传输本地文件数据，最近引入了加法-最小积模糊关系不等式来建立点对点文件共享系统的模型。以往的研究主要集中在最小-最大模糊关系规划上，该规划假设对所有终端都一视同仁。但是，当终端需要区分或分配固定的优先级等级时，这种方法是不够的。为了在考虑终端优先级的同时解决网络拥塞问题，本研究探讨了加法最小积fri的字典最小解。我们提出了一个详细的算法来计算字典最小解，并结合了一个数值例子。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Lexicographic Minimum Solution to the System of Fuzzy Relation Inequalities With Addition-Min-Product Composition

The addition-min-product fuzzy relation inequalities were recently introduced to model peer-to-peer file-sharing systems, considering scenarios where the terminals transmit their local file data at varying quality levels. Previous research primarily focused on min–max fuzzy relation programming, which assumed equal treatment for all terminals. However, this approach is inadequate when the terminals need to be differentiated or assigned fixed priority grades. To address network congestion while considering terminal priority, this study explores the lexicographic minimum solution for the addition-min-product FRIs. We propose a detailed algorithm to compute the lexicographic minimum solution, associated with a numerical illustrative example.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE Transactions on Fuzzy Systems 工程技术-工程：电子与电气

CiteScore

20.50

自引率

13.40%

发文量

517

审稿时长

3.0 months

期刊介绍： The IEEE Transactions on Fuzzy Systems is a scholarly journal that focuses on the theory, design, and application of fuzzy systems. It aims to publish high-quality technical papers that contribute significant technical knowledge and exploratory developments in the field of fuzzy systems. The journal particularly emphasizes engineering systems and scientific applications. In addition to research articles, the Transactions also includes a letters section featuring current information, comments, and rebuttals related to published papers.