Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219434.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

Selecting a sustainable facility location is a crucial strategy for manufacturing companies to achieve long-term success in today’s competitive environment. Various quantitative and qualitative criteria with different importance in a multiple level structure must be considered and aggregated to assist the company in decision-making. How to determine these criteria weights and select the sustainable manufacturing facility locations have become research questions. To resolve this problem, this paper proposes a total distance ranking approach to fuzzy analytic hierarchical process (AHP)-based multiple criteria decision-making (MCDM) method. Currently, the membership functions of fuzzy weighted ratings in the MCDM with a multilevel structure cannot be developed. A ranking method is needed to defuzzify those fuzzy numbers used for fuzzy AHP and qualitative criteria in the MCDM for better executing decision-making procedure. The total distance ranking method related to the centroid on x-axis, centroid on y-axis and the distances of centroids point to the two tangent lines of a fuzzy number are considered in the proposed ranking approach. Formulas of the proposed approach will be presented, and some properties will be investigated to derive formulas for trapezoidal and triangular fuzzy numbers. A comparison with relevant ranking methods will be made to show the advantages of the proposed ranking approach. The proposed ranking approach is then applied to defuzzify the fuzzy numbers used in fuzzy AHP and linguistic values under qualitative criteria to obtain the criteria weights under multi-level structure and crisp values under qualitative criteria, respectively. The final scores of alternatives can be obtained by aggregating crisp criteria values and their corresponding weights by simple additive weighting method to obtain the ranking result. A numerical example will be conducted to show the effectiveness of the proposed model. Finally, a comparison with Best-Worst method (BWM) will be presented to show the persuasiveness of the proposed method.

Under the rapid process of urbanization, many early renovated urban villages have also encountered many problems. Due to the rapid development of urban construction and the continuous changes in spatial functions, early renovated urban villages have already encountered problems such as unreasonable commercial distribution, lack of parking spaces, reduced commercial vitality, and commercial activities crowding out affecting the normal lives of villagers. There is a serious contradiction between the need for development and the quality of life of villagers. Due to the fixed nature of architectural space, only by fully understanding the essential morphological characteristics of the space can we find the optimal solutions for different space usage functions, and obtain the matching of the optimal solutions in the existing space requirements. The social ecological evaluation of the spatial form of old urban blocks is a multi-attribute group decision making (MAGDM). Recently, the grey relational analysis (GRA) and CRITIC method has been used to cope with MAGDM issues. The dual probabilistic linguistic term sets (DPLTSs) are used as a tool for characterizing uncertain information during the social ecological evaluation of the spatial form of old urban blocks. In this manuscript, the dual probabilistic linguistic GRA (DPL-GRA) method is built to solve the MAGDM under DPLTSs. The CRITIC method is used to obtain the attributes weights. In the end, a numerical case study for social ecological evaluation of the spatial form of old urban blocks is given to validate the proposed method.

An L (p₁,  p₂,  p₃,   … ,  p _m )- labeling of a graph G, has the vertices of G assigned with non-negative integers, such that the vertices at distance j should have at least p _j as their label difference. If m = 3 and p₁ = 3,  p₂ = 2,  p₃ = 1, it is called an L (3,  2,  1)-labeling which is widely studied in the literature. In this paper, we define an L (3,  2,  1)-path coloring of G as a labeling g : V (G) → Z⁺ such that between every pair of vertices there exists at least one path P where in the labeling restricted to this path is an L (3,  2,  1)-labeling. Among the labels assigned to any vertex of G under g, the maximum label is called the span of g. The L (3,  2,  1)-connection number of a graph G, denoted by k_3c (G) is defined as the minimum value of span of g taken over all such labelings g. We call graphs with the special property that k_3c (G) = |V (G) | as L (3,  2,  1)-path graceful. In this paper, we obtain k_3c (G) of graphs that possess a Hamiltonian path and carry forward the discussion to certain classes of graphs which do not possess a Hamiltonian path, which is novel to this paper. Although different kinds of labeling are studied in the literature with different mathematical constraints imposed, the idea of showing the existence of a graph with a given number as its minimum labeling number has rarely been addressed. We show that given any positive integer, there always exists an L (3,  2,  1)-path graceful graph with the given integer as its k_3c (G), thus addressing the inverse question. Finally exploiting the fact that there is no gap on the k_3c (G) number line, we give an application of path colorings for secure communication on social networking sites. Efforts to deploy graph coloring in task scheduling, interference-free transmission, etc have been dealt by earlier researchers. In this paper, we deploy the L (3,  2,  1)-path coloring technique defined by us for secure communication in social networks, which has not been dealt with so far.

Multiple-attribute group decision-making (MAGDM) technique is often used to make decisions when several optimal options are under consideration. It can be difficult to select a reasonable optimal option for the decision maker under consideration of insufficient information. The theory of Hamy mean (HM) operators are used to express correlation among different input arguments and provide a smooth approximation during the decision-making process. Recently, Aczel Alsina aggregating expressions gained a lot of attention from numerous mathematicians under different fuzzy circumstances. This article aims to illustrate the notion of a Pythagorean fuzzy (PyF) set (PyFS) with some restricted constraints, such as a sum of the square of truth membership value and falsity membership value. We developed a series of new approaches under consideration of the HM tools, including PyF Aczel Alsina Hamy mean (PyFAAHM), and PyF Aczel Alsina weighted Hamy mean (PyFAAWHM) operators. Further, we also extend the theory of Dual Hamy mean (DHM) operators and derived a series of new methodologies such as PyF Aczel Alsina Dual Hamy mean (PyFAADHM) and PyF Aczel Alsina weighted Dual Hamy mean (PyFAAWDHM) operators. To demonstrate the flexibility of our derived approaches, we illustrate an application of a multinational company considering the MAGDM technique. An experimental case study is also illustrated to evaluate a reasonable option from a group of options. We see the advantages and compatibility of our findings by comparing the results of existing approaches with the results of currently discussed methodologies.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219434.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

Association rule mining (ARM) is an important research issue in the field of data mining that aims to find relations among different items in binary databases. The conventional ARM algorithms consider the frequency of the items in binary databases, which is not sufficient for real time applications. In this paper, a novel hash table based Type-2 fuzzy mining algorithm (T2FM) with an efficient pruning strategy is presented for discovering multiple fuzzy frequent itemsets from quantitative databases. The algorithm employs a hash table based structure for efficient storage and retrieval of item/itemset which reduces the search efficiency to O(1) or constant time. Previously, type-2 based Apriori and FP-growth based fuzzy frequent itemsets mining were proposed, which required large amounts of computation and a greater number of candidate generation and processing. Meanwhile, the proposed approach reduces a huge amount of computation by finding the common keys before the actual intersection operation takes place. An efficient pruning strategy is proposed to avoid unpromising candidates in order to speed up the computations. Several experiments are carried out to verify the efficiency of the approach in terms of runtime and memory for different minimum support threshold and the results show that the designed approach provides better performance compared to the state-of-the-art algorithms.

The proliferation of mobile technology has given rise to a multitude of applications, among them those designed with malicious intent, aimed at compromising the integrity of mobile devices (MDs). To combat this issue, this study introduces an innovative anomaly application detection system leveraging Federated Learning in conjunction with a Hyperbolic Tangent Radial-Deep Belief Network (FL-HTR-DBN). This system operates through two distinct phases: training and testing. During the training phase, the system first extracts log files and transforms them into a structured format, harnessing the power of the Hadoop System. Subsequently, these structured logs are converted into vector representations using the Updating Gate-BERT (UG-BERT) technique, thereby facilitating feature extraction. These features are then annotated utilizing the Symmetric Kullback Leibler Divergence squared Euclidean distance-based K Means (SKLD-SED K Means) algorithm. The FL-HTR-DBN model is subsequently trained using these labelled features. The detected anomalies are hashed and securely stored within an index tree, alongside their corresponding hashed Media Access Control (MAC) addresses. In the testing phase, log files are cross-referenced with the hashed index tree to identify potential anomalies. Notably, this novel approach outperforms many valuable outcomes in comparison with the existing approaches ConAnomaly, QLLog and LogCAD in terms of precision 97.5, recall 97.1, accuracy 95.9, F-measure 93.9, sensitivity 94.8 and specificity 95.9.

Every decision-making process particularly those involving real-life issues is disproportionately plagued by uncertainty. It is also unavoidable and obvious. Since its conception are several ways for representing uncertainty have been proposed by numerous academics to cope with uncertainty. Fuzzy sets and hierarchical such as picture fuzzy sets stand out among them as excellent representation techniques for modeling uncertainty. However, there are several significant drawbacks to the current uncertainty modeling techniques. Due to its vast versatility and benefits we here embrace the idea of the spherical fuzzy set, an extension of the picture fuzzy set. On the other hand amid uncertainty in real life the multi-objective plays a critical role. In this research paper determining a Multi-Objective Linear Programming Problem of Spherical fuzzy sets serves to stimulate nous. The score function corresponding to the degree positive, negative and neutral is the foundation upon which the suggested approach is developed. Additionally we apply the suggested strategy to the solution of the multi-objective linear programming problem to demonstrate its superiority through certain numerical examples. Maximization or Minimizing of the cost is the primary goal of the multi-objective linear programming problem. Using an explicitly defined score function the suggested solution transformed the Spherical Fuzzy Multi-Objective Linear Programming Problem into a Crisp Multi-Objective Linear Programming Problem (CMOLPP). We establish some theorems to show that the efficient solution of CMOLPP is likewise an efficient solution of SFMOLPP. The CMOLPP is then further simplified into a single-objective Linear Programming Problem (LPP) thus we revamp the modified Zimmermann’s approach in the environment of a nonlinear membership function with the aid of the suggested technique. It is possible to simply solve this single-objective LPP using any software or standard LPP algorithm. The suggested approach achieves the fuzzy optimum result without altering the nature of the issue. An application of the suggested approach has been used to illustrate it and its results have been distinguished from those of other preexisting methods found in the literature. To determine the importance of the suggested technique which adjudicate thorough theorem and result analysis is conducted.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219434.

The purpose of this article is to study the notion of statistical limit superior(SLS) and statistical limit inferior(SLI) in non-Archimedean(NA) L -fuzzy normed spaces( L -FNS). The concept of SLS and SLI is examined and extended to SLS and SLI in NA L -FNS. Moreover, the analogue of some results between SLS and SLI over NA L -FNS have been discussed. And also, it is proved that a bounded sequence is statistically convergent over NA L -FNS. Throughout this article, K denotes a complete, non-trivially valued, non-Archimedean fields(NAF).

