کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6873020 | 1440627 | 2018 | 33 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Certain types of M-fuzzifying matroids: A fundamental look at the security protocols in RFID and IoT
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Security protocols for RFID and IoT are often built on NP-hard problems. The greedy algorithm is an effective method to solve some NP-hard problems. However, the greedy algorithm can get the optimal solution if and only if the structure of the solutions is a matroid. This paper focuses on M-fuzzifying matroids. The notions of acyclic matroids, simple matroids, paving matroids and uniform matroids are generalized to fuzzy setting, which are called M-fuzzifying acyclic matroids, M-fuzzifying simple matroids, fuzzifying paving matroids and fuzzifying uniform matroids, respectively. From the sense of categorical, the relationships between M-fuzzifying matroids, M-fuzzifying acyclic matroids and M-fuzzifying simple matroids are investigated.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Future Generation Computer Systems - Volume 86, September 2018, Pages 582-590
Journal: Future Generation Computer Systems - Volume 86, September 2018, Pages 582-590
نویسندگان
Shao-Jun Yang, Xinyi Huang,