Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Purchase individual online access for 1 year to this journal.
Price: EUR 315.00Impact Factor 2024: 1.7
The purpose of the Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology is to foster advancements of knowledge and help disseminate results concerning recent applications and case studies in the areas of fuzzy logic, intelligent systems, and web-based applications among working professionals and professionals in education and research, covering a broad cross-section of technical disciplines.
The journal will publish original articles on current and potential applications, case studies, and education in intelligent systems, fuzzy systems, and web-based systems for engineering and other technical fields in science and technology. The journal focuses on the disciplines of computer science, electrical engineering, manufacturing engineering, industrial engineering, chemical engineering, mechanical engineering, civil engineering, engineering management, bioengineering, and biomedical engineering. The scope of the journal also includes developing technologies in mathematics, operations research, technology management, the hard and soft sciences, and technical, social and environmental issues.
Authors: Imtiaz, Aneeza | Shuaib, Umer | Razaq, Abdul | Gulistan, Muhammad
Article Type: Research Article
Abstract: The study of complex fuzzy sets defined over the meet operator (ξ – CFS) is a useful mathematical tool in which range of degrees is extended from [0, 1] to complex plane with unit disk. These particular complex fuzzy sets plays a significant role in solving various decision making problems as these particular sets are powerful extensions of classical fuzzy sets. In this paper, we define ξ – CFS and propose the notion of complex fuzzy subgroups defined over ξ – CFS (ξ – CFSG) along with their various fundamental algebraic characteristics. We extend the study …of this idea by defining the concepts of ξ – complex fuzzy homomorphism and ξ – complex fuzzy isomorphism between any two ξ – complex fuzzy subgroups and establish fundamental theorems of ξ – complex fuzzy morphisms. In addition, we effectively apply the idea of ξ – complex fuzzy homomorphism to refine the corrupted homomorphic image by eliminating its distortions in order to obtain its original form. Moreover, to view the true advantage of ξ – complex fuzzy homomorphism, we present a comparative analysis with the existing knowledge of complex fuzzy homomorphism which enables us to choose this particular approach to solve many decision-making problems. Show more
Keywords: ξ –complex fuzzy sets (ξ – CFS), ξ –complex fuzzy subgroups (ξ – CFSG), ξ –complex fuzzy normal subgroups (ξ – CFNSG), ξ –complex fuzzy homomorphism, ξ –complex fuzzy isomorphism, 08A72, 20N25, 03E72
DOI: 10.3233/JIFS-201261
Citation: Journal of Intelligent & Fuzzy Systems, vol. 40, no. 3, pp. 4425-4437, 2021
Authors: Mo, Hongming
Article Type: Research Article
Abstract: Wind power is a typical clean and renewable energy, which has been widely regarded as one of the replaceable energies in many countries. Wind turbine is the key equipment to generate wind power. It is necessary to evaluate the risks of each stage of the wind turbine with regard to occupational health and safety. In this study, the stage of production of life cycle of wind turbine is considered. The aim of this study is to propose a new method to identify and evaluate the risk factors based on strengths-weaknesses-opportunities-threats (SWOT) analysis and D number theory, named D-SWOT method. A …wind turbine firm is used to demonstrate the detailed steps of the proposed method. SWOT is conducted to identify the risk factors of production stage of the wind turbine company. Experts are invited to perform the risk assessment, and D number theory is carried out to do the processes of information representation and integration. After that, some suggestions are provided to the company to lower the risks. The D-SWOT method obtains the same results as the previous method of hesitant fuzzy linguistic term set (HFLTS). Compared with HFLTS method, D-SWOT method simplifies the process of information processing, and D-SWOT method is more intuitional and concise. Besides, a property of pignistic probability transformation of D number theory (DPPT) is proposed in the manuscript, which extends D number theory and has been used in the process of decision making of D-SWOT. Show more
Keywords: Belief function, evidence theory, D number theory, strengths-weaknesses-opportunities-threats, risk evaluation, wind turbine
DOI: 10.3233/JIFS-201277
Citation: Journal of Intelligent & Fuzzy Systems, vol. 40, no. 3, pp. 4439-4452, 2021
Authors: Gao, Xin Wen | Li, ShuaiQing | Jin, Bang Yang | Hu, Min | Ding, Wei
Article Type: Research Article
Abstract: With the large-scale construction of urban subways, the detection of tunnel cracks becomes particularly important. Due to the complexity of the tunnel environment, it is difficult for traditional tunnel crack detection algorithms to detect and segment such cracks quickly and accurately. The article presents an optimal adaptive selection model (RetinaNet-AOS) based on deep learning RetinaNet for semantic segmentation on tunnel crack images quickly and accurately. The algorithm uses the ROI merge mask to obtain a minimum detection area of the crack in the field of view. A scorer is designed to measure the effect of ROI region segmentation to achieve …optimal results, and further optimized with a multi-dimensional classifier. The algorithm is compared with the standard detection based on RetinaNet algorithm with an optimal adaptive selection based on RetinaNet algorithm for different crack types. The results show that our crack detection algorithm not only addresses interference due to mash cracks, slender cracks, and water stains but also the false detection rate decreases from 25.5–35.5% to about 3.6%. Meanwhile, the experimental results focus on the execution time to be calculated on the algorithm, FCN, PSPNet, UNet. The algorithm gives better performance in terms of time complexity. Show more
Keywords: Crack detection, deep learning, retinanet, optimal adaptive selection, ROI merge
DOI: 10.3233/JIFS-201296
Citation: Journal of Intelligent & Fuzzy Systems, vol. 40, no. 3, pp. 4453-4469, 2021
Authors: Ghorani, Maryam | Garhwal, Sunita
Article Type: Research Article
Abstract: In this paper, we study fuzzy top-down tree automata over lattices ( LTA s , for short). The purpose of this contribution is to investigate the minimization problem for LTA s . We first define the concept of statewise equivalence between two LTA s . Thereafter, we show the existence of the statewise minimal form for an LTA . To this end, we find a statewise irreducible LTA which is equivalent to a given LTA …. Then, we provide an algorithm to find the statewise minimal LTA and by a theorem, we show that the output statewise minimal LTA is statewise equivalent to the given input. Moreover, we compute the time complexity of the given algorithm. The proposed algorithm can be applied to any given LTA and, unlike some minimization algorithms given in the literature, the input doesn’t need to be a complete, deterministic, or reduced lattice-valued tree automaton. Finally, we provide some examples to show the efficiency of the presented algorithm. Show more
Keywords: Fuzzy tree automata, minimization problem, lattice-valued logic, statewise minimal
DOI: 10.3233/JIFS-201298
Citation: Journal of Intelligent & Fuzzy Systems, vol. 40, no. 3, pp. 4471-4480, 2021
Authors: Chen, Lei | Xia, Meimei
Article Type: Research Article
Abstract: Recommender systems can recommend products by analyzing the interests and habits of users. To make more efficient recommendation, the contextual information should be collected in recommendation algorithms. In the restaurant recommendation, the location and the current time of customers should also be considered to facilitate restaurants to find potential customers and give accurate and timely recommendations. However, the existing recommendation approaches often lack the consideration of the influence of time and location. Besides, the data sparsity is an inherent problem in the collaborative filtering algorithm. To address these problems, this paper proposes a recommendation approach which combines the contextual information …including time, price and location. Instead of constructing the user-restaurant scoring matrix, the proposed approach clusters price tags and generates the user-price scoring matrix to alleviate the sparsity of data. The experiment on Foursquare dataset shows that the proposed approach has a better performance than traditional ones. Show more
Keywords: Recommender system, collaborative filtering, contextual information, restaurant recommendation, data sparsity
DOI: 10.3233/JIFS-201299
Citation: Journal of Intelligent & Fuzzy Systems, vol. 40, no. 3, pp. 4481-4489, 2021
Authors: Alfaqih, Waleed M. | Ali, Based | Imdad, Mohammad | Sessa, Salvatore
Article Type: Research Article
Abstract: In this manuscript, we provide a new and novel generalization of the concept of fuzzy contractive mappings due to Gregori and Sapena [Fuzzy Sets and Systems 125 (2002) 245–252] in the setting of relational fuzzy metric spaces. Our findings possibly pave the way for another direction of relation-theoretic as well as fuzzy fixed point theory. We illustrate several examples to show the usefulness of our proven results. Moreover, we define cyclic fuzzy contractive mappings and utilize our main results to prove a fixed point result for such mappings. Finally, we deduce several results including fuzzy metric, order-theoretic and α -admissible …results. Show more
Keywords: 47H10, 54H25, Fuzzy metric space, fixed point, binary relation, α-admissible
DOI: 10.3233/JIFS-201319
Citation: Journal of Intelligent & Fuzzy Systems, vol. 40, no. 3, pp. 4491-4501, 2021
Authors: Zhou, Xiao-Wu | Shi, Fu-Gui
Article Type: Research Article
Abstract: Considering L be a completely distributive lattice, the notion of the sum of L -convex spaces is introduced and its elementary properties is studied. Firstly, the connections between the sum of L -convex spaces and its factor spaces are established. Secondly, the additivity of separability (S -1 , sub-S 0 , S 0 , S 1 , S 2 , S 3 and S 4 ) are investigated. Finally, the additivity of five types special L -convex spaces are examined.
Keywords: L-convex space, sum of L-convex space, separability, additivity
DOI: 10.3233/JIFS-201335
Citation: Journal of Intelligent & Fuzzy Systems, vol. 40, no. 3, pp. 4503-4515, 2021
Authors: Al-Andoli, Mohammed | Cheah, Wooi Ping | Tan, Shing Chiang
Article Type: Research Article
Abstract: Detecting communities is an important multidisciplinary research discipline and is considered vital to understand the structure of complex networks. Deep autoencoders have been successfully proposed to solve the problem of community detection. However, existing models in the literature are trained based on gradient descent optimization with the backpropagation algorithm, which is known to converge to local minima and prove inefficient, especially in big data scenarios. To tackle these drawbacks, this work proposed a novel deep autoencoder with Particle Swarm Optimization (PSO) and continuation algorithms to reveal community structures in complex networks. The PSO and continuation algorithms were utilized to avoid …the local minimum and premature convergence, and to reduce overall training execution time. Two objective functions were also employed in the proposed model: minimizing the cost function of the autoencoder, and maximizing the modularity function, which refers to the quality of the detected communities. This work also proposed other methods to work in the absence of continuation, and to enable premature convergence. Extensive empirical experiments on 11 publically-available real-world datasets demonstrated that the proposed method is effective and promising for deriving communities in complex networks, as well as outperforming state-of-the-art deep learning community detection algorithms. Show more
Keywords: Complex networks, community detection, autoencoder, particle swarm optimization, continuation method
DOI: 10.3233/JIFS-201342
Citation: Journal of Intelligent & Fuzzy Systems, vol. 40, no. 3, pp. 4517-4533, 2021
Authors: Jin, LeSheng | Yager, Ronald R. | Špirková, Jana | Mesiar, Radko | Paternain, Daniel | Bustince, Humberto
Article Type: Research Article
Abstract: Basic Uncertain Information (BUI) as a newly introduced concept generalized a wide range of uncertain information. The well-known Ordered Weighted Averaging (OWA) operators can flexibly and effectively model bipolar preferences of decision makers over given real valued input vector. However, there are no extant methods for OWA operators to be carried out over given BUI vectors. Against this background, this study firstly discusses the interval transformation for BUI and elaborately explains the reasonability within it. Then, we propose the corresponding preference aggregations for BUI in two different decisional scenarios, the aggregation for BUI vector without original information influencing and the …aggregation for BUI vector with original information influencing after interval transformation. For each decisional scenario, we also discuss two different orderings of preference aggregation, namely, interval-vector and vector-interval orderings, respectively. Hence, we will propose four different aggregation procedures of preference aggregation for BUI vector. Some illustrative examples are provided immediately after the corresponding aggregation procedures. Show more
Keywords: Aggregation function, basic uncertain information (BUI), decision-making, interval information, ordered weighted averaging (OWA) operator
DOI: 10.3233/JIFS-201374
Citation: Journal of Intelligent & Fuzzy Systems, vol. 40, no. 3, pp. 4535-4544, 2021
Authors: Li, Ming | Su, Bin | Lei, Deming
Article Type: Research Article
Abstract: Assembly flow shop scheduling problem with DPm → 1 layout has important applications in various manufacturing systems and has been extensively considered in single factory; however, this problem with fuzzy processing time is seldom studied in multiple factories. In this paper, fuzzy distributed assembly flow shop scheduling problem (FDAFSP) is considered, in which each factory has DPm → 1 layout, and an imperialist competitive algorithm with empire cooperation (ECICA) is developed to minimize fuzzy makespan. In ECICA, an adaptive empire cooperation between the strongest empire and the weakest empire is implemented by exchanging computing resources and search ability, historical evolution data are …used and a new imperialist competition is adopted. Numerical experiments are conducted on various instances and ECICA is compared with the existing methods to test its performance. Computational results demonstrate that ECICA has promising advantages on solving FDAFSP. Show more
Keywords: Assembly flow shop scheduling, distributed scheduling, imperialist competitive algorithm, fuzzy makespan
DOI: 10.3233/JIFS-201391
Citation: Journal of Intelligent & Fuzzy Systems, vol. 40, no. 3, pp. 4545-4561, 2021
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl