Pub. online:14 Feb 2024Type:Research ArticleOpen Access
Journal:Informatica
Volume 35, Issue 1 (2024), pp. 1–20
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.
Pub. online:22 Nov 2023Type:Research ArticleOpen Access
Journal:Informatica
Volume 35, Issue 1 (2024), pp. 21–46
Abstract
In this paper, the numerical algorithms for calculating the values of the left- and right-sided Riemann–Liouville fractional integrals and the Riesz fractional integral using spline interpolation techniques are derived. The linear, quadratic and three variants of cubic splines are taken into account. The estimation of errors using analytical methods are derived. We show four examples of numerical evaluation of the mentioned fractional integrals and determine the experimental rate of convergence for each derived algorithm. The high-precision calculations are executed using the 128-bit floating-point numbers and arithmetic routines.
Pub. online:19 Oct 2023Type:Research ArticleOpen Access
Journal:Informatica
Volume 35, Issue 1 (2024), pp. 47–63
Abstract
In this paper, we introduce a novel Model Based Foggy Image Enhancement using Levenberg-Marquardt non-linear estimation (MBFIELM). It presents a solution for enhancing image quality that has been compromised by homogeneous fog. Given an observation set represented by a foggy image, it is desired to estimate an analytical function dependent on adjustable variables that best cross the data in order to approximate them. A cost function is used to measure how the estimated function fits the observation set. Here, we use the Levenberg-Marquardt algorithm, a combination of the Gradient descent and the Gauss-Newton method, to optimize the non-linear cost function. An inverse transformation will result in an enhanced image. Both visual assessments and quantitative assessments, the latter utilizing a quality defogged image measure introduced by Liu et al. (2020), are highlighted in the experimental results section. The efficacy of MBFIELM is substantiated by metrics comparable to those of recognized algorithms like Artificial Multiple Exposure Fusion (AMEF), DehazeNet (a trainable end-to-end system), and Dark Channel Prior (DCP). There exist instances where the performance indices of AMEF exceed those of our model, yet there are situations where MBFIELM asserts superiority, outperforming these standard-bearers in algorithmic efficacy.
Pub. online:23 Nov 2023Type:Research ArticleOpen Access
Journal:Informatica
Volume 35, Issue 1 (2024), pp. 65–98
Abstract
Cloud computing has emerged as a transformative technology in the healthcare industry, but selecting the most suitable CV (“cloud vendor”) remains a complex task. This research presents a decision framework for CV selection in the healthcare industry, addressing the challenges of uncertainty, expert hesitation, and conflicting criteria. The proposed framework incorporates FFS (“Fermatean fuzzy set”) to handle uncertainty and data representation effectively. The importance of experts is attained via the variance approach, which considers hesitation and variability. Furthermore, the framework addresses the issue of extreme value hesitancy in criteria through the LOPCOW (“logarithmic percentage change-driven objective weighting”) method, which ensures a balanced and accurate assessment of criterion importance. Personalized grading of CVs is done via the ranking algorithm that considers the formulation of CoCoSo (“combined compromise solution”) with rank fusion, providing a compromise solution that balances conflicting criteria. By integrating these techniques, the proposed framework aims to enhance the rationale and reduce human intervention in CV selection for the healthcare industry. Also, valuable insights are gained from the framework for making informed decisions when selecting CVs for efficient data management and process implementation. A case example from Tamil Nadu is presented to testify to the applicability, while sensitivity and comparison analyses reveal the pros and cons of the framework.
Pub. online:12 Mar 2024Type:Research ArticleOpen Access
Journal:Informatica
Volume 35, Issue 1 (2024), pp. 99–129
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.
Pub. online:6 Mar 2024Type:Research ArticleOpen Access
Journal:Informatica
Volume 35, Issue 1 (2024), pp. 131–154
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.
Pub. online:20 Nov 2023Type:Research ArticleOpen Access
Journal:Informatica
Volume 35, Issue 1 (2024), pp. 155–178
Abstract
Metaheuristics are commonly employed as a means of solving many distinct kinds of optimization problems. Several natural-process-inspired metaheuristic optimizers have been introduced in the recent years. The convergence, computational burden and statistical relevance of metaheuristics should be studied and compared for their potential use in future algorithm design and implementation. In this paper, eight different variants of dragonfly algorithm, i.e. classical dragonfly algorithm (DA), hybrid memory-based dragonfly algorithm with differential evolution (DADE), quantum-behaved and Gaussian mutational dragonfly algorithm (QGDA), memory-based hybrid dragonfly algorithm (MHDA), chaotic dragonfly algorithm (CDA), biogeography-based Mexican hat wavelet dragonfly algorithm (BMDA), hybrid Nelder-Mead algorithm and dragonfly algorithm (INMDA), and hybridization of dragonfly algorithm and artificial bee colony (HDA) are applied to solve four industrial chemical process optimization problems. A fuzzy multi-criteria decision making tool in the form of fuzzy-measurement alternatives and ranking according to compromise solution (MARCOS) is adopted to ascertain the relative rankings of the DA variants with respect to computational time, Friedman’s rank based on optimal solutions and convergence rate. Based on the comprehensive testing of the algorithms, it is revealed that DADE, QGDA and classical DA are the top three DA variants in solving the industrial chemical process optimization problems under consideration.
Journal:Informatica
Volume 35, Issue 1 (2024), pp. 179–202
Abstract
The purpose of this manuscript is to develop a novel MAIRCA (Multi-Attribute Ideal-Real Comparative Analysis) method to solve the MCDM (Multiple Criteria Decision-Making) problems with completely unknown weights in the q-rung orthopair fuzzy (q-ROF) setting. Firstly, the new concepts of q-ROF Lance distance are defined and some related properties are discussed in this paper, from which we establish the maximizing deviation method (MDM) model for q-ROF numbers to determine the optimal criteria weight. Then, the Lance distance-based MAIRCA (MAIRCA-L) method is designed. In it, the preference, theoretical and real evaluation matrices are calculated considering the interaction relationship in q-ROF numbers, and the q-ROF Lance distance is applied to obtain the gap matrix. Finally, we manifest the effectiveness and advantage of the q-ROF MAIRCA-L method by two numerical examples.
Pub. online:8 Mar 2024Type:Research ArticleOpen Access
Journal:Informatica
Volume 35, Issue 1 (2024), pp. 203–225
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.