ERAM 모델의 거리가중치 도입 및 적용에 관한 연구

박근송(Park, Gunsong),김민석(Kim, Minseok),최재필(Choi, Jaepil) 대한건축학회 2014 대한건축학회논문집 Vol.30 No.12

The purpose of this study is to verify whether to improve the explanatory power by introducing and applying distance-weighting concept to the ERAM model, one of spatial analysis techniques. Introduction of distance-weighting to the ERAM model was tried in an existing study, but it showed lower explanatory power than the original ERAM model, to which distance-weighting concept is not applied. In the existing research, movement distance is in reverse proportion to accessibility, which is problematic. Moreover, this study proposed new distance-weighting functions, not the reciprocal of distance(1/D) from the existing study. The original ERAM model, the existing distance-weighted ERAM model, and the distance-weighted ERAM model with newly proposed distance-weighting functions in this study were used for analyzing two regions in Seoul, Insadong and Myeongdong. In these regions, the correlation tests between the analysis results and the pedestrian movement rate showed that the distance-weighted ERAM model with the newly proposed distance-weighting functions has higher explanatory power than the original ERAM Model and the existing distance-weighted ERAM Model. In particular, the case of applying ‘W=1-D/250’ function as distance-weighting function showed the highest explanatory power among the three functions proposed in this study. This study reveals that the distance-weighting concept can contribute to improve the explanatory power of the ERAM model to human movement behavior, which opposes to conclusion of the existing study. However, further studies need to be done more deeply and extensively to find out the final form of distance-weighting function.

공간구문론을 위한 거리가중 함수 구축 및 적용 연구- 이동성과 인지거리의 관점에서 -

PIAO GENSONG,김민석 대한건축학회지회연합회 2018 대한건축학회연합논문집 Vol.20 No.1

In order to improve the predictability of space syntax on human behavior, this study proposes a method of applying metric distance as weighting concept to space syntax. Through examining existing researches, this study finds clues in factors that metric distance has influence on accessibility, considering that the concept of 'accessibility' is implied in 'depth', the key index of space syntax. Thus, the effect of metric distance on accessibility was implemented as functions of depth on metric distance which were applied to space syntax techniques. The effect of metric distance on accessibility was viewed from the viewpoint of pedestrian mobility and cognitive distance, and the relationship between metric distance and mobility and the relationship between metric distance and cognitive distance were implemented as distance weighting functions. Unlike existing methods, the statistical analyses of the correlation tests between pedestrian movement pattern and results of space syntax analysis with distance weighting, were found to be more significant. 본 연구에서는 공간구문론의 인간행태에 대한 예측력을 높이기 위해 공간구문론에 물리적 거리를 가중 개념으로 적용하는 방법론을 제안하는 것을 목적으로 한다. 이를 위해 선행연구 고찰을 통해 기존의 거리 가중 적용 방식이 갖는 문제점을 확인하였고, 공간구문론의 핵심 개념인 ‘깊이’에 ‘접근성’의 개념이 내포되어 있음에 착안하여, 물리적 거리가 접근성에 미치는 영향을 가중 함수로 구현하여 적용하는 접근을 시도하였다. 물리적 거리가 접근성에 미치는 영향요인을 보행자 이동성의 관점과 인지거리의 관점에서 각각 바라보았고, 물리적 거리와 이동성의 관계, 물리적 거리와 인지거리의 관계를 ‘깊이’의 가중 함수로 각각 구현하였다. 이렇게 도출된 거리가중 함수들을 공간구문론 분석에 적용하고 그 결과와 실제 보행패턴과의 상관관계를 통계 분석한 결과 기존 거리가중 적용 방식과는 달리 유의미한 수준의 예측력을 보임을 확인하였다.

암호학 및 오류 수정 코드를 위한 부울 대수 가중치 연구

연용호 ( Yong Ho Yon ),강안나 ( An Na Kang ) 한국항행학회 2011 韓國航行學會論文誌 Vol.15 No.5

