• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.7
• /
• pp.1951-1975
• /
• 2023

Recent advances in Cognitive Radio Networks (CRN) have elevated them to the status of a critical instrument for overcoming spectrum limits and achieving severe future wireless communication requirements. Collaborative spectrum sensing is presented for efficient channel selection because spectrum sensing is an essential part of CRNs. This study presents an innovative cooperative spectrum sensing (CSS) model that is built on the Firefly Algorithm (FA), as well as machine learning artificial neural networks (ANN). This system makes use of user grouping strategies to improve detection performance dramatically while lowering collaboration costs. Cooperative sensing wasn't used until after cognitive radio users had been correctly identified using energy data samples and an ANN model. Cooperative sensing strategies produce a user base that is either secure, requires less effort, or is faultless. The suggested method's purpose is to choose the best transmission channel. Clustering is utilized by the suggested ANN-FA model to reduce spectrum sensing inaccuracy. The transmission channel that has the highest weight is chosen by employing the method that has been provided for computing channel weight. The proposed ANN-FA model computes channel weight based on three sets of input parameters: PU utilization, CR count, and channel capacity. Using an improved evolutionary algorithm, the key principles of the ANN-FA scheme are optimized to boost the overall efficiency of the CRN channel selection technique. This study proposes the Artificial Neural Network with Firefly Algorithm (ANN-FA) for cognitive radio networks to overcome the obstacles. This proposed work focuses primarily on sensing the optimal secondary user channel and reducing the spectrum handoff delay in wireless networks. Several benchmark functions are utilized We analyze the efficacy of this innovative strategy by evaluating its performance. The performance of ANN-FA is 22.72 percent more robust and effective than that of the other metaheuristic algorithm, according to experimental findings. The proposed ANN-FA model is simulated using the NS2 simulator, The results are evaluated in terms of average interference ratio, spectrum opportunity utilization, three metrics are measured: packet delivery ratio (PDR), end-to-end delay, and end-to-average throughput for a variety of different CRs found in the network.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.5 no.1
• /
• pp.52-64
• /
• 1995

Robot manipulator is a highly nonlinear-time varying system. Therefore, a lot of control theory has been applied to the system. Robot manipulator has two types of control; one is path planning, another is path tracking. In this paper, we select the path tracking, and for this purpose, propose the intelligent control¬ler which is combined with fuzzy logic and neural network. The fuzzy logic provides an inference morphorlogy that enables approximate human reasoning to apply to knowledge-based systems, and also provides a mathematical strength to capture the uncertainties associated with human cognitive processes like thinking and reasoning. Based on this fuzzy logic, the fuzzy logic controller(FLC) provides a means of converhng a linguistic control strategy based on expert knowledge into automahc control strategy. But the construction of rule-base for a nonlinear hme-varying system such as robot, becomes much more com¬plicated because of model uncertainty and parameter variations. To cope with these problems, a auto-tuning method of the fuzzy rule-base is required. In this paper, the GA-based Fuzzy-Neural control system combining Fuzzy-Neural control theory with the genetic algorithm(GA), that is known to be very effective in the optimization problem, will be proposed. The effectiveness of the proposed control system will be demonstrated by computer simulations using a two degree of freedom robot manipulator.

• The Journal of Information Systems
• /
• v.26 no.3
• /
• pp.63-90
• /
• 2017

Purpose This study proposes a novel system trading model using case-based reasoning (CBR) based on absolute similarity threshold. The proposed model is designed to optimize the absolute similarity threshold, feature selection, and instance selection of CBR by using genetic algorithm (GA). With these mechanisms, it enables us to yield higher returns from stock market trading. Design/Methodology/Approach The proposed CBR model uses the absolute similarity threshold varying from 0 to 1, which serves as a criterion for selecting appropriate neighbors in the nearest neighbor (NN) algorithm. Since it determines the nearest neighbors on an absolute basis, it fails to select the appropriate neighbors from time to time. In system trading, it is interpreted as the signal of 'hold'. That is, the system trading model proposed in this study makes trading decisions such as 'buy' or 'sell' only if the model produces a clear signal for stock market prediction. Also, in order to improve the prediction accuracy and the rate of return, the proposed model adopts optimal feature selection and instance selection, which are known to be very effective in enhancing the performance of CBR. To validate the usefulness of the proposed model, we applied it to the index trading of KOSPI200 from 2009 to 2016. Findings Experimental results showed that the proposed model with optimal feature or instance selection could yield higher returns compared to the benchmark as well as the various comparison models (including logistic regression, multiple discriminant analysis, artificial neural network, support vector machine, and traditional CBR). In particular, the proposed model with optimal instance selection showed the best rate of return among all the models. This implies that the application of CBR with the absolute similarity threshold as well as the optimal instance selection may be effective in system trading from the perspective of returns.

• Journal of the Korean Geotechnical Society
• /
• v.15 no.4
• /
• pp.113-132
• /
• 1999

Recently in Korea, application of the soil nailing is gradually extended to the sites of excavations and slopes having various ground conditions and field characteristics. Design of the soil nailing is generally carried out in two steps, The First step is to examine the minimum safety factor against a sliding of the reinforced nailed-soil mass based on the limit equilibrium approach, and the second step is to check the maximum displacement expected to occur at facing using the numerical analysis technique. However, design parameters related to the soil nailing system are so various that a reliable design method considering interrelationships between these design parameters is continuously necessary. Additionally, taking into account the anisotropic characteristics of in-situ grounds, disturbances in collecting the soil samples and errors in measurements, a systematic analysis of the field measurement data as well as a rational technique of the optimum design is required to improve with respect to economical efficiency. As a part of these purposes, in the present study, a procedure for the optimum design of a soil nailing excavation wall system is proposed. Focusing on a minimization of the expenses in construction, the optimum design procedure is formulated based on the genetic algorithm. Neural network theory is further adopted in predicting the maximum horizontal displacement at a shotcrete facing. Using the proposed procedure, various effects of relevant design parameters are also analyzed. Finally, an optimized design section is compared with the existing design section at the excavation site being constructed, in order to verify a validity of the proposed procedure.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.3 s.303
• /
• pp.17-28
• /
• 2005

