• Journal of Mechanical Science and Technology
• /
• 제18권2호
• /
• pp.253-261
• /
• 2004

A simple and effective filtering method to control the member size of an optimized structure is proposed for topology optimization. In the present approach, the original objective sensitivities are replaced with their relative values evaluated within a filtering area. By adjusting the size of the filtering area, the member size of an optimized structure or the level of its topological complexity can be controlled even within a given finite element mesh. In contrast to the checkerboard-free filter, the present filter focuses on high-frequency components of the sensitivities. Since the present filtering method does not add a penalty term to the objective function nor require additional constraints, it is not only efficient but also simple to implement. Mean compliance minimization and eigenfrequency maximization problems are considered to verify the effectiveness of the present approach.

• 대한교통학회지
• /
• 제5권1호
• /
• pp.3-23
• /
• 1987

Traffic signal control problems in urban street networks are formulated in two ways. In the formulations network flows are assumed to satisfy the user route choice criterion. the first formulation which is called implicit substiuation incorporates user route behavior implicitly in the objective function by recognizing the dependence of the link flows on the signal variables. On the other hands, the second one which is called 'penalty formulation' consists in expressing the route choice conditions in the form of a single nonlinear constraint. Approximate solution algorithm for each of the formulations was investigated in detail and computer codes were written to examine key aspects of each algorithm. A test was done on a network which is small in size but sufficiently complex in representing real-world traffic conditions and the test result shows that both algorithms produce converged solutions. It is recommended, however, that further studies should be done in order to compare the performance of each algorithm more in depth.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 1999년도 춘계학술대회논문집
• /
• pp.253-256
• /
• 1999

The Streamline Upwind Petrov-Galerkin(SUPG) finite element method is used to solve the two-dimensional laminar and turbulent flow. The flow is simulated by averaged Navier-Stokes equations with a penalty function approach and the lograithmic(k-$\varepsilon$) turbulent model is employed to take into account its turbulent behavior. The near-wall viscous sub-layer model is employed to approach the dominant viscous effects in the near wall zones. To find a good-enough initial guess of the Newton-Raphson iteration solving Nonlinear Matrix the Incremental method is considered for momentum and the Incomplete logarithmic turbu-lent equations for Turbulence. The validation of our method is investigated in comparision with published experimental data.

• 한국지하수토양환경학회:학술대회논문집
• /
• 한국지하수토양환경학회 2004년도 임시총회 및 추계학술발표회
• /
• pp.302-306
• /
• 2004

Probabilistic approaches are applied to the problem of groundwater remediation design to consider the risk of design and heterogeneity of real condition. Hydraulic conductivity fields are generated by two methods. First, the homogeneous domains which have the hydraulic conductivity with log-normal distribution are constructed by using Latin Hypercube method. Second, random fields with a certain spatial correlation are also generated. The optimal solutions represented by cumulative distribution function (CDF) of relative cost are calculated by three different manners. The one uses the homogeneous domains with the optimal design of base condition. It shows that ver)'wide range of cost and the influences of different penalty values. The other one uses the random field with same design and shows narrow range of cost. These CDF can reflect on the risk of optimal solution in a simple exampie condition and be effective in estimating the cost of groundwater remediation.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.514-518
• /
• 1990

This paper describes an experimental Knowledge-Based Control System, named KBCS, for manufacturing and assembly. The KBCS of five parts and function : data-base, knowledge acquisition, optimization, and graphic monitoring. The KBCS is utilized for a FMS which is of five machine centers and automatic assembly lines. Each machine can perform almost all manufacturing functions which some difference in efficiency. Buffers store temporarily the incoming components and the outing components. Parts arrive at assembly lines after many steps of manufacturing, and the transfer path and time are determined by procedural knowledge of control systems. Nine different incoming components are set up. The total control system is expected to perform four algorithms, timing algorithm ,sequencing algorithm, penalty algorithm, and cart algorithm. The construction of controller require basic components of manufacturing systems in which knowledges are formulated on the base of the results and the repeated simulation of KBCS with graphic monitoring system. Simulation results by KBCS are compared with those by the other rules of manufacturing.

• Journal of Electrical Engineering and Technology
• /
• 제3권4호
• /
• pp.514-519
• /
• 2008