Sphere-packing problem은 주어진 공간에 가능한 한 많은 구(sphere)를 채울 수 있는 배열을 찾는 문제이고 covering problem은 이에 쌍대적인 최적화의 문제로 코딩이론에 적용된다. 본 논문에서는 이진 코드이론에서의 가중치(weight)와 해밍거리(Hamming distance)에 대한 개념을 부울 대수(Boolean algebra)의 개념으로 일반화한다. 부울 대수에서의 가중치와 이를 이용하여 거리함수를 정의하고, 이들의 기본적인 성질들을 밝힌다. 또한, 부울 대수에서의 sphere-packing bound와 Gilbert-Varshamov bound의 정리를 증명한다. A sphere-packing problem is to find an arrangement of the spheres to fill as large area of the given space as possible, and covering problems are optimization problems which are dual problems to the packing problems. We generalize the concepts of the weight and the Hamming distance for a binary code to those of Boolean algebra. In this paper, we define a weight and a distance on a Boolean algebra and research some properties of the weight and the distance. Also, we prove the notions of the sphere-packing bound and the Gilbert-Varshamov bound on Boolean algebra.

Applications of the Weighted Likelihood Estimator based on the Negative Exponential Disparity

Kim, Chan soo 중앙대학교 통계연구소 1997 統計論文集 Vol.- No.4

Lindsay (1994)와 Basu, Sarkar, Vidyashankar (1997)는 근사적으로 효율적이고도 로버스트(robust)한 추정량을 만들어 내는데 있어 negative exponential disparity (NED) 라 일컫는 밀도함수에 기초한 새로운 거리 측도가 헬린저(Hellinger)거리측도 (HD)에 대해 좋은 대안이 될 수 있다는 것을 보여 주었다. 본 논문은 negative exponential disparity 를 가중치로 삼는 가중우도추정량이 헬린저거리측도를 이용한 유사한 로버스트 추정량들에 대한 대안으로서 성능을 알아본다. 또한 negative exponential disparity 族에 대한 고찰과 그 응용 분야에 대해 알아 보고자 한다. Lindsay (1994) and Basu et al. (1997) show that another density-based distance called the negative exponential disparity (NED) is an excellent competitor to the Hellinger distance (HD) in generating and asymptotically fully efficient and robust estimator. In this paper we review the performance of the weighted likelihood estimator based on the negative exponential disparity as a robust alternative relative to that based on the Hellinger distance. We also investigate the negative exponential disparity as a family of a disparity.

Improved DV-Hop Localization Algorithm Based on Anchor Weight and Distance Compensation in Wireless Sensor Network

Ming Jiang,Yunfei Li,Yuan Ge,Wengeng Gao,Ke Lou,Shinong Wang,Juanjuan Jiang 보안공학연구지원센터 2016 International Journal of Signal Processing, Image Vol.9 No.12

Position information is the foundation of massive applications in Wireless Sensor Network(WSN). Three improved positioning algorithms based on DV-Hop are proposed in order to enhance the positioning accuracy of wireless sensor nodes. First improved algorithm is distance compensation algorithm (DCA) that creates a triangle model to compensate the estimated distance. The second improved algorithm creates a new chain table for all anchor nodes to record and compute the average hop distance. The third improved algorithm is weighting different anchor nodes with anchor nodes’ nearest unknown nodes. The second and third improved algorithms are based on the DCA. The simulation results show that the three improved algorithms are better than the original DV-Hop in localization accuracy. Compared to the original DV-Hop algorithm, the simulation results shows that the three improved algorithms proposed in the paper increase the positioning accuracy of the unknown nodes.

파종밀도가 풋콩 품종의 생육 및 수량에 미치는 영향

이승수,김창호 한국작물학회 2008 Korean journal of crop science Vol.53 No.1

