• Title/Summary/Keyword: average closest distance

Search Result 24, Processing Time 0.028 seconds

Comparison of Goal-point and In-length Analyses in the Proximity Measures of Simulated Maneuvers (선박조종시뮬레이션의 근접도 계측에서 연속 분석과 목표점 분석에 관한 비교 연구)

  • Jeong, Tae-Gweon;Lee, Dong-Sup
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.1
    • /
    • pp.31-36
    • /
    • 2006
  • The evaluation of safety of simulated maneuvers is frequently analysed by so called goal line or point of interest. This paper is to suggest that regarding the results of simulation the goal analysis and in length analysis are investigated respectively and the availability of which is effective and is also to suggest closest distance to channel boundary at each ship's position, not centerline, as one of proximity measures.

  • PDF

Analysis Of Spatial Impact With Seoul Subway Line 7 Construction (지하철 건설에 따른 공간적 영향 분석 - 서울 지하철 7호선의 아파트가격에 미친 영향을 중심으로 -)

  • 여홍구;최창식
    • Journal of the Korean Society for Railway
    • /
    • v.7 no.2
    • /
    • pp.155-162
    • /
    • 2004
  • In order to account for a price variation of apartment that places near a newly constructed subway station, a spatial hedonic model was developed to examine spacial characteristics that affect a purchasing price of an apartment using a White Estimator. In particular, the paper aims to examine various effects of subway 7 construction on an apartment price in Seoul Metropolitan Area. As explanatory variables, an apartment size, distance to a closest subway station, distance to the Central Business District (CBD) of Seoul, the number of years after building, and a lagged variable of the apartment purchasing price were used. The lagged variable plays a role of representing a spatial weighted average of previous prices of other apartments that locate within 3 km from the apartment. For a precise study, an entire sample was divided into two sets, southern area and southwestern area of Seoul, and two different spatial hedonic models were estimated. Not only before and after analysis, but also with and without analysis were conducted to compare with different effects of the spatial characteristics of two areas. The results show that before the construction of the subway 7, the prices of the apartments in the southern area were more sensitive to the apartment size, the distance to a closest subway station, the distance to the CBD, and the prices of the other apartments locating within 3km rather than those in the southwestern area. After the construction, on contrast, it is found that the apartment purchasing prices in the southwestern area are more sensitive than those in the southern area due to people's expectation regarding a new development around the subway station. In addition, the prices of the apartments locating closely with a transfer station are more likely to go up by increase in the apartment size, the distance to the station, and the prices of the other apartments within 3 km. Compared with the negative effects of the distance to the station on the prices in the other models, the positive effect of the distance to the transfer station might be caused by the characteristics of commercial area in which people are not likely to live.

Low-Complexity Design of Quantizers for Distributed Systems

  • Kim, Yoon Hak
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.3
    • /
    • pp.142-147
    • /
    • 2018
  • We present a practical design algorithm for quantizers at nodes in distributed systems in which each local measurement is quantized without communication between nodes and transmitted to a fusion node that conducts estimation of the parameter of interest. The benefits of vector quantization (VQ) motivate us to incorporate the VQ strategy into our design and we propose a low-complexity design technique that seeks to assign vector codewords into sets such that each codeword in the sets should be closest to its associated local codeword. In doing so, we introduce new distance metrics to measure the distance between vector codewords and local ones and construct the sets of vector codewords at each node to minimize the average distance, resulting in an efficient and independent encoding of the vector codewords. Through extensive experiments, we show that the proposed algorithm can maintain comparable performance with a substantially reduced design complexity.

Comparison of Goal-line and In-length Analyses in the Proximity Measures of Simulated Maneuvers (선박조종시뮬레이션의 근접도 평가에서 연속 분석과 목표선 분석에 관한 비교 연구)

  • Lee, Dong-Sup;Jeong, Tae-Gweon
    • Journal of Navigation and Port Research
    • /
    • v.31 no.1 s.117
    • /
    • pp.1-6
    • /
    • 2007
  • The evaluation of safety of simulated maneuvers is frequently analysed by so called goal-line or point of interest in Korea. For the purpose of warning the risk in the proximity measure composed of only the goal-line analysis, this paper utilized Korea Institute of Maritime and Fisheries Technology(KIMFT) which houses a real-time, full-mission shiphandling simulator to examine the goal-line and in-length analyses in the outbound channel of Kwangyang port as an example. It used a 15,000 TEU container ship as a model under environmental conditions of the northwestly 26-knot wind and 2.2-knot ebb current. The result of two analyses showed the probability invading the channel boundary obtained by the goal-line analysis is a little greater than that of the in-length analysis. Therefore it was acknowledged that the proximity measure by the goal-line analysis alone may be followed by some risk. In addition, this paper was to suggest the closest distance to channel boundary from the ship's edge as one of proximity measures, instead of using the ship's deviation from the centerline of channel.

