• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.342-352
• /
• 2006

Current studies on storing XML data are focused on either mapping XML data to existing RDBMS efficiently or developing a native XML storage. Some native XML storages store each XML node with parsed object form. Clustering, the physical arrangement of each object, can be an important factor to increase the performance with this storing method. In this paper, we propose re-clustering techniques that can store an XML document efficiently. Proposed clustering technique uses path similarities among data nodes, which can reduce page I/Os when returning query results. And proposed technique can process a path query only using small number of clusters as possible instead of using all clusters. This enables efficient processing of path query because we can reduce search space by skipping unnecessary data. Finally, we apply existing clustering techniques to store XML data and compare the performance with proposed technique. Our results show that the performance of XML storage can be improved by using a proper clustering technique.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.16-18
• /
• 2004

Single system image(SSI) have been the mainstay high-performance computing for many years. SSI requires the integration and aggregation of all types of resources in a cluster to present a single interface to users. In this paper, we describe a cluster computing architecture with the concept of single process space(SPS) where all processes share a uniform process identification scheme. With SPS, a process on any node can create child process on the same or different node or communicate with any other process on a remote node, as if they are on a single node. For this purpose, SPS is built with the support of unique cluster-wide pid, signal forwarding, and remote fork. We propose a novel design of SPS cluster which addresses the scalability and flexibility problem of traditional clusterwidely unique pid implementation by using blocked pid assignment. We have implemented this new design of SPS cluster, and we demonstrate its performance by comparing it to Beowulf distributed process space. Benchmark performance results show that our design of SPS cluster realized both scalability and flexibility that are essential to building SPS cluster.

• 한국신재생에너지학회:학술대회논문집
• /
• 2009.06a
• /
• pp.573-573
• /
• 2009

지열에너지는 지구가 생성될 당시부터 지구 내부에 존재하는 무한한 열에너지로 온실가스 배출이 적으며 태양광이나 풍력 등 다른 신재생 에너지와는 달리 일정한 에너지를 공급할 수 있는 항상성 에너지로 기저부하를 담당할 수 있다. 지열을 이용한 전력 생산은 1904년에 이탈리아 라데렐로에서 처음으로 시작되었으며, 현재까지 화산지대를 중심으로 활발히 이루어지고 있다. 2001년에서 2005년 사이에 전세계 지열발전용량은 약 13% 증가하였으며, 2005년을 기준으로 약 8,933MWe의 지열발전설비가 가동 중이다. 최근 들어 지하 심부까지 시추하여 지열저장소(geothermal reservoir)를 형성하고 이를 통해 지열에너지를 생산하는 새로운 시스템인 EGS(Enhanced Geothermal Systems)가 개발됨에 따라 비화산지대에서도 지열발전소를 건설하려는 움직임이 가속화되고 있다. EGS는 지하 심부의 불투수성 결정질 암반에 존재하는 지열에너지의 경제적인 생산뿐만 아니라 물을 주입하여 생산시키는 순환 방식을 이용하여 지열에너지 획득의 매개 역할을 하는 지열수의 고갈 문제를 해결하였다. 결정질 암반에서의 지열저장소의 형성은 암반 내에 분포하는 불연속면에서 주로 발생하며, 이를 위한 압력 조건은 현지 암반의 응력 분포 특성과 암반 및 불연속면의 물성에 좌우된다. 시추공을 통해 지하 심부의 암반에 수압이 가해지면 물의 주입으로 불연속면의 마찰력이 감소하며, 이로 인해 불연속면에 전단변형이 발생하게 된다. 전단변형은 불연속면을 열린 상태로 유지시켜 지열저장소를 형성하게 된다. 불연속면의 전단 변형시 발생하는 미소 탄성파는 시추공 주변에 설치한 모니터링 장비에서 측정되며, 모니터링 장비에 의해 측정된 미소 탄성파 발생 지점의 클러스터는 지열저장소의 공간적 분포 및 규모를 추정할 수 있는 자료가 된다. 현재 EGS를 이용한 지열발전 프로젝트는 프랑스 슐츠, 스위스 바젤, 호주 하바네로에서 대표적으로 진행 중이다. 슐츠는 현재 1.5MWe의 파일럿 플랜트를 가동 중이며, 하바네로는 파일럿 플랜트 건설 단계를 진행중이다. 스위스 바젤은 지열저장소를 형성시킬 목적으로 수행된 주입시험에서 발생된 문제에 대한 기술의 신뢰성을 확보할 목적으로 잠시 중단된 상태다. 제주도는 신생대에 분출하여 형성된 대표적인 한국의 화산지형으로 지열부존 가능성이 높을 것으로 예상되는 지역이다. 따라서 폐사는 지열에너지 부존 특성을 파악하기 위한 심부 물리 탐사 및 탐사정 시추가 실시될 예정이며 궁극적으로 국내 최초의 상용화된 지열발전소 건설을 목표로 하고 있다.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.17 no.4
• /
• pp.189-199
• /
• 2014