The next Point-of-Interest (POI) recommendation, in recent years, has attracted an extensive amount of attention from the academic community. RNN-based methods cannot establish effective long-term dependencies among the input sequences when capturing the user’s motion patterns, resulting in inadequate exploitation of user preferences. Besides, the majority of prior studies often neglect high-order neighborhood information in users’ check-in trajectory and their social relationships, yielding suboptimal recommendation efficacy. To address these issues, this paper proposes a novel Double-Layer Attention Network model, named DLAN. Firstly, DLAN incorporates a multi-head attention module that can combine first-order and high-order neighborhood information in user check-in trajectories, thereby effectively and parallelly capturing both long- and short-term preferences of users and overcoming the problem that RNN-based methods cannot establish long-term dependencies between sequences. Secondly, this paper designs a user similarity weighting layer to measure the influence of other users on the target users leverage the social relationships among them. Finally, comprehensive experiments are conducted on user check-in data from two cities, New York (NYC) and Tokyo (TKY), and the results demonstrate that DLAN achieves a performance in Accuracy and Mean Reverse Rank enhancement by 8.07% -36.67% compared to the state-of-the-art method. Moreover, to investigate the effect of dimensionality and the number of heads of the multi-head attention mechanism on the performance of the DLAN model, we have done sufficient sensitivity experiments.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

Multi-attribute group decision-making (MAGDM) is one of the research hotspots in human cognitive and decision-making theory. However, there are still challenges to the existing MAGDM methods in modeling uncertain linguistics of decision-makers’ (DMs’) cognitive information and objectively obtaining weights. Therefore, this paper aims to develop a new MAGDM method considering incomplete known weight information under spherical uncertain linguistic sets (SULSs) to model uncertain information in MAGDM problems. The method mainly includes the following aspects. Firstly, a new concept, which enables an intuitive evaluation of neutral membership and hesitancy degrees at the linguistic evaluation, has been is first developed for capturing the more uncertain information. Secondly, the cosine similarity measure (CSM) and cross-entropy measure (CEM) are widely used to measure ambiguous information because of their robustness of measurement results. The CSM and CEM are extended to SULSs to calculate the DMs’ and attributes weights quantitively, respectively. Thirdly, in terms of effective integration of fuzzy information to obtain more accurate decision results, the Hamy mean (HM) and dual Hamy mean (DHM) operators are valued due to their consideration of the interrelationships between inputs. Two extension operators, named spherical fuzzy uncertain linguistic weight HM and DHM, are proposed to integrate spherical fuzzy uncertain linguistic information in the third stage. In the experiment, a decision case is presented to illustrate the applicability of the proposed method, and results show the effectiveness, flexibility and advantages of the proposed method are demonstrated by numerical examples and comparative analysis.

The development of an accurate electricity demand forecasting model is of paramount importance for promoting global energy efficiency and sustainability. Nonetheless, the presence of outliers and inappropriate model training can result in suboptimal performance. To tackle these challenges, this study explores the potential of Convolutional Neural Network (CNN) and active learning theory as forecasting solutions, offering high efficiency and advantages for long time series. In this study, a hybrid model that combines Isolation Forest (IF), Outlier Reconstruction (OR), CNN and Random Forest (RF) is conducted to mitigate computational complexity and enhance the accuracy of electricity demand forecasting in the presence of outliers. IF is employed to detect outliers in electricity demand time series, while OR is used to reconstruct subsequences based on calendrical heterogeneity for training. CNN is applied for both training and forecasting, and the final output is combined using RF. The effectiveness of the proposed IF-OR-CNN-RF model is validated using electricity data collected from recent sources in Australia at different sampling frequency. The experimental results demonstrate that, in comparison with other popular CNN-based electricity demand forecasting models, IF-OR-CNN-RF model outperforms with significantly improved performance metrics. Specifically, Mean Absolute Error (MAE), Root Mean Squared Error (RMSE) and R-squared values are 77.92, 179.18 and 0.9769 in 5-minute frequency; 162.67, 353.96 and 0.9775 in 10-minute frequency; 841.27, 1374.79 and 0.9622 in 30-minute frequency; 2746.01, 3824.00 and 0.9262 in 60-minute frequency; 9106.08, 12269.04 and 0.8044 in 120-minute frequency. IF-OR-CNN-RF model represents a valuable framework for future electricity demand forecasting, particularly in scenarios involving outliers.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

Visual attention has emerged as a prominent approach for improving the effectiveness of image captioning, as it enables the decoder network to focus selectively on the most salient regions in the image content, thereby facilitating the generation of precise and informative captions. Although visual attention achieves the improvement, the small numerical values of its input have a negative impact on its softmax, decreasing its effectiveness. To address this limitation, we propose a refined visual attention (RVA) framework that internally reweights visual attention by leveraging the language context of previously generated words. We first feed the language context into a fully connected layer to obtain appropriate dimensions for the visual features. Then, we use a sigmoid function to obtain a probability distribution to reweight the softmax’s input by applying the multiplication process. Experiments conducted on the MS COCO dataset demonstrate that RVA outperforms traditional visual attention and other existing image captioning methods, highlighting its effectiveness in enhancing the accuracy and informativeness of image captions.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

The current conventional water resources management planning method realizes the optimal allocation of water resources by constructing a function aiming at economic benefits; it causes poor model planning repercussions as a result of the disregard of comprehensive benefits. In this regard, a hydrological model-based water resource management planning method for climate change is proposed. By combining geological conditions, hydrological conditions and other climate change factors, a hydrological model is constructed to calculate watershed flows, and the hydrological model is used to divide the watershed scale and hydrological response units. A multi-objective function planning model is constructed with economic and ecological benefits as the objective functions. The proposed approach is tested in trials and shown to provide advantages for thorough planning. The results of the study demonstrate that the algorithm has a high value of extensive benefit when the recommended strategy is utilized for the optimum allocation of water resources, and has a more preferable optimal allocation consequence.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

In recent years, significant progress has been made in the study of Chinese vocabulary acquisition, and the research content and scope have gradually expanded. Chinese vocabulary is the foundation for understanding and using language, and any language has developed on the basis of Chinese vocabulary. Many studies have shown that there are many factors that affect the acquisition of Chinese vocabulary, and the impact on Chinese vocabulary acquisition is also different. Among them, the influencing factors of Chinese vocabulary acquisition have gradually become a research hotspot, and a large number of related empirical studies have emerged. Based on the big data technology and the random effect model, this paper comprehensively analyzes whether the influencing factors of Chinese vocabulary acquisition as a second language are significant and investigates the effects of internal and external influencing factors, delayed post-test, specific factors and experimental interval time on the learning effect. External factors significantly impact Chinese vocabulary acquisition, including learning style, input factors and input methods. Through the subgroup analysis of the experimental interval, we find that the effect of Chinese vocabulary acquisition decreases with the extension of the experimental interval. Therefore, this paper holds an inverse relationship between the experimental interval and the development of Chinese vocabulary acquisition.

To protect the historical and cultural heritage, the application of self-organizing mapping networks and genetic algorithms in the restoration of ancient architectural murals is studied. The results show that the average repair time for different types of mural paintings is less than 60 seconds, and the shortest repair time is only 17.81 seconds. The evaluation effect of the research model is good, and the comprehensive efficiency evaluation of the mural restoration work is improved by about 40.42%. The repair system has excellent performance, and the algorithm has high feasibility and effectiveness. The impact of restoring murals is substantial, and the extent of restoration is highly consequential for the restoration of ancient architectural murals.

The distribution system plays a pivotal role in connecting power generation sources to vital facilities like nuclear reactors. In this intricate network, losses occur while supplying electricity, demanding a reduction for enhanced performance. The quality of power reaching the nuclear plant is imperative due to the susceptibility of sensitive equipment to poor power conditions. This study presents a reconfiguration strategy to bolster dependability and curtail power losses in distribution networks. Leveraging the Modified Genetic Optimization Algorithm (MGOA), the reconfiguration conundrum is tactfully addressed to determine optimal switch operation schemes. The MGOA-based reconfiguration not only minimizes energy wastage but also refines voltage profiles, elevating operational efficiency. The effectiveness of this approach is substantiated through its successful application to radial distribution systems comprising 33, 69, and 136 buses. Embracing diverse scenarios encompassing normal and abnormal operating states, as well as varying loads, the method’s robustness is showcased. The validity of the proposed methodology is reinforced by comprehensive simulation results, underscoring its reliability and potential for real-world implementation.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

