• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.11a
• /
• pp.413-416
• /
• 2006

최근 위치 측위 기술의 발달 및 GPS 기술의 상용화로 인해 무선 통신 기기의 보급이 증가하면서 다양한 위치 기반 서비스 개발을 위한 노력이 활발히 진행되고 있다. 사용자들의 특성에 맞게 개인화되고 세분화된 위치 기반 서비스를 제공하기 위해서는 방대한 이동 객체의 위치 이동 데이터로부터 의미있는 지식인 유용한 패턴을 추출하기 위한 시간 패턴 탐사가 필요하다. 기존의 시간 패턴 탐사 기법들 중 일부는 이동 객체의 시간에 따른 공간 속성들의 변화를 충분히 고려하지 못하거나 또는 시공간 속성을 동시에 고려한 패턴 탐사는 가능하나 전체 이동 패턴들 중 추출하고자 하는 패턴에 반드시 포함되어야 하는 공간 정보에 대한 제약이 없어 특정 지점들 사이의 최적 이동 경로 탐색 문제나 단위기간 동안 이동 객체가 순회해야 지점들에 대한 스케줄링 경로 예측 문제 등에 적용하기 어렵다. 따라서 본 논문에서는 이동 객체의 위치 이력 데이터들에 대한 시공간 속성들을 고려하여 다양한 이동 패턴들 중 객체의 최적 이동 경로에 해당하는 패턴을 탐색하기 위한 새로운 시간 패턴 마이닝 알고리즘을 제안한다. 제안된 알고리즘은 특정한 지점들 사이를 이동한 객체의 위치 데이터들 중 객체가 가장 빈번하게 이동한 경로를 탐색하여 최적 경로를 결정하는 알고리즘으로, 공간 추상 계층의 각 계층별 영역 내 포함여부를 고려한 위치 일반화를 수행하여 보다 효과적으로 이동 패턴을 탐색할 수 있다.

• Journal of Broadcast Engineering
• /
• v.8 no.2
• /
• pp.204-208
• /
• 2003

In this paper, a new matrix vector formulation for a wavelet-based subband decomposition is introduced. This formulation provides a means to compute a regular multi-resolution analysis over many levels of decomposition. With this approach. any single channel linear space-invariant filtering problem can be cast into a multi-channel framework. This decomposition Is applied to the linear space-invariant image restoration problem and propose a frequency-adaptive constrained least squares(CLS) filter. In the proposed filter, we use different parameters adaptively according to subband characteristics. Experimental results are presented for the proposed frequency-adaptive CLS filter These experiments show that if accurate estimates of the subband characteristics are available, the proposed frequency adaptive CLS filter provides significant improvements over the traditional single channel filter.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.568-576
• /
• 2001

Most of clustering algorithms data to degenerate rapidly on high dimensional spaces. Moreover, high dimensional data often contain a significant a significant of noise. which causes additional ineffectiveness of algorithms. Therefore it is necessary to develop algorithms adapted to the structure and characteristics of the high dimensional data. In this paper, we propose a clustering algorithms CLIP using the projection The CLIP is designed to overcome efficiency and/or effectiveness problems on high dimensional clustering and it is the is based on clustering on each one dimensional subspace but we use the incremental projection to recover high dimensional cluster and to reduce the computational cost significantly at time To evaluate the performance of CLIP we demonstrate is efficiency and effectiveness through a series of experiments on synthetic data sets.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2016.05a
• /
• pp.40-40
• /
• 2016

우리나라는 산업화시기에 도시지역의 급속한 발달로 불투수면적과 하수보급률이 증가 하였으며, 이로 인해 지하수함량 감소, 용수사용량 증가 및 무분별한 지하수 개발 등은 도시하천의 수질 악화, 유량부족의 문제를 발생시켰다. 또한 1960년대 이후 하천정비사업은 홍수방지 등의 치수 차원에서 주로 정비되어 왔고, 산업화 팽창시기에 도시를 관통하여 흐르는 중소하천은 도시의 과밀화 문제를 해소하는 수단으로서 도로와 주차장등으로 이용되었다. 따라서 수변공간이 가지는 의미와 가치에도 불구하고 우리나라의 경우 수변공간은 치수와 이수 등 기능적인 목적을 위주로 관리되고 사용되어 왔다. 그러나 최근들어 지속가능한 물순환 체계 구축 및 적응 대책 수립을 지원하기 위해 개발사업 추진 시 저영향개발 기법의 적용을 확대하도록 권장하고 있으며, 국가하천 주변의 개발허가를 골자로 하는 "친수구역 활용에 관한 특별법"이 공표되어 수변공간 및 수변도시에 대한 관심이 증가하고 있는 추세이다. 본 연구에서는 도시개발에 따른 수문 및 환경적 영향을 최소화하기 위해 자연상태를 가급적 보존하고 불투수면적을 최대한 줄이며, 분산식 우수배제 방식을 지향하는 저영향개발 기법을 적용하였다. 이를 위해 현재 수변도시로 개발중인 송산그린시티에 저영향개발 기법을 적용하였으며, 기존의 개발 방식과의 비교를 통하여 저영향개발 기법의 효과를 분석하였다.