Recently intelligent characters in computer games have been an important element more and more because they continually stimulate gamers' interests. As a typical method for implementing such intelligent characters, neural networks have been used for training action patterns of opponent's characters and game rules. However, some of the game rules can be abruptly changed and action properties of garners in on-line game environments are quite different according to gamers. In this paper, we address how a neural network adapts to those environmental changes. Our adaptation solution includes two components: an individual adaptation mechanism and a group adaptation mechanism. With the individual adaptation algorithm, an intelligent character steadily checks its game score, assesses the environmental change with taking into consideration of the lastly earned scores, and initiates a new learning process when a change is detected. In multi-user games, including massively multiple on-line games, intelligent characters confront diverse opponents that have various action patterns and strategies depending on the gamers controlling the opponents. The group adaptation algorithm controls the birth of intelligent characters to conserve an equilibrium state of a game world by using a genetic algorithm. To show the performance of the proposed schemes, we implement a simple fighting action game and experiment on it with changing game rules and opponent characters' action patterns. The experimental results show that the proposed algorithms are able to make intelligent characters adapt themselves to the change.

• The Journal of Korean Association of Computer Education
• /
• v.6 no.2
• /
• pp.33-40
• /
• 2003

Criticality prediction models that determine whether a design entity is fault-prone or non fault-prone play an important role in reducing system development costs because the problems in early phases largely affect the quality of the late products. Real-time systems such as telecommunication systems are so large that criticality prediction is mere important in real-time system design. The current models are based on the technique such as discriminant analysis, neural net and classification trees. These models have some problems with analyzing causes of the prediction results and low extendability. This paper builds a new prediction model, GAM, based on Genetic Algorithm. GAM is different from other models because it produces a criticality function. So GAM can be used for comparison between entities by criticality. GAM is implemented and compared with a well-known prediction model, BackPropagation neural network Model(BPM), considering Internal characteristics and accuracy of prediction.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.6
• /
• pp.47-52
• /
• 2002

The wavelet functions are originated from scaling functions and can be used as activation function in the hidden node of the network by deciding two parameters such as scale and center. In this paper, we would like to propose the mixed structure. When we compose the WNN using wavelet functions, we propose to set a single scale function as a node function together. The properties of the proposed structure is that while one scale function approximates the target function roughly, the other wavelet functions approximate it finely. During the determination of the parameters, the wavelet functions can be determined by the global search algorithm such as genetic algorithm to be suitable for the suggested problem. Finally, we use the back-propagation algorithm in the learning of the weights.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.3
• /
• pp.27-38
• /
• 2000

This paper proposes how the recurrent neural network controller for a Khepera mobile robot with an obstacle avoiding ability can be determined by co-adaptation of the evolution and learning, The proposed co-adaptation scheme consists of two folds： a population of NN controllers are evolved by the genetic algorithm so that the degree of obstacle avoidance might be reduced through the global searching and each NN controller is trained by CRBP learning so that the running behavior is adapted to its outer environment through the local searching. Experimental results shows that the NN controller coadapted by evolution and learning outperforms its non-learning equivalent evolved by only genetic algorithm in both the ability of obstacle avoidance and the convergence speed reaching to the required running behavior.

• Smart Structures and Systems
• /
• v.19 no.4
• /
• pp.341-350
• /
• 2017

Based on the super elastic properties of the shape memory alloy (SMA) and the inverse piezoelectric effect of piezoelectric (PZT) ceramics, a kind of hybrid semi-active control device was designed and made, its mechanical properties test was done under different frequency and different voltage. The local search ability of genetic algorithm is poor, which would fall into the defect of prematurity easily. A kind of adaptive immune memory cloning algorithm(AIMCA) was proposed based on the simulation of clone selection and immune memory process. It can adjust the mutation probability and clone scale adaptively through the way of introducing memory cell and antibody incentive degrees. And performance indicator based on the modal controllable degree was taken as antigen-antibody affinity function, the optimization analysis of damper layout in a space truss structure was done. The structural seismic response was analyzed by applying the neural network prediction model and T-S fuzzy logic. Results show that SMA and PZT friction composite damper has a good energy dissipation capacity and stable performance, the bigger voltage, the better energy dissipation ability. Compared with genetic algorithm, the adaptive immune memory clone algorithm overcomes the problem of prematurity effectively. Besides, it has stronger global searching ability, better population diversity and faster convergence speed, makes the damper has a better arrangement position in structural dampers optimization leading to the better damping effect.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.4
• /
• pp.35-41
• /
• 2002

To solve the large scale optimization problem approximately, various approaches have been introduced. They are mainly based on recent research advancement of simulations for evolutions, flocking, annealing, and interactions among organisms on artificial environments. The typical ones are simulated annealing(SA), artificial neural network(ANN), genetic algorithms(GA), tabu search(TS), etc. Recently the particle swarm optimization(PSO) has been introduced. The PSO simulates the process of birds flocking or fish schooling for food, as with the information of each agent Is share by other agents. The PSO technique has been applied to various optimization problems of which variables are continuous. However, there are seldom trials for visualization of searching process. This paper proposes a new visualization tool for searching process particle swarm optimization(PSO) algorithm. The proposed tool is effective for understanding the searching process of PSO method and educational for students.