Lung sound (LS) signals are a vital source of information for the identification of pulmonary disorders. Heart sound (HS) is the most common contaminant of lung sounds during auscultation from the chest walls. This directly affects the efficiency of lung sound processing in diagnosing lung diseases. In this work, Adaptive Variational Mode Decomposition (AVMD) technique is proposed to remove heart sound contaminants from lung sounds. The proposed AVMD method initially breakdown the noisy lung sound signal into a collective of bandlimited modes called variational mode functions (VMF). Then, based on the frequency spectrum, the HS is filtered out from the LS. The real time lung sound data is collected from 95 participants and the performance of VMD technique is evaluated using the statistical metrics measures. Thus, the proposed topology exhibits Higher SNR (29.6587dB, lowest Root Mean Square (RMSE) of 0.0102, lowest normalized Mean Absolute Error (nMAE) of 0.0336, and highest percentage in correlation coefficient Factor (CCF) of 99.79% respectively. These experimental results are found to be superior and outperform all other recently proposed techniques.

The concept of endorsing AI in embedded systems is growing in all sectors including the development of Accident Avoidance Systems. Although real-time road crash prediction is vital for enhancing road user safety, there has been limited focus on the analysis of real-time crash events within ensemble and deep learning fused systems. The main aim of this paper is to design an advanced Accident Avoidance System established on a deep learning and ensemble fusion strategy in order to acquire more performant crash predictions. As such, four highly optimized models for crash prediction have been designed based on the popular ensemble techniques: CatBoost, AdaBoost and Bagging and the deep learning CNN. Additionally, four categories of features, including driver inputs, vehicle kinematics, driver states and weather conditions, were measured during the execution of various driving tasks performed on a driving simulator. Moreover, given the infrequent nature of crash events, an imbalance-control procedure was adopted using the SMOTE and ADASYN techniques. The highest performances results have been acquired using CatBoost along with ADASYN on almost all the adopted metrics during the different weather conditions, and more than 50% of all crashes have occurred in rainy weather conditions, whereas 31% have been exhibited in fog patterns. The sensitivity analysis results indicate that the fusing all the acquired features has the highest impact on the prediction performance. To our knowledge, there has been a limited interest, if not at all, at adopting a fused ensemble deep learning system examining the real-time impact of the adopted features’ combinations on the prediction of road crashes while taking into account class imbalance. The findings provide new insights into crash prediction and emphasize the relevance of the explanatory features which can be endorsed in designing efficient Accident Avoidance Systems.

Quality function deployment (QFD) is a customer-driven product development technique that converts customer requirements (CRs) into design attributes (DAs) of a product and service. Nevertheless, in real situations, the traditional QFD method has been found that possesses some deficiencies, such as the accuracy assessment of relationships between CRs and DAs, and the inter-relationships among DAs. To fill in the above gaps, this study develops a new QFD approach by a CoCoSo-based ranking method under Pythagorean fuzzy environment. To begin with, an extended Pythagorean fuzzy decision-making trial and evaluation laboratory (DEMATEL) method is proposed to identify the relationships within DAs. Second, the aggregation method of the weighted average method and objective penalty function are propounded to construct the programming models for calculating the importance of DAs under Pythagorean fuzzy setting. Third, a new CoCoSo-based ranking method for Pythagorean triangular fuzzy numbers (PTrFNs) is proposed to obtain the ranking of DAs. Lastly, a case regarding “Ping An Health” mobile medical App is carried out to verify the effectiveness and superiority of the proposed QFD approach. The results show that the top DA is perceptibility. Therefore, perceptibility should be focus on firstly in the “Ping An Health” App design, such as system fluency, interface comfort and network stability. Additionally, the results show that the new QFD can express experts’ hesitant assessment information, deal with the interrelations among DAs, and yield more precise rankings of DAs in QFD.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219434.

Relevancy transformation operators (RET operators) have been widely used in fuzzy systems modelling and the construction of weighted aggregation functions. Several construction methods of RET operators based on different aggregation functions such as t-norm, t-conorm and copula, have been proposed. In this paper, the attention is paid to the expression of RET operators, which is an important feature from an application the point of view. Polynomial RET operators are introduced as those RET operators in the form of polynomial functions of two variables. A complete characterisation of polynomial RET operators of degree less than 4 are presented.

Recently, actor-critic architectures such as deep deterministic policy gradient (DDPG) are able to understand higher-level concepts for searching rich reward, and generate complex actions in continuous action space, and widely used in practical applications. However, when action space is limited and has dynamic hard margins, training DDPG can be problematic and inefficiency. Since real-world actuators always have margins and interferences, after initialization, the actor network is likely to be stuck at a local optimal point on action space margin: actor gradient orients to the outside of action space but actuators stop at the margin. If the hard margins are complex, dynamic and unknown to the DDPG agent, it is unable to use penalty functions to recover from local optimum. If we enlarge the random process for local exploration, the training could be in potential risk of failure. Therefore, simply relying on gradient of critic network to train the actor network is not a robust method in real environment. To solve this problem, in this paper we modify DDPG to deep comparative policy (DCP). Rather than leveraging critic-to-actor gradient, the core training process of DCP is regulated by a T-fold compare among random proposed adjacent actions. The performance of DDPG, DCP and related algorithms are tested and compared in two experiments. Our results show that, DCP is effective, efficient and qualified to perform all tasks that DDPG can perform. More importantly, DCP is less likely to be influenced by the action space margins, DCP can provide more safety in avoiding training failure and local optimum, and gain more robustness in applications with dynamic hard margins in the action space. Another advantage is that, complex penalty for margin touching detection is not required, the reward function can always be brief and short.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

For solving the distributed assembly flow shop scheduling problem with fuzzy processing time (FDAPFSP), a regional biogeography-based optimization algorithm (RBBO) is proposed to minimize the maximum fuzzy completion time. The mathematical model is provided. In RBBO, all habitats are divided into regions based on the habitat suitability index, and the habitats of each region are subject to cross-regional migration and replacement procedures. A critical factory optimization strategy is developed to enhance local search capability. Taguchi method is used to determine the parameters of RBBO. In ten FDAPFSP instances, comparative testing of RBBO algorithm with various heuristic and swarm intelligence algorithms are conducted. The computation results show that in ten FDAPFSP cases, the proposed RBBO outperforms other algorithms in nine out of ten FDAPFSP cases.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

Overload service in the communication network of smart substation will cause congestion, resulting in low overload service throughput, high congestion rate and long congestion control time in the average smart substation. A congestion control method for overloaded services in smart substations with high concurrent users is proposed. According to the characteristics of overload service request of smart substation, the mathematical model of the algorithm is defined by describing the overload service request of smart substation on the basis of network topology model. Combined with the wavelength rotation strategy, the congestion rate of overloaded services in smart substations is reduced, and the throughput rate of overloaded services in smart substations is improved. Considering the factors of high concurrent users, by judging and feeding back the congestion of the overloaded services of smart substations, the congestion control of overloaded services of smart substations under high concurrent users is realized. The experimental results show that the proposed method has better effect and scalability in the congestion control of the overloaded service of the smart substation, and can effectively shorten the congestion control time of the overloaded service of the smart substation.

This research presents a novel model for optimizing process information in manufacturing steps through the utilization of Process Constituent Elements (PCE), with the aim of enhancing the effectiveness of product process information design. To achieve this objective, a systematic analysis is conducted on six dimensions: input, output, resources, value-adding activities, environment, and process control and inspection content. In addition, specific attributes of PCE are investigated, and an improved FP-growth algorithm is employed to extract the optimized structural expressions of typical PCE, thus determining specific expression requirements. The PCE and their attribute relationships are organized into modular mapping rules, resulting in an optimized representation structure based on a polychromatic set approach. The effectiveness of this approach is quantitatively assessed by developing a comprehensive quality indicator evaluation system for process information and using a fuzzy comprehensive evaluation model for analysis.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

The accuracy of predicting river-suspended sediment concentration (SSC) is crucial for evaluating the functional lifespan of reservoirs, analyzing river geomorphological evolution, and assessing riverbed stability. In this study, we aim to develop new models for SSC prediction at two hydrological stations near Puerto Rico, USA, by integrating the bacterial foraging optimization algorithm and adaptive neural fuzzy inference network (ANFIS). The models comprise ANFIS with grid partition (ANFIS-GP), ANFIS with subtractive clustering (ANFIS-SC), and ANFIS with fuzzy c-means clustering (ANFIS-FCM). Additionally, we employ an artificial neural network (ANN) and the sediment rating curve (SRC) for predicting daily series data of flow discharge-suspended sediment concentration (SSC). Different scenarios are considered based on varying input and output variables, leading to predictions for four distinct scenarios. At the Rio Valenciano Station, the MRSE values for ANFIS-BFO, ANFIS-FCM, ANFIS-GP, ANFIS-SC, ANN, and SRC are 2.2172, 2.5389, 2.6627, 2.7549, 2.7994, and 3.7882, respectively. For the Quebrada Blanca Station, the MRSE values for ANFIS-BFO, ANFIS-FCM, ANFIS-SC, ANFIS-GP, ANN, and SRC are 0.8295, 0.8664, 0.8964, 0.9110, 0.9684, and 1.6742, respectively. It can be inferred that ANFIS-BFO exhibits superior prediction results compared to all other models. Furthermore, ANFIS-SC and ANFIS-FCM demonstrate slightly better prediction performance than ANFIS-GP. In comparison to ANN, ANFIS-GP, ANFIS-SC, and ANFIS-FCM exhibit slightly superior prediction performance.

Patients with lung cancer can only be diagnosed and treated surgically. Early detection of lung cancer through medical imaging could save numerous lives. Adding advanced techniques to conventional tests that offer high accuracy in diagnosing lung cancer is essential. U-Net has excelled in diversified tasks involving the segmentation of medical image datasets. A significant challenge remains in determining the ideal combination of hyper parameters for designing an optimized U-Net for detailed image segmentation. In our work, we suggested a technique for automatically generating evolutionary U-Nets to detect and segregate lung cancer anomalies. We used three distinct datasets, namely the LIDC-IRDC Dataset, Luna 16 Dataset, and Kaggle Dataset, for training the proposed work on lung images. Our results, examined with six distinct evaluation criteria used for medical image segmentation, consistently demonstrated the highest performance. More specifically, the GA-UNet outperforms conventional approaches in terms of an impressive accuracy rate of 97.5% and a Dice similarity coefficient (DSC) of 92.3%.

Human activity recognition (HAR) plays a crucial role in remotely monitoring the health of the elderly. Human annotation is time-consuming and expensive, especially for abstract sensor data. Contrastive learning can extract robust features from weakly annotated data to promote the development of sensor-based HAR. However, current research mainly focuses on the exploration of data augmentation methods and pre-trained models, disregarding the impact of data quality on label effort for fine-tuning. This paper proposes a novel active contrastive coding model that focuses on using an active query strategy to evenly select small, high-quality samples in downstream tasks to complete the update of the pre-trained model. The proposed uncertainty-based balanced query strategy mines the most indistinguishable hard samples according to the data posterior probability in the unlabeled sample pool, and imposes class balance constraints to ensure equilibrium in the labeled sample pool. Extensive experiments have shown that the proposed method consistently outperforms several state-of-the-art baselines on four mainstream HAR benchmark datasets (UCI, WISDM, MotionSense, and USCHAD). With approximately only 10% labeled samples, our method achieves impressive F1-scores of 98.54%, 99.34%, 98.46%, and 87.74%, respectively.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219434.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219434.

With the rapid growth of Internet penetration, identifying emergency information from network news has become increasingly significant for emergency monitoring and early warning. Although deep learning models have been commonly used in Chinese Named Entity Recognition (NER), they require a significant amount of well-labeled training data, which is difficult to obtain for emergencies. In this paper, we propose an NER model that combines bidirectional encoder representations from Transformers (BERT), bidirectional long-short-term memory (BILSTM), and conditional random field (CRF) based on adversarial training (ATBBC) to address this issue. Firstly, we constructed an emergency dataset (ED) based on the classification and coding specifications of the national emergency platform system. Secondly, we utilized the BERT pre-training model with adversarial training to extract text features. Finally, BILSTM and CRF were used to predict the probability distribution of entity labels and decode the probability distribution into corresponding entity labels.Experiments on the ED show that our model achieves an F1-score of 85.39% on the test dataset, which proves the effectiveness of our model.

In recent years, UNet and its derivative networks have gained widespread recognition as major methods of medical image segmentation. However, networks like UNet often struggle with Point-of-Care (POC) healthcare applications due to their high number of parameters and computational complexity. To tackle these challenges, this paper introduces an efficient network designed for medical image segmentation called MCU-Net, which leverages ConvNeXt to enhance UNet. 1) Based on ConvNeXt, MCU-Net proposes the MCU Block, which employs techniques such as large kernel convolution, depth-wise separable convolution, and an inverted bottleneck design. To ensure stable segmentation performance, it also integrates global response normalization (GRN) layers and Gaussian Error Linear Unit (GELU) activation functions. 2) Additionally, MCU-Net introduces an enhanced Multi-Scale Convolution Attention (MSCA) module after the original UNet’s skip connections, emphasizing medical image features and capturing semantic insights across multiple scales. 3)The downsampling process replaces pooling layers with convolutions, and both upsampling and downsampling stages incorporate batch normalization (BN) layers to enhance model stability during training. The experimental results demonstrate that MCU-Net, with a parameter count of 2.19 million and computational complexity of 19.73 FLOPs, outperforms other segmentation models. The overall performance of MCU-Net in medical image segmentation surpasses that of other models, achieving a Dice score of 91.8% and mIoU of 84.7% on the GlaS dataset. When compared to UNet on the BUSI dataset, MCU-Net shows an improvement of 2% in Dice and 2.9% in mIoU.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

