• Architectural research
• /
• v.11 no.2
• /
• pp.19-26
• /
• 2009

The effect of rebirthing technique on the genetic algorithm (GA)-based size optimization is investigated. The GA mimics the principles of nature and it can gradually improve structural design through biological operations such as fitness, selection, crossover and mutation. However, premature optimum has been often detected in the generic GA with continuous design variable. Since then, the so-called rebirthing technique has been proposed to avoid this problem. However, the performance of the rebirthing technique has not been reported. Therefore, the size optimizations of spatial structures are tackled to investigate the performance of the rebirthing technique on the generic GA. From numerical results, it is well proved that the rebirthing technique is very effective to produce the optimum values regardless of the values of parameters used in the GA operations.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.04a
• /
• pp.729-737
• /
• 1996

Laminated composite plates have been applied to aircraft structures because their properties are superior to the conventional materials and the laminates have anisortropic elastic properties. However, it tis diffcult to determine stacking structures using actual design variables for the lack of searching capability of existing optimization technique. GA(generic algorithms) are robust search algorithms based on the mechanics of natural selection and natural genetics. Therefore, this study presents an application of IGA to stiffness and weight optimization design and gives the various stacking structures suitable to constraint conditions.

• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.51-58
• /
• 2006

In rapid prototyping, the optimal part orientation during fabrication is critical as it can improve part accuracy, minimize the requirement for supports and reduce the production time. Through investigating the geometric issues of STL model and process planning of RPM, This paper establishes optimizing model based on the considerations of staircase effect, support area and production time. The general satisfactory degree function is constructed employing the multi-objective optimization theory based on the general satisfactory degree principle. The best part-building orientation is obtained by solving the function employing generic algorithm. Experiment shows that the methods can effective resolve the part-building orientation in RP.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.367-369
• /
• 2001

GSPA(Generic Shortest Path Algorithm)은 각종 정보통신 네트워크 상에서 멀티미디어 정보전송시 요구되는 QoS 기반의 라우팅을 위한 새로운 라우팅 알고리즘이다. 전체적인 동작은 원시노드(Source Node)에서 목적노드(Destination Node) 사이에서 이전 단계의 재귀호출에서 찾은 최단 경로를 기준으로 해서 이웃 노드들을 대상으로 재귀호출을 통해서 QoS 요구조건을 만족하는 경로정보를 기록하면서 최단 경로를 찾는 알고리즘이다. GSPA는 기존 Distance Vector 알고리즘이 경로를 설정하기 위해 많은 시간과 대역폭을 낭비하며 네트워크 형상이 수시로 변경될 때 “Counting to Infinity”현상을 발생시키는 단점을 보완하고, Link-State 데이터 베이스를 이용해서 함수 재귀호츨을 통해서 최단 경로를 찾아냄으로써 구현하기가 쉬운 알고리즘이다. 또, Distance-Vector와 Link-State 알고리즘의 장점을 수용하였으며, 이 알고리즘을 분산 네트워크 환경에서 동작하도록 수정하면 분산 네트워크 환경에서의 Hierarchical Routing, Multi-Path Routing, QoS Routing을 위한 기본 알고리즘으로 매우 좋은 특성들을 가지고 있다. 본 논문에서는 이 알고리즘을 소개하고 간단한 예를 통해 기본 동작에 대해 살펴본다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.5
• /
• pp.169-177
• /
• 2003

We establish the security requirements and derive a generic condition of elliptic curve scalar multiplication to resist against DPA and Goubin’s attack. Also we show that if a scalar multiplication algorithm satisfies our generic condition, then both attacks are infeasible. Showing that the randomized signed scalar multiplication using Ha-Moon's receding algorithm satisfies the generic condition, we recommend the randomized signed scalar multiplication using Ha-Moon's receding algorithm to be protective against both attacks. Also we newly design a random recoding method to Prevent two attacks. Finally, in efficiency comparison, it is shown that the recommended method is a bit faster than Izu-Takagi’s method which uses Montgomery-ladder without computing y-coordinate combined with randomized projective coordinates and base point blinding or isogeny method. Moreover. Izu-Takagi’s method uses additional storage, but it is not the case of ours.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.210-214
• /
• 2008

It is actually impossible to model and store all objects which exist in real home environment into robot's database in advance. To resolve this problem, this paper proposes new object modeling method that can be available for robot self-modeling, which is capable of estimating whole model's shape from partial surface data using Generic Model. And this whole produce is conducted to cylindrical objects like cup, bottles and cans which can be easily found at indoor environment. The detailed process is firstly we obtain cylinder's initial principle axis using points coordinates and normal vectors from object's surface after we separate cylindrical object from 3D image. This 3D image is obtained from 3D sensor. And second, we compensate errors in the principle axis repeatedly. Then finally, we do modeling whole cylindrical object using cross sectional principal axis and its radius To show the feasibility of the algorithm, We implemented it and evaluated its accuracy.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.776-782
• /
• 1995

This paper presents a methodology for development of a heterarchical control system in Flexible Manufacturing Systems (FMS) environment. A Petri net based model is applied for development of control software. A real-time scheduling methodology for the heterarchical system is also developed and it is used as a software entity in the overall architecture. The partition of generic and specific modules in control software development is emphasized. The control system performs its control tasks in two stages: (1) generation of generic control code and distribution of them to each controller entity prior to system execution; (2) generation of specific control code according to job arrival and its process plan. The control software and the scheduling algorithm are evaluated by a simulation program.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.45.5-45
• /
• 2002

In this paper, a quasi-deadbeat minimax estimation (QME) is proposed as a new class of time-domain parameter estimations for deterministic generic linear models. Linearity, quasi-deadbeat property, FIR structure, and independency of the initial parameter information will be required in advance, in addition to a new performance criterion of a worst case gain between the disturbances and the current estimation error. The proposed QME is obtained in a closed form by directly solving an optimization problem. The QME is represented in both a batch form and an iterative form. A fast algorithm for the suggested estimation is also presented, which is remarkable in view...

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1427-1429
• /
• 2003

In our contribution, the new idea of parking/moving discrimination is proposed by using Three Line Scanner Imagery. The framework of our study consists of three main stages: preprocessing, vehicle detection and parking/moving detection respectively. First two stages of framework have been done in our previous work. Parking/ Moving Discrimination algorithm have been developed by using generic vehicle characteristics and some principle of photogrammetry. By using detected vehicles from our previous work, stopping/moving vehicles are able to discriminate. Moving vehicle is detected by detecting generic moving vehicle in TLS, inter-band gap. Stopping vehicle is verified by 3 dimensional viewing of Stereoscopic measurement. Finally, the conceptual framework has been done and the result will been realized soon.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.308-315
• /
• 2002

Guaranteed frame rate (GFR) service has been defied to provide minimum cell rate (MCR) guarantees for virtual connections (VCs) carrying Internet traffic in ATM networks and allow them to fairly share residual bandwidth. The simplest switch implementation mechanism to support the GFR service in ATM networks consists of the frame-based generic cell rate algorithm (F-GCRA) frame classifier and the early packet discard (EPD)-like buffer acceptance algorithm in a single FIFO buffer. This mechanism is simple, but has foiled to guarantee the same bandwidth as an MCR to a VC that has reserved a relatively large MCR. This paper applies the packet spacing scheme to TCP traffic to alleviate its burstness, so as to guarantee a larger MCR to a VC. In addition, the random early detection (RED) scheme is added to the buffer acceptance algorithm in order to improve fairness in use of residual bandwidth. Simulation results show that the applied two schemes improve a quality of service (QoS) in the GFR service for the TCP traffic.