Pub. online:29 Jan 2021Type:Research ArticleOpen Access
Journal:Informatica
Volume 32, Issue 1 (2021), pp. 85–118
Abstract
The data-driven approach is popular to automate learning of fuzzy rules and tuning membership function parameters in fuzzy inference systems (FIS) development. However, researchers highlight different challenges and issues of this FIS development because of its complexity. This paper evaluates the current state of the art of FIS development complexity issues in Computer Science, Software Engineering and Information Systems, specifically: 1) What complexity issues exist in the context of developing FIS? 2) Is it possible to systematize existing solutions of identified complexity issues? We have conducted a hybrid systematic literature review combined with a systematic mapping study that includes keyword map to address these questions. This review has identified the main FIS development complexity issues that practitioners should consider when developing FIS. The paper also proposes a framework of complexity issues and their possible solutions in FIS development.
Pub. online:12 Jan 2021Type:Research ArticleOpen Access
Journal:Informatica
Volume 32, Issue 2 (2021), pp. 217–245
Abstract
Industry 4.0 solutions are composed of autonomous engineered systems where heterogeneous agents act in a choreographed manner to create complex workflows. Agents work at low-level in a flexible and independent manner, and their actions and behaviour may be sparsely manipulated. Besides, agents such as humans tend to show a very dynamic behaviour and processes may be executed in a very anarchic, but correct way. Thus, innovative, and more flexible control techniques are required. In this work, supervisory control techniques are employed to guarantee a correct execution of distributed and choreographed processes in Industry 4.0 scenarios. At prosumer level, processes are represented using soft models where logic rules and deformation indicators are used to analyse the correctness of executions. These logic rules are verified using specific engines at business level. These engines are fed with deformation metrics obtained through tensor deformation functions at production level. To apply deformation functions, processes are represented as discrete flexible solids in a phase space, under external forces representing the variations in every task’s inputs. The proposed solution presents two main novelties and original contributions. On the one hand, the innovative use of soft models and deformation indicators allows the implementation of this control solution not only in traditional industrial scenarios where rigid procedures are followed, but also in other future engineered applications. On the other hand, the original integration of logic rules and events makes possible to control any kind of device, including those which do not have an explicit control plane or interface. Finally, to evaluate the performance of the proposed solution, an experimental validation using a real pervasive computing infrastructure is carried out.
Pub. online:12 Jan 2021Type:Research ArticleOpen Access
Journal:Informatica
Volume 32, Issue 1 (2021), pp. 23–40
Abstract
Anti-cancer immunotherapy dramatically changes the clinical management of many types of tumours towards less harmful and more personalized treatment plans than conventional chemotherapy or radiation. Precise analysis of the spatial distribution of immune cells in the tumourous tissue is necessary to select patients that would best respond to the treatment. Here, we introduce a deep learning-based workflow for cell nuclei segmentation and subsequent immune cell identification in routine diagnostic images. We applied our workflow on a set of hematoxylin and eosin (H&E) stained breast cancer and colorectal cancer tissue images to detect tumour-infiltrating lymphocytes. Firstly, to segment all nuclei in the tissue, we applied the multiple-image input layer architecture (Micro-Net, Dice coefficient (DC) $0.79\pm 0.02$). We supplemented the Micro-Net with an introduced texture block to increase segmentation accuracy (DC = $0.80\pm 0.02$). We preserved the shallow architecture of the segmentation network with only 280 K trainable parameters (e.g. U-net with ∼1900 K parameters, DC = $0.78\pm 0.03$). Subsequently, we added an active contour layer to the ground truth images to further increase the performance (DC = $0.81\pm 0.02$). Secondly, to discriminate lymphocytes from the set of all segmented nuclei, we explored multilayer perceptron and achieved a 0.70 classification f-score. Remarkably, the binary classification of segmented nuclei was significantly improved (f-score = 0.80) by colour normalization. To inspect model generalization, we have evaluated trained models on a public dataset that was not put to use during training. We conclude that the proposed workflow achieved promising results and, with little effort, can be employed in multi-class nuclei segmentation and identification tasks.
Pub. online:18 Dec 2020Type:Research ArticleOpen Access
Journal:Informatica
Volume 32, Issue 1 (2021), pp. 41–67
Abstract
This study introduces an approach in three phases to cover the disadvantages of the FMEA method including inability to assign different importance to risk factors and incomplete prioritization in uncertain environment. First, the values of Risk Priority Number (RPN) are set through the FMEA method. Then, the Step-wise Weight Assessment Ratio Analysis based on the Z-Number theory (Z-SWARA) method has been done to determine the weights of quintuplet factor. Finally, failures are prioritized using Multi-Objective Optimization by Ratio Analysis based on the Z-number theory (Z-MOORA). The results of implementation of the proposed approach by considering uncertainty and reliability represent a complete prioritization.
Pub. online:8 Dec 2020Type:Research ArticleOpen Access
Journal:Informatica
Volume 32, Issue 2 (2021), pp. 357–370
Abstract
It is a challenging task to prevent the staircase effect and simultaneously preserve sharp edges in image inpainting. For this purpose, we present a novel nonconvex extension model that closely incorporates the advantages of total generalized variation and edge-enhancing nonconvex penalties. This improvement contributes to achieve the more natural restoration that exhibits smooth transitions without penalizing fine details. To efficiently seek the optimal solution of the resulting variational model, we develop a fast primal-dual method by combining the iteratively reweighted algorithm. Several experimental results, with respect to visual effects and restoration accuracy, show the excellent image inpainting performance of our proposed strategy over the existing powerful competitors.
Pub. online:2 Dec 2020Type:Research ArticleOpen Access
Journal:Informatica
Volume 31, Issue 4 (2020), pp. 707–722
Abstract
Spherical fuzzy sets theory is useful and advantageous for handling uncertainty and imprecision in multiple attribute decision-making problems by considering membership, non-membership, and indeterminacy degrees. In this paper, by extending the classical linear assignment method, we propose a novel method called the spherical fuzzy linear assignment method (SF-LAM) to solve multiple criteria group decision-making problems in the spherical fuzzy environment. A ranking procedure consisting of aggregation functions, score functions, accuracy functions, weighted rank frequency, and a binary mathematical model are presented to determine the criterion-wise preferences and various alternatives’ priority order. The proposed method’s applicability and validity are shown through the selection problem among wind power farm locations. The proposed method helps managers to find the best location to construct the wind power plant based on the determined criteria. Finally, a comparative analysis is performed between the proposed spherical fuzzy linear assignment (SF-LAM) model and the spherical fuzzy analytic hierarchy process (SF-AHP) and spherical fuzzy WASPAS methods.
Pub. online:23 Nov 2020Type:Research ArticleOpen Access
Journal:Informatica
Volume 31, Issue 4 (2020), pp. 769–791
Abstract
In this paper we consider a non-cooperative N players differential game affected by deterministic uncertainties. Sufficient conditions for the existence of a robust feedback Nash equilibrium are presented in a set of min-max forms of Hamilton–Jacobi–Bellman equations. Such conditions are then used to find the robust Nash controls for a linear affine quadratic game affected by a square integrable uncertainty, which is seen as a malicious fictitious player trying to maximize the cost function of each player. The approach allows us to find robust strategies in the solution of a group of coupled Riccati differential equation. The finite, as well as infinite, time horizon cases are solved for this last game. As an illustration of the approach, the problem of the coordination of a two-echelon supply chain with seasonal uncertain fluctuations in demand is developed.
Pub. online:20 Nov 2020Type:Research ArticleOpen Access
Journal:Informatica
Volume 32, Issue 2 (2021), pp. 397–424
Abstract
Blockchain is a decentralized database, which can protect the safety of trade and avoid double payment. Due to the widespread attention of researchers, the studies of this field have increased sharply in recent years. It is meaningful to reveal the development level and trends based on this literature. This paper adopts bibliometric methods to study the collaboration characteristics from the levels of author, institution and country. Furthermore, several kinds of collaboration networks and their centrality analysis are also presented, which not only display the development level and collaboration degree but also the evolution of author collaboration modes in different phases.
Pub. online:9 Nov 2020Type:Research ArticleOpen Access
Journal:Informatica
Volume 31, Issue 4 (2020), pp. 659–680
Abstract
In this paper, we continue the study of efficient algorithms for the computation of zeta functions on the complex plane, extending works of Coffey, Šleževičienė and Vepštas. We prove a central limit theorem for the coefficients of the series with binomial-like coefficients used for evaluation of the Riemann zeta function and establish the rate of convergence to the limiting distribution. An asymptotic expression is derived for the coefficients of the series. We discuss the computational complexity and numerical aspects of the implementation of the algorithm. In the last part of the paper we present our results on 3D visualizations of zeta functions, based on series with binomial-like coefficients. 3D visualizations illustrate underlying structures of surfaces and 3D curves associated with zeta functions.