A Study on the Network Quotient of Employees in Deluxe Hotel according to Demographic Characteristics (특급호텔 종사원의 인구통계적 특성에 따른 인맥지수에 대한 탐색적 고찰)

  • Jung, Hyo Sun;Yoon, Hye Hyun
    • Journal of the Korean Society of Food Culture
    • /
    • v.30 no.4
    • /
    • pp.439-446
    • /
    • 2015
  • This study considered network quotient (NQ) of deluxe hotel employees and schematized characteristic attributes of being selected by employees with image through correspondence analysis in terms of cognition degree. Self-administrated questionnaires were completed by employees (292 samples) and data were analysed by frequency, t-test, one-way ANOVA, reliability and correspondence analysis. First, the hotel employees indicated the high average value in "participating in special education or seminar for improving ability ($3.85{\pm}0.76$). Second, as a result of analyzing difference according to gender, the average value in men was higher than in women. It was indicated that the higher age and career lead to a rise even in the average value of relationship index. Third, in consequence of carrying out correspondence analysis in order to prepare image map according to cognition level on relationship index in hotel employees, the measurement item that is placed in the closest distance to the response as saying of not so very was the response as saying of "having a lunch (dinner) engagement twice or three times a week." On the other hand, the response as saying of "tending to have many acquaintances compared to coworkers" was schematized in the close distance to the response as saying of very so.

A Density-Based K-Nearest Neighbors Search Method

  • Jang I. S.;Min K.W.;Choi W.S
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.260-262
    • /
    • 2004
  • Spatial database system provides many query types and most of them are required frequent disk I/O and much CPU time. k-NN search is to find k-th closest object from the query point and up to now, several k-NN search methods have been proposed. Among these, MINMAX distance method has an aim not to visit unnecessary node by applying pruning technique. But this method access more disk than necessary while pruning unnecessary node. In this paper, we propose new k-NN search algorithm based on density of object. With this method, we predict the radius to be expected to contain k-NN object using density of data set and search those objects within this radius and then adjust radius if failed. Experimental results show that this method outperforms the previous MINMAX distance method. This algorithm visit fewer disks than MINMAX method by the factor of maximum $22\%\;and\;average\;6\%.$

  • PDF

The Usefulness of Magnification of the Heart Shadow in Chest Radiography (흉부 촬영시 심음영 확대에 따른 유용성에 관한 연구)

  • Park, Eun-Gyung;Lee, Kun-Young;Jung, Young-Tae;Dong, Kyung-Rae;Ji, Youn-Sang
    • Korean Journal of Digital Imaging in Medicine
    • /
    • v.12 no.2
    • /
    • pp.119-125
    • /
    • 2010
  • In order to demonstrate the value of long-distance radiography, we have studied how distance affects images in chest frontal radiography and compared short-distance and long-distance images in chest lateral radiography. Cardiothoracic ratio(CTR %) of 50 patients with no disease in the chest(10 each at the age of 20~60) were evaluated in Supine AP(100 cm), Sitting AP(100 cm), Sitting AP(180 cm), and Erect PA(180 cm). In lateral radiography, we evaluated and compared left lateral radiography(100 cm and 180 cm) of the patients based on the horizontal maximum of the heart. The average value of CTR(%) were 0.48 in Erect PA(180 cm), 0.52 in Supine AP(100 cm), 0.50 in Sitting AP(100 cm), 0.49 in Sitting AP(180 cm), which were Supine AP(100 cm) > Sitting AP(100 cm) > Sitting AP(180 cm) > Erect PA(180 cm). The average value of Maximum transverse diameter of left of the cardiac(MLD), which showed how much axis of spine was slanted to the left, was 90.67 mm in Erect PA(180 cm), 103.92 mm in Supine AP(100 cm), 93.54 mm in Sitting(100 cm), 89.84 mm in Sitting AP(180 cm), 58.11 mm in the minimum value and 118.79 mm in the maximum value. The average value of Maximum transverse diameter of right side of the cardiac(MRD), which suggested how much axis of spine was slanted to the right, was 47.18 mm in Erect PA(180 cm), 48.12 mm in Supine AP(100 cm), 44.98 mm in Sitting AP(180 cm), and the minimum value 26.84 mm and the maximum value 65.30 mm. There was no standard method to calculate; therefore, the horizontal maximum of the heart was used for lateral radiography. The average value was 121.07 mm in 100 cm and 109.76 mm in 180 cm. Sitting AP(180 cm) among the types was closest to C-PA(180 cm). As a result, during C-AP radiography, long-distance radiography lessened shadow of the heart more than that of short distance, Sitting position more than Supine position.

  • PDF

