Publications

Software quality analysis with the use of computational intelligence

LLM4CMO: Large Language Model-aided Algorithm Design for Constrained Multiobjective Optimization

Constrained multi-objective optimization problems (CMOPs) frequently arise in real-world applications where multiple conflicting objectives must be optimized under complex constraints. Existing dual-population two-stage algorithms have shown promise by leveraging infeasible solutions to improve solution quality. However, designing high-performing constrained multi-objective evolutionary algorithms (CMOEAs) remains a challenging task due to the intricacy of algorithmic components. Meanwhile, large language models (LLMs) offer new opportunities for assisting with algorithm design; however, their effective integration into such tasks remains underexplored. To address this gap, we propose LLM4CMO, a novel CMOEA based on a dual-population, two-stage framework. In Stage 1, the algorithm identifies both the constrained Pareto front (CPF) and the unconstrained Pareto front (UPF). In Stage 2, it performs targeted optimization using a combination of hybrid operators (HOps), an epsilon-based constraint-handling method, and a classification-based UPF-CPF relationship strategy, along with a dynamic resource allocation (DRA) mechanism. To reduce design complexity, the core modules, including HOps, epsilon decay function, and DRA, are decoupled and designed through prompt template engineering and LLM-human interaction. Experimental results on six benchmark test suites and ten real-world CMOPs demonstrate that LLM4CMO outperforms eleven state-of-the-art baseline algorithms. Ablation studies further validate the effectiveness of the LLM-aided modular design. These findings offer preliminary evidence that LLMs can serve as efficient co-designers in the development of complex evolutionary optimization algorithms. The code associated with this article is available at https://anonymous.4open.science/r/LLM4CMO971.

Analog Programmable Distance Calculation Circuit for Winner Takes All Neural Network Realized in the CMOS Technology

This paper presents a programmable analog current-mode circuit used to calculate the distance between two vectors of currents, following two distance measures. The Euclidean (L2) distance is commonly used. However, in many situations, it can be replaced with the Manhattan (L1) one, which is computationally less intensive, whose realization comes with less power dissipation and lower hardware complexity. The presented circuit can be easily reprogrammed to operate with one of these distances. The circuit is one of the components of an analog winner takes all neural network (NN) implemented in the complementary metal-oxide-semiconductor 0.18- [Formula: see text] technology. The learning process of the realized NN has been successfully verified by the laboratory tests of the fabricated chip. The proposed distance calculation circuit (DCC) features a simple structure, which makes it suitable for networks with a relatively large number of neurons realized in hardware and operating in parallel. For example, the network with three inputs occupies a relatively small area of 3900 μm(2). When operating in the L2 mode, the circuit dissipates 85 [Formula: see text] of power from the 1.5 V voltage supply, at maximum data rate of 10 MHz. In the L1 mode, an average dissipated power is reduced to 55 [Formula: see text] from 1.2 V voltage supply, while data rate is 12 MHz in this case. The given data rates are provided for the worst case scenario, where input currents differ by 1%-2% only. In this case, the settling time of the comparators used in the DCC is quite long. However, that kind of situation is very rare in the overall learning process.

A neural network algorithm for testing stuck-open faults in CMOS combinational circuits

Two nonparametric models for fusing heterogeneous fuzzy data

Two models are discussed that integrate heterogeneous fuzzy data of three types: real numbers, real intervals, and real fuzzy sets. The architecture comprises three modules: 1) an encoder that converts the mixed data into a uniform internal representation; 2) a numerical processing core that uses the internal representation to solve a specified task; and 3) a decoder that transforms the internal representation back to an interpretable output format. The core used in this study is fuzzy clustering, but there are many other operations that are facilitated by the models. Two schemes for encoding the data and decoding it after clustering are presented. One method uses possibility and necessity measures for encoding and several variants of a center of gravity defuzzification method for decoding. The second approach uses piecewise linear splines to encode the data and decode the clustering results. Both procedures are illustrated using two small sets of heterogeneous fuzzy data.

Cross-Platform Distributed Product Online Ratings Aggregation Approach for Decision Making with Basic Uncertain Linguistic Information

Fuzzy Aggregation Method Using Fisherface and Wavelet Decomposition for Face Recognition

