• 대한기계학회논문집A
• /
• 제26권7호
• /
• pp.1408-1415
• /
• 2002

In this paper, we investigate the effect and the importance of the accuracy of finite element analysis in the shape optimization based on the finite element method and improve the existing finite element which has inaccuracy in some cases. And then, the shape optimization is performed by using the improved finite element. One of the main stream to improve finite element is the prevention of locking phenomenon. In case of bending dominant problems, finite element solutions cannot be reliable because of shear locking phenomenon. In the process of shape optimization, the mesh distortion is large due to the change of the structure outline. So, we have to raise the accuracy of finite element analysis for the large mesh distortion. We cannot guarantee the accurate result unless the finite element itself is accurate or the finite elements are remeshed. So, we approach to more accurate shape optimization to diminish these inaccuracies by improving the existing finite element. The shape optimization using the modified finite element is applied to a two and three dimensional simple beam. Results show that the modified finite element has improved the optimization results.

• Steel and Composite Structures
• /
• 제47권5호
• /
• pp.569-585
• /
• 2023

This paper proposes an efficient approach for the structural topology optimization of bi-directional functionally graded structures by incorporating popular radial basis functions (RBFs) into an implicit level set (ILS) method. Compared to traditional element density-based methods, a level set (LS) description of material boundaries produces a smoother boundary description of the design. The paper develops RBF implicit modeling with multiquadric (MQ) splines, thin-plate spline (TPS), exponential spline (ES), and Gaussians (GS) to define the ILS function with high accuracy and smoothness. The optimization problem is formulated by considering RBF-based nodal densities as design variables and minimizing the compliance objective function. A LS-RBF optimization method is proposed to transform a Hamilton-Jacobi partial differential equation (PDE) into a system of coupled non-linear ordinary differential equations (ODEs) over the entire design domain using a collocation formulation of the method of lines design variables. The paper presents detailed mathematical expressions for BiDFG beams topology optimization with two different material models: continuum functionally graded (CFG) and mechanical functionally graded (MFG). Several numerical examples are presented to verify the method's efficiency, reliability, and success in accuracy, convergence speed, and insensitivity to initial designs in the topology optimization of two-dimensional (2D) structures. Overall, the paper presents a novel and efficient approach to topology optimization that can handle bi-directional functionally graded structures with complex geometries.

• Journal of information and communication convergence engineering
• /
• 제21권2호
• /
• pp.130-138
• /
• 2023

The selection of the correct examination variables for diagnosing heart disease provides many benefits, including faster diagnosis and lower cost of examination. The selection of inspection variables can be performed by referring to the data of previous examination results so that future investigations can be carried out by referring to these selected variables. This paper proposes a model for selecting examination variables using an Artificial Bee Swarm Optimization method by considering the variables of accuracy and cost of inspection. The proposed feature selection model was evaluated using the performance parameters of accuracy, area under curve (AUC), number of variables, and inspection cost. The test results show that the proposed model can produce 24 examination variables and provide 95.16% accuracy and 97.61% AUC. These results indicate a significant decrease in the number of inspection variables and inspection costs while maintaining performance in the excellent category.

• 전자공학회논문지
• /
• 제52권9호
• /
• pp.21-27
• /
• 2015

High resistivity(HR) silicon-on-insulator(SOI) RF CMOS 공정 인덕터의 모델 파라미터를 정확히 결정하기 위하여 직접추출과 simultaneous optimization을 사용한 개선된 방법을 개발하였다. 먼저, 대칭형 인덕터와 센터탭이 접지된 대칭형 인덕터 등가회로들의 Y 및 Z-파라미터 방정식 유도를 통해 일부 모델 파라미터들을 직접 추출하고, 병렬 저항과 전체 인덕턴스 방정식들로 미지 변수들을 줄여 모델링 정확도를 향상시켰다. 또한, 두 등가회로의 동일한 모델 파라미터들을 공통 변수로 두고 S-파라미터 데이터 세트를 동시에 optimization함으로써 optimization 정확도를 크게 향상시켰다.

• Smart Structures and Systems
• /
• 제25권3호
• /
• pp.345-368
• /
• 2020

The present work proposes a self-controlled multi-stage optimization method for damage identification of structures utilizing standard particle swarm optimization (PSO) algorithm. Damage identification problem is formulated as an inverse optimization problem where damage severity in each element of the structure is considered as optimization variables. An efficient objective function is formed using the first few frequencies and mode shapes of the structure. This objective function is minimized by a self-controlled multi-stage strategy to identify and quantify the damage extent of the structural members. In the first stage, standard PSO is utilized to get an initial solution to the problem. Subsequently, the algorithm identifies the most damage-prone elements of the structure using an adaptable threshold value of damage severity. These identified elements are included in the search space of the standard PSO at the next stage. Thus, the algorithm reduces the dimension of the search space and subsequently increases the accuracy of damage prediction with a considerable reduction in computational cost. The efficiency of the proposed method is investigated and compared with available results through three numerical examples considering both with and without noise. The obtained results demonstrate the accuracy of the present method can accurately estimate the location and severity of multi-damage cases in the structural systems with less computational cost.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.61-80
• /
• 2018

