• Journal of the Korean Institute of Landscape Architecture
• /
• v.24 no.2
• /
• pp.74-85
• /
• 1996

The objective of this study is to investigate the influence of viewing aspects based on formal aesthetics and psychophysica approaches of the MAISAN provincial park for landscape management. Two methods are applied in this study. First, according to the field study with map the quantitative analyses of the viewshed area, visual section and scenery types were achieved, herein the visual landscape characteristics is found. Second, based upon visual preference evaluation of the relationships between the viewing aspects and visual preference scores to landscape slides were measured by questionnaires. The main conclusions obtained by the research are as follows. Visual area of MAISAN has a quite wide viewshed though itself is surrounded. The preference for the visual terminal were change by its characteristics to the visual corridors, view points, viewing types and viewing distance. Especially, the regression analysis between visual preference and viewing distance indicated Y=-3.20X\sup 2\+18.64X+20.64. In this case, viewing distance 794m from O\sub p\ is more important point for visual experience. The viewing types B·C and famous view A obtained a high visual preference score. A visual terminus are viewed along an entire RouteA, so revealed by its evolving spatial containment as to exact the full potential of its changing perspectives. Also we conducted the degree of visual influence by the shade in visual area at MAISAN and clarified viewing vantage Route and point in LSH being necessary for landscape preservation.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1078-1089
• /
• 2015

In this paper, we propose the Min-hash Assisted Delta-compression Engine(MADE) to improve the lifetime of NAND flash-based storages at the device level. MADE effectively reduces the write traffic to NAND flash through the use of a novel delta compression scheme. The delta compression performance was optimized by introducing min-hash based LSH(Locality Sensitive Hash) and efficiently combining it with our delta compression method. We also developed a delta encoding technique that has functionality equivalent to deduplication and lossless compression. The results of our experiment show that MADE reduces the amount of data written on NAND flash by up to 90%, which is better than a simple combination of deduplication and lossless compression schemes by 12% on average.

• The korean journal of orthodontics
• /
• v.26 no.1 s.54
• /
• pp.1-16
• /
• 1996

The purpose of this study was to evaluate the amount and interrelationship of the soft and hard tissue changes after simultaneous maxillary advancement and mandibular setback surgery in skeletal Class III malocclusion. The sample consisted of 25 adult patients(13 males and 12 females) who had severe anteroposterior skeletal discrepancy. These patients had received presurgical orthodontic treatment and surgical treatment which consisted of simultaneous Le Fort I or Le Fort II osteotomy and bilateral sagittal split ramus osteotomy. The presurgical and postsurgical lateral cephalograms were evaluated. The computerized statistical analysis was carried out with SPSS/$PC^+$ program. The results were as follows. 1. The correlation of maxillary hard and soft tissue horizontal changes were high and the ratios for soft tissue to A point were $71\%$ at Sn, $67\%$ at SLS and $37\%$ at LS. 2. The correlation of mandibular hard and soft tissue horizontal changes were very high and the ratios were $84\%$ at LI, $107\%$ at ILS, $96\%$ at Pog' and $97\%$ at Gn'. 3. The correlation of mandibular hard tissue horizontal changes and soft tissue vertical changes were moderate. 4. The upper to lower lip length were increased(P<0.001). 5. The soft tissue thickness were decreased in upper lip and increased in lower lip(P<0.001). The postsurgical changes were reversely correlated with initial thickness in upper lip.

• KIISE Transactions on Computing Practices
• /
• v.21 no.11
• /
• pp.681-688
• /
• 2015

The k nearest neighbor (k-NN) graph construction is an important operation with many web-related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Despite its many elegant properties, the brute force k-NN graph construction method has a computational complexity of $O(n^2)$, which is prohibitive for large scale data sets. Thus, (Key, Value)-based distributed framework, MapReduce, is gaining increasingly widespread use in Locality Sensitive Hashing which is efficient for high-dimension and sparse data. Based on the two-stage strategy, we engage the locality sensitive hashing technique to divide users into small subsets, and then calculate similarity between pairs in the small subsets using a brute force method on MapReduce. Specifically, generating a candidate group stage is important since brute-force calculation is performed in the following step. However, existing methods do not prevent large candidate groups. In this paper, we proposed an efficient algorithm for approximate k-NN graph construction by regrouping candidate groups. Experimental results show that our approach is more effective than existing methods in terms of graph accuracy and scan rate.