Floodplain is a flat plain between levees and rivers. This paper suggests a methodology for analyzing the land uses in the Nakdong River floodplain using the RapidEye imagery and the given LiDAR(LIght Detection And Ranging) DEM(Digital Elevation Models). First, the levee boundaries are generated using the LiDAR DEM, and the area of the floodplain is extracted from the given RapidEye imagery. The land uses in the floodplain are identified in the extracted RapidEye imagery by the ISODATA(Iterative Self-Organizing Data Analysis Technique Analysis) clustering. The overall accuracy of the identified land uses by the ISODATA clustering is 91%. Analysis of the identified land uses in the floodplain is implemented by counting the number of the pixels constituting the land cover clusters. The results of this research shows that the area of the river occupies 46%, the area of the bare soil occupies 36%, the area of the marsh occupies 11%, and the area of the grass occupies 7% in the identified floodplain.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.10
• /
• pp.1173-1179
• /
• 2012

In this paper, collision avoidance beamforming(CA-BF) technology is proposed to mitigate inter-cell interference in cooperative wireless communications system with limited feedback. Each acess terminal(AT) selects both the best BF weight vector for a serving base transceiver station(BTS) and the most interfering BF weight vectors of interfering BTSs within a cluster, and sends it back to a cluster scheduler. At the cluster scheduler, a set of transmit BF weights of BTSs and the corresponding scheduled ATs are jointly determined to avoid collision among beams formed by BTSs within a cluster, which enhances system throughput by mitigating inter-cell interference. It is shown that the proposed CA-BF outperforms existing non-coordinated BF schemes in terms of the average system throughput.

• Journal of Korea Multimedia Society
• /
• v.9 no.10
• /
• pp.1257-1265
• /
• 2006

As XML is increasingly used, the need of researches which are related with XML in various fields is also augmented. Many XML document management systems have been actively developed especially for the storage, processing and retrieval of XML documents. The BitCube is a three dimensional bitmap index system that could be manipulated efficiently and improves the performance of document retrieval. However, the site of index is increase rapidly, when a new bit is added to the axis. This problem is caused by its three dimensional memory structure with document, path and word. We suggest a path combining strategy of XML documents in this paper to solve the problem of BitCube that mentioned above. To reduce the size of index, our approach combines sibling nodes that has same ancestor paths, and transforms word axis into value axis. The method reduces the size of index, when the system com poses the three dimensional bitmap index. It also improves the speed of retrieving, and takes efficiency in storage space.

• Journal of KIISE
• /
• v.44 no.11
• /
• pp.1236-1243
• /
• 2017

In this paper, we propose a novel way of producing keyword networks, named LSI-based ClusterTextRank, which extracts significant key words from a set of clusters with a mutual information metric, and constructs an association network using latent semantic indexing (LSI). The proposed method reduces the dimension of documents through LSI, decomposes documents into multiple clusters through k-means clustering, and expresses the words within each cluster as a maximal spanning tree graph. The significant key words are identified by evaluating their mutual information within clusters. Then, the method calculates the similarities between the extracted key words using the term-concept matrix, and the results are represented as a keyword association network. To evaluate the performance of the proposed method, we used travel-related blog data and showed that the proposed method outperforms the existing TextRank algorithm by about 14% in terms of accuracy.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.3
• /
• pp.821-831
• /
• 2014

Stochastic rainfall generators or stochastic simulation have been widely employed to generate synthetic rainfall sequences which can be used in hydrologic models as inputs. The calibration of Poisson cluster stochastic rainfall generator (e.g. Modified Bartlett-Lewis Rectangular Pulse, MBLRP) is seriously affected by local minima that is usually estimated from the local optimization algorithm. In this regard, global optimization techniques such as particle swarm optimization and shuffled complex evolution algorithm have been proposed to better estimate the parameters. Although the global search algorithm is designed to avoid the local minima, reliable parameter estimation of MBLRP model is not always feasible especially in a limited parameter space. In addition, uncertainty associated with parameters in the MBLRP rainfall generator has not been properly addressed yet. In this sense, this study aims to develop and test a Bayesian model based parameter estimation method for the MBLRP rainfall generator that allow us to derive the posterior distribution of the model parameters. It was found that the HBM based MBLRP model showed better performance in terms of reproducing rainfall statistic and underlying distribution of hourly rainfall series.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.1-14
• /
• 2006

Sort-last parallel rendering using a cluster of GPUs has been widely used as an efficient method for visualizing large- scale volume datasets. The performance of this method is constrained by load balancing when data parallelism is included. In previous works static partitioning could lead to self-balance when only task level parallelism is included. In this paper, we present a load balancing scheme that adapts to the characteristic of volume dataset when data parallelism is also employed. We effectively combine the hierarchical data structures (octree and BSP tree) in order to skip empty regions and distribute workload to corresponding rendering nodes. Moreover, we also exploit a 3D clustering method to determine visibility order and save the AGP bandwidths on each rendering node. Experimental results show that our scheme can achieve significant performance gains compared with traditional static load distribution schemes.

• Journal of KIISE:Software and Applications
• /
• v.32 no.9
• /
• pp.901-911
• /
• 2005

With the development of e-commerce and the proliferation of easily accessible information, information filtering has become a popular technique to prune large information spaces so that users are directed toward those items that best meet their needs and preferences. While many collaborative filtering systems have succeeded in capturing the similarities among users or items based on ratings to provide good recommendations, there are still some challenges for them to be more efficient, especially the user bias problem, non-transitive association problem and cold start problem. Those three problems impede us to capture more accurate similarities among users or items. In this paper, we provide probabilistic model approaches for UCHM and ICHM which are suggested to solve the addressed problems in hopes of achieving better performance. In this probabilistic model, objects (users or items) are classified into groups and predictions are made for users considering the Gaussian distribution of user ratings. Experiments on a real-word data set illustrate that our proposed approach is comparable with others.