Location information of individual nodes is important in the implementation of necessary network functions. While extensive studies focus on localization techniques in 2D space, few approaches have been proposed for 3D positioning, which brings the location closer to the reality with more complex calculation consumptions for high accuracy. In this paper, an effective range-free localization scheme is proposed for 3D space localization, and the sensitivity of parameters is evaluated. Firstly, we present an improved algorithm (MDV-Hop), that the average distance per hop of the anchor nodes is calculated by root-mean-square error (RMSE), and is dynamically corrected in groups with the weighted RMSE based on group hops. For more improvement in accuracy, we expand particle swarm optimization (PSO) of intelligent optimization algorithms to MDV-Hop localization algorithm, called PMDV-hop, in which the parameters (inertia weight and trust coefficient) in PSO are calculated dynamically. Secondly, the effect of various localization parameters affecting the PMDV-hop performance is also present. The simulation results show that PMDV-hop performs better in positioning accuracy with limited energy.

• International Journal of Computer Science & Network Security
• /
• 제23권4호
• /
• pp.116-122
• /
• 2023

Sentiment categorization technique be commonly isolated interested in threes significant classifications name Machine Learning Procedure (ML), Lexicon Based Method (LB) also finally, the Hybrid Method. In Machine Learning Methods (ML) utilizes phonetic highlights with apply notable ML algorithm. In this paper, in classification and identification be complete base under in optimizations technique called sequential minimal optimization with Random Forest algorithm (SMORF) for expanding the exhibition and proficiency of sentiment classification framework. The three existing classification algorithms are compared with proposed SMORF algorithm. Imitation result within experiential structure is Precisions (P), recalls (R), F-measures (F) and accuracy metric. The proposed sequential minimal optimization with Random Forest (SMORF) provides the great accuracy.

• Journal of Communications and Networks
• /
• 제18권5호
• /
• pp.796-805
• /
• 2016

In many wireless sensor network (WSN) applications, the information transmitted by an individual entity or node is of limited use without the knowledge of its location. Research in node localization is mostly geared towards multi-hop range-free localization algorithms to achieve accuracy by minimizing localization errors between the node's actual and estimated position. The existing localization algorithms are focused on improving localization accuracy without considering efficiency in terms of energy costs and algorithm convergence time. In this work, we show that our proposed localization scheme, called DV-maxHop, can achieve good accuracy and efficiency. We formulate the multi-objective optimization functions to minimize localization errors as well as the number of transmission during localization phase. We evaluate the performance of our scheme using extensive simulation on several anisotropic and isotropic topologies. Our scheme can achieve dual objective of accuracy and efficiency for various scenarios. Furthermore, the recently proposed algorithms require random uniform distribution of anchors. We also utilized our proposed scheme to compare and study some practical anchor distribution schemes.

• International Journal of Advanced Culture Technology
• /
• 제7권4호
• /
• pp.56-62
• /
• 2019

Recently, research using artificial neural networks has further expanded the field of neural network optimization and automatic structuring from improving inference accuracy. The performance of the machine learning algorithm depends on how the hyperparameters are configured. Open-source hyperparameter optimization software can be an important step forward in improving the performance of machine learning algorithms. In this paper, we review open-source hyperparameter optimization softwares.

• Journal of Computing Science and Engineering
• /
• 제8권1호
• /
• pp.1-10
• /
• 2014

The Bacterial Foraging Optimization Algorithm is a swarm intelligence optimization algorithm. This paper first analyzes the chemotaxis, as well as elimination and dispersal operation, based on the basic Bacterial Foraging Optimization Algorithm. The elimination and dispersal operation makes a bacterium which has found or nearly found an optimal position escape away from that position, which greatly affects the convergence speed of the algorithm. In order to avoid this escape, the sphere of action of the elimination and dispersal operation can be altered in accordance with the generations of evolution. Secondly, we put forward an algorithm of an adaptive adjustment of step length we called improved bacterial foraging optimization (IBFO) after making a detailed analysis of the impacts of the step length on the efficiency and accuracy of the algorithm, based on chemotaxis operation. The classic test functions show that the convergence speed and accuracy of the IBFO algorithm is much better than the original algorithm.