The improved Sparse Signal Reconstruction (SR) algorithm for Trusted Artificial Intelligence (AI) and Distributed Compressed Sensing (DCS) technology was thoroughly investigated. The study verified its effectiveness and advantages in trusted AI and DCS systems, which have significant implications for enhancing the credibility, security, and performance of signal processing and AI algorithms. The reconstruction performance was evaluated using Orthogonal Matching Pursuit (OMP), Basis Pursuit (BP), and Least Absolute Shrinkage and Selection Operator (LASSO). The analysis primarily focused on runtime, refactoring errors, and the number of successful reconstruction attempts. When K = 4, K = 6, K = 8, and K = 10, OMP outperformed BP and LASSO in terms of successful reconstructions, demonstrating better performance and higher reconstruction precision.

As the theory of picture fuzzy sets has been developed, more information in life can be expressed in mathematical terms. Similarity measure is a special tool for quantifying the similarity between two sets, so studying similarity measure on picture fuzzy sets has become a trending topic. This new research direction has drawn a great deal of attention from experts and has led to a number of important results which have led to significant results in a number of practical applications. By examining these new findings, we discovered that there are many studies on similarity measure of picture fuzzy sets, some of them are deficient in solving certain problems, and such similarity measures can lead to the calculation of unreasonable data in practical applications, affecting the final results. Secondly, there is still room for research similarity measures on exponential functions. Considering these two aspects, we propose two new similarity measures based on exponential function, which not only satisfy the axiomatic definition of similarity measures, but also show reasonable computational results in practical applications.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219434.

Recently, the neutrosophic graph has been introduced as an extension of fuzzy graphs and intuitionistic fuzzy graphs, which offers more compatibility and flexibility than these two types in modeling and structuring many actual issues. In this article, using neutrosophic highly strong arc, the new notions of (totally) special irregular, highly special irregular, strongly special irregular, neighborly special irregular and special arc-irregular of neutrosophic graphs are stated. Finally, one of their utilizations relevant to offering a fixed optimization model in decision making in diverse conditions is presented. In fact,we present a decision-making problem in real-world applied example which discusses the factors influencing a companys efficiency. The presented model is, in fact, a factor-based model wherein the impact score of each factor is divided into two types of direct and indirect influences, in which the concept of neutrosophic special dominating set plays a significant role.

Previously, single classification models were mainly studied to classify human protein cell images, i.e., to identify a certain protein based on a set of different cells. However, a classifier can identify only one protein, in fact, a single cell usually consists of multiple proteins, and the proteins are not completely independent of each other. In this paper, we build a human protein cell classification model by multi-label learning. The logical relationship and distribution characteristics among the labels are analyzed to determine the different proteins contained in a set of different cells (i.e., containing multiple elements in the output space). In this paper, using human protein image data, we conducted comparison experiments on pre-trained Xception and InceptionResnet V2 to optimize the two models in terms of data augmentation, channel settings, and model structure. The results show that the Optimized InceptionResnet V2 model achieves high performance in the classification task. The final accuracy of the Optimized InceptionResnet V2 model we obtained reached 96.1%, which is a 2.82% improvement relative to that before the optimized model.

In this study, it is aimed to integrate CODAS method with circular intuitionistic fuzzy sets as a new solution method for MCDM problems. Containing a radius notation with degrees of central membership and non-membership degrees is the main advantage of circular intuitionistic fuzzy in decision making. On the other side, Combinative Distance-based Assessment (CODAS) method contains many advantages such as basing on two types of distance calculations (Euclidean and Taxicab distances) comparing with other MCDM methods. When the advantages of circular intuitionistic fuzzy sets and CODAS method are considered, proposed circular intuitionistic fuzzy CODAS method (CIFS-CODAS) presents many superiorities compared to other MCDM techniques. By this way, an application for green logistics park location selection will be handled by using CIFS-CODAS to show the validity of the methodology. After, a comparative analysis with intuitionistic fuzzy CODAS (IFS-CODAS), intuitionistic fuzzy TOPSIS (IFS-TOPSIS) and intuitionistic fuzzy EDAS (IFS-EDAS) methods will be performed for green logistics park location selection problem to confirm the robustness of presented method. Green logistics and Green Deal are also emphasized considering environmental factors as a scope of the article. Finally, the results will be evaluated in the context of the logistics sector and green logistics.

A novel approach to enhance software testing through intelligent test case selection is proposed in this work. The proposed method combines feature extraction, clustering, and a hybrid optimization algorithm to improve testing effectiveness while reducing resource overhead. It employs a context encoder to extract relevant features from software code, enhancing the accuracy of subsequent testing. Through the use of Fuzzy C-means (FCM) clustering, the test cases are classified into groups, streamlining the testing process by identifying similar cases. To optimize feature selection, a Hybrid Whale Optimized Crow Search Algorithm (HWOCSA), which intelligently combines the strengths of both Whale Optimization Algorithm (WOA) and Crow Search Algorithm (CSA) is introduced. This hybrid approach mitigates limitations while maximizing the selection of pertinent features for testing. The ultimate contribution of this work lies in the proposal of a multi-SVM classifier, which refines the test case selection process. Each classifier learns specific problem domains, generating predictions that guide the selection of test cases with unprecedented precision. Experimental results demonstrate that the proposed method achieves remarkable improvements in testing outcomes, including enhanced performance metrics, reduced computation time, and minimized training data requirements. By significantly streamlining the testing process and accurately selecting relevant test cases, this work paves the way for higher quality software updates at a reduced cost.

Relative pupillary afferent disorder (RAPD) plays a crucial role in diagnosing optic nerve dysfunction. This paper introduces an innovative equipment design with a high-speed pupil detection algorithm and a binocular independent stimulation optical path. The proposed algorithm utilizes the grayscale characteristics of the pupil region to achieve rapid and accurate pupil detection and tracking. Initially, a pupil threshold is estimated using eigenvalues, enabling the calculation of the pupil centroid. Subsequently, leveraging the unique characteristics of the pupil region, a dynamic tracking algorithm, a second-order partial derivative threshold algorithm, and a pupil diameter extraction algorithm are employed to precisely locate the centroid. By incorporating a binocular independent stimulus light path design, the algorithm overcomes limitations associated with the current measurement equipment. The experimental results demonstrate the algorithm’s high robustness and fast detection speed, meeting the tracking speed requirement of 1250 frames per second for a single eye. These advancements have the potential to significantly enhance the diagnosis and assessment of optic nerve dysfunction.

Feature selection can remove data noise and redundancy and reduce computational complexity, which is vital for machine learning. Because the difference between nominal attribute values is difficult to measure, feature selection for hybrid information systems faces challenges. In addition, many existing feature selection methods are susceptible to noise, such as Fisher, LASSO, random forest, mutual information, rough-set-based methods, etc. This paper proposes some techniques that consider the above problems from the perspective of fuzzy evidence theory. Firstly, a new distance incorporating decision attributes is defined, and then a relation between fuzzy evidence theory and fuzzy β covering with an anti-noise mechanism is established. Based on fuzzy belief and fuzzy plausibility, two robust feature selection algorithms for hybrid data are proposed in this framework. Experiments on 10 datasets of various types have shown that the proposed algorithms achieved the highest classification accuracy 11 times out of 20 experiments, significantly surpassing the performance of the other 6 state-of-the-art algorithms, achieved dimension reduction of 84.13% on seven UCI datasets and 99.90% on three large-scale gene datasets, and have a noise tolerance that is at least 6% higher than the other 6 state-of-the-art algorithms. Therefore, it can be concluded that the proposed algorithms have excellent anti-noise ability while maintaining good feature selection ability.

Convolutional neural networks (CNNs) have received significant attention for change detection (CD) on multimodal remote sensing images, but they struggle to capture global cues due to the locality of convolution operations. In contrast, the transformer can learn global semantic information by dividing the input image into patches, adding position encodings, and utilizing the self-attention mechanism. Motivated by this, we propose mSwinUNet, a novel end-to-end multi-modal model with swin-transformer-based and U-shaped siamese network architectures for supervised CD using Sentinel-1 Synthetic Aperture Radar (SAR) and Sentinel-2 Multispectral Imager (MSI) data. mSwinUNet contains multi-modal encoder with difference module, bottleneck, and fused decoder, and all of them are based on swin transformer. Firstly, tokenized multi-modal bitemporal image patches are fed into multiple Siamese encoder branches to extract multi-level multi-modal difference feature maps in parallel. Subsequently, the last level multi-modal difference maps are fused to generate the smallest scale change map in the bottleneck. Then, the hierarchical decoder incorporates patch expansion and fusion operations to fuse multi-scale difference and change maps, effectively recuperating the details of the change information. Finally, the last patch expansion and a linear projection are applied to output the final change map, which preserves the identical spatial resolution as the input image. Extensive experiments have shown that mSwinUNet outperforms several the state-of-the-art multi-modal CD methods on OSCD dataset and the corresponding Sentinel-1 SAR data.

Accurate segmentation of knee cartilage in MR images is crucial for early diagnosis and treatment of knee conditions. Manual segmentation is time-consuming, leading researchers to explore automatic deep learning methods. However, the choice between 2D and 3D networks for organ segmentation remains debated. In this paper, we propose a hybrid 2D and 3D deep neural network approach, named UVNet, which combines the strengths of both techniques to enhance segmentation performance. Within this network structure, the 3D segmentation network serves as the backbone for feature extraction, while the 2D segmentation network functions as an information supplement network. Local and global MIP images are generated by employing various maximum intensity projection modes of knee MRI volumes as input for the information supplement network. By constructing a local and global MIP feature fusion module, the supplementary information obtained from the 2D segmentation network is fully integrated into the backbone network. We assess the quality of the proposed method using the Osteoarthritis Initiative (OAI) dataset and the 2010 Grand Challenge Knee Image Segmentation (SKI-10) dataset, comparing it to the Baseline Network and other advanced 2D and 3D segmentation methods. The experiments demonstrate that UVNet achieves competitive performance in the aforementioned two cartilage segmentation tasks.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This research investigates the presence of unique solutions and quasi-uniform stability for a class of fractional-order uncertain BAM neural networks utilizing the Banach fixed point concept, the contraction mapping principle, and analysis techniques. In order to guarantee the equilibrium point of fractional-order BAM neural networks with undetermined parameters, some new adequate criteria are devised, and both time delays result in quasi-uniform stability. The acquired results, which are simple to verify in practice, enhance and extend several earlier research works in some ways. Finally, two illustrative examples are provided to show the value of the suggested outcomes.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219434.

