• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.354-356
• /
• 1998

축약 분산 기억 장치는 적응적 문제 해결 능력과 하드웨어화의 용이성으로 인해 현실성이 있는 신경망의 한 모델로 주목받고 있다. 그러나 다층 인식자의 개별 뉴론이 선형의 결정 함수로 해 공간을 이분하고 그들이 다양하게 결합하므로써 일반적인 문제 해결 능력을 갖는데 비해, 축약 분산 기억 장치의 뉴론은 해 공간에서 자신을 중심으로 한 일정 반경 영역을 안과 밖으로 이분하고 이들을 단순하게 합하므로 해 공간이 크기 관계를 갖는 경우 비효율적인 모델로 된다. 본 논문에서는 이러한 축약 분산 기억 장치의 특성과 그 원인을 규명하고 해결 방안으로써 개선된 축약 분산 기억 장치를 제안한다. 아울러 새로운 모델의 적용 예를 ATM 호 수락 제어 과정을 통해 보인다.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.19 no.5
• /
• pp.340-346
• /
• 1999

Minimum reflection and backward radiation methods on liquid/solid interrace were used to determine the velocity dispersion relation of acoustical surface wave for brass and aluminum substrates and copper/stainless steel nickel/brass, and nickel/aluminum layered substrates. Dispersion data agreed to dispersion characteristics of a generalized Lamb wave. The difference between velocities determined by two phenomena was closely related to the dispersion characteristics. This correspondence was explained by considering the generation mechanism of surface waves and the concept of group velocity.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.239-241
• /
• 2012

최근 클라우드 서비스 공급자들은 세계적으로 증가하는 고객의 수요에 대응하기 위하여, 다양한 지역에 데이터센터들을 구축하고 시스템의 규모를 확장시키고 있다. 클라우드는 통합된 자원을 이용하기 때문에 부하 분산(load balancing)을 통해서 시스템의 성능 및 안정성을 향상시킬 수 있다. 하지만 지역적으로 분산된 데이터센터들을 운영하는 클라우드 컴퓨팅 환경에서는 자원 부하의 분산과 서비스 응답 속도(service response time) 사이의 상관 관계를 고려할 필요가 있다. 그럼에도 불구하고 대부분의 클라우드 서비스 공급자들은 고정된 최소 서비스 응답 속도를 서비스 수준 협약(SLA: Service-Level Agreements)을 제시하고 있는 현실이다. 이와 같이 SLA에 최소 서비스 응답 속도를 임의로 고정할 경우, 거리차이가 있는 데이터센터(SLA에 명시된 응답 속도 보다 느린 데이터센터)에는 부하가 분산되기 어렵다. 따라서 지역적으로 분산된 데이터센터 환경에서는 응답 속도에 대한 가변 SLA를 적용할 필요가 있다. 본 연구에서는 지역적으로 분산된 데이터센터를 운영하는 클라우드 컴퓨팅 환경에서 가변 응답 속도를 적용하기 위한 방법으로써 서비스 응답 속도와 가격을 고려한 자동화된 SLA 협상 메커니즘을 적용하고 그 유효성을 평가하였다. 시뮬레이션을 이용한 실험 결과를 통해서 SLA 협상을 통한 가변 SLA를 이용하는 방법이 고정된 SLA를 이용하는 방법에 비해서 더 높은 SLA 보장률을 지원하고 클라우드 공급자에게 더 높은 수익을 제공함을 확인하였다.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.6
• /
• pp.627-637
• /
• 2009

Composite materials have been employed in the various engineering applications due to high mechanical performances including high strength-weight ratio and high degree of free formability. Due to complex manufacturing process, however, it can have intrinsic randomness in the material constants which affect the deterministic behavior of the composite structures. In this study, we suggest a formulation for stochastic finite element analysis considering the spatial randomness of Poisson's ratio. Considering the reciprocal relation between elastic moduli and Poisson's ratios in the two mutually orthogonal axes, one of two values of Poisson's ratio can be expressed in terms of the other. Using this, the relation between stress resultants and strains is derived in the ascending order of power of the stochastic field function, which can be directly used in the formulation to obtain the coefficient of variation of responses. The adequacy of the proposed scheme is demonstrated by comparison with the results of Monte Carlo analysis.

