• Journal of the Earthquake Engineering Society of Korea
• /
• v.2 no.2
• /
• pp.23-34
• /
• 1998

This research proposes on effective analytical methodology for vertical vibration of three dimensional frame structures including slabs. The consideration of slabs, although allows more precise results, requires large amount of computer time and memory space due to the use of plane stress elements. In consideration of these problems, a method to properly manage nodal points and degrees of freedom is proposed based on matrix condensation technique. Also studied is the use of super elements to obtain fast and reliable results with simple input data when they are applied to conventional building structures.

• Computational Structural Engineering
• /
• v.7 no.3
• /
• pp.143-152
• /
• 1994

Superelement technique for structural analysis of large scale objects such as airplanes or vessels is effective especially in the harsh hardware environments. In this paper, a crane vessel of OHI 5000 which is capable of lifting 5000 tons in tie-backs and capable of revolving with 3000 tons is investigated in the view point of structural safety using superelements through the substructure scheme. Also an effective substructure procedure, a unique load extraction method and finite element modeling technique are demonstrated. Comprehensive reinforcement blueprints are derived based on the analysis results. Successful application of substructure technique is achieved through the structural analysis of the crane vessel. The analysis technique developed in this paper can be a guideline for similar large scale structures' relevant safety identification.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.1
• /
• pp.80-86
• /
• 2002

This paper describes to extend the MLFMA(Multi-Level Fast Multipole Algorithm) for three-dimensional capacitance computation in the case of conductors embedded in an arbitrary dielectric medium. The triangular meshes are used and refined in the area which has heavy charge density. This technique is applied to the capacitance extraction of three-dimensional structures with multiple dielectrics. The results show good convergence with the comparable accuracy, and this adaptive technique coupled with MLFMA is useful to reduce computing time and the number of elements with least additional computational efforts in large three dimensional problems.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.28-30
• /
• 2018

본 논문에서는 전이중 통신 방식을 사용하는 DOCSIS 3.1 시스템의 자기간섭 제거를 위한 자기간섭신호의 채널 및 비선형 왜곡 요소를 추정하는 기술을 제안한다. DOCSIS 3.1 시스템의 전이중 통신 방식은 일반적으로 가입자 단말인 CM (Cable Modem) 과 케이블방송신호 송신 시스템인 CMTS (Cable Modem Termination System) 사이의 상하향 통신을 시간/주파수의 분할 없이 동시에 수행하는 통신 방식이다. CMTS 에서 CM 의 신호를 수신함과 동시에 CMTS 신호를 송신하는 경우 고출력의 CMTS 송출신호가 CMTS 의 수신기로 인가되는 자기간섭 현상이 발생하게 된다. 이렇게 인가되는 자기간섭신호는 고출력 증폭기 (HPA: High - Power Amplifier) 및 Feedback 채널의 영향으로 크게 왜곡되어 수신된다. 따라서 자기간섭신호를 제거하고 CM 의 신호를 원활하게 복조하기 위해서는 자기간섭신호의 왜곡 요소룰 추정 및 보상하는 절차가 반드시 필요하다. 본 논문에서는 자기간섭신호의 HPA 에서 발생하는 비선형 왜곡 요소 및 Feedback 채널의 영향으로 발생하는 채널 요소를 추정하는 기술을 제안하고 성능을 분석한다. 제안된 기술은 간단한 연산기반으로 왜곡요소의 추정이 가능하며 반복추정을 통해 성능을 효과적으로 향상시키는 것이 가능하다.

• Proceedings of the Korea Database Society Conference
• /
• 1999.06a
• /
• pp.271-280
• /
• 1999

인공신경망을 시계열예측에 적용하는 경우에 고려되어야 할 문제중, 특히 모형에 적합한 입력변수의 생성이 중요시되고 있는데, 이러한 분야는 인공신경망의 모형생성과정에서 입력변수에 대한 전처리기법으로써 다양하게 제시되어 왔다. 가장 최근의 입력변수 전처리기법으로써 제시되고 있는 신호처리기법은 전통적 주기분할처리방법인 푸리에변환기법(Fourier transforms)을 비롯하여 이를 확장시킨 개념인 웨이블릿변환기법(wavelet transforms) 등으로 대별될 수 있다. 이는 기본적으로 시계열이 다수의 주기(cycle)들로 구성된 상이한 시계열들의 집합이라는 가정에서 출발하고 있다. 전통적으로 이러한 시계열은 전기 또는 전자공학에서 주파수영역분할, 즉 고주파 및 저주파수를 분할하기 위한 기법에 적용되어 왔다. 그러나, 최근에는 이러한 연구가 다양한 분야에 활발하게 응용되기 시작하였으며, 그 중의 대표적인 예가 바로 경영분야의 재무시계열에 대한 분석이다 전통적으로 재무시계열은 장, 단기의사결정을 가진 시장참여자들간의 거래특성이 시계열에 각기 달리 가격으로 반영되기 때문에 이러한 상이한 집단들의 고유한 거래움직임으로 말미암아 예를 들어, 주식시장이 프랙탈구조를 가지고 있다고 보기도 한다. 이처럼 재무시계열은 다양한 사회현상의 집합체라고 볼 수 있으며, 그만큼 예측모형을 구축하는데 어려움이 따른다. 본 연구는 이러한 시계열의 주기적 특성에 기반을 둔 신호처리분석으로서 기존의 시계열로부터 노이즈를 줄여 주면서 보다 의미 있는 정보로 변환시켜 줄 수 있는 웨이블릿분석 방법론을 새로운 필터링기법으로 사용하여 현재 많은 연구가 진행되고 있는 인공신경망과의 모형결합을 통해 기존연구와는 다른 새로운 통합예측방법론을 제시하고자 한다. 본 연구에서 제시하는 통합방법론은 크게 2단계 과정을 거쳐 예측모형으로 완성이 된다. 즉, 1차 모형단계에서 원시 재무시계열은 먼저 웨이블릿분석을 통해서 노이즈가 필터링 되는 동시에, 과거 재무시계열의 프랙탈 구조, 즉 비선형적인 움직임을 보다 잘 반영시켜 주는 다차원 주기요소를 가지는 시계열로 분해, 생성되며, 이렇게 주기에 따라 장단기로 분할된 시계열들은 2차 모형단계에서 신경망의 새로운 입력변수로서 사용되어 최종적인 인공 신경망모델을 구축하는 데 반영된다.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.4
• /
• pp.11-21
• /
• 2011

