• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.23-31
• /
• 2011

The simple bacteria cooperative optimization (sBCO) algorithm that we developed as one of optimization algorithms has shown relatively good performances, but their performances were limited by step-by-step movement of individuals at a time. In order to solve this problem, we proposed a new method that assigned a speed to each individual according to its rank and it was confirmed that it improved the performances of sBCO in some degree. In addition to the assigning of speed to the individuals, we employed a new mutation operation that most existing evolutionary algorithms used in order to enhance the performances of sBCO in this paper. A specific percent of bad individuals are mutated within an area that is proportion to the rank of the individual in the mutation operation. That is, Gaussian noise of large standard deviation is added as the fitness of individuals is low. From this, the probability that the individuals with lower ranks can be located far from its parent will be increased. This causes that the probability of falling into local optimum areas is decreased and the probability of fast escaping the local optimum areas is increased. From experimental results with four function optimization problems, we showed that the performances of sBCO with mutation operation and individual speed were increased. If the optimization function is quite complex, however, the performances are not always better. We should devise a new method for solving this problem as a further work.

• Structural Engineering and Mechanics
• /
• v.63 no.4
• /
• pp.429-438
• /
• 2017

Structural design has an imperative role in deciding the failure possibility of a Reinforced Concrete (RC) structure. Recent research works achieved the goal of predicting the structural failure of the RC structure with the assistance of machine learning techniques. Previously, the Artificial Neural Network (ANN) has been trained supported by Particle Swarm Optimization (PSO) to classify RC structures with reasonable accuracy. Though, keeping in mind the sensitivity in predicting the structural failure, more accurate models are still absent in the context of Machine Learning. Since the efficiency of multi-objective optimization over single objective optimization techniques is well established. Thus, the motivation of the current work is to employ a Multi-objective Genetic Algorithm (MOGA) to train the Neural Network (NN) based model. In the present work, the NN has been trained with MOGA to minimize the Root Mean Squared Error (RMSE) and Maximum Error (ME) toward optimizing the weight vector of the NN. The model has been tested by using a dataset consisting of 150 RC structure buildings. The proposed NN-MOGA based model has been compared with Multi-layer perceptron-feed-forward network (MLP-FFN) and NN-PSO based models in terms of several performance metrics. Experimental results suggested that the NN-MOGA has outperformed other existing well known classifiers with a reasonable improvement over them. Meanwhile, the proposed NN-MOGA achieved the superior accuracy of 93.33% and F-measure of 94.44%, which is superior to the other classifiers in the present study.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.9 no.3 s.43
• /
• pp.23-32
• /
• 2005

Torsional behavior of eccentric structure under seismic leading may cause the stress and/or deformation concentration, which arouse the failure of the structure in an unexpected manner. This study suggests D-R relationship which shows the overall displacement and rotation of the system based on the ultimate displacement capacity of the each lateral load resistant member. Using the suggested D-R relationship and displacement spectrum, the seismic assessment is conducted and verified in comparison with the time history analysis result. Multi-level seismic assessment Is considered which takes multiple seismic hazard levels and respective performance levels into account. Finally, based on the seismic assessment result, seismic rehabilitation process is presented. In this research, two rehabilitation methods are considered. One is done by means of stiffening/strengthening the seismic resistant members, and the other is based on the member ductility. Especially, in the first method, to optimize the rehabilitation result, the rehabilitation problem is modeled as an optimization problem, and solved using BFGS quasi-Newton optimization method.

• Journal of Internet Computing and Services
• /
• v.9 no.2
• /
• pp.35-42
• /
• 2008

Mobile IP is a solution to support mobile nodes, however, it does not handle NEtwork MObility (NEMO). The NEMO Basic Support (NBS) protocol ensures session continuity for all the nodes in the mobile network. Since the protocol is based on Mobile IP, it inherits the same fundamental problem such as tunnel convergence, when supporting the multicast for NEMO. In this paper, we propose the multicast route optimization scheme for NEMO environment. We assume that the Mobile Router (MR) has a multicast function and the Nested Mobile Router Information (NeMRI) table. The NeMRI is used to record o list of the CoAs of all the MRs located below it. And it covers whether MRs desire multicast services. Any Route Optimization (RO) scheme can be employed here for pinball routing. Therefore, we achieve optimal routes for multicasting based on the given architecture. We also propose cost analytic models to evaluate the performance of our scheme. We observe significantly better multicast cost in NEMO compared with other techniques such as Bi-directional Tunneling, Remote Subscription, and Mobile Multicast based on the NBS protocol.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.1
• /
• pp.39-45
• /
• 2008

This paper considers the multi-objective optimization of a multi-service arrayed waveguide grating-based single-hop WDM network with the two conflicting objectives of maximizing throughput while minimizing delay. This paper presents a genetic algorithm based methodology for finding the optimal throughput-delay tradeoff curve, the so-called Pareto-optimal frontier. Genetic algorithm based methodology provides the network architecture parameters and the Medium Access Control protocol parameters that achieve the Pareto-optima in a computationally efficient manner. The numerical results obtained with this methodology provide the Pareto-optimal network planning and operation solution for a wide range of traffic scenarios. The presented methodology is applicable to other networks with a similar throughput-delay tradeoff.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3834-3857
• /
• 2021

