• Smart Structures and Systems
• /
• v.26 no.3
• /
• pp.345-360
• /
• 2020

Modern swarm intelligence heuristic search methods are widely applied in the field of structural health monitoring due to their advantages of excellent global search capacity, loose requirement of initial guess and ease of computational implementation etc. To this end, a hybrid strategy is proposed based on butterfly optimization algorithm (BOA) and differential evolution (DE) with purpose of effective combination of their merits. In the proposed identification strategy, two improvements including mutation and crossover operations of DE, and dynamic adaptive operators are introduced into original BOA to reduce the risk to be trapped in local optimum and increase global search capability. The performance of the proposed algorithm, hybrid butterfly optimization and differential evolution algorithm (HBODEA) is evaluated by two numerical examples of a simply supported beam and a 37-bar truss structure, as well as an experimental test of 8-story shear-type steel frame structure in the laboratory. Compared with BOA and DE, the numerical and experimental results show that the proposed HBODEA is more robust to detect the reduction of stiffness with limited sensors and contaminated measurements. In addition, the effect of search space, two dynamic operators, population size on identification accuracy and efficiency of the proposed identification strategy are further investigated.

• Journal of Astronomy and Space Sciences
• /
• v.20 no.1
• /
• pp.29-42
• /
• 2003

The KSR-3 magnetometers consist of the fluxgate magnetometer (MAG/AIM) for acquiring the rocket flight attitude information, and the search-coil magnetometer (MAG/SIM) for the observation of the Earth's magnetic fluctuations. The position (latitude, longitude, and height) and flight condition (the transformation angle) of the rocket is measured after the data based on these two magnetometers are compared with IGRF The gap in the vector of magnetic field between the position of the launching point and an impact point is taken into account in data reduction. Angular variation of pitch, yaw, and roll can be researched when the data is applied to the coordinate system of the rocket.

• Journal of Korean Society of Transportation
• /
• v.14 no.1
• /
• pp.51-67
• /
• 1996

The optimal path-finding problem becomes complicated when multiple variables are simultaneously considered such as physical route length, degree of congestion, traffic capacity of intersections, number of intersections and lanes, and existence of free ways. Therefore, many researchers in various fields (management science, computer science, applied mathematics, production planning, satellite launching) attempted to solve the problem by ignoring many variables for problem simplification, by developing intelligent algorithms, or by developing high-speed hardware. In this research, an integration of expert system technique and case-based reasoning in high level with a conventional algorithms in lower level was attempted to develop an optimal path-finding system. Early application of experienced driver's knowledge and case data accumulated in case base drastically reduces number of possible combinations of optimal paths by generating promising alternatives and by eliminating non-profitable alternatives. Then, employment of a conventional optimization algorithm provides faster search mechanisms than other methods such as bidirectional algorithm and $A^*$ algorithm. The conclusion obtained from repeated laboratory experiments with real traffic data in Seoul metropolitan area shows that the integrated approach to finding optimal paths with consideration of various real world constraints provides reasonable solution in a faster way than others.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.40-48
• /
• 2021

Content-Based Image Retrieval (CBIR) system plays a vital role to retrieve the relevant images as per the user perception from the huge database is a challenging task. Images are represented is to employ a combination of low-level features as per their visual content to form a feature vector. To reduce the search time of a large database while retrieving images, a novel image retrieval technique based on feature dimensionality reduction is being proposed with the exploit of metaheuristic optimization techniques based on Genetic Algorithm (GA), Extended Binary Cuckoo Search (EBCS) and Whale Optimization Algorithm (WOA). Each image in the database is indexed using a feature vector comprising of fuzzified based color histogram descriptor for color and Median binary pattern were derived in the color space from HSI for texture feature variants respectively. Finally, results are being compared in terms of Precision, Recall, F-measure, Accuracy, and error rate with benchmark classification algorithms (Linear discriminant analysis, CatBoost, Extra Trees, Random Forest, Naive Bayes, light gradient boosting, Extreme gradient boosting, k-NN, and Ridge) to validate the efficiency of the proposed approach. Finally, a ranking of the techniques using TOPSIS has been considered choosing the best feature selection technique based on different model parameters.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.2
• /
• pp.436-444
• /
• 2010

