• Fire Science and Engineering
• /
• v.28 no.6
• /
• pp.82-89
• /
• 2014

Disasters that destroy homes and infrastructure and cause significant financial damage are becoming more common as population centers grow. In addition, several natural disasters have resulted in a major loss of life and created countless refugees due to damage to housing. After major catastrophic disasters, it is very important that the government agencies respond to post-disaster housing issues and provide resources such as temporary housing before the full rehabilitation and reconstruction of destroyed and damaged housing. To provide affordable temporary housing for residents who may lose their homes as the result of a catastrophic disaster including storms, government agencies must develop a post-disaster housing prototype. In general, government agencies should explore several different forms of factory-built single-story, single family housing, such as modular homes, panelized homes, and precut homes. In urban cities including New York and Seoul, it is very important to provide housing which supports the demand for higher-density living spaces than single-family homes or trailers typically available due to the high population density and the desire to resettle as many residents as possible in their former neighborhoods. This study identified the urban post-disaster housing prototypes that may provide higher density housing with high quality living spaces, high air quality, and energy efficiency as well as rapid deployment. A case study of "Urban Post-Disaster Housing Prototype Program in New York" was conducted through a detailed interview process with a designer, engineer, contractor, the Office of Emergency Management (OEM) in New York, the U.S. Army Corps of Engineers (USACE), and temporary occupants. An appropriate disaster housing program that can provide living spaces for victims of disasters that keeps residents in their community and allows them to live and work in their neighborhoods was developed.

• Journal of the Korean Chemical Society
• /
• v.40 no.3
• /
• pp.161-166
• /
• 1996

6-ethyl-5,6-dihydrouracil($C_6H_10N_2O_2$) is monoclinic, space group $$P2_{1}c}$$ with a=10.302(2), b=10.419(3), $c=7.095(1)\AA$, $\beta=106.6(0)$, Z=4, $V=729.7(3)\AA$^3$$, $D_c=1.29 g/cm^3,\;{\lambda}(MoK\alpha)=0.71073\AA$, $\mu=0.010cm^{-1}$, F(000)=304, and R=0.054 for 1070 unique observed reflection with F>4.0 $\sigma(F).$ The structure was solved by direct methods and refined by full-matrix least-squares refinement with the fixed C-H bond length at $0.96\AA.$ The hydrouracil molecule makes an envelope conformation with the ethyl substituent oriented to an axial position attainable to a varying degree of steric strain. There are two intermolecular hydrogen-bondings via N-H---O interactions, being nearly parallel to the 100 plane. The shortest distance between molecules is $3.187\AA$ of C(4) and O(8) (-x,-y, 1-z).

• Korean journal of applied entomology
• /
• v.47 no.2
• /
• pp.127-131
• /
• 2008

Ambrosia beetle, Platypus koryoensis, is a vector of oak wilt disease caused by Raffaelea sp. in Korea. The degree of damage by oak wilt disease was dependent on the density of the beetles in the oak trunk, a relationship between the degree of damage by oak wilt disease and the density of beetle on the basis of the number of entry hole was studied. Entry hole distribution within tree trunk was analyzed by the nearest neighbor method. Thirty four oak trees (Quercus mongolica) located in survey area were selected and then degree of damage, the number of attack hole/$623cm^2$ in upper (50cm from the surface) and lower (surface) trunk and the nearest neighbor distance between the holes were measured. The number of hole and the nearest neighbor distance in upper and lower part were positively correlated with each other. As the degree of damage was severer, the number of the holes increased, whereas the nearest neighbor distance decreased. The distribution pattern of the hole was changed from clumped one to uniform as the severity of damage increased. These results suggested that Platypus koryoensis attacked the oak tree in concentrative manner at initial stage of attack but at final stage, it distributed uniformly to reduce intraspecific competition between the beetles.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.17-24
• /
• 2011