Structure learning is the core of graph model Bayesian Network learning, and the current mainstream single search algorithm has problems such as poor learning effect, fuzzy initial network, and easy falling into local optimum. In this paper, we propose a heuristic learning algorithm HC-PSO combining the HC (Hill Climbing) algorithm and PSO (Particle Swarm Optimization) algorithm, which firstly uses HC algorithm to search for locally optimal network structures, takes these networks as the initial networks, then introduces mutation operator and crossover operator, and uses PSO algorithm for global search. Meanwhile, we use the DE (Differential Evolution) strategy to select the mutation operator and crossover operator. Finally, experiments are conducted in four different datasets to calculate BIC (Bayesian Information Criterion) and HD (Hamming Distance), and comparative analysis is made with other algorithms, the structure shows that the HC-PSO algorithm is superior in feasibility and accuracy.

The Aquila optimization (AO) algorithm has the drawbacks of local optimization and poor optimization accuracy when confronted with complex optimization problems. To remedy these drawbacks, this paper proposes an Enhanced aquila optimization (EAO) algorithm. To avoid elite individual from entering the local optima, the elite opposition-based learning strategy is added. To enhance the ability of balancing global exploration and local exploitation, a dynamic boundary strategy is introduced. To elevate the algorithm’s convergence rapidity and precision, an elite retention mechanism is introduced. The effectiveness of EAO is evaluated using CEC2005 benchmark functions and four benchmark images. The experimental results confirm EAO’s viability and efficacy. The statistical results of Freidman test and the Wilcoxon rank sum test are confirmed EAO’s robustness. The proposed EAO algorithm outperforms previous algorithms and can useful for threshold optimization and pressure vessel design.

The main contribution of this review work is to show how various control techniques are used to manage the speed of Permanent Magnet Synchronous Motor (PMSM). The PMSM’s are mostly used in electric vehicles, electric traction and high performance industrial drive applications. In this article conventional sensorless techniques are compared with machine learning techniques such as fuzzy logic, artificial neural network and neuro-fuzzy controllers to control the speed of PMSM drive based on vector control approach. The benefits of machine learning techniques used in sensorless PMSM drive are easy to design, less execution time and fast access speed control. The various controlling techniques used in controller along with its complexity, advantages and drawbacks are discussed in this article. The above mentioned controlling techniques are implemented and simulated by using MATLAB R2019b/Simulink software based on sensorless Model Reference Adaptive System (MRAS) with the help of Field Oriented Control (FOC) strategy of PMSM drive. By comparing the all sensorless controlling techniques in simulation study, it is identified that the combination of neuro-fuzzy controller gives the best speed control performance than other controllers.

Cross-efficiency evaluation is an extension of data envelopment analysis (DEA), which can effectively distinguish between decision-making units (DMUs) through self- and peer-evaluation. The cross-efficiency of each DMU in a set of DMUs is measured in terms of intervals when the input–output data are represented by the number of intervals. Based on the interval cross-efficiency matrix, the interval entropy is defined in terms of the likelihood. Then, considering the influence of peer evaluation, the interval conditional cross-efficiency entropy is proposed and an aggregation model of the interval conditional cross-efficiency entropy is presented to create a ranking index for DMUs. Finally, a simple example is provided to illustrate the effectiveness of the proposed method, which is applied to the evaluation of forest carbon sink efficiency in China. The results indicate that the final cross-efficiencies of all 30 provinces range from 0 to 0.6. Among these provinces, those with a relatively high efficiency include Guangdong, Guizhou, Hainan, Shandong, and Qinghai.

In the E-commerce environment, conversations between customers and businesses contain lots of useful information about customer sentiment. By mining that information, customer sentiment can be validly identified, which is helpful in accurately identifying customer needs and improving customer satisfaction. For conversational sentiment analysis, most existing approaches take contextual information into account. On this basis, we focus on the degree of association between utterances, which can more effectively capture overall and useful sentiment information in conversation. For this purpose, we propose a hybrid model to recognize customer sentiment in conversation. The model obtains utterance vectors with sentiment information through Sentiment Knowledge Enhanced Pre-training (SKEP), then uses the bidirectional long short-term memory network (BiLSTM) to generate contextual semantic information, and further obtains customer sentiment information by applying the self-attention mechanism to focus on the degree of association between utterances. The experimental results on the JD Dialog dataset show that our model can more accurately recognize customer sentiment than other baseline models in customer service conversation.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This paper defines an improved similarity degree based on inclusion degree as well as advanced information system based on interval coverage and credibility, and thus an attribute reduction framework embodying 4×2 = 8 reduct algorithms is systematically constructed for application and optimization in interval-valued decision systems. Firstly, a harmonic similarity degree is constructed by introducing interval inclusion degree and harmonic average mechanism, which has better semantic interpretation and robustness. Secondly, interval credibility degree and coverage degree are defined for information fusion, and they are combined to propose a δ-fusion condition entropy. The improved condition entropy achieves the information reinforcement and integrity by dual quantization fusion of credibility and coverage, and it obtains measure development from granularity monotonicity to non-monotonicity. In addition, information and joint entropies are also constructed to obtain system equations. Furthermore, 8 reduct algorithms are designed by using attribute significance for heuristic searches. Finally, data experiments show that our five novel reduct algorithms are superior to the three contrast algorithms on classification performance, which also further verify the effectiveness of proposed similarity degree, information measures and attribute reductions.

Selecting suppliers for prefabricated components (PCs) involves a complex decision-making process, frequently relying on ambiguous information and subjective judgment. However, most existing methods use precise values to portray indicator information and overlook the uncertainty of weights and the subjective preferences of decision-makers (DMs). In order to address these limits, this paper proposes a novel approach to select suppliers of PCs. Initially, an evaluation index system for suppliers is established through literature analysis and a questionnaire survey. The system comprises six layers: product quality, price, service level, comprehensive ability, supply ability, and environmental sustainability. The group decision matrix is then constructed using the set-valued statistical method and the prospect theory. The index weights are determined by a combination weighting method. Next, the cobweb model is introduced to analyze the disparity between the alternative and ideal solutions, describing their similarities in terms of area and shape. Lastly, cobweb similarity is employed instead of comprehensive distance, combined with the minimum sum of squares criterion, to improve the closeness algorithm and contrast the alternatives. The results demonstrate that this method facilitates a comprehensive evaluation of the benefits and drawbacks of various alternatives from diverse perspectives. Furthermore, it allows flexible adjustments based on the risk preferences of DMs, ensuring accurate and reliable decision results.

As an important extension of classical rough sets, local rough set model can effectively process data with noise. How to effectively calculate three approximation regions, namely positive region, negative region and boundary region, is a crucial issue of local rough sets. Existing calculation methods for approximation regions are based on conditional probability, the time complexity is O (|X||U||C|). In order to improve the computational efficiency of three approximation regions of local rough sets, we propose a double-local conditional probability based fast calculation method. First, to improve the computational efficiency of equivalence class, we define the double-local equivalence class. Second, based on the double-local equivalence class, we define the double-local conditional probability. Finally, given the probability thresholds and a local equivalence class, the monotonicity of double-local conditional probability is proved, on this basis, a double-local conditional probability based fast calculation method for approximation regions of local rough sets is proposed, and the time complexity is O (MAX (|X|²|C|, |X||X ^C ||C|)). Experimental results based on 9 datasets from UCI demonstrate the effectiveness of the proposed method.

How to better grasp students’ learning preferences in the environment of rapid development of engineering and science and technology so as to guide them to high-quality learning is one of the important research topics in the field of educational technology research today. In order to achieve this goal, this paper utilizes the LDA (Latent Dirichlet Allocation) model for text mining of the survey results on the basis of a survey on students’ self-perception evaluation. The results show that the LDA model is capable of extracting terms from text, fuzzy identifying groups of students at different levels and presenting potential logical relationships between the groups, and further analyzing the learning preferences of students at different levels for IT courses. Based on the student’s learning needs, this paper proposes recommendations for developing students’ learning effectiveness. The LDA method proposed in this paper is a feasible and effective method for assessing students’ learning dynamics as it generates cognitive content about students’ learning and allows for the timely discovery of students’ learning expectations and cutting-edge dynamics.

This research mainly evaluates the synergistic effect of “dual carbon” and high-quality economic development from four aspects: carbon reduction, pollution reduction, green expansion, and economic growth. Firstly, an indicator system of synergistic effect evaluation is constructed, and a FOPA-Cloud evaluation model is proposed based on the FOPA (Fuzzy Ordinal Priority Approach) and Cloud model. Based on the evaluation of experts’ language variables, it is calculated that a province’s “dual carbon” and high-quality economic development generally belong to a high-level synergistic effect. However, further improvement is still needed in reducing carbon, pollution reduction, and green expansion. The tedious work of pairwise comparison can be overcome in the FOPA-Cloud model. Optimizing and solving to determine the weight of each indicator can not only determine the overall level but also analyze specific reasons, which can provide a basis for improving the synergistic effect of “dual carbon” and high-quality economic development.

Most existing RGB-D salient object detection (SOD) methods extract features of both modalities in parallel or adopt depth features as supplementary information for unidirectional interaction from depth modality to RGB modality in the encoder stage. These methods ignore the influence of low-quality depth maps, and there is still room for improvement in effectively fusing RGB features and depth features. To address the above problems, this paper proposes a Feature Interaction Network (FINet), which performs bi-directional interaction through feature interaction module (FIM) in the encoder stage. The feature interaction module is divided into two parts: depth enhancement module (DEM) filters the noise in the depth features through the attention mechanism; and cross enhancement module (CEM) effectively interacts RGB features and depth features. In addition, this paper proposes a two-stage cross-modal fusion strategy: high-level fusion adopts the semantic information of high level for coarse localization of salient regions, and low-level fusion makes full use of the detailed information of low level through boundary fusion, and then we progressively refine high-level and low-level cross-modal features to obtain the final saliency prediction map. Extensive experiments show that the proposed model achieves better performance than eight state-of-the-art models on five standard datasets.