Robust Construction of Voronoi Diagram of Circles by Region-Expansion Algorithm (영역 확장법을 통한 평면에서 원들의 보로노이 다이어그램의 강건한 계산)

  • Kim, Donguk
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.42 no.3
    • /
    • pp.52-60
    • /
    • 2019
  • This paper presents a numerically robust algorithm to construct a Voronoi diagram of circles in the plane. The circles are allowed to have intersections among them, but one circle cannot fully contain another circle. The Voronoi diagram is a tessellation of the plane into Voronoi regions of given circles. Each circle has its Voronoi region which is defined by a set of points in the plane closer to the circle than any other circles. The distance from a point p to a circle $c_i$ of center $p_i$ and radius $r_i$ is ${\parallel}p-p_i{\parallel}-r_i$, which is the closest Euclidean distance from p to the circle boundary. The proposed algorithm first constructs the point Voronoi diagram of centers of given circles, then it enlarges each point to the circle and expands its Voronoi region accordingly. This region-expansion process is done by local modifications and after completing this process for the whole circles the desired circle Voronoi diagram can be obtained. The proposed algorithm is numerically robust and we provide with a few examples to show its robustness. The algorithm runs in $O(n^2)$ time in the worst case and O(n) time on average where n is the number of the circles. The experiment shows that the region-expansion algorithm is robust and runs fast with strong linear time behavior.

Use of Cattle Microsatellite Markers to Assess Genetic Diversity of Thai Swamp Buffalo (Bubalus bubalis)

  • Sraphet, Supajit;Moolmuang, Benchamart;Na-Chiangmai, Ancharlie;Panyim, Sakol;Smith, Duncan R.;Triwitayakorn, Kanokporn
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.21 no.2
    • /
    • pp.177-180
    • /
    • 2008
  • In this study, cattle microsatellite markers recommended for diversity studies of cattle by the EU AIRE 2066 Concerted Action Group were used to study the genetic diversity of 105 Thai swamp buffalo which were randomly selected from eight different research stations of the Department of Livestock Development, Thailand. Of 34 primer pairs, 16 were successfully amplified while the rest showed non-specific amplification. The lowest number of alleles was two while the highest was nine, with an average of 4.7 alleles per locus. The average unbiased heterozygosity for all eight populations was 0.5233, with a low of 0.4772 (Samui) and a high of 0.5616 (Burirum). The genetic distance ranged from 0.0574 to 0.2575. Populations from Lopburi and Burirum showed the closest relationship, whereas Srisagat and Samui were the most divergent. The results generated with the primers recommended by the EU AIRE 2066 Concerted Action Group are at a slight variance from our previous study, possibly as a result of the number of specific amplification products obtained, suggesting that cattle markers may not be optimal for studies of the genetic diversity of the Thai swamp buffalo.

Hough Transform-based Semi-automatic Vertex Detection Algorithm on a Touch Screen Mobile Phone (모바일 폰 터치스크린에서 허프변환 기반의 반자동식 정점 검출 알고리즘)

  • Jang, Young-Kyoon;Woo, Woon-Tack
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.5
    • /
    • pp.596-600
    • /
    • 2010
  • This paper proposes hough transform-based semi-automatic vertex detection algorithm for object modeling on a mobile phone supporting touch-screens. The proposed algorithm shows fast processing time by searching the limited range of parameters for computing hough transform with a small range of ROI image. Moreover, the proposed algorithm removes bad candidates among the detected lines by selecting the two closest candidate lines from the position of user's input. After that, it accurately detects an interesting vertex without additionally required interactions by detecting an intersection point of the two lines. As a result, we believe that the proposed algorithm shows a 1.4 pixel distance error on average as a vertex detection accuracy under such conditions as a 5.7 pixel distance error on average as an inaccurate input.