The non-separable quadratic penalty terms create an inherent difficulty when applying the standard augmented Lagrangian relaxation(ALR) method for decomposing the unit commitment problem into independent subproblems. This paper presents a separable augmented Lagrangian relaxation method for solving the unit commitment problem. The proposed method is designed to have a separable structure by introducing the quadratic terms with additional auxiliary terms in the augmented Lagrangian function. Numerical results are presented to validate the effectiveness of the proposed method.

• 대한산업공학회지
• /
• 제23권1호
• /
• pp.223-234
• /
• 1997

Companies often have to locate their facilities considering competitors' response to their locational decision. One model available in the literature is due to Dobson and Karmarkar, in which a firm has to decide locations so as to prevent competitors from entering the market after the firm's entry. In this paper, we provide new compact binary integer program formulations for their competitive location model and also present an efficient Genetic Algorithm(GA) for finding a (near-)optimal stable set. The GA we propose utilizes a penalty function to handle the feasibility of the problem and modified elitism for better performance of the algorithm. Computational comparisons indicate the superior performance of the GA over the Dobson and Karmarkar's branch and fathom algorithm.

• 한국안전학회지
• /
• 제13권1호
• /
• pp.40-46
• /
• 1998

This paper is presented that theoretical optimization design method in order to consider mass reduction for the structural safety In this paper, it described methods for reducing vibration in structural safety by the determination of the optimum sizes and locations of tunning masses through formal mathematical optimization techniques. The optimization procedure which employs the tunning masses and corresponding locations is developed. Design variables are systematically changed to achieve low values of shear without a large mass penalty. Three optimization methods ire developed and tested. The first is based on minimizing the modal shaping parameter which indirectly reduce the modal shear amplitudes corresponding to each harmonic of airload. The second method reduces these amplitudes directly and the third method reduces the shear as a function of time during a revolution of the blade. The first method works well for reducing the shear for one mode responding to a single harmonic of the airload but has been found in some bases to be ineffective for more than one mode.

• Journal of information and communication convergence engineering
• /
• 제7권3호
• /
• pp.372-376
• /
• 2009

In this paper, new and simple optical transmission link with fixed dispersion management (DM) scheme, i.e., pre(post) compensation and residual dispersion per span (RDPS) are fixed to net residual dispersion (NRD) = 0 ps/nm, and optical phase conjugator (OPC) having optimal position depending on launch power in WDM transmission system is proposed. Also, effective launch power range of WDM channels resulting 1 dB eye opening penalty (EOP) is induced as a function of OPC position. First, it is confirmed that, for applying DM into WDM transmission link fixed pre(post)compensation and RDPS, which are independence on exact system parameters except launch power, sufficiently are used in WDM links, but OPC with optimal position is needed for effective compensating impairments of WDM channels. And, it is confirmed that effective launch power is broader in case of RDPS = 100 ps/nm than in RDPS = 50 ps/nm. But, it is shown that the best OPC position offset is -0.6 km from a point of view of power window, which is defined as difference between maximum and minimum effective launch power.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2000년도 봄 학술발표논문집 Vol.27 No.1 (B)
• /
• pp.354-356
• /
• 2000

의사형태소를 디코딩 단위로 한국어 연속 음성 인식에서의 조사, 어미, 접사 및 짧은 용언의 어간등의 단어가 상당수의 인식 오류를 발생시킨다. 이러한 단어들은 발화 지속시간이 매우 짧고 생략이 빈번하며 결합되는 다른 형태소의 형태에 따라서 매우 심한 발음상의 변이를 보인다. 본 논문에서는 이러한 단어들은 한국어 기능어라 정의하고 실제 의사형태소 단위의 인식 실험을 통하여 기능어 집합 1, 2를 규정하였다. 그리고 한국어 기능어에 기능어용 음소를 독립적으로 적용하는 방법을 제안했다. 또한 기능어용 음소가 분리되어 생기는 음향학적 변이들을 처리하기 위해 Gaussian Mixture 수를 증가시켜 보다 견고한 학습을 수행했고, 기능어들의 음향 모델 스코어가 높아짐에 따른 인식에서의 삽입 오류 증가를 낮추기 위해 언어 모델에 fixed penalty를 부여하였다. 기능어 집합1에 대한 음소 모델을 적용한 경우 전체 문장 인식률은 0.8% 향상되었고 기능어 집합2에 대한 기능어 음소 모델을 적용하였을 때 전체 문장 인식률은 1.4% 증가하였다. 위의 실험 결과를 통하여 한국어 기능어에 대해 새로운 음소를 적용하여 독립적으로 학습하여 인식을 수행하는 것이 효과적임을 확인하였다.