The dual probabilistic linguistic term sets (DPLTSs) are more effective than PLTSs in solving the problem of multi-attribute group decision-making (MAGDM). In this paper, an improved TOPSIS method is developed combining the TOPSIS method and projection measure of DPLTS to supplement the existing research. Firstly, considering the mathematical characteristics of DPLTS, this paper defines the concepts of the module, cosine function, and projection of DPLTS, and then proves the mathematical properties of the cosine function. Secondly, considering the uncertainty of decision-making problems, the weight-solving models are established respectively under the condition that the weight information is completely unknown and partially known. Furthermore, a novel DPLPrj-TOPSIS approach is established based on the projection measure proposed. It involves integrating experts’ DPLTS evaluations, normalizing different DPLTSs, calculating alternatives’ relative closeness and score, etc. Secondly, the proposed method’s feasibility is demonstrated through a case study that entails selecting network promotion plans for food manufacturers. Finally, the proposed method’s effectiveness and validity are verified by comparing and analyzing it with the traditional TOPSIS method based on a distance measure and other existing decision methods.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219434.

The reliability level of general aviation fleet system directly affects the economic benefits and safe operation of general aviation fleet. In order to effectively evaluate the reliability level of general aviation fleet, using the entropy weight variable fuzzy recognition and 1D-CNN depth learning reliability evaluation method. Firstly, taking the Cessna 172 general aviation fleet as the research object, refers to the maintenance statistical analysis of general aviation fleet reliability data, and classifies the fleet reliability evaluation indexes according to the ATA100 chapter standard. Combined with index importance analysis and Delphi expert investigation, 14 key items are extracted as reliability evaluation indexes of general aviation fleet. Secondly, using entropy weight method to obtain indexes weight objectively, and the evaluation level membership function is constructed based on variable fuzzy recognition method. Finally, a reliability evaluation model based on 1D-CNN deep learning method was established. Through training and testing the reliability data evaluation model of general aviation fleet, and comparing with the results of evaluation methods such as support vector machines. The results show that the recognition rate of the 1D-CNN deep learning method based on entropy weight variable fuzzy recognition can reach 91.95%, verifying the objective effectiveness of the evaluation method.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219434.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

Rolling bearings are a key component of rotating machinery and their health directly affects the safe operation of mechanical equipment. Therefore, fault diagnose for rolling bearings is very important. The fault diagnosis process of rolling bearings includes three stages: signal decomposition, feature extraction, and pattern recognition. Variational mode decomposition (VMD) can suppress end effects, but improper parameter settings will cause information losses or excessive decomposition. In this work, an improved whale optimization algorithm (IWOA) is applied to parameter settings of VMD. Correspondingly, an IWOA-VMD signal decomposition method is proposed. The decomposed signal is combined with a Laplace score method and classifier to remove the redundancy and noise in the feature set and obtain a low-dimensional sensitive feature subset. Then, aiming at the problem of the parameter settings of a least squares support vector machine (LSSVM) affecting the recognition performance and accuracy, a salp swarm algorithm (SSA) is used to globally optimize the penalty parameter and kernel width in the LSSVM to establish an SSA-LSSVM fault recognition model. This model is applied to the fault diagnosis of rolling bearings. In particular, rolling bearing fault samples at Case Western Reserve University are used to verify the method. The results indicate that the proposed method is effective and improves the speed and accuracy of fault diagnosis.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

The purpose of the Chinese similar case matching task is to compare the similarity of two case texts with a given anchor text and find out which text is more similar to the anchor text. In the area of law, it plays an important role and has been of interest to many researchers. Previous approaches have compared legal texts only at the text semantic level, without incorporating article information of law. In addition, the position correlation of words in case texts is often important, but it has not been considered in previous approaches. This paper proposes a method which extracts features from the semantic similarity level and from the level of related articles of law, respectively, to enable similarity comparisons of legal case texts. When similarity comparisons are made at the semantic similarity level, a novel capsule network method is proposed based on siamese structure that introduces the position correlation and the routing mechanism within the capsule network is improved so that deep text features between case pairs can be learned. When similarity comparisons are made at the level of related articles of law, related articles of law are selected and coded and interacted with the case text features to generate legal features. Experiment is conducted with a real-world legal text dataset, and the proposed model outperformed all baseline models, demonstrating effectiveness of the proposed model. Further, to confirm the generality of the improved capsule network proposed in the paper on long text datasets, this paper also carried out experiments on two long text datasets, demonstrating effectiveness of the improved capsule network proposed in the model.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

The influence maximization problem is one of the hot research topics in the field of complex networks in recent years. The so-called influence maximization problem is how to select the seed set that propagates the largest amount of information on a given network. In practical applications, networks are often exposed to complicated environments, and both link-specific and node-specific attacks can have a significant impact on the network’s propagation performance. Several pilot studies have revealed the crux of the robust influence maximization problem, but the current work available is not comprehensive. On the one hand, existing studies only consider the case that the network structure is stable or under link-specific attacks, and few researches have concentrated on the case when the network structure is under node-specific attacks. On the other hand, the current algorithm fails to combine the information of the search process well to solve the robust influence maximization problem. Aiming at these deficiencies, in this paper, a metric for evaluating the robust influence performance of seeds under node-specific attacks is developed. Guided by this, a genetic algorithm (GA) maintaining the principle of diversity concern (DC) to solve the Robust Influence Maximization (RIM) problem is designed, called DC-GA-RIM. DC-GA-RIM contains several problem-orientated operators and fully considers diverse information in the optimization process, which significantly improves the search ability of the algorithm. The effectiveness of DC-GA-RIM in solving the RIM problem is demonstrated on a variety of networks. The superiority of this algorithm over other approaches is shown.

As a complex uncertain differential equation, how to solve the multi-dimensional uncertain differential equation is a complicated and difficult problem. This paper will be devoted to the α-path of some special multi-dimensional uncertain differential equations, namely, multi-factor uncertain differential equations, nested uncertain differential equations and multi-factor nested uncertain differential equations. The α-path method is used to study the numerical solution problems of the above three special multi-dimensional uncertain differential equations. At the same time, the inverse uncertainty distributions and expected values of these three special multi-dimensional uncertain differential equations are also obtained. At last, the numerical algorithm examples are given to verify it.

Text summarization (TS) plays a crucial role in natural language processing (NLP) by automatically condensing and capturing key information from text documents. Its significance extends to diverse fields, including engineering, healthcare, and others, where it offers substantial time and resource savings. However, manual summarization is a laborious task, prompting the need for automated text summarization systems. In this paper, we propose a novel strategy for extractive summarization that leverages a generative adversarial network (GAN)-based method and Bidirectional Encoder Representations from Transformers (BERT) word embedding. BERT, a transformer-based architecture, processes sentence bidirectionally, considering both preceding and following words. This contextual understanding empowers BERT to generate word representations that carry a deeper meaning and accurately reflect their usage within specific contexts. Our method adopts a generator and discriminator within the GAN framework. The generator assesses the likelihood of each sentence in the summary while the discriminator evaluates the generated summary. To extract meaningful features in parallel, we introduce three dilated convolution layers in the generator and discriminator. Dilated convolution allows for capturing a larger context and incorporating long-range dependencies. By introducing gaps between filter weights, dilated convolution expands the receptive field, enabling the model to consider a broader context of words. To encourage the generator to explore diverse sentence combinations that lead to high-quality summaries, we introduce various noises to each document within our proposed GAN. This approach allows the generator to learn from a range of sentence permutations and select the most suitable ones. We evaluate the performance of our proposed model using the CNN/Daily Mail dataset. The results, measured using the ROUGE metric, demonstrate the superiority of our approach compared to other tested methods. This confirms the effectiveness of our GAN-based strategy, which integrates dilated convolution layers, BERT word embedding, and a generator-discriminator framework in achieving enhanced extractive summarization performance.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

Microaneurysms, tiny, circular red dots that occur in retinal fundus images, are one of the earliest symptoms of diabetic retinopathy. Because microaneurysms are small and delicate, detecting them can be difficult. Their small size and cunning character make automatic detection of them difficult. In this study, a novel encoder-decoder network is proposed to segment the MAs automatically and accurately. The encoder part mainly consists of three parts: a low-level feature extraction module composed of a dense connectivity block (Dense Block), a High-resolution Block (HR Block), and an Atrous Spatial Pyramid Pooling (ASPP) module, of which the latter two modules are used to extract high-level information. Therefore, the network is named a Multi-Level Features based Deep Convolutional Neural Network (MF-DCNN). The proposed decoder takes advantage of the multi-scale features from the encoder to predict MA regions. Compared with the existing methods on three datasets, it is proved that the proposed method is better than the current excellent methods in the segmentation results of the normal and abnormal fundus. In the case of fewer network parameters, MF-DCNN achieves better prediction performance on intersection over union (IoU), dice similarity coefficient (DSC), and other evaluation metrics. MF-DCNN is lightweight and able to use multi-scale features to predict MA regions. It can be used to automatically segment the MA and assist in computer-aided diagnosis.

The analytical structure plays an important role in system design and stability analysis of FLC. Structure analysis of traditional IT2 TS FLCs using Zadeh min operator and KM algorithm requires multiple IC dividing, which results in complex calculation and cumbersome parameter adjustment. This article proposes a new IT2 TS FLC by adopting product-type operator and NT algorithm. The proposed controller has such advantages: 1)use product-type operator to skip the partitioning in fuzzy inference process;2) use NT algorithm to avoid determining switching points and sorting rule consequents in type-reduction process. Then, the controller is proved to be universal approximator and sufficient condition is deduced. Finally, we derive the analytical structure of the controller by substituting the parameters, and study the relationship between the uncertainty parameter θ and the analytical structure when the rule consequents are symmetric or asymmetric. Both the computational costs during operation and the computational workload for structural analysis can be reduced significantly by using the new FLC.

In this paper, we provide some new characterizations of L-convex systems. For this purpose, we first introduce the concept of partial hull operators and establish the categorical relationship between partial hull operators and convex systems. Then we abstract the relationship between a subset and its partially convex hull in convex system to a binary relation, called enclosed relation. Moreover, we prove that the enclosed relations are equivalent to convex systems. Subsequently, we generalize the concept of partial hull operators and enclosed relations to the fuzzy case, which will be called L-partial hull operators and L-enclosed relations respectively. Finally we explore the categorical isomorphisms between them.