Collaborative filtering system is the clustering about user is built and then based on that clustering results will recommend the preferred item to the user. However, building user clustering is time consuming and also once the users evaluate and give feedback about the film then rebuilding the system is not simple. In this paper, genre pattern of movie recommendation systems is being used and in order to simplify and reduce time of rebuilding user clustering. A Frequent pattern networks is used and then extracts user preference genre patterns and through that extracted patterns user clustering will be built. Through built the clustering for all neighboring users to collaborative filtering is applied and then recommends movies to the user. When receiving user information feedback, traditional collaborative filtering is to rebuild the clustering for all neighbouring users to research and do the clustering. However by using frequent pattern Networks, through user clustering based on genre pattern, collaborative filtering is applied and when rebuilding user clustering inquiry limited by search time can be reduced. After receiving user information feedback through proposed user clustering based on genre pattern, the time that need to spent on re-establishing user clustering can be reduced and also enable the possibility of traditional collaborative filtering systems and recommendation of a similar performance.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.367-380
• /
• 2002

Due to recent increase in applications requiring huge amount of data such as spatial data analysis and image analysis, clustering on large databases has been actively studied. In a hierarchical clustering method, a tree representing hierarchical decomposition of the database is first created, and then, used for efficient clustering. Existing hierarchical clustering methods mainly adopted the bottom-up approach, which creates a tree from the bottom to the topmost level of the hierarchy. These bottom-up methods require at least one scan over the entire database in order to build the tree and need to search most nodes of the tree since the clustering algorithm starts from the leaf level. In this paper, we propose a novel top-down hierarchical clustering method that uses multidimensional indexes that are already maintained in most database applications. Generally, multidimensional indexes have the clustering property storing similar objects in the same (or adjacent) data pares. Using this property we can find adjacent objects without calculating distances among them. We first formally define the cluster based on the density of objects. For the definition, we propose the concept of the region contrast partition based on the density of the region. To speed up the clustering algorithm, we use the branch-and-bound algorithm. We propose the bounds and formally prove their correctness. Experimental results show that the proposed method is at least as effective in quality of clustering as BIRCH, a bottom-up hierarchical clustering method, while reducing the number of page accesses by up to 26～187 times depending on the size of the database. As a result, we believe that the proposed method significantly improves the clustering performance in large databases and is practically usable in various database applications.

• Journal of the Korean association of regional geographers
• /
• v.15 no.1
• /
• pp.16-35
• /
• 2009