This paper proposes a method for decomposing a Hangul glyph of outline fonts into its initial, medial and final components using statistical-structural information. In a font family, the positions of components are statistically consistent and the stroke relationships of a Hangul character reflect its structure. First, we create the component histograms that accumulate the shapes and positions of the same components. Second, we make pixel clusters from character image based on pixel direction probabilities and extract the candidate strokes using position, direction, size of clusters and adjacencies between clusters. Finally, we find the best structural match between candidate strokes and predefined character model by relaxation labeling. The proposed method in this paper can be used for a study on formative characteristics of Hangul font, and for a font classification/retrieval system.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.5
• /
• pp.475-482
• /
• 2010

In this paper, an efficient two-level parallel domain decomposition algorithm is suggested to solve large-DOF structural problems. Each subdomain is composed of the coarse problem and local problem. In the coarse problem, displacements at coarse nodes are computed by the iterative method that does not need to assemble a stiffness matrix for the whole coarse problem. Then displacements at local nodes are computed by Multi-Frontal Sparse Solver. A parallel version of PCG(Preconditioned Conjugate Gradient Method) is developed to solve the coarse problem iteratively, which minimizes the data communication amount between processors to increase the possible problem DOF size while maintaining the computational efficiency. The test results show that the suggested algorithm provides scalability on computing performance and an efficient approach to solve large-DOF structural problems.

• Journal of Korea Multimedia Society
• /
• v.7 no.3
• /
• pp.388-398
• /
• 2004

This paper focuses on the reduction method of message traffic occurred when multiple participants collaborate in the distributed virtual environment. It is referred to as filtering method of update message to minimize data traffic exchanged in the virtual environment, and it is the essential process to improve the scalability of the virtual environment. Spatial partitioning method, a popular filtering technique, divides the whole environment into smaller sub-parts in order to make it small the regions to be maintained consistently. However, it is less flexible and adaptable because the information of area of interest must be configured before simulation. In this paper, the concept of dynamic area of interest is proposed, which is highly adaptable by applying dynamic environmental elements to AOI management. It uses multiple layering and multiple consistency algorithms for dynamic management, and makes it possible to consume system resource efficiently. For performance evaluation, experiments are performed with virtual avatars, measuring message traffic. Finally, the proposed model could be applied to the AOI management systems which accommodate massive users like MMORPG, or virtual communities.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.531-540
• /
• 2008

An Adaptive Random Testing(ART) is one of test case generation algorithms, which was designed to get better performance in terms of fault-detection capability than that of Random Testing(RT) algorithm by locating test cases in evenly spreaded area. Two ART algorithms, such as Distance-based ART(D-ART) and Restricted Random Testing(RRT), had been indicated that they have significant drawbacks in computations, i.e., consuming quadratic order of runtime. To reduce the amount of computations of D-ART and RRT, iterative partitioning of input domain strategy was proposed. They achieved, to some extent, the moderate computation cost with relatively high performance of fault detection. Those algorithms, however, have yet the patterns of non-uniform distribution in test cases, which obstructs the scalability. In this paper we analyze the distribution of test cases in an iterative partitioning strategy, and propose a new method of input domain enlargement which makes the test cases get much evenly distributed. The simulation results show that the proposed one has about 3 percent of improvement in terms of mean relative F-measure for 2-dimension input domain, and shows 10 percent improvement for 3-dimension space.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.3
• /
• pp.299-305
• /
• 2010

In general, the flexible forming die that has been used in the flexible forming process has the identical punch size; hence, its flexibility is relatively low because the range of allowable curvature radii is limited due to the uniform punch tip radius. Hence, a conceptual design of a sectional flexible die is presented for enhancing the flexibility of the forming process. Two punches of different sizes are used to configure the arbitrary forming surface. For a forming region with a relatively large curvature radius, a large punch array block is used; on the other hand, for the forming regions with small curvature radii, a small punch block is used. The cross-sectional profiles are compared with the target shape for evaluating the effectiveness of the process. Consequently, it is confirmed that the sectional flexible die can be used along with a combination of punch blocks of different sizes for manufacturing objective surfaces of complex shapes.