콩의 용도는 메주나 장류 또는 두부로 이용하는 장류콩, 나물로 이용하는 나물콩, 혼반용으로 이용할 수 있는 밥밑용으로 이용되어 왔으나, 최근에는 콩을 채소처럼 먹을 수 있는 풋콩에 대한 관심이 증대되고 있는 실정이다. 따라서 본 시험은 풋콩재배에 기초 자료를 제공하기 위하여 검정용 및 갈색콩 품종들의 풋콩재배시 가지풋콩의 상품성을 향상시키면서 풋콩수량을 증대시킬 수 있는 적정재식거리 구명을 위한 실험으로 그 결과를 요약하면 다음과 같다. 1. 재식거리는 파종으로부터 개화까지의 소요일수, 수확까지의 소요일수 및 도복에 영향을 주지 않았다. 2. 경장은 밀식할수록 증가한 반면 협수, 분지수, 개체당 협수, 분지당 협수, 경협중 및 2+3립협의 비율은 밀식할수록 감소하였다. 3. 풋콩의 크기는 재식밀도간 유의적인 차이는 없었으나, 풋콩의 수확지수는 밀식할수록 낮았다. 4. 밀식을 하면 풋콩의 수량은 증대하지만 경협중, 분지 당 협수 및 2+3립협의 풋콩수량을 고려한 가지풋콩으로의 상품성을 고려할 때 적정재식밀도는 선흑콩과 일품검정콩은 60x25cm , 갈미콩은 60x35cm 이었다. The objective of experiment was to investigate the effects of planting density on growth and yield of vegetable soybean, and to clarify the optimum planting density of vegetable soybean in the middle west region of Korea. The field experiment with 4 levels of planting density was carried out at Yesan area in 2005~2006 . The days from seeding to flowering and the days from seeding to harvesting and lodging were not significantly different among planting distance. The stem length was increased as planting distance was shortened but the number of node, branch, pod per branch, pod per individual, weight of stem and pod, one hundred pod weight and rate of 2+3 seed per pod were decreased as planting density was increased. The size of vegetable soybeans was not significantly different among planting distance, but the harvest index of vegetable soybean was decreased as planting distance was shortened. Yield of vegetable soybean was increased as planting distance was decreased. However, the approriate densities for stem and pod weight per a plant, number of pod per a branch and the vegetable soybean yield of 2+3 seed per pod were different from that density. The optimal planting distance of varieties was 60~25~;cm in Sunheukkong and Ilpumgeomjeongkong and was 60~35~;cm in Galmikong.

Generalization Threshold Optimization of Fuzzy Rough Set algorithm in Healthcare Data Classification

Beibei Dong,Yu Liu,Benzhen Guo,Xiao Zhang 보안공학연구지원센터 2016 International Journal of Database Theory and Appli Vol.9 No.3

There is ineffective classification problem in application of K-means clustering algorithm in massive data cluster analysis. This paper presents a K-means algorithm based on generalization threshold rough set optimization weight. Firstly, utilize attribute order described method, using the average distance calculation with Laplace method to optimize the generalization threshold of fuzzy rough set , then the Euclidean distance metric is used in the calculation of the similarity of K-means algorithm, introducing the variation coefficient into the cluster analysis, clustering the Euclidean distance weighted K-means algorithm totally based on data, finally, combine the rough set algorithm based on the generalization threshold optimization and K-means clustering algorithm, applied to medical and health data classification. The K-means algorithm based on generalization threshold rough set optimization weight presented by this paper has a better effect on medical and health data classification.

Weighted Distance-Based Quantization for Distributed Estimation

Kim, Yoon Hak The Korea Institute of Information and Commucation 2014 Journal of information and communication convergen Vol.12 No.4

We consider quantization optimized for distributed estimation, where a set of sensors at different sites collect measurements on the parameter of interest, quantize them, and transmit the quantized data to a fusion node, which then estimates the parameter. Here, we propose an iterative quantizer design algorithm with a weighted distance rule that allows us to reduce a system-wide metric such as the estimation error by constructing quantization partitions with their optimal weights. We show that the search for the weights, the most expensive computational step in the algorithm, can be conducted in a sequential manner without deviating from convergence, leading to a significant reduction in design complexity. Our experments demonstrate that the proposed algorithm achieves improved performance over traditional quantizer designs. The benefit of the proposed technique is further illustrated by the experiments providing similar estimation performance with much lower complexity as compared to the recently published novel algorithms.

AN UPPER BOUND ON THE NUMBER OF PARITY CHECKS FOR BURST ERROR DETECTION AND CORRECTION IN EUCLIDEAN CODES

Jain, Sapna,Lee, Ki-Suk Korean Mathematical Society 2009 대한수학회지 Vol.46 No.5

There are three standard weight functions on a linear code viz. Hamming weight, Lee weight, and Euclidean weight. Euclidean weight function is useful in connection with the lattice constructions [2] where the minimum norm of vectors in the lattice is related to the minimum Euclidean weight of the code. In this paper, we obtain an upper bound over the number of parity check digits for Euclidean weight codes detecting and correcting burst errors.

An upper bound on the number of parity checks for burst error detection and correction in Euclidean codes

Sapna Jain,이기석 대한수학회 2009 대한수학회지 Vol.46 No.5

There are three standard weight functions on a linear code viz. Hamming weight, Lee weight, and Euclidean weight. Euclidean weight function is useful in connection with the lattice constructions [2] where the minimum norm of vectors in the lattice is related to the minimum Euclidean weight of the code. In this paper, we obtain an upper bound over the number of parity check digits for Euclidean weight codes detecting and correcting burst errors.