• 대한수학회논문집
• /
• 제25권1호
• /
• pp.139-147
• /
• 2010

A generalized nondifferentiable fractional optimization problem (GFP), which consists of a maximum objective function defined by finite fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions, is considered. Recently, Kim et al. [Journal of Optimization Theory and Applications 129 (2006), no. 1, 131-146] proved optimality theorems and duality theorems for a nondifferentiable multiobjective fractional programming problem (MFP), which consists of a vector-valued function whose components are fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions. In fact if $\overline{x}$ is a solution of (GFP), then $\overline{x}$ is a weakly efficient solution of (MFP), but the converse may not be true. So, it seems to be not trivial that we apply the approach of Kim et al. to (GFP). However, modifying their approach, we obtain optimality conditions and duality results for (GFP).

• 대한전기학회논문지:전기기기및에너지변환시스템부문B
• /
• 제51권12호
• /
• pp.697-703
• /
• 2002

Interior permanent magnet synchronous motor(IPMSM) is widely used in many applications such as an electric vehicle, compressor drives of air conditioner and machine tool spindle drives. In order to maximize the efficiency in such applications, this paper is proposed the optimal control method of the armature current. The controllable electrical loss which consists of the copper loss and the iron loss can be minimized by the optimal control of the armature current. The minimization of loss is possible to realize efficiency optimization control for the proposed IPMSM The optimal current can be decided according to the operating speed and the load conditions. The proposed control algorithm is applied to IPMSM drive system, the operating characteristics controlled by efficiency optimization control are examined in detail by simulation.

• Computers and Concrete
• /
• 제2권5호
• /
• pp.345-366
• /
• 2005

This work presents an assessment of the computational performance of a vector-parallel implementation of probabilistic model for concrete cracking in 3D. This paper shows the continuing efforts towards code optimization as reported in earlier works Paz, et al. (2002a,b and 2003). The probabilistic crack approach is based on the direct Monte Carlo method. Cracking is accounted by means of 3D interface elements. This approach considers that all nonlinearities are restricted to interface elements modeling cracks. The heterogeneity governs the overall cracking behavior and related size effects on concrete fracture. Computational kernels in the implementation are the inexact Newton iterative driver to solve the non-linear problem and a preconditioned conjugate gradient (PCG) driver to solve linearized equations, using an element by element (EBE) strategy to compute matrix-vector products. In particular the paper analyzes code behavior using OpenMP directives in parallel vector processors (PVP), such as the CRAY SV1 and CRAY T94. The impact of the memory architecture on code performance, and also some strategies devised to circumvent this issue are addressed by numerical experiment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권9호
• /
• pp.2976-2990
• /
• 2022

The adaptive adjustment of reference or weight vectors in decomposition-based methods has been a hot research topic in the evolutionary community over the past few years. Although various methods have been proposed regarding this issue, most of them aim to diversify solutions in the objective space to cover the true Pareto fronts as much as possible. Different from them, this paper proposes a knee point-based reference vector adaptive adjustment strategy to concurrently balance the convergence and diversity. To be specific, the knee point-based reference vector adaptive adjustment strategy firstly utilizes knee points to construct the adaptive reference vectors. After that, a new fitness function is defined mathematically. Then, this paper further designs a many-objective evolutionary algorithm with knee point-based reference vector adaptive adjustment strategy, where the mating operation and environmental selection are designed accordingly. The proposed method is extensively tested on the WFG test suite with 8, 10 and 12 objectives and MPDMP with state-of-the-art optimizers. Extensive experimental results demonstrate the superiority of the proposed method over state-of-the-art optimizers and the practicability of the proposed method in tackling practical many-objective optimization problems.

• 한국전산구조공학회논문집
• /
• 제28권1호
• /
• pp.63-69
• /
• 2015

