• 대한기계학회논문집A
• /
• 제26권11호
• /
• pp.2364-2373
• /
• 2002

In this paper, the finite element equations for the time-domain numerical analysis of transient dynamic axisymmetric problems are newly presented. which are based on the equations of motion in convolution integral as in the previous paper. A hollow cylinder subjected to a sudden internal pressure is solved first as a benchmark problem and then the dynamic stress concentrations are analyzed in detail far hollow cylinders having inner and outer circumferential grooves subjected to sudden internal or axial loadings, all the computed results are compared with the existing or the computed ones obtained by using the commercial finite element packages Nastran and Ansys to show the validity and capability of the presented method.

• Nuclear Engineering and Technology
• /
• 제24권2호
• /
• pp.130-140
• /
• 1992

동방향 성층이상유동에서의 직접적촉 응축현상을 일차원 모델인 RELAP5/MOD2와 /MOD3를 이용하여 해석하였으며, 해석결과를 Northwestern의 실험결과와 비교·검토하였다. 해석결과 RELAP5의 공유열전달 모델은 동방향 성층이상유동에서 응축율을 비교적 잘 예측하고 있다. 그러나 공유접촉면에 파형이 생기는 경우는 물경계두께 및 국부 열전달계수는 유사한 범위로 일치할분 현상을 예측하는데 상당한 차이가 있다.

• ETRI Journal
• /
• 제33권1호
• /
• pp.39-49
• /
• 2011

A new structure learning approach for Bayesian networks based on asexual reproduction optimization (ARO) is proposed in this paper. ARO can be considered an evolutionary-based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter, the parent and its bud compete to survive according to a performance index obtained from the underlying objective function of the optimization problem: This leads to the fitter individual. The convergence measure of ARO is analyzed. The proposed method is applied to real-world and benchmark applications, while its effectiveness is demonstrated through computer simulations. Results of simulations show that ARO outperforms genetic algorithm (GA) because ARO results in a good structure and fast convergence rate in comparison with GA.

• Journal of Information Processing Systems
• /
• 제14권2호
• /
• pp.448-454
• /
• 2018

Artificial bee colony (ABC) algorithm has attracted significant interests recently for solving the multivariate optimization problem. However, it still faces insufficiency of slow convergence speed and poor local search ability. Therefore, in this paper, a modified ABC algorithm with bees' number reallocation and new search equation is proposed to tackle this drawback. In particular, to enhance solution accuracy, more bees in the population are assigned to execute local searches around food sources. Moreover, elite vectors are adopted to guide the bees, with which the algorithm could converge to the potential global optimal position rapidly. A series of classical benchmark functions for frequency-modulated sound waves are adopted to validate the performance of the modified ABC algorithm. Experimental results are provided to show the significant performance improvement of our proposed algorithm over the traditional version.

• 한국전산유체공학회지
• /
• 제3권1호
• /
• pp.22-29
• /
• 1998

Parallel implementation is conducted for a SIMPLER finite volume model. The present parallelism is based on domain decomposition and explicit message passing using MPI and SHMEM. Two parallel solvers to tridiagonal matrix equation are employed. The implementation is verified on the Cray T3E system for a benchmark problem of natural convection in a sidewall-heated cavity. The test results illustrate good scalability of the present parallel models. Performance issues are elaborated in view of convergence as well as conventional parallel overheads and single processor performance. The effectiveness of a localized matrix solution algorithm is demonstrated.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2005년도 추계학술대회 및 정기총회
• /
• pp.409-413
• /
• 2005

The logical analysis of data(LAD) is an effective Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a new optimization-based pattern generation methodology and propose two mathematical programming medels, a mixed 0-1 integer and linear programming(MILP) formulation and a well-studied set covering problem(SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with much ease patterns of high complexity that cannot be generated with the conventional approach.

• Smart Structures and Systems
• /
• 제10권4_5호
• /
• pp.459-470
• /
• 2012

This paper summarizes a study for the modal analysis and model updating conducted using the monitoring data obtained from the Canton Tower of 610 m tall, which was established as an international benchmark problem by the Hong Kong Polytechnic University. Modal properties of the tower were successfully identified using frequency domain decomposition and stochastic subspace identification methods. Finite element model updating using the measurement data was further performed to reduce the modal property differences between the measurements and those of the finite element model. Over-fitting during the model updating was avoided by using an optimization scheme with a regularization term.

• 한국통신학회논문지
• /
• 제17권4호
• /
• pp.424-432
• /
• 1992

본 논문에서는 고위영역합성(High-level synthesis)의 가장 중요한 과제인 스케듈링 문제를 다루었다. 스케듈링 문제에 대한 접근 방식으로서, IP(integer programming)을 이용한 방식을 택하였다. 본 논문에서는 특히, 가용(可用)자원이 제한된 상태에서의 스케듈링이 효율적으로 수행될 수 있는 방법을 연구하여, 임의의 스케듈링방식에 의해 구해진 스케듈링 결과로부터, 주어진 조건을 만족하는 스케듈링을 행할수 있는 방법을 연구하였다. 멀티싸이클 연산의 연산자할당 및 구조적 파이프라이닝을 위한 스케듈링에 중점을 주어, 가능한한 최대의 성능과 최대의 자원공유가 이루어 지도록, 연산자의 특성을 세밀히 분석하였다.

• 한국시뮬레이션학회논문지
• /
• 제3권2호
• /
• pp.49-56
• /
• 1994

Performance measurement and analysis for computer systems has been studied for a long time. However, little attention has been focused on how to distribute a given budget to each part of a computer system for enhancing system performance maximally. In traditional approaches, performance enhancement is achieved by identifying a dominant system bottleneck and enhancing the bottleneck's performance. These approaches, however, often bring problems since the removal of a bottleneck may result in other bottlenecks. This paper proposes an approximated method for such budget distribution problem. For budget distribution, a critical set is defined. The set contains the servers of which performance changes affect the overall system performance significantly. Then, the given budget is distributed properly to every server in the critical set. To verify the proposed method, two benchmark experiments are carried out I SLAM environments. The experimental results show that the proposed method provides better results than the traditional method does in many cases.

• 정보기술과데이타베이스저널
• /
• 제8권2호
• /
• pp.91-101
• /
• 2001

Previous research efforts on performance evaluation of multidimensional indexes typically have used synthetic data sets distributed uniformly or normally over multidimensional space. However, recent research research result has shown that these hinds of data sets hardly reflect the characteristics of multimedia database applications. In this paper, we discuss issues on generating high dimensional data and query sets for resolving the problem. We first identify the features of the data and query sets that are appropriate for fairly evaluating performances of multidimensional indexes, and then propose HDDQ_Gen(High-Dimensional Data and Query Generator) that satisfies such features. HDDQ_Gen supports the following features : (1) clustered distributions, (2) various object distributions in each cluster, (3) various cluster distributions, (4) various correlations among different dimensions, (5) query distributions depending on data distributions. Using these features, users are able to control tile distribution characteristics of data and query sets. Our contribution is fairly important in that HDDQ_Gen provides the benchmark environment evaluating multidimensional indexes correctly.