The present study focuses on the implementation of Deep Reinforcement Learning (Deep-RL) techniques for a parallel manipulator robot, specifically the Delta Robot, within a simulated setting. We introduced a simulation framework designed to guide the Delta Robot’s end-effector to a designated spatial point accurately. Within this environment, the robotic agent undergoes a learning process grounded in trial and error. It garners positive rewards for successful predictions regarding the next action and faces negative repercussions for inaccuracies. Through this iterative learning mechanism, the robot refines its strategies, thereby establishing improved decision-making rules based on the ever-evolving environment states. Our investigation delved into three distinct Deep-RL algorithms: the Deep Q-Network Algorithm (DQN), the Double Deep Q-Network (DDQN), and the Trust Region Policy Optimization Algorithm (TRPO). All three methodologies were adept at addressing the challenge presented, and a comprehensive discussion of the findings is encapsulated in the subsequent sections of the paper.

Recent advances in high-throughput electron microscopy (EM) have revolutionized the examination of microstructures by enabling fast EM image generation. However, accurately segmenting EM images remains challenging due to inherent characteristics, including low contrast and subtle grayscale variations. Moreover, as manually annotated EM images are limited, it is usually impractical to utilize deep learning techniques for EM image segmentation. To address these challenges, the pyramid multiscale channel attention network (PmcaNet) is specifically designed. PmcaNet employs a convolutional neural network-based architecture and a multiscale feature pyramid to effectively capture global context information, enhancing its ability to comprehend the intricate structures within EM images. To enable the rapid extraction of channel-wise dependencies, a novel attention module is introduced to enhance the representation of intricate nonlinear features within the images. The performance of PmcaNet is evaluated on two general EM image segmentation datasets as well as a homemade dataset of superalloy materials, regarding pixel-wise accuracy and mean intersection over union (mIoU) as evaluation metrics. Extensive experiments demonstrate that PmcaNet outperforms other models on the ISBI 2012 dataset, achieving 87.85% pixel-wise accuracy and 73.11% mean intersection over union (mIoU), while also advancing results on the Kathuri and SEM-material datasets.

In order to accurately estimate the disparity of ill-posed regions, such as weak texture and occlusion regions, we propose DSPANet, a stereo matching network that incorporates a dual-stream pyramid module and a channel and spatial attention module. The dual-stream pyramid module captures numerous complementary features from different layers by utilizing multi-resolution inputs and feature extraction blocks. This approach enables the learning of local detailed features at various scales. These features at various scales are then combined to calculate the stereo matching cost. By incorporating channel and spatial attention module into the feature extraction process to obtain richer and more concise contextual information, the matching cost can be constructed more accurately, which provides powerful conditions for subsequent cost aggregation. In the cost aggregation stage, we utilize the stacked hourglass module for both encoding and decoding. Additionally, we incorporate 3D global attention upsampling during the decoding stage, which enables high-level features to provide guidance information to low-level features in a simple way. We evaluate our proposed method on the Scene Flow dataset, as well as the KITTI2012 and KITTI2015 datasets. The experimental results demonstrate that our DSPANet achieves superior performance and effectively enhances the matching results in ill-posed regions. Our code has been implemented using PyTorch and will be released after paper publication at https://github.com/Shi-LiQing/DSPANet.

In practical applications of machine learning, only part of data is labeled because the cost of assessing class label is relatively high. Measure of uncertainty is abbreviated as MU. This paper explores MU for partially labeled real-valued data via a discernibility relation. First, a decision information system with partially labeled real-valued data (p-RVDIS) is separated into two decision information systems: one is the decision information system with labeled real-valued data (l-RVDIS) and the other is the decision information system with unlabeled real-valued data (u-RVDIS). Then, based on a discernibility relation, dependence function, conditional information entropy and conditional information amount, four degrees of importance on an attribute subset in a p-RVDIS are defined. They are calculated by taking the weighted sum of l-RVDIS and u-RVDIS based on the missing rate, which can be considered as four MUs for a p-RVDIS. Combining l-RVDIS and u-RVDIS provides a more accurate assessment of the importance and classification ability of attribute subsets in a p-RVDIS. This is precisely the novelty of this paper. Finally, experimental analysis on several datasets verify the effectiveness of these MUs. These findings will contribute to the comprehension of the essence of the uncertainty in a p-RVDIS.

In order to further enhance energy conservation and emission reduction, the header lifting structure of a harvester is studied. First, a double electric pushrod structure is used to replace the oil cylinder and air cylinder lifting structure of a traditional header to reduce fuel consumption and harmful gas emission. Furthermore, a mathematical model and a simulation model of the electric pushrod are established. To enhance the control effect of the header lifting structure, an improved version of the traditional gray wolf optimization (GWO) algorithm is designed. The nonlinear convergence factor, Kent chaotic mapping and convergence surrounding and spiral updating operations are introduced to increase the convergence speed and optimization accuracy of this algorithm. The improved GWO (IGWO) algorithm is applied to optimize the proportional-integral-derivative (PID) controller of the double pushrod coordinated control system. Then, a new IGWO-PID control algorithm is also designed. The cross-coupling control strategy of header’s double pushrods is then studied. Results of the simulation and bench test show that the IGWO-PID control algorithm and the cross-coupling control strategy can effectively enhance controlling effect of the harvester header. The left and right pushrods can achieve good synchronous and coordinated movements.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

To improve the accuracy of fault diagnosis for recoil systems under multiple operating conditions, a fuzzy RBF neural network (Radial Basis Function, RBF) fault diagnosis method based on knowledge and data fusion is proposed. A kinetic model for the recoil system is first established to describe the system’s behavior. Next, fuzzy RBF neural network is used to establish the relationship between abnormal operating parameters and fault causes, achieving a fault cause diagnosis accurately based on the integration of expert experience knowledge and system operation data. A study case demonstrate that the algorithm has strong knowledge and data fusion capabilities and can effectively identify faults in recoil system.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

Intelligent Transportation Systems (ITS) have experienced significant growth over the past decade thanks to advances in control, communication, and information technology applied to vehicles, roads, and traffic control systems. Vehicle type classification plays a vital role in implementing ITS because of its ability to collect useful traffic information, enable future development of transport infrastructures, and increase human comfort. As a branch of machine learning, deep learning represents a frontier for artificial intelligence, which seeks to be closer to its primary goal. Deep learning is a powerful tool for classifying vehicle types because it can capture complex traffic data characteristics and learn from large amounts of data. This means that it can be used to accurately classify traffic data and generate valuable insights that can be used to improve traffic management. Researchers have successfully adopted these algorithms as a solution to propose optimal vehicle-type classification strategies. This paper highlights the role of deep learning algorithms in solving the vehicle type classification problem, reviewing the state-of-the-art approaches in this field.

Coconut farming is a significant agricultural activity in South India, but the coconut trees face challenges due to adverse weather conditions and environmental factors. These challenges include various leaf diseases and pest infestations. Identifying and locating these issues can be difficult because of the large foliage and shading provided by the coconut trees. Recent research has shown that Computer Vision algorithms are becoming increasingly important for solving problems related to object identification and detection. So, in this work, the YOLOv4 algorithm was employed to detect and pinpoint diseases and infections in coconut leaves from images. The YOLOv4 model incorporates advanced features such as cross-stage partial connections, spatial pyramid pooling, contextual feature selection, and path-based aggregation. These features enhance the model’s ability to efficiently identify issues such as yellowing and drying of leaves, pest infections, and leaf flaccidity in coconut leaf images taken in various environmental conditions. Furthermore, the model’s predictive accuracy was enhanced through multi-scale feature detection, PANet feature learning, and adaptive bounding boxes. These improvements resulted in an impressive 88% F1-Score and an 85% Mean Average Precision. The model demonstrates its effectiveness and robustness even when dealing with medium-resolution images, offering improved accuracy and speed in disease and pest detection on coconut leaves.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219434.

Domain adaptation (DA) technology has the ability to solve fault diagnosis (FD) problems under variable operating conditions. However, DA technology faces two issues: (1) in general, vibration signals inevitably contain noise, which makes it difficult to extract discriminant features.(2) there are unknown fault types in target domain. These issues will lead to poor diagnostic performance. To solve above issues, a new cross-domain open-set transfer FD method called feature improvement adversarial network (FIAN) is proposed in this article. Specifically, to alleviate noise interference, a feature improvement module (FIM) is proposed and embedded into the backbone convolutional neural network to form new feature extractor. FIM uses soft threshold function to enhance important information and suppresses redundant information. Furthermore,open-set DA by back-propagation (OSBP) is introduced into FIAN. OSBP can predict the probability that a target domain sample belongs to an unknown category, so that it can effectively identify unknown and known category samples. Experimental results demonstrated its effectiveness and superiority in two bearing datasets.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

Electrochemical energy storage battery fault prediction and diagnosis can provide timely feedback and accurate judgment for the battery management system(BMS), so that this enables timely adoption of appropriate measures to rectify the faults, thereby ensuring the long-term operation and high efficiency of the energy storage battery system. Based on the idea of data driven, this paper applies the Long-Short Term Memory(LSTM) algorithm in the field of artificial intelligence to establish the fault prediction model of energy storage battery, which can realize the prediction of the voltage difference over-limit fault according to the operation data of the energy storage battery, and introduce the parameter of the difference between maximum voltage and minimum voltage(DMM) at the cluster level to quantitatively determine whether the battery cluster has a fault. It provides powerful guidance and effective methods for the safe and stable operation of electrochemical energy storage power stations.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

Although deep learning models show powerful performance, they are still easily deceived by adversarial samples. Some methods for generating adversarial samples have the drawback of high time loss, which is problematic for adversarial training, and the existing adversarial training methods are difficult to adapt to the dynamic nature of the model, so it is still challenging to study an efficient adversarial training method. In this paper, we propose an adversarial training method, the core of which is the improved adversarial sample generation method AGFAT for adversarial training and the improved dynamic adversarial training method AGFAT-DAT. AGFAT uses a word frequency-based approach to identify significant words, filter replacement candidates, and use an efficient semantic constraint module as a means to reduce the time of adversarial sample generation; AGFAT-DAT is a dynamic adversarial training approach that uses a cyclic attack on the model after adversarial training and generates adversarial samples for adversarial training again. It is demonstrated that the proposed method can significantly reduce the generation time of adversarial samples, and the adversarial-trained model can also effectively defend against other types of word-level adversarial attacks.

In order to solve the problem of discrete manufacturing customization and personalized production scheduling, considering the influence of manual labor on processing time, we propose a multi-objective Hybrid Job-shop Scheduling with Multiprocessor Task(HJSMT) problem with cooperative effect model. Based on the actual production, two optimization objectives are set, i. e. minimizing the maximum completion time and the total tardiness. Firstly, considering the situation where workers’ cooperation reduces job processing time, the cooperative effect of workers co-processing is considered by referring to the learning effect curve in the model. Subsequently, we develop an Improved Non-dominated Sorting Genetic Algorithm-II (INSGA-II) to solve the multi-objective HJSMT problem by improving Precedence Operation Crossover (POX) and Multiple Mutations (MM) operations. Finally, the scheduling results and the C values are compared with other algorithms to verify the effectiveness of the algorithm. Simultaneously, the multi-objective HJSMT problem with the cooperative effect is solved by the INSGA-II algorithm, and the experimental results also demonstrate the superior performance of the algorithm.

