Pub. online:19 Dec 2022Type:Research ArticleOpen Access
Journal:Informatica
Volume 34, Issue 2 (2023), pp. 223–248
Abstract
In this study, Intuitionistic Fuzzy Consistency Method (IF-FUCOM) and Grey Relation Analysis (GRA) were combined to assess the effects of Bacillus subtilis bacteria on concrete properties, as well as to determine the optimal bacteria concentration and curing day. Three different concentrations of bacteria were added to the mortar mixes, like 103, 105, and 107 cells/ml of water. Mortar samples were left to cure for 7 days, 14 days, and 28 days to evaluate compressive strength, water absorption, crack healing. According to the proposed algorithm, 105 bacteria are the optimal concentration, while 28 days is the ideal curing time.
Pub. online:19 Dec 2022Type:Research ArticleOpen Access
Journal:Informatica
Volume 34, Issue 1 (2023), pp. 199–222
Abstract
Due to the popularity of mobile communication, many computing devices are exposed to remote environments without physical protection so that these devices easily suffer from leakage attacks (e.g., side-channel attacks). Under such leakage attacks, when a computing device performs some cryptographic algorithm, an adversary may acquire partial bits of secret keys participated in this cryptographic algorithm. To resist leakage attacks, researchers offer leakage-resilient cryptography as a solution. A signcryption scheme combines signing and encrypting processes to simultaneously provide both authentication and confidentiality, which is an important cryptographic primitive. Indeed, many leakage-resilient signcryption schemes under various public key system (PKS) settings were proposed. Unfortunately, these schemes still have two shortcomings, namely, bounded leakage resilience and conditionally continuous leakage resilience. In this paper, a “fully” continuous leakage-resilient certificate-based signcryption (FCLR-CBSC) scheme is proposed. Security analysis is formally proved to show that our scheme possesses both authentication and confidentiality against two types of adversaries in the certificate-based PKS setting. Performance analysis and simulation experience show that our scheme is suited to run on both a PC and a mobile device.
Pub. online:9 Dec 2022Type:Research ArticleOpen Access
Journal:Informatica
Volume 33, Issue 4 (2022), pp. 833–856
Abstract
Commonly modern symmetric encryption schemes (e.g. AES) use rather simple actions repeated many times by defining several rounds to calculate the ciphertext. An idea we previously offered was to trade these multiple repeats for one non-linear operation. Recently we proposed a perfectly secure symmetric encryption scheme based on the matrix power function (MPF). However, the platform group we used was commuting. In this paper, we use a non-commuting group whose cardinality is a power of 2 as a platform for MPF. Due to the convenient cardinality value, our scheme is more suitable for practical implementation. Moreover, due to the non-commuting nature of the platform group, some “natural” constraints on the power matrices arise. We think that this fact complicates the cryptanalysis of our proposal. We demonstrate that the newly defined symmetric cipher possesses are perfectly secure as they were previously done for the commuting platform group. Furthermore, we show that the same secret key can be used multiple times to encrypt several plaintexts without loss of security. Relying on the proven properties we construct the cipher block chaining mode of the initial cipher and show that it can withstand an adaptive chosen plaintext attack.
Pub. online:7 Dec 2022Type:Research ArticleOpen Access
Journal:Informatica
Volume 33, Issue 4 (2022), pp. 749–769
Abstract
In this paper, we propose a light-weight electronic voting protocol. The approach used by our protocol to conceal the ballots does not imply encryption, and guarantees the privacy of the direction of the vote unless all the contestants (parties) agree to do so. Our method is based on the division of the ballot into different pieces of information, which separately reveal no information at all, and that can be latter aggregated to recover the original vote. We show that, despite its simplicity, this scheme is powerful, it does not sacrifice any of the security properties demanded in a formal electronic voting protocol, and, furthermore, even in post-quantum scenarios, neither the casted votes can be tampered with, nor the identity of any elector can be linked with the direction of her vote.
Pub. online:6 Dec 2022Type:Research ArticleOpen Access
Journal:Informatica
Volume 33, Issue 4 (2022), pp. 795–832
Abstract
Intonation is a complex suprasegmental phenomenon essential for speech processing. However, it is still largely understudied, especially in the case of under-resourced languages, such as Lithuanian. The current paper focuses on intonation in Lithuanian, a Baltic pitch-accent language with free stress and tonal variations on accented heavy syllables. Due to historical circumstances, the description and analysis of Lithuanian intonation were carried out within different theoretical frameworks and in several languages, which makes them hardly accessible to the international research community. This paper is the first attempt to gather research on Lithuanian intonation from both the Lithuanian and the Western traditions, the structuralist and generativist points of view, and the linguistic and modelling perspectives. The paper identifies issues in existing research that require special attention and proposes directions for future investigations both in linguistics and modelling.
Pub. online:30 Nov 2022Type:Research ArticleOpen Access
Journal:Informatica
Volume 33, Issue 4 (2022), pp. 771–793
Abstract
A new methodology to help to improve the efficiency of herbicide assessment is explained. It consists of an automatic tool to quantify the percentage of weeds and plants of interest (sunflowers) that are present in a given area. Images of the crop field taken from Sequoia camera were used. Firstly, the quality of the images of each band is improved. Later, the resulting multi-spectral images are classified into several classes (soil, sunflower and weed) through a novel algorithm implemented in e-Cognition software. Obtained results of the proposed classifications have been compared with two deep learning-based segmentation methods (U-Net and FPN).
Pub. online:28 Nov 2022Type:Research ArticleOpen Access
Journal:Informatica
Volume 33, Issue 4 (2022), pp. 857–899
Abstract
T-spherical fuzzy (T-SF) sets furnish a constructive and flexible manner to manifest higher-order fuzzy information in realistic decision-making contexts. The objective of this research article is to deliver an original multiple-criteria choice method that utilizes a correlation-focused approach toward computational intelligence in uncertain decision-making activities with T-spherical fuzziness. This study introduces the notion of T-SF data-driven correlation measures that are predicated on two types of the square root function and the maximum function. The purpose of these measures is to exhibit the overall desirability of choice options across all performance criteria using T-SF comprehensive correlation indices within T-SF decision environments. This study executes an application for location selection and demonstrates the effectiveness and suitability of the developed techniques in T-SF uncertain conditions. The comparative analysis and outcomes substantiate the justifiability and the strengths of the propounded methodology in pragmatic situations under T-SF uncertainties.
Journal:Informatica
Volume 33, Issue 4 (2022), pp. 713–729
Abstract
In recent years, the multi-attribute group decision making (MAGDM) problem has received extensive attention and research, and it plays an increasingly important role in our daily life. Fuzzy environment provides a more accurate decision-making environment for decision makers, so the research on MAGDM problem under fuzzy environment sets (SFSs) has become popular. Taxonomy method has become an effective method to solve the problem of MAGDM. It also plays an important role in solving the problem of MAGDM combined with other environments. In this paper, a new method for MAGDM is proposed by combining Taxonomy method with SFSs (SF-Taxonomy). In addition, we use entropy weight method to calculate the objective weight of attributes, so that more objective results can be produced when solving MAGDM problems.
Journal:Informatica
Volume 33, Issue 3 (2022), pp. 593–621
Abstract
This paper proposes a new multi-criteria group decision-making (MCGDM) method utilizing q-rung orthopair fuzzy (qROF) sets, improved power weighted operators and improved power weighted Maclaurin symmetric mean (MSM) operators. The power weighted averaging operator and power weighted Maclaurin symmetric mean (MSM) operator used in the existing MCGDM methods have the drawback of being unable to distinguish the priority order of alternatives in some scenarios, especially when one of the qROF numbers being considered has a non-belongingness grade of 0 or a belongingness grade of 1. To address this limitation of existing MCGDM methods, four operators, namely qROF improved power weighted averaging (qROFIPWA), qROF improved power weighted geometric (qROFIPWG), qROF improved power weighted averaging MSM (qROFIPWAMSM) and qROF improved power weighted geometric MSM (qROFIPWGMSM), are proposed in this paper. These operators mitigate the effects of erroneous assessment of information from some biased decision-makers, making the decision-making process more reliable. Following that, a group decision-making methodology is developed that is capable of generating a reasonable ranking order of alternatives when one of the qROF numbers considered has a non-belongingness grade of 0 or a belongingness grade of 1. To investigate the applicability of the proposed approach, a case study is also presented and a comparison-based investigation is used to demonstrate the superiority of the approach.
Journal:Informatica
Volume 33, Issue 4 (2022), pp. 731–748
Abstract
Fuzzy relations have been widely applied in decision making process. However, the application process requires people to have a high level of ability to compute and infer information. As people usually have limited ability of computing and inferring, the fuzzy relation needs to be adapted to fit the abilities of people. The bounded rationality theory holding the view that people have limited rationality in terms of computing and inferring meets such a requirement, so we try to combine the fuzzy relation with the bounded rationality theory in this study. To do this, first of all, we investigate four properties of fuzzy relations (i.e. reflexivity, symmetry, transitivity and reciprocity) within the bounded rationality context and find that these properties are not compatible with the bounded rationality theory. Afterwards, we study a new property called the bounded rational reciprocity of fuzzy relations, to make it possible to combine a fuzzy relation with the bounded rationality theory. Based on the bounded rational reciprocity, the bounded rational reciprocal preference relation is then introduced. A rationality visualization technique is proposed to intuitively display the rationality of experts. Finally, a bounded rationality net-flow-based ranking method is presented to solve real decision-making problems with bounded rational reciprocal preference relations, and a numerical example with comparative analysis is given to demonstrate the advantages of the proposed methods.