• Journal of Korean Society of Steel Construction
• /
• v.10 no.3 s.36
• /
• pp.473-486
• /
• 1998

A numerically stable technique to remove the limitation in choosing a shift in the subspace iteration method with shift is presented. A major difficulty of the subspace iteration method with shift is that because of singularity problem, a shift close to an eigenvalue can not be used, resulting in slower convergence. This study solves the above singularity problem using side conditions without sacrifice of convergence. The method is always nonsingular even if a shift is an eigenvalue itself. This is one of the significant characteristics of the proposed method. The nonsingularity is proved analytically. The convergence of the proposed method is at least equal to that of the subspace iteration method with shift, and the operation counts of above two methods are almost the same when a large number of eigenpairs are required. To show the effectiveness of the proposed method, two numerical examples are considered.

• Journal of Korean Society for Geospatial Information Science
• /
• v.22 no.4
• /
• pp.165-173
• /
• 2014

Open-pit mining method, is safe relatively work as compared with underground mining. And high yield, low production cost, has the advantage that it can provide a lot of production. But deforestation, tailings and slag deposition, mineral debris, dust, water, noise, land subsidence, sediment runoff discharge, I have internalized environmental disaster predisposing factors, such as landslides. Thus, it may be noted, also by typical environmental regulations. We try to deal with the changes in open pit terrain and environment related issues. Then, use the recovery period and the open pit mine and ecology off the gun, environment-friendly development of accurate monitoring methods, systems of this development is required. The use of open platforms and open source GIS tools have been developed during this period, it needs to develop spatial information environment monitoring system open pit mine construction.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.12 no.3
• /
• pp.371-383
• /
• 1999

An efficient and numerically stable eigensolution method for structures with multiple natural frequencies is presented. The proposed method is developed by improving the well-known subspace iteration method with shift. A major difficulty of the subspace iteration method with shift is that because of singularity problem, a shift close to an eigenvalue can not be used, resulting in slower convergence. In this paper, the above singularity problem has been solved by introducing side conditions without sacrifice of convergence. The proposed method is always nonsingular even if a shift is on a distinct eigenvalue or multiple ones. This is one of the significant characteristics of the proposed method. The nonsingularity is proved analytically. The convergence of the proposed method is at least equal to that of the subspace iteration method with shift, and the operation counts of above two methods are almost the same when a large number of eigenpairs are required. To show the effectiveness of the proposed method, two numerical examples are considered.

• Journal of Digital Contents Society
• /
• v.19 no.4
• /
• pp.605-613
• /
• 2018

In this paper, we propose a system to walk around the world with virtual reality technology. Although the virtual reality users are interested in the virtual travel contents, the conventional virtual travel contents have limited space for experiencing and lack of interactivity. In order to solve the problem of lack of realism and limited space, which is a disadvantage of existing contents, this system created a virtual space using Google Street View image. Users can have realistic experience with real street images, and travel a vast area of the world provided by Google Street View image. Also, a virtual reality headset and a treadmill equipment are used so that the user can actually walk in the virtual space, which maxmizes user interactivity and immersion. We expect this system contributes to the leisure activities of virtual reality users by allowing natural walking trip from famous tourist spots to even mountain roads and alleys.

• Journal of KIISE
• /
• v.43 no.12
• /
• pp.1365-1375
• /
• 2016

One of the most important capabilities for autonomous service robots working in living environments is to recognize and understand the correct context in dynamically changing environment. To generate high-level context knowledge for decision-making from multiple sensory data streams, many technical problems such as multi-modal sensory data fusion, uncertainty handling, symbolic knowledge grounding, time dependency, dynamics, and time-constrained spatio-temporal reasoning should be solved. Considering these problems, this paper proposes an effective dynamic context management and spatio-temporal reasoning method for intelligent service robots. In order to guarantee efficient context management and reasoning, our algorithm was designed to generate low-level context knowledge reactively for every input sensory or perception data, while postponing high-level context knowledge generation until it was demanded by the decision-making module. When high-level context knowledge is demanded, it is derived through backward spatio-temporal reasoning. In experiments with Turtlebot using Kinect visual sensor, the dynamic context management and spatio-temporal reasoning system based on the proposed method showed high performance.

• Journal of Korean Library and Information Science Society
• /
• v.38 no.1
• /
• pp.67-87
• /
• 2007

This study aims to suggest the ways to apply Information Commons to local university libraries, which face various changes in users and information environment, for using the libraries' space more effectively and for providing users with more satisfying services. Information Commons, which is a concept having been gradually spreading mainly in the U.S. from the early 1990's, is a service place where users can work out anything related to their studies or various lecture-related jobs because they are provided with various information and electronic resources in that one spot. Researches show that physical and human resources should be prepared before executing Information Commons to minimize the problems and to maximize the effectiveness from applying it. Physical resources are such as PC rooms, multimedia rooms, education rooms, one person or group study rooms, and cafe or lounge. Human resources are the librarians who can do reference services including giving the lectures on using library information resources and who can solve the operating problems related to IT.