In this paper, we propose the fuzzy aggregation method for face recognition based on subimage sets decomposed by wavelets. The proposed approach consists of four main stages. The first stage uses the wavelet decomposition that helps extract intrinsic features of face images. The second stage of the approach applies a fisherface method to these four subimages obtained by wavelet decomposition. The choice of the fisherface method in this setting is motivated by its insensitivity to large variation in light direction, face pose, and facial expression. The last two phases are concerned with the aggregation of the individual classifiers by means of the fuzzy integral. The experiments use an n-fold cross-validation to assure high consistency of the classification results. The experimental results obtained for the Yale face databases reveal that the approach presented in this paper yields better classification performance in comparison with the results obtained by other recognition methods.

AFS Fuzzy Classifiers

Multi-valued model checking IoT and intelligent systems with commitment protocols in multi-source data environments

Adaptive Feature Selection-Based AdaBoost-KNN With Direct Optimization for Dynamic Emotion Recognition in Human–Robot Interaction

AdaBoost-KNN using adaptive feature selection with direct optimization is proposed for dynamic emotion recognition in human-robot interaction, where the real-time dynamic emotion is recognized based on facial expression. It can make robots capable of understanding human dynamic emotions, in such a way that human-robot interaction is realized in a smooth manner. Based on the facial key points extracted by Candide-3 model, adaptive feature selection is adopted, namely Plus-L Minus-R Selection is completed. It can determine the features that contribute the most to emotion recognition, thereby forming the basis of emotion classification. Emotion classification is based on AdaBoost-KNN, which builds a series of KNN classifiers. AdaBoost-KNN adjusts the weights of the data in an iterative manner. Moreover, global optimal parameters are approximated with direct optimization until the recognition rate reaches its maximal value. The experimental performance of the proposal is verified by a k-fold cross-validation. Results show that the recognition rate of the proposed approach is higher than that of the AdaBoost-KNN, adaptive feature selection-based AdaBoost-KNN, and AdaBoost-KNN with direct optimization. It is also higher than the rate achieved by other traditional recognition methods, such as AdaBoost, KNN, and SVM. In addition, preliminary application experiments are developed in our emotional social robot system, composed of two mobile robots. The experiments demonstrate the dynamic emotion understanding ability of robots in human-robot interaction.

Relationship Between Ratio Analysis, DEA-R and DEA Models

Neuro-fuzzy algorithms

Key Points Estimation and Point Instance Segmentation Approach for Lane Detection

Perception techniques for autonomous driving should be adaptive to various environments. In the case of traffic line detection, an essential perception module, many condition should be considered, such as number of traffic lines and computing power of the target system. To address these problems, in this paper, we propose a traffic line detection method called Point Instance Network (PINet); the method is based on the key points estimation and instance segmentation approach. The PINet includes several stacked hourglass networks that are trained simultaneously. Therefore the size of the trained models can be chosen according to the computing power of the target environment. We cast a clustering problem of the predicted key points as an instance segmentation problem; the PINet can be trained regardless of the number of the traffic lines. The PINet achieves competitive accuracy and false positive on the TuSimple and Culane datasets, popular public datasets for lane detection. Our code is available at https://github.com/koyeongmin/PINet_new

IEEE Transactions on Systems, Man, and Cybernetics publication information

Neurofuzzy Systems

Approximate Solutions of Fuzzy Relation Equations

A true random number generator based on parallel STT-MTJs

Random number generators are an essential part of cryptographic systems. For the highest level of security, true random number generators (TRNG) are needed instead of pseudorandom number generators. In this paper, the stochastic behavior of the spin transfer torque magnetic tunnel junction (STT-MTJ) is utilized to produce a TRNG design. A parallel structure with multiple MTJs is proposed that minimizes device variation effects. The design is validated in a 28-nm CMOS process with Monte Carlo simulation using a compact model of the MTJ. The National Institute of Standards and Technology (NIST) statistical test suite is used to verify the randomness quality when generating encryption keys for the Transport Layer Security or Secure Sockets Layer (TLS/SSL) cryptographic protocol. This design has a generation speed of 177.8 Mbit/s, and an energy of 0.64 pJ is consumed to set up the state in one MTJ.

Granular Data Regression with Neural Networks