본 연구에서는 페이즈 필드법을 기반으로 하는 위상 최적설계 방법을 통하여 적외선 스텔스 효과를 위한 적외선 반사층의 설계를 진행하였다. 이를 위하여 수직으로 입사하는 적외선 파를 반사층에서 반사되어 원하는 방향으로 전파되도록 모델링을 하였다. 전파 방향에 측정 영역을 설정하여 해당 영역에서의 목적함수 값을 최대화하도록 설계가 진행되었으며, 이때 목적함수는 전자기파의 에너지 흐름을 나타내는 포인팅 벡터(Poynting vector)로 설정하였다. 페이즈 필드법 기반의 방법에서의 여러 파라미터 값들을 변경해 가며 설계 결과를 도출하였고, 목적함수 값을 최대화하는 모델을 최적 모델로 선정하였다. 선정된 최적 모델에서 gray scale을 cut-off 방법으로 제거한 경우 더 좋은 결과를 얻을 수 있었다. 또한 중적외선 영역에서의 효과를 고려하기 위하여 입사되는 파장을 바꿔가며 얻은 해석결과를 검토하였다. 본 연구의 유한요소해석 및 최적화 과정은 상용 프로그램인 COMSOL과 Matlab을 연동하여 수행하였다.

• 정보보호학회논문지
• /
• 제30권4호
• /
• pp.537-544
• /
• 2020

악성코드 기술 발전으로 변이, 난독화 등의 탐지 회피 방법이 고도화되고 있다. 이에 악성코드 탐지 기술에 있어 알려지지 않은 악성코드 탐지 기술이 중요하며, 배포된 악성코드를 통해 저자를 식별하여 알려지지 않은 악성코드를 탐지하는 악성코드 저자 식별 방법이 연구되고 있다. 본 논문에서는 바이너리 기반 저자 식별 방법에 대해 중요 정보인 컴파일러 정보를 추출하고자 하였으며, 연구 간에 특징 선택, 확률 및 비확률 모델, 최적화가 분류 효율성에 미치는 민감성(Sensitive)을 확인하고자 하였다. 실험에서 정보 이득을 통한 특징 선택 방법과 비확률 모델인 서포트 벡터 머신이 높은 효율성을 보였다. 최적화 연구 간에 제안하는 프레임워크를 통한 특징 선택 및 모델 최적화를 통해 높은 분류 정확도를 얻었으며, 최대 48%의 특징 감소 및 51배가량의 빠른 실행 속도라는 결과를 보였다. 본 연구를 통해 특징 선택 및 모델 최적화 방법이 분류 효율성에 미치는 민감성에 대해 확인할 수 있었다.

• Computers and Concrete
• /
• 제32권6호
• /
• pp.577-594
• /
• 2023

Engineered cementitious composites with calcined clay limestone cement (LC³-ECC) as a kind of green, low-carbon and high toughness concrete, has recently received significant investigation. However, the complicated relationship between potential influential factors and LC³-ECC compressive strength makes the prediction of LC³-ECC compressive strength difficult. Regarding this, the machine learning-based prediction models for the compressive strength of LC³-ECC concrete is firstly proposed and developed. Models combine three novel meta-heuristic algorithms (golden jackal optimization algorithm, butterfly optimization algorithm and whale optimization algorithm) with support vector regression (SVR) to improve the accuracy of prediction. A new dataset about LC³-ECC compressive strength was integrated based on 156 data from previous studies and used to develop the SVR-based models. Thirteen potential factors affecting the compressive strength of LC³-ECC were comprehensively considered in the model. The results show all hybrid SVR prediction models can reach the Coefficient of determination (R²) above 0.95 for the testing set and 0.97 for the training set. Radar and Taylor plots also show better overall prediction performance of the hybrid SVR models than several traditional machine learning techniques, which confirms the superiority of the three proposed methods. The successful development of this predictive model can provide scientific guidance for LC³-ECC materials and further apply to such low-carbon, sustainable cement-based materials.

• Geomechanics and Engineering
• /
• 제36권2호
• /
• pp.111-119
• /
• 2024