The design of cluster-based routing protocols is necessary for Wireless Sensor Networks (WSN). But, due to the lack of features, the traditional methods face issues, especially on unbalanced energy consumption of routing protocol. This work focuses on enhancing the security and energy efficiency of the system by proposing Energy Efficient Based Secure Routing Protocol (EESRP) which integrates trust management, optimization algorithm and key management. Initially, the locations of the deployed nodes are calculated along with their trust values. Here, packet transfer is maintained securely by compiling a Digital Signature Algorithm (DSA) and Elliptic Curve Cryptography (ECC) approach. Finally, trust, key, location and energy parameters are incorporated in Particle Swarm Optimization (PSO) and meta-heuristic based Harmony Search (HS) method to find the secure shortest path. Our results show that the energy consumption of the proposed approach is 1.06mJ during the transmission mode, and 8.69 mJ during the receive mode which is lower than the existing approaches. The average throughput and the average PDR for the attacks are also high with 72 and 62.5 respectively. The significance of the research is its ability to improve the performance metrics of existing work by combining the advantages of different approaches. After simulating the model, the results have been validated with conventional methods with respect to the number of live nodes, energy efficiency, network lifetime, packet loss rate, scalability, and energy consumption of routing protocol.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.34 no.2
• /
• pp.167-177
• /
• 2024

This paper proposes optimization techniques for SeaSign, an isogeny-based digital signature algorithm. SeaSign combines class group actions of CSIDH with the Fiat-Shamir with abort. While CSIDH-based algorithms have regained attention due to polynomial time attacks for SIDH-based algorithms, SeaSiogn has not undergone significat optimization because of its inefficiency. In this paper, an efficient signing method for SeaSign is proposed. The proposed signing method is simple yet powerful, achived by repositioning the rejection sampling within the algorithm. Additionally, this paper presnts parameters that can provide optimal performance for the proposed algorithm. As a result, by using the original parameters of SeaSign, the proposed method is three times faster than the original SeaSign. Additonally, combining the newly suggested parameters with the signing method proposed in this paper yields a performance that is 290 times faster than the original SeaSign and 7.47 times faster than the method proposed by Decru et al.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.6
• /
• pp.411-418
• /
• 2020

In this paper, approximation and optimization methods are proposed for the structural performance of the composite fan blade. Using these methods, we perform the optimal design of the stacking sequence to maximize stiffnesses without changing the mass and the geometric shape of the composite fan blade. In this study, the lamination parameters are introduced to reduce the design variables and space. From the characteristics of lamination parameters, we generate response surface model having a high fitness value. Considering the requirements of the optimal stacking sequence, the multi-objective optimization problem is formulated. We apply the two-step optimization method that combines gradient-based method and genetic algorithm for efficient search of an optimal solution. Finally, the finite element analysis results of the initial and the optimized model are compared to validate the approximation and optimization methods based on the lamination parameters.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.6
• /
• pp.853-866
• /
• 2011

We propose a multi-objective space search algorithm (MSSA) and introduce the identification of fuzzy inference systems based on the MSSA and information granulation (IG). The MSSA is a multi-objective optimization algorithm whose search method is associated with the analysis of the solution space. The multi-objective mechanism of MSSA is realized using a non-dominated sorting-based multi-objective strategy. In the identification of the fuzzy inference system, the MSSA is exploited to carry out parametric optimization of the fuzzy model and to achieve its structural optimization. The granulation of information is attained using the C-Means clustering algorithm. The overall optimization of fuzzy inference systems comes in the form of two identification mechanisms: structure identification (such as the number of input variables to be used, a specific subset of input variables, the number of membership functions, and the polynomial type) and parameter identification (viz. the apexes of membership function). The structure identification is developed by the MSSA and C-Means, whereas the parameter identification is realized via the MSSA and least squares method. The evaluation of the performance of the proposed model was conducted using three representative numerical examples such as gas furnace, NOx emission process data, and Mackey-Glass time series. The proposed model was also compared with the quality of some "conventional" fuzzy models encountered in the literature.

• Structural Engineering and Mechanics
• /
• v.61 no.3
• /
• pp.347-357
• /
• 2017

The applications of active control is being more popular nowadays. Several control algorithms have been developed to determine optimum control force. In this paper, a Chaotic Particle Swarm Optimization (CPSO) technique, based on Logistic map, is used to compute the optimum control force of active tendon system. A chaotic exploration is used to search the solution space for optimum control force. The response control of Multi-Degree of Freedom (MDOF) shear buildings, equipped with active tendons, is introduced as an optimization problem, based on Instantaneous Optimal Active Control algorithm. Three MDOFs are simulated in this paper. Two examples out of three, which have been previously controlled using Lattice type Probabilistic Neural Network (LPNN) and Block Pulse Functions (BPFs), are taken from prior works in order to compare the efficiency of the current method. In the present study, a maximum allowable value of control force is added to the original problem. Later, a twenty-story shear building, as the third and more realistic example, is considered and controlled. Besides, the required Central Processing Unit (CPU) time of CPSO control algorithm is investigated. Although the CPU time of LPNN and BPFs methods of prior works is not available, the results show that a full state measurement is necessary, especially when there are more than three control devices. The results show that CPSO algorithm has a good performance, especially in the presence of the cut-off limit of tendon force; therefore, can widely be used in the field of optimum active control of actual buildings.