In this study, we introduce and discuss a concept of a granular-oriented radial basis function neural networks (GRBF NNs). In contrast to the typical architectures encountered in radial basis function neural networks(RBF NNs), our main objective is to develop a design strategy of GRBF NNs as follows : (a) The architecture of the network is fully reflective of the structure encountered in the training data which are granulated with the aid of clustering techniques. More specifically, the output space is granulated with use of K-Means clustering while the information granules in the multidimensional input space are formed by using a so-called context-based Fuzzy C-Means which takes into account the structure being already formed in the output space, (b) The innovative development facet of the network involves a dynamic reduction of dimensionality of the input space in which the information granules are formed in the subspace of the overall input space which is formed by selecting a suitable subset of input variables so that the this subspace retains the structure of the entire space. As this search is of combinatorial character, we use the technique of genetic optimization to determine the optimal input subspaces. A series of numeric studies exploiting some nonlinear process data and a dataset coming from the machine learning repository provide a detailed insight into the nature of the algorithm and its parameters as well as offer some comparative analysis.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.59-68
• /
• 2006

The study on the uniform error property of codes has been restricted to additive white Gaussian noise (AWGN) channel, which is generally referred to as geometrical uniformity. In this paper, we extend the uniform error property to space-time codes in multiple-input multiple-output (MIMO) channel by directly treating the probability density functions fully describing the transmission channel and the receiver. Moreover, we provide the code construction procedure for the geometrically uniform space-time trellis codes in fast MIMO channels, which consider the distance spectrum. Due to the uniform error property, the complexity of code search is extensively reduced. Such reduction makes it possible to obtain the optimal space-time trellis codes with high order states. Simulation results show that new codes offer a better performance in fast MIMO channels than other known codes.

• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.3
• /
• pp.285-295
• /
• 2016

A contact strip shape of a high speed train pantograph system was optimized with CFD to increase the aerodynamic performance and stability of contact force, and the results were validated by a wind tunnel test. For design of the optimal contact strip shape, a Kriging model and genetic algorithm were used to ensure the global search of the optimal point and reduce the computational cost. To enhance the performance and robustness of the contact strip for high speed pantograph, the drag coefficient and the fluctuation of the lift coefficient along the angle of attack were selected as design objectives. Aerodynamic forces were measured by a load cell and HWA (Hot Wire Anemometer) was used to measure the Strouhal number of wake flow. PIV (Particle Image Velocimetry) was adopted to visualize the flow fields. The optimized contact strip shape was shown a lower drag with smaller fluctuation of vertical lift force than the general shaped contact strip. And the acoustic noise source strength of the optimized contact strip was also reduced. Finally, the reduction amount of drag and noise was assessed when the optimized contact strip was applied to three dimensional pantograph system.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.3
• /
• pp.248-254
• /
• 2009

The use of evolutionary algorithm is limited in the field of aerodynamics, mainly because the population-based search algorithm requires excessive CPU time. In this paper a coupling method with adaptive range genetic algorithm for floating point and back-propagation neural network is proposed to efficiently obtain a converged solution. As a result, it is shown that a reduction of 14% and 33% respectively in wave drag and its consumed time can be achieved by the new method.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.5
• /
• pp.52-65
• /
• 1997

For the degradation of severe noise and ill-conditioned blur the optimization function has the solution spaces which have many local optima around global solution. General restoration methods such as inverse filtering or gradient methods are mainly dependent on the properties of degradation model and tend to be isolated into a local optima because their convergences are determined in the convex space. Hence we introduce genetic algorithm as a searching method which will search solutions beyond the convex spaces including local solutins. In this paper we introudce improved evaluation square error) and fitness value for gray scaled images. Finally we also proposed the local fine tunign of window size and visit number for delicate searching mechanism in the vicinity of th global solution. Through the experiental results we verified the effectiveness of the proposed genetic operators and evaluation function on noise reduction over the conventional ones, as well as the improved performance of local fine tuning.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.04a
• /
• pp.164-173
• /
• 2005

Data mining is the method to find useful information for large amounts of data in database. It is used to find hidden knowledge by massive data, unexpectedly pattern, relation to new rule. The methods of data mining are decision tree, association rules, clustering, neural network and so on. The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud detection, data reduction and variable screening, category merging, etc. We analyze waste database united with local information using decision tree techniques for environmental information. We can use these decision tree outputs for environmental preservation and improvement.