• Science of Emotion and Sensibility
• /
• v.17 no.2
• /
• pp.111-122
• /
• 2014

This study has analyzed the scanning path algorithm shown at the process of exploring spatial information through an observation experiment with the object of lobby in subway station. In the estimation of observation time by section, the frequency of scanning type was found to increase as the observation time got longer, which makes it possible that the longer the observation lasts the more the observation interruptions occur. In addition, the observation slipped out of the range of imaging when any fatigue was caused from the observation or the more active exploration took place. Furthermore, when the trend line was employed for the examination of the changes to the scanning type by time section, "concentration" "diagonal or vertical" showed a sharp and a gentle increases along with the increase of time section respectively, while "circulation. combination, horizontal" showed a reduction. The observation data of the subjects observing a space include various visual information. The analysis of the scanning type found at "attention concentration" enabled to draw this significant conclusion. The features of increase and decrease of scanning types can be a fundamental data for understanding the scanning tendency by time.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.12
• /
• pp.1133-1140
• /
• 2011

Current design process for the Hall effect thruster has relied on expensive experimental method based on the limited historical data. In this study, a proper design space for the Hall effect thruster is chosen and associated design space exploration is conducted based on a recently proposed numerical method in order to improve current design process. According to the results of the design space exploration, performance envelope is determined for the given design space and the correlations between performance metrics are analyzed. Further analysis shows that main factors in performances for the Hall effect thruster are the anode mass flow rate and the discharge voltage.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.165-165
• /
• 2021

전 세계적으로 하천 수질이 저하되고 있다. 이는 수생태계의 손상을 야기하고 인류를 위한 하천의 물 공급원 기능에 저해 요소로 작용한다. 오염된 수생태계에 대한 효과적인 맞춤형 관리전략을 수립하려면 수질의 시공간적 변동 요인을 이해하는 것이 중요하다. 시간적 및 공간적 변동성이 모두 중요하지만, 본 연구에서는 낙동강 전체 유역에서 나타나는 공간적인 변동성에 집중하여 하천 수질의 공간적 차이에 영향을 미치는 요인을 식별하고 그들의 상대적 중요성을 분석하고자 하였다. 분석을 위해 낙동강 유역 전역의 40개 수질오염총량관리 단위유역에서 5년 동안 수집된 하천 총인 농도와 유역특성 자료를 사용하였다. 총인 농도의 공간적 변동성에 영향을 미치는 주요 유역특성을 식별하기 위한 통계모델 선정을 위해 완전 탐색 접근법과 베이지안 추론이 적용되었다. 완전 탐색은 두 단계에 걸쳐 진행되었으며, 1 단계 완전 탐색의 결과로 유역특성 자료들의 중요도가 선정되었으며 2 단계 완전탐색 결과로 통계모델이 우선 선정되었다. 우선 선정된 통계모델은 베이지안 추론을 통해 모델의 정확도와 불확실성이 분석되었고 공간적 변동성 분석을 위한 최적 모델이 선정되었다. 본 연구의 결과로 낙동강 하천 총인 농도의 공간적 변동성에 영향을 미치는 주요 유역특성에 대한 통찰력이 제공된다. 또한 식별된 주요 유역특성은 유역특성 변화에 대한 하천의 수질 반응을 예측하는데 사용될 수 있을 것으로 기대된다.

• The KIPS Transactions:PartB
• /
• v.15B no.2
• /
• pp.159-170
• /
• 2008

Nowadays, one of the important functionalities required from robot task planners is to generate plans to compose existing component services into a new service. In this paper, we introduce the design and implementation of a heuristic search planner, JPLAN, as a kernel module for component service composition. JPLAN uses a local search algorithm and planning graph heuristics. The local search algorithm, EHC+, is an extended version of the Enforced Hill-Climbing(EHC) which have shown high efficiency applied in state-space planners including FF. It requires some amount of additional local search, but it is expected to reduce overall amount of search to arrive at a goal state and get shorter plans. We also present some effective heuristic extraction methods which are necessarily needed for search on a large state-space. The heuristic extraction methods utilize planning graphs that have been first used for plan generation in Graphplan. We introduce some planning graph heuristics and then analyze their effects on plan generation through experiments.