• The Korean Journal of Financial Management
• /
• v.20 no.1
• /
• pp.125-162
• /
• 2003

This paper investigates the short- and long- run relationship among Korean, U.S. and Japanese construction indices. We conducted the Johansen's cointegration tests on the hypotheses that the construction indices of three countries we related in the long-run as well as in the short-run. The test results show that there exists no long-run relationship among three countrie's construction indices. In addition, the cointegrating relation did not exist for three countrie's stock market indices and five major Korean construction firms. It fumed out that the U.S. indices Granger-causes Japanese and Korean indices. This finding implies that there may exist international diversification benefit through forming a portfolio from these indices.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.151-153
• /
• 2005

유비쿼터스 연구가 진행되면서 서로 데이터 모델이 안지 않는 이기종 데이터베이스 간의 데이터 교환이 중요한 문제로 대두되었다. XML문서는 데이터 호환성이 뛰어나 유비쿼터스 환경에 맞는 데이터 교환 수단으로 적합하다. 데이터베이스 시스템의 장점때문에 XML 문서를 객체 관계 데이터베이스에 저장하는 연구가 진행되었다. 객체 관계 데이터베이스 시스템에 XML 문서를 저장하고 질의하는 방법에는 여러 가지가 있다. 이 논문에서는 분산 환경에서 객체 관계 데이터베이스 시스템에 XML 문서를 저장하고 질의하는 방법을 논의하고, 성능 평가를 수행한다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.2 s.105
• /
• pp.165-170
• /
• 2006

A two dimensional(2-D) finite-difference time-domain(FDTD) method based on a novel finite difference scheme is developed to eliminate the numerical dispersion errors. In this paper, numerical dispersion and stability analysis of the new scheme are given, which show that the proposed method is nearly dispersionless, and stable for a larger time step than the standard FDTD method.

• KIISE Transactions on Computing Practices
• /
• v.24 no.3
• /
• pp.105-112
• /
• 2018

As data size increase, a single database is not enough to serve current volume of tasks. Since data is partitioned and stored into multiple databases, analysis should also support parallelism in order to increase efficiency. However, traditional analysis requires data to be transferred out of database into nodes where analytic service is performed and user is required to know both database and analytic framework. In this paper, we propose an efficient way to perform K-means clustering algorithm inside the distributed column-based database and relational database. We also suggest an efficient way to optimize K-means algorithm within relational database.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.35-40
• /
• 2003

In this paper, I raise an issue regarding the relationships between the Election problem and the Consensus problem in asynchronous systems with unreliable failure detectors. First, I describe our system model, and then define Leader Election. After then, I show that the Election problem is harder to resolve than the Consensus problem. Each correct process eventually gets into the state in which it considers only one process to be a leader. Therefore a Perfect Failure Detector is the weakest failure detector which is sufficient to solve the Election. In order to show that the Election problem is harder to resolve than the Consensus problem, I utilize the Reduction protocol in this paper.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.10
• /
• pp.397-406
• /
• 2014

In order to answer the questions successfully on behalf of the human in DeepQA environments such as Jeopardy! of the American quiz show, the computer is required to have the capability of fast temporal and spatial reasoning on a large-scale commonsense knowledge base. In this paper, we present a scalable spatial reasoning algorithm for deriving efficiently new directional and topological relations using the MapReduce framework, one of well-known parallel distributed computing environments. The proposed reasoning algorithm assumes as input a large-scale spatial knowledge base including CSD-9 directional relations and RCC-8 topological relations. To infer new directional and topological relations from the given spatial knowledge base, it performs the cross-consistency checks as well as the path-consistency checks on the knowledge base. To maximize the parallelism of reasoning computations according to the principle of the MapReduce framework, we design the algorithm to partition effectively the large knowledge base into smaller ones and distribute them over multiple computing nodes at the map phase. And then, at the reduce phase, the algorithm infers the new knowledge from distributed spatial knowledge bases. Through experiments performed on the sample knowledge base with the MapReduce-based implementation of our algorithm, we proved the high performance of our large-scale spatial reasoner.