This paper is to compare the contexts and old place names in old county maps of Goryeong-hyeon(高靈縣) according to the four types of maps. 23 maps covering Goryeong-hyeon were collected from the old county-map atlas(郡縣地圖帖) and Eupji(邑誌). The first type(named 'picture county map') included 8 county-maps in which information of military, and administrative contents are mainly mapped. The second type(named '1-ri grid system map') included 4 county maps in which information about beacon routes and road systems were regarded as very important. The third type(named '20-ri grid-system map(方眼地圖)' included 4 county-maps which were drawn as same scale with 20-ri(里) grids. The fourth type(named 'local county-map(地方郡縣地圖)' included 5 county maps which were drawn by local mappers. Types of toponyms which were included in maps are different by the propose of map-drawing. In the picture county maps, place names from military, and administrative contents are written. In the 1-ri grid system county maps, place names especially from military and transportation are fluent. In the 20-ri grid system county maps, generic name from natural environment, such as mountains are very fluent. In the local county maps, city-walls and castles are drawn exaggeratively and detailed generic name from warehouses and villages are written in those maps. This study shows that Daedongyeo-jido was drawn on the basis of 20-ri grid system county maps with the supplementation of geographical information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.8
• /
• pp.1809-1818
• /
• 2010

In order to detect the skin color area from input images, many prior researches have divided an image into the pixels having a skin color and the other pixels. In a still image or videos, it is very difficult to exactly extract the skin pixels because lighting condition and makeup generate a various variations of skin color. In this thesis, we propose a method that improves its performance using hierarchical merging of 3D skin color model and context informations for the images having various difficulties. We first make 3D color histogram distributions using skin color pixels from many YCbCr color images and then divide the color space into 3 layers including skin color region(Skin), non-skin color region(Non-skin), skin color candidate region (Skinness). When we segment the skin color region from an image, skin color pixel and non-skin color pixels are determined to skin region and non-skin region respectively. If a pixel is belong to Skinness color region, the pixels are divided into skin region or non-skin region according to the context information of its neighbors. Our proposed method can help to efficiently segment the skin color regions from images having many distorted skin colors and similar skin colors.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.43 no.6
• /
• pp.883-896
• /
• 2023

As human activities in Korea are spread throughout the mountains, forest fires often affect residential areas, infrastructure, and other facilities. Hence, it is necessary to detect fire-damaged areas quickly to enable support and recovery. Remote sensing is the most efficient tool for this purpose. Fire damage detection experiments were conducted on the east coast of Korea. Because this area comprises a mixture of forest and artificial land cover, data with low resolution are not suitable. We used Sentinel-2 multispectral instrument (MSI) data, which provide adequate temporal and spatial resolution, and the k-nearest neighbor (kNN) algorithm in this study. Six bands of Sentinel-2 MSI and two indices of normalized difference vegetation index (NDVI) and normalized burn ratio (NBR) were used as features for kNN classification. The kNN classifier was trained using 2,000 randomly selected samples in the fire-damaged and undamaged areas. Outliers were removed and a forest type map was used to improve classification performance. Numerous experiments for various neighbors for kNN and feature combinations have been conducted using bi-temporal and uni-temporal approaches. The bi-temporal classification performed better than the uni-temporal classification. However, the uni-temporal classification was able to detect severely damaged areas.

• Journal of Broadcast Engineering
• /
• v.5 no.2
• /
• pp.247-259
• /
• 2000

This paper introduces a new technique that reduces the search times and Improves the accuracy of motion estimation using high temporal and spatial correlation of motion vector. Instead of using the fixed first search Point of previously proposed search algorithms, the proposed method finds more accurate first search point as to compensating searching area using high temporal and spatial correlation of motion vector. Therefore, the main idea of proposed method is to find first search point to improve the performance of motion estimation and reduce the search times. The proposed method utilizes the direction of the same coordinate block of the previous frame compared with a block of the current frame to use temporal correlation and the direction of the adjacent blocks of the current frame to use spatial correlation. Based on these directions, we compute the first search point. We search the motion vector in the middle of computed first search point with two fixed search patterns. Using that idea, an efficient adaptive predicted direction search algorithm (APDSA) for block matching motion estimation is proposed. In the experimental results show that the PSNR values are improved up to the 3.6dB as depend on the Image sequences and advanced about 1.7dB on an average. The results of the comparison show that the performance of the proposed APDSA algorithm is better than those of other fast search algorithms whether the image sequence contains fast or slow motion, and is similar to the performance of the FS (Full Search) algorithm. Simulation results also show that the performance of the APDSA scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS algorithm.

• The Korean Journal of Nuclear Medicine
• /
• v.39 no.6
• /
• pp.464-472
• /
• 2005

Purpose: SPECT using a fan-beam collimator improves spatial resolution and sensitivity. For the reconstruction from fan-beam projections, it is necessary to implement direct fan-beam reconstruction methods without transforming the data into the parallel geometry. In this study, various fan-beam reconstruction algorithms were implemented and their performances were compared. Materials and Methods: The projector for fan-beam SPECT was implemented using a ray-tracing method. The direct reconstruction algorithms implemented for fan-beam projection data were FBP (filtered backprojection), EM (expectation maximization), OS-EM (ordered subsets EM) and MAP-EM OSL (maximum a posteriori EM using the one-step late method) with membrane and thin-plate models as priors. For comparison, the fan-beam protection data were also rebinned into the parallel data using various interpolation methods, such as the nearest neighbor, bilinear and bicubic interpolations, and reconstructed using the conventional EM algorithm for parallel data. Noiseless and noisy projection data from the digital Hoffman brain and Shepp/Logan phantoms were reconstructed using the above algorithms. The reconstructed images were compared in terms of a percent error metric. Results: for the fan-beam data with Poisson noise, the MAP-EM OSL algorithm with the thin-plate prior showed the best result in both percent error and stability. Bilinear interpolation was the most effective method for rebinning from the fan-beam to parallel geometry when the accuracy and computation load were considered. Direct fan-beam EM reconstructions were more accurate than the standard EM reconstructions obtained from rebinned parallel data. Conclusion: Direct fan-beam reconstruction algorithms were implemented, which provided significantly improved reconstructions.