Type B semigroups are described as the generalized inverse semigroups in the range of abundant semigroup. Motivated by studying fuzzy congruences in inverse semigroups, and as a continuation of N. Kuroki’s work in inverse semigroups and our work in abundant semigroups in terms of fuzzy subsets, this paper considers fuzzy admissible congruences on some classes of type B semigroups. Our main purpose is to show when a fuzzy admissible congruence on a type B semigroup with E-properties is E-properties preserving. In particular, we get some sufficient and necessary conditions for some classes of type B semigroups to be primitive, E-unitary and E-reflexive, respectively. As an application, we extend our results to the cases of inverse semigroups.

Conducted electromagnetic emissions from interconnecting cables in computer systems can lead to internal information leakage and cause information security problems. However, unintentionally leaked EM signals are characterized by low signal-to-noise ratio and random noise, making it difficult to recover the original signal. In this paper, we propose a denoising model (S-DnCNN) based on an improved DnCNN to better recover the original signal. The network structure consists of three parts: feature mapping generation, low-dimensional feature extraction, and original reconstruction. To improve the noise extraction capability, we use Leaky ReLU as the activation function of the CNN, and introduce a residual structure and a convolutional attention module. The residual structure uses residual hopping to implicitly remove potentially clean images by hidden layer operations, thus training noisy data to recover clean data. We construct a one-dimensional selective convolution kernel (SKConv1d) and fuse it with local paths to form a feature extraction network, which improves the performance of the network. The experimental results show that our proposed method can preserve the details in the effective signal during denoising and shows good generalization to complex SNR data.

Under the highly valued environment of intelligent breeding, rapid and accurate detection of pigs in the breeding process can scientifically monitor the health of pigs and improve the welfare level of pigs. At present, the methods of live pig detection cannot complete the detection task in real time and accurately, so a pig detection model named TR-YOLO is proposed. Using cameras to collect data at the pig breeding site in Rongchang District, Chongqing City, LabelImg software is used to mark the position of pigs in the image, and data augmentation methods are used to expand the data samples, thus constructing a pig dataset. The lightweight YOLOv5n is selected as the baseline detection model. In order to complete the pig detection task more accurately, a C3DW module constructed by depth wise separable convolution with large convolution kernels is used to replace the C3 module in YOLOv5n, which enhances the receptive field of the whole detection model; a C3TR module constructed by Transformer structure is used to extract more refined global feature information. Contrast with the baseline model YOLOv5n, the new detection model does not increase additional computational load, and improves the accuracy of detection by 1.6 percentage points. Compared with other lightweight detection models, the new detection model has corresponding advantages in terms of parameter quantity, computational load, detection accuracy and so on. It can detect pigs in feeding more accurately while satisfying the real-time performance of target detection, providing an effective method for live monitoring and analysis of pigs at the production site.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

The adoption of online banking is a big challenge as well as an emergent paradigm which is evolving quickly. The study develops a new exploration model that is used to determine significant constructs of the UTAUT theory that influence the adoption of online-banking. A study was conducted through an online survey of online banking users. Three methods were used; firstly, PLS-SEM was used to determine which of the constructs have a significant impact on behavioral intention to use e-banking, secondly, an incorporated neural network model was used to classify the relative impact of significant variables obtained from PLS-SEM, and finally a hybrid procedure is incorporated from PLS-SEM to initialize the Fuzzy TOPSIS. The findings of the research paper constitute the ranked results and a comparison between them. The results of PLS-SEM and ANN analysis showed the same ranking for the constructs, while the decision making method Fuzzy TOPSIS introduced some changes in the ranking. This study presents valuable insights for the banking system to bring effective projects that increase the possibilities of using online banking.

Selecting appropriate Cluster Heads (CHs) can significantly enhance the lifetime of the wireless sensor networks (WSNs). Fuzzy logic is an effective approach for CH election. However, existing fuzzy-logic-based CH election methods usually require a large number of fuzzy rules, making the CH election procedure inefficiency. In this study, a data-driven CH election method is proposed based on a compact set of fuzzy rules, which are learned by group sparse Takagi-Sugeno-Kang (GS-TSK) fuzzy system. Specifically, five linguistic variables were first used as features to describe the status of sensor nodes. After that, a compact set of fuzzy rules were learned by GS-TSK, and they were then used to predict the chance of each sensor node becoming a CH. Based on the selected CHs, the clusters are generated. Simulation results show that the GS-TSK can select CHs with fewer rules more accurately. Besides, by using the proposed DD-FLC, an average improvement of WSN was shown in terms of first node dead (FND), 10% of nodes dead (10PND), quarter of nodes dead (QND), half of nodes dead (HND).

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219434.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433.

In order to address the problem of decreased accuracy in vehicle object detection models when facing low-light conditions in nighttime environments, this paper proposes a method to enhance the accuracy and precision of object detection by using the image translation technology based on the Generative Adversarial Network (GAN) in the field of computer vision, specifically the CycleGAN, from the perspective of improving the training set of object detection models. This is achieved by transforming the existing well-established daytime vehicle dataset into a nighttime vehicle dataset. The proposed method adopts a comparative experimental approach to obtain translation models with different degrees of fitting by changing the training set capacity, and selects the optimal model based on the evaluation of the effect. The translated dataset is then used to train the YOLO-v5-based object detection model, and the quality of the nighttime dataset is evaluated through the evaluation of annotation confidence and effectiveness. The research results indicate that utilizing the translated nighttime vehicle dataset for training the object detection model can increase the area under the PR curve and the peak F1 score by 10.4% and 9% respectively. This approach improves the annotation accuracy and precision of vehicle object detection models in nighttime environments without requiring additional labeling of vehicles in monitoring videos.

With the advancement of modern medical concepts, the beneficial effects of music on human health have gradually become accepted, and the corresponding music therapy has gradually become a new research direction that has received much attention in recent years. However, folk music has certain peculiarities that lead to the fact that there is no efficient way of selecting repertoire that can be carried out directly throughout the repertoire selection. This paper combines deep learning theory with ethnomusic therapy based on previous research and proposes a deep learning-based approach to ethnomusic therapy song selection. Since the feature extraction process in the traditional sense has insufficient information on each frame, excessive redundancy, inability to process multiple frames of continuous music signals containing relevant music features and weak noise immunity, it increases the computational effort and reduces the efficiency of the system. To address the above shortcomings, this paper introduces deep learning methods into the feature extraction process, combining the feature extraction process of the Deep Auto-encoder (DAE) with the music classification process of Gaussian mixture model, which forms a new DAE-GMM music classification model. Finally, in terms of music therapy selection, this paper compares the music selection method based on co-matrix and physiological signal with the one in this paper. From the theoretical and simulation plots, it can be seen that the method proposed in this paper can achieve both good music classifications from a large number of music and further optimize the process of music therapy song selection from both subjective and objective aspects by considering the therapeutic effect of music on patients. Through this article research results found that the depth of optimization feature vector to construct double the accuracy of the classifier is higher, in addition, compared with the characteristics of the original optimization classification model, using the gaussian mixture model can more accurately classify music, the original landscape “hometown” score of 0.9487, is preferred, insomnia patients mainly ceramic flute style soft tone, without excitant, low depression, have composed of nourishing the heart function.

Automobiles have undergone a transformation during the past two decades due to the merger of the electronics and automotive industries. The combination of autos and electronic sensors has resulted in a new generation of vehicles known as autonomous vehicles (AVs). These AVs have a few hundred thousand sensors, producing an enormous amount of raw data for computation. Data from the vehicular network can be offloaded to existing telecommunication infrastructure to address the problem of processing resources. In order to address vehicular network requirements, large-capacity servers deployed in major telecommunications networks are first used to offload resource-intensive tasks. Mobile Cloud Computing (MCC) is a critical enabling technology for 5 G networks, which has a key feature of offloading to divide application tasks into local and cloud server execution components. This paper proposes a novel Three TierEdge cloud computing (T² EC²) system which uses an Energy-aware Dynamic Task offloading and collaborative task execution algorithm (EA-DTOCTE) for multilayer vehicular cloud computing networks. The EA-DTOCTE algorithm is included in the decision-making engine in the proposed system, which selects whether to offload the task to the remote environment or implement it locally. EA-DTOCTE focuses on consumption of energy by tasks both locally and remotely since its goal is to efficiently and dynamically split the application into tasks and schedule them on local devices and cloud resources. The proposed T² EC² has been evaluated in terms of parameters such as energy consumption, completion time, and throughput. Experimental results indicate that the proposed T²EC² can save up to 28% of system energy consumption compared with other state-of-art techniques.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219434.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219434.

In the past couple of years, neural networks have gained widespread use in network security analysis. This type of analysis is usually performed in a nonlinear and highly correlated manner. Due to the immense amount of data traffic, the current models are prone to false alarms and poor detection. Deep-learning models can help security researchers identify and extract data features that are related to an attack. They can also minimize the data’s dimensionality and detect intrusions. Unfortunately, the complexity of the network structure and hidden neurons of a deep-learning model can be set by error-prone procedures. In order to improve the performance of deep learning models, a new algorithm is proposed. This method combines a gradient boost regression and particle swarm optimization. The proposes a method called the Spark-DBN-SVM-GBR algorithm. The simulations conducted proposed algorithm revealed that it has a better accuracy rate than other deep learning models and the experiments conducted on the PSO-GBR algorithm revealed that it performed better than the current optimization technique when detecting unauthorized attack activities.

The conjugate gradient (CG) techniques are a class of unconstrained optimization algorithms with strong local and global convergence qualities and minimal memory needs. While the quasi-Newton methods are reliable and efficient on a wide range of problems and these methods are converge faster than the conjugate gradient methods and require fewer function evaluations, however, they are request substantially more storage, and if the problem is ill-conditioned, they may require several iterations. There is another class, termed preconditioned conjugate gradient method, it is a technique that combines two methods conjugate gradient with quasi-Newton. In this work, we proposed a new two limited memory preconditioned conjugate gradient methods (New1 and New2), to solve nonlinear unconstrained minimization problems, by using new modified symmetric rank one (NMSR1) and new modified Davidon, Fletcher, Powell (NMDFP), and also using projected vectors. We proved that these modifications fulfill some conditions. Also, the descent condition of the new technique has been proved. The numerical results showed the efficiency of the proposed new algorithms compared with some standard nonlinear, unconstrained problems.