The interval-valued intuitionistic fuzzy sets (IVIFSs), based on the intuitionistic fuzzy sets (IFSs), combine the classical decision method and its research and application is attracting attention. After a comparative analysis, it becomes clear that multiple classical methods with IVIFSs’ information have been applied to many practical issues. In this paper, we extended the classical EDAS method based on the Cumulative Prospect Theory (CPT) considering the decision experts (DEs)’ psychological factors under IVIFSs. Taking the fuzzy and uncertain character of the IVIFSs and the psychological preference into consideration, an original EDAS method, based on the CPT under IVIFSs (IVIF-CPT-EDAS) method, is created for multiple-attribute group decision making (MAGDM) issues. Meanwhile, the information entropy method is used to evaluate the attribute weight. Finally, a numerical example for Green Technology Venture Capital (GTVC) project selection is given, some comparisons are used to illustrate the advantages of the IVIF-CPT-EDAS method and a sensitivity analysis is applied to prove the effectiveness and stability of this new method. PDF XML
{"title":"An Extended EDAS Approach Based on Cumulative Prospect Theory for Multiple Attributes Group Decision Making with Interval-Valued Intuitionistic Fuzzy Information","authors":"Jing Wang, Qiang Cai, Guiwu Wei, Ningna Liao","doi":"10.15388/24-infor547","DOIUrl":"https://doi.org/10.15388/24-infor547","url":null,"abstract":"The interval-valued intuitionistic fuzzy sets (IVIFSs), based on the intuitionistic fuzzy sets (IFSs), combine the classical decision method and its research and application is attracting attention. After a comparative analysis, it becomes clear that multiple classical methods with IVIFSs’ information have been applied to many practical issues. In this paper, we extended the classical EDAS method based on the Cumulative Prospect Theory (CPT) considering the decision experts (DEs)’ psychological factors under IVIFSs. Taking the fuzzy and uncertain character of the IVIFSs and the psychological preference into consideration, an original EDAS method, based on the CPT under IVIFSs (IVIF-CPT-EDAS) method, is created for multiple-attribute group decision making (MAGDM) issues. Meanwhile, the information entropy method is used to evaluate the attribute weight. Finally, a numerical example for Green Technology Venture Capital (GTVC) project selection is given, some comparisons are used to illustrate the advantages of the IVIF-CPT-EDAS method and a sensitivity analysis is applied to prove the effectiveness and stability of this new method.\u0000PDF XML","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"69 1","pages":""},"PeriodicalIF":2.9,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140149975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Conventional parking lots struggle to meet demand, prompting the rise of Fully Automated Parking Systems (FAPS), offering eco-friendly alternatives with advanced technology. However, operational challenges persist, especially in planning and scheduling. Real-time responsiveness necessitates dispatching rules and heuristics. This study comprehensively explores FAPS operational dynamics, assessing various rule combinations’ impact on customer wait times and system utilization. Utilizing a six-month MATLAB simulation, results favour the Nearest-Available-Slot (NAS) allocation rule coupled with First-Come-First-Served (FCFS) sequencing, emphasizing allocation’s pivotal role in system efficiency. Future research will refine allocation strategies to further optimize FAPS operational performance. PDF XML
{"title":"Performance Evaluation of Different Dispatching Rules and Heuristics in a Fully Automated Parking System","authors":"Nurhan Dudakli, Adil Baykasoğlu","doi":"10.15388/24-infor544","DOIUrl":"https://doi.org/10.15388/24-infor544","url":null,"abstract":"Conventional parking lots struggle to meet demand, prompting the rise of Fully Automated Parking Systems (FAPS), offering eco-friendly alternatives with advanced technology. However, operational challenges persist, especially in planning and scheduling. Real-time responsiveness necessitates dispatching rules and heuristics. This study comprehensively explores FAPS operational dynamics, assessing various rule combinations’ impact on customer wait times and system utilization. Utilizing a six-month MATLAB simulation, results favour the Nearest-Available-Slot (NAS) allocation rule coupled with First-Come-First-Served (FCFS) sequencing, emphasizing allocation’s pivotal role in system efficiency. Future research will refine allocation strategies to further optimize FAPS operational performance.\u0000PDF XML","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"6 1","pages":""},"PeriodicalIF":2.9,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140107208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Energy conservation and emission reduction are important policies vigorously promoted in China. With the continuous popularization of the concept of green transportation, electric vehicles have become a green transportation tool with good development prospects, greatly reducing the pressure on the environment and resources caused by rapid economic growth. The development status of electric vehicles has a significant impact on urban energy security, environmental protection, and sustainable development in China. With the widespread application of new energy vehicles, charging piles have become an important auxiliary infrastructure necessary for the development of electric vehicles. They have significant social and economic benefits, so it is imperative to build electric vehicle charging piles. There are many factors to consider in the scientific layout of electric vehicle charging stations, and the location selection problem of electric vehicle charging stations is a multiple-attribute group decision-making (MAGDM) problem. Recently, the Combined Compromise Solution (CoCoSo) technique and CRITIC technique have been utilized to deal with MAGDM issues. Spherical fuzzy sets (SFSs) can uncover the uncertainty and fuzziness in MAGDM more effectively and deeply. In this paper, on basis of CoCoSo technique, a novel spherical fuzzy number CoCoSo (SFN-CoCoSo) technique based on spherical fuzzy number cosine similarity measure (SFNCSM) and spherical fuzzy number Euclidean distance (SFNED) is conducted for dealing with MAGDM. Moreover, when the attribute weights are completely unknown, the CRITIC technique is extended to SFSs to acquire the attribute weights based on the SFNCSM and SFNED. Finally, the SFN-CoCoSo technique is utilized for location selection problem of electric vehicle charging stations to prove practicability of the developed technique and compare the SFN-CoCoSo technique with existing techniques to further demonstrate its superiority. PDF XML
{"title":"Location Selection of Electric Vehicle Charging Stations Through Employing the Spherical Fuzzy CoCoSo and CRITIC Technique","authors":"Rong Yan, Yongguang Han, Huiyuan Zhang, Cun Wei","doi":"10.15388/24-infor545","DOIUrl":"https://doi.org/10.15388/24-infor545","url":null,"abstract":"Energy conservation and emission reduction are important policies vigorously promoted in China. With the continuous popularization of the concept of green transportation, electric vehicles have become a green transportation tool with good development prospects, greatly reducing the pressure on the environment and resources caused by rapid economic growth. The development status of electric vehicles has a significant impact on urban energy security, environmental protection, and sustainable development in China. With the widespread application of new energy vehicles, charging piles have become an important auxiliary infrastructure necessary for the development of electric vehicles. They have significant social and economic benefits, so it is imperative to build electric vehicle charging piles. There are many factors to consider in the scientific layout of electric vehicle charging stations, and the location selection problem of electric vehicle charging stations is a multiple-attribute group decision-making (MAGDM) problem. Recently, the Combined Compromise Solution (CoCoSo) technique and CRITIC technique have been utilized to deal with MAGDM issues. Spherical fuzzy sets (SFSs) can uncover the uncertainty and fuzziness in MAGDM more effectively and deeply. In this paper, on basis of CoCoSo technique, a novel spherical fuzzy number CoCoSo (SFN-CoCoSo) technique based on spherical fuzzy number cosine similarity measure (SFNCSM) and spherical fuzzy number Euclidean distance (SFNED) is conducted for dealing with MAGDM. Moreover, when the attribute weights are completely unknown, the CRITIC technique is extended to SFSs to acquire the attribute weights based on the SFNCSM and SFNED. Finally, the SFN-CoCoSo technique is utilized for location selection problem of electric vehicle charging stations to prove practicability of the developed technique and compare the SFN-CoCoSo technique with existing techniques to further demonstrate its superiority.\u0000PDF XML","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"88 1","pages":""},"PeriodicalIF":2.9,"publicationDate":"2024-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140075590","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Signcryption integrates both signature and encryption schemes into single scheme to ensure both content unforgeability (authentication) and message confidentiality while reducing computational complexity. Typically, both signers (senders) and decrypters (receivers) in a signcryption scheme belong to the same public-key systems. When signers and decrypters in a signcryption scheme belong to heterogeneous public-key systems, this scheme is called a hybrid signcryption scheme which provides more elastic usage than typical signcryption schemes. In recent years, a new kind of attack, named side-channel attack, allows adversaries to learn a portion of the secret keys used in cryptographic algorithms. To resist such an attack, leakage-resilient cryptography has been widely discussed and studied while a large number of leakage-resilient schemes have been proposed. Also, numerous hybrid signcryption schemes under heterogeneous public-key systems were proposed, but none of them possesses leakage-resilient property. In this paper, we propose the first hybrid signcryption scheme with leakage resilience, called leakage-resilient hybrid signcryption scheme, in heterogeneous public-key systems (LR-HSC-HPKS). Security proofs are demonstrated to show that the proposed scheme provides both authentication and confidentiality against two types of adversaries in heterogeneous public-key systems. PDF XML
{"title":"Leakage-Resilient Hybrid Signcryption in Heterogeneous Public-key Systems","authors":"Ting-Chieh Ho, Yuh-Min Tseng, Sen-Shan Huang","doi":"10.15388/24-infor546","DOIUrl":"https://doi.org/10.15388/24-infor546","url":null,"abstract":"Signcryption integrates both signature and encryption schemes into single scheme to ensure both content unforgeability (authentication) and message confidentiality while reducing computational complexity. Typically, both signers (senders) and decrypters (receivers) in a signcryption scheme belong to the same public-key systems. When signers and decrypters in a signcryption scheme belong to heterogeneous public-key systems, this scheme is called a hybrid signcryption scheme which provides more elastic usage than typical signcryption schemes. In recent years, a new kind of attack, named side-channel attack, allows adversaries to learn a portion of the secret keys used in cryptographic algorithms. To resist such an attack, leakage-resilient cryptography has been widely discussed and studied while a large number of leakage-resilient schemes have been proposed. Also, numerous hybrid signcryption schemes under heterogeneous public-key systems were proposed, but none of them possesses leakage-resilient property. In this paper, we propose the first hybrid signcryption scheme with leakage resilience, called leakage-resilient hybrid signcryption scheme, in heterogeneous public-key systems (LR-HSC-HPKS). Security proofs are demonstrated to show that the proposed scheme provides both authentication and confidentiality against two types of adversaries in heterogeneous public-key systems.\u0000PDF XML","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"16 1","pages":""},"PeriodicalIF":2.9,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140046999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A fast vectorized codes for assembly mixed finite element matrices for the generalized Navier–Stokes system in three space dimensions in the MATLAB language are proposed by the MINI element. Vectorization means that the loop over tetrahedra is avoided. Numerical experiments illustrate computational efficiency of the codes. An experimental superconvergence rate for the pressure component is established. PDF XML
通过 MINI 元素，提出了用 MATLAB 语言在三维空间组装广义 Navier-Stokes 系统混合有限元矩阵的快速矢量化代码。矢量化意味着避免在四面体上循环。数值实验说明了代码的计算效率。实验证明了压力分量的超收敛率。PDF XML
{"title":"MINI Element for the Navier–Stokes System in 3D: Vectorized Codes and Superconvergence","authors":"Radek Kučera, Vladimír Arzt, Jonas Koko","doi":"10.15388/24-infor543","DOIUrl":"https://doi.org/10.15388/24-infor543","url":null,"abstract":"A fast vectorized codes for assembly mixed finite element matrices for the generalized Navier–Stokes system in three space dimensions in the MATLAB language are proposed by the MINI element. Vectorization means that the loop over tetrahedra is avoided. Numerical experiments illustrate computational efficiency of the codes. An experimental superconvergence rate for the pressure component is established.\u0000PDF XML","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"32 1","pages":""},"PeriodicalIF":2.9,"publicationDate":"2024-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139947844","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A special class of monotone Boolean functions coming from shadow minimization theory of finite set-systems – KK-MBF functions – is considered. These functions are a descriptive model for systems of compatible groups of constraints, however, the class of all functions is unambiguously complex and it is sensible to study relatively simple subclasses of functions such as KK-MBF. Zeros of KK-MBF functions correspond to initial segments of lexicographic order on hypercube layers. This property is used to simplify the recognition. Lexicographic order applies priorities over constraints which is applicable property of practices. Query-based algorithms for KK-MBF functions are investigated in terms of their complexities. PDF XML
{"title":"Shadow Minimization Boolean Function Reconstruction","authors":"Levon Aslanyan, Gyula Katona, Hasmik Sahakyan","doi":"10.15388/24-infor542","DOIUrl":"https://doi.org/10.15388/24-infor542","url":null,"abstract":"A special class of monotone Boolean functions coming from shadow minimization theory of finite set-systems – KK-MBF functions – is considered. These functions are a descriptive model for systems of compatible groups of constraints, however, the class of all functions is unambiguously complex and it is sensible to study relatively simple subclasses of functions such as KK-MBF. Zeros of KK-MBF functions correspond to initial segments of lexicographic order on hypercube layers. This property is used to simplify the recognition. Lexicographic order applies priorities over constraints which is applicable property of practices. Query-based algorithms for KK-MBF functions are investigated in terms of their complexities.\u0000PDF XML","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"182 1","pages":""},"PeriodicalIF":2.9,"publicationDate":"2024-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139754790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-24DOI: 10.31449/inf.v47i10.5395
S. Yousiff, Ra'ad A. Muhajjar, Mishall Al-Zubaidie
{"title":"Designing A Blockchain Approach to Secure Firefighting Stations Based Internet of Things","authors":"S. Yousiff, Ra'ad A. Muhajjar, Mishall Al-Zubaidie","doi":"10.31449/inf.v47i10.5395","DOIUrl":"https://doi.org/10.31449/inf.v47i10.5395","url":null,"abstract":"","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"1987 4","pages":""},"PeriodicalIF":2.9,"publicationDate":"2023-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139160533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-23DOI: 10.31449/inf.v47i10.5118
A. S. Hashim, Wid Akeel Awadh, Mohammed S. Hashim
{"title":"Non-dominated Sorting Genetic Optimization-based Fog Cloudlet Computing for Wireless Metropolitan Area Networks","authors":"A. S. Hashim, Wid Akeel Awadh, Mohammed S. Hashim","doi":"10.31449/inf.v47i10.5118","DOIUrl":"https://doi.org/10.31449/inf.v47i10.5118","url":null,"abstract":"","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"13 2","pages":""},"PeriodicalIF":2.9,"publicationDate":"2023-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139161380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：