• Journal of KIISE:Software and Applications
• /
• v.33 no.6
• /
• pp.574-579
• /
• 2006

The feature selection algorithms should broadly and efficiently explore the huge problem spaces to find a good solution. This paper attempts to gain insights on the fitness landscape of the spaces and to improve search capability of the algorithms. We investigate the solution spaces in terms of statistics on local maxima and minima. We also analyze behaviors of the existing algorithms and improve their solutions.

• The Korean Journal of Applied Statistics
• /
• v.9 no.2
• /
• pp.145-159
• /
• 1996

We propose an adaptive searching method using some spatial relations among sample points to estimate the interesting area in the spatial population. The fundamental idea is to observe the neighboring sample points when a sample point is satified with some condition of an adaptive searching observation. For obseving the sample points with this method to estimate the area the sample size is decreased. From this result, we may expect to reduce the cost and time consuming in observation the sample points and to draw the shape of the interesting area without prior information of an spatial population. Some analytical simulation results are also presented.

• Korean Architects
• /
• no.5 s.349
• /
• pp.78-83
• /
• 1998

• Journal of the Korean Geographical Society
• /
• v.43 no.3
• /
• pp.392-411
• /
• 2008

The purpose of this paper is to develop a method for exploring hotspot patterns of house price volatility where there is a high fluctuation in price and homogeneity of direction of price volatility. These patterns are formed when the majority of householders in an area show an adaptive tendency in their decision making. This paper suggests a method that consists of two analytical parts. The first part uses spatial scan statistics to detect spatial clusters of houses with a positive range of price volatility. The second part utilizes local Moran's I to evaluate the homogeneity of direction of price volatility within each cluster. The method is applied to the areas of Gangnam-Gu, Seocho-Gu, and Songpa-Gu in Seoul from August to November of 2003; the Participatory Government of Korea designated these areas and this period as the most speculative. The results of the analysis show that the area around Gaepo-Dong was as a hotspot before the Government's anti-speculative 10.29 policy in 2003; the house prices in the same area stabilized in October, 2003 and the area was identified as a coldspot in December, 2003. This case study shows that the suggested method enables exploration of hotspot of house price volatility at micro spatial scales which had not been detected by visual analysis.

• Journal of Creative Information Culture
• /
• v.6 no.1
• /
• pp.41-48
• /
• 2020

In order to represent and process spatial data, hierarchical data structures such as a quadtree or a bintree are used. Various approaches for linearly representing the bintree have been proposed. S-Tree has the advantage of compressing the storage space by expressing binary region image data as a linear binary bit stream, but the higher the resolution of the image, the longer the length of the binary bit stream, the longer the storage space and the lower the search performance. In this paper, we construct a hierarchical structure of multiple separated bintrees with a full binary tree structure and express each bintree as two linear binary bit streams to reduce the range required for image search. It improves the overall search performance by performing a simple number conversion instead of searching directly the binary bit string path. Through the performance evaluation by the worst-case space-time complexity analysis, it was analyzed that the proposed method has better search performance and space efficiency than the previous one.

• Journal of Creative Information Culture
• /
• v.5 no.3
• /
• pp.345-353
• /
• 2019

Several studies have been proposed to improve storage space efficiency by expressing binary trie data structure as a linear binary bit string. Compact binary tree approach generated using one binary trie increases the key search time significantly as the binary bit string becomes very long as the size of the input key set increases. In order to reduce the key search range, a hierarchical compact binary tree technique that hierarchically expresses several small binary compact trees has been proposed. The search time increases proportionally with the number and length of binary bit streams. In this paper, we generate several binary compact trees represented by full binary tries hierarchically. The search performance is improved by allowing a path for the binary bit string corresponding to the search range to be determined through simple numeric conversion. Through the performance evaluation using the worst time and space complexity calculation, the proposed method showed the highest performance for retrieval and key insertion or deletion. In terms of space usage, the proposed method requires about 67% ~ 68% of space compared to the existing methods, showing the best space efficiency.