In the realm of rock excavation projects, precise estimation of the drilling rate index stands as a pivotal factor in strategic planning and cost assessment. This study introduces and evaluates two pioneering computational intelligence models designed for the prognostication of the drilling rate index, a pivotal parameter with direct implications for cost estimation in rock excavation projects. These models, denoted as the Relevance Vector Regression (RVR) optimized with the Invasive Weed Optimization algorithm (IWO) (RVR-IWO model) and the RVR integrated with the Shuffled Frog Leaping algorithm (SFL) (RVR-SFL model), represent a groundbreaking approach to forecasting drilling rate index. The RVR-IWO and RVR-SFL models were meticulously devised to harness the capabilities of computational intelligence and optimization techniques for drilling rate index estimation. This research pioneers the integration of IWO and SFL with RVR, constituting an unprecedented effort in forecasting drilling rate index. The primary objective of this study was to gauge the precision and dependability of these models in forecasting the drilling rate index, revealing significant distinctions between the two. In terms of predictive precision, the RVR-IWO model emerged as the superior choice when compared to the RVR-SFL model, underscoring the remarkable efficacy of the Invasive Weed Optimization algorithm. The RVR-IWO model delivered noteworthy results, boasting a Variance Account for (VAF) of 0.8406, a Mean Squared Error (MSE) of 0.0114, and a Squared Correlation Coefficient (R²) of 0.9315. On the contrary, the RVR-SFL model exhibited slightly lower precision, yielding an MSE of 0.0160, a VAF of 0.8205, and an R2 of 0.9120. These findings serve to highlight the potential of the RVR-IWO model as a formidable instrument for drilling rate index prediction, particularly within the framework of rock excavation projects. This research not only makes a significant contribution to the realm of drilling engineering but also underscores the broader adaptability of the RVR-IWO model in tackling an array of challenges within the domain of rock engineering. Ultimately, this study advances the comprehension of drilling rate index estimation and imparts valuable insights into the practical implementation of computational intelligence methodologies within the realm of engineering projects.

• Journal of Computing Science and Engineering
• /
• 제9권2호
• /
• pp.39-50
• /
• 2015

Genetic algorithm (GA) and particle swarm optimization (PSO) are two excellent approaches to multimodal optimization problems. However, slow convergence or premature convergence readily occurs because of inappropriate and inflexible evolution. In this paper, a novel optimization algorithm with a flexible grid optimization (FGO) is suggested to provide adaptive trade-off between exploration and exploitation according to the specific objective function. Meanwhile, a uniform agents array with adaptive scale is distributed on the gird to speed up the calculation. In addition, a dominance centroid and a fitness center are proposed to efficiently determine the potential guides when the population size varies dynamically. Two types of subregion division strategies are designed to enhance evolutionary diversity and convergence, respectively. By examining the performance on four benchmark functions, FGO is found to be competitive with or even superior to several other popular algorithms in terms of both effectiveness and efficiency, tending to reach the global optimum earlier. Moreover, FGO is evaluated by applying it to a parameter decision in a least squares support vector machine (LS-SVM) to verify its practical competence.

• 방송공학회논문지
• /
• 제10권3호
• /
• pp.270-285
• /
• 2005

해상도 변환모듈과 움직임 예측모듈은 트랜스코더를 이루는 중요한 모듈이다. 본 논문에서는 트랜스코더 시스템의 이 두 가지 모듈을 공동 최적화하는 기법을 제안한다. 제안하는 기법은 먼저 주어진 움직임 벡터에 대해 해상도 변환모듈을 최적화한 후, 최적화된 해상도 변환모듈에 대해 최적의 움직임 벡터를 결정한다. 기존 해상도 변환 기법들은 한 영상에 대해 변환함수를 최적화하여 사용한다. 본 논문에서는 해상도 변환 최적화를 위하여 적응적 3차 회선 변환기를 제안한다 제안된 방법은 3차 회선 변환기의 인자값을 각 매크로블록 단위로 영상의 지역적 특성을 고려하여 적응적으로 조절한다. 움직임 예측모듈에서는 기존의 고속 트랜스코더 알고리듬에서 많이 연구된 움직임 벡터의 재사용 기법을 사용하였다. 입력 영상의 움직임 벡터를 재사용 함으로써 연산량을 줄일 수 있고 이를 기본 움직임 벡터로 사용해 작은 영역에서 재탐색해 움직임벡터를 결정할 경우 전역탐색기법과 거의 동일한 화질의 영상을 얻을 수 있다. 해상도 변환모듈과 움직임 예측모듈의 공동 최적화를 통해서 트랜스코딩된 영상의 화질 열화를 최소화할 수 있는 알고리듬을 제안한다. 실험 결과 본 논문에서 제안하는 공동 최적화 기법이 기존에 연구 되었던 다른 기법에 비해 화질의 열화가 적은 것을 알 수 있었고, 이를 통해 다른 기법과 비교해 해상도 변환으로 인한 정보의 손실이 가장 적음을 알 수 있다.