• Geophysics and Geophysical Exploration
• /
• v.4 no.1
• /
• pp.8-18
• /
• 2001

To delineate the inhomogeneities including fractures and to estimate the freshness of rock borehole radar consisting of the reflection and tomography methods, and GPR surveys were conducted at a granite quarry mine. The borehole reflection survey using the direction finding antenna was also conducted to get the spatial orientations of reflectors. 20 MHz was adopted as the central frequency for the borehole radar reflection and tomography surveys and 100 MHz was for GPR. Through the interpretation of borehole reflection data using dipole and direction finding antenna as well as GPR images, which are good agreement with each other, we could determine the orientation of the major fractures in three dimensional way. Parts of travel time curves of tomography data showed the anisotropy, which is uncommon in granite quarry. By comparing the tomography data and TeleViewer images, the anisotropy effect in this area are closely related to fine fissures aligned in the same direction. The area confined by the two fractures, MF2 and MF5, might consist of the most fresh granite in the surveyed area, which was concluded from the borehole radar tomography, and GPR images as well as the distribution of anisotropy.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.211-218
• /
• 2015

This paper introduces a 'divide-and-conquer' algorithm to the travelling salesman problem (TSP). Top 10n are selected beforehand from a pool of n(n-1) data which are sorted in the ascending order of each vertex's distance. The proposed algorithm then firstly selects partial paths that are interconnected with the shortest distance $r_1=d\{v_i,v_j\}$ of each vertex $v_i$ and assigns them as individual regions. For $r_2$, it connects all inter-vertex edges within the region and inter-region edges are connected in accordance with the connection rule. Finally for $r_3$, it connects only inter-region edges until one whole Hamiltonian cycle is constructed. When tested on TSP-1(n=26) and TSP-2(n=42) of real cities and on a randomly constructed TSP-3(n=50) of the Euclidean plane, the algorithm has obtained optimal solutions for the first two and an improved one from that of Valenzuela and Jones for the third. In contrast to the brute-force search algorithm which runs in n!, the proposed algorithm runs at most 10n times, with the time complexity of $O(n^2)$.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.534-539
• /
• 2010

OpenMP 프로그램의 수행 중에 발생하는 자료 경합과 같은 병행성 오류는 디버깅을 위하여 반드시 탐지되어야만 한다. 그러나 이를 탐지하는 것은 어려운 일이다. 접근사건의 발생 후 관계를 기반으로하는 경합 탐지 기법은 프로그램의 수행 중에 발생하는 스레드의 병행성 정보를 식별하기위한 레이블을 생성하고, 생성된 스레드의 레이블을 기반으로 공유변수에 접근하는 사건을 접근역사를 통해 감시함으로써 경합을 탐지한다. 이러한 경합 탐지의 방법에서 레이블 생성을 위한 NR 레이블링 기법은 병행성 정보생성 시에 지역자료 구조를 사용함으로써 병목현상이 발생하지 않으며, 접근역사에 저장하는 레이블의 크기가 상수 값을 갖는 공간적 효율성을 제공한다. 또한 부모스레드의 정보역사를 정렬된 리스트 형태로 가져 병행성 정보 비교 시에 이진탐색이 가능하므로 시간적 효율성을 가지는 우수한 기법이다. 그러나, NR 레이블링은 레이블의 생성시에 부모스레드의 정보역사를 유지하기 위해서 내포 병렬성의 깊이에 의존하는 시간적 비용이 요구된다. 본 논문에서는 부모스레드의 정보역사 유지를 위해 상수적인 시간 및 공간적 복잡도를 갖도록 NR 레이블링 기법을 개선한다. 합성 프로그램을 이용하여 실험한 결과에서 개선된 기법은 최대 병렬성의 증가에 따라 레이블의 생성과 유지시 기존의 기법보다 평균 4.5배 빠르고, 레이블링을 위해 평균 3배 감소된 기억공간을 요구하며, 내포 병렬성에 의존적이지 않음을 보인다.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2009.09a
• /
• pp.412-419
• /
• 2009

Large quantity of extra soils discharged from excavation site in Songdo area can be treated by hardening agents and utilized in surface stabilized layer overlying thick reclaimed soft soil deposit. Though surface layer stabilization method using cement or lime for very soft soils has been studied in recent years, but studies on moderately soft clayey silt has not been tried. The purpose of this research is to investigate optimum mixing condition for stabilizing Songdo marine soil with low plasiticity. The optimum mixing conditions of hardening agents with Songdo soil such as kind of agents, mixing ratio, initial water content and curing time are investigated by uniaxial compression test and laboratory vane test. The results indicate that strength increases with high mixing ratio and long curing time, while decreases drastically under certain water content before mixing. Finally, optimum mixing condition considering economic efficiency and workability with test results was proposed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.05a
• /
• pp.696-698
• /
• 2022

게임에서는 장애물이 가로 막고 있을 때 길 찾기 알고리즘이 요구된다. Path Finding Method 는 길과 장애물을 고려하여 목적지까지의 경로를 찾는 방법을 말한다. A^* 알고리즘은 이런 복잡한 미로 찾기에 최적화된 Path Finding 알고리즘이다. 하지만, 모바일 같은 저비용 기기에서 A^* 알고리즘을 사용하기엔 단순한 지형에서도 연산 부하가 발생할 수 있다. 본 논문에서는 가상의 공간에서 Grid를 구축하여, 통행이 가능한 곳과 불가능한 곳을 나누어 최종 지점에 도달할 수 있도록 하는 방식을 제안한다. 본 논문에서 제시한 Path Finding Method 는 최종 지점이 막다른 길인 경우 가장 가까운 이동 가능한 경로로 길을 안내하도록 설계하여 예외 상황에 대처했다. 대표적인 길 찾기 알고리즘인 Dijkstra 알고리즘은 최소 비용을 고려해서 최단으로 가는 거리를 비교하여 길을 나타낼 수 있다. 하지만, Dijkstra 알고리즘 경우 비용이 양수가 아닌 음수의 경우 무한 루프에 빠지는 등 결과 값이 제대로 나오지 않을 수 있다. 본 논문에서 제안한 Path Finding Method 는 최소 비용을 노드별로 비교하는 방식이 아닌 초기 비용을 알 수 없는 분야에 쉽게 사용할 수 있다. 본 논문에서는 제안한 Path Finding Method 를 적용하여 Web 게임을 제작하는 것에 성공하였다. 향후, Path Finding Method 결과에 위치 정렬 알고리즘을 적용하여, 중복된 지역을 가는 확률을 최소화하면서 정리된 Path 가 돌출되도록 연구할 예정이다. 본 논문의 Path Finding Method 은 게임 개발 분야에 적극 기여되길 바란다.

• Survey Research
• /
• v.11 no.1
• /
• pp.123-144
• /
• 2010

In new sample design for Korea Housing Survey to research about housing policy, total strata are forty five because individual results of sixteen regions are estimated. The sample size is determined by sample errors of several variables which are the living area, family income, householder income, and living expenses. The sample size of each region is determined by relative standard error of existing result, and the strata sample size is to use the square root proportion allocation. Enumeration districts are sampled by the probability proportion to size systematic sampling in proportion to the enumeration district size, and the systemic sampling to use assortment characteristics. We considered a new apartment complex because of variation reflections which are rebuilder and redevelopment of houses. To get estimators of mean and variance, we used the design weighting, non-response adjusting, and post-stratification. In order to consider estimation efficiency, we calculate the design effect using estimators of variance.

• Journal of the Korean association of regional geographers
• /
• v.13 no.5
• /
• pp.576-594
• /
• 2007

The purpose of this study is to derive policy implications in allocating day care centers for the elderly with more efficiency and/or equity by calculating and analysing the accessibility scores of individual dongs to day care centers for the elderly in Seoul using GIS spatial analysis techniques. The study finds that the spatial distribution of the centers does not respond to the distribution of the potential users very well and that dongs in Gangseo-gu and Songpa-gu at the outskirt of Seoul has the lowest level of accessibility. The findings of the study has policy implications in the management of day care centers for the elderly. First, in order to improve the accessibility of the elderly to the centers, an increase in the number and the capacity of the centers needs to be made especially in areas with lower level of services provided. Second, if policy decision is made in the way to increase the capacity of the existing centers rather than to increase the number of centers due to, for example, the budget limit, capacity expansion needs to be made in the centers with higher proximity in order for more elderly people to use the centers more frequently with easy access. Finally, this type of accessibility analysis techniques needs to be used to allocate, expand, and evaluate other types of care facilities for the elderly and social welfare facilities in order to preserve the welfare right of the users of the facility who usually have a lower mobility and to assure the necessity of the resource investment.

• Korean Journal of Plant Resources
• /
• v.25 no.1
• /
• pp.96-104
• /
• 2012

Phylogenetic analyses were conducted to evaluate relationships of 7 taxa of Korean Carpesium including three outgroup (Inula britannica L., Inula germanica L., Rhanteriopsis lannginosa (DC.) Rauschert) by using ITS (internal transcribed spacer) sequences of nuclear ribosomal DNA. Phylogenetic studies used maximum parsimony, neighbor-joining and maximum likelihood methods analysis. The length of the ITS sequences was 731 bp, and the lengths of the ITS1, ITS2 and 5.8S regions were 284~297 bp, 264~266 bp and 164 bp, respectively. The total number of variable sites was 111 for the entire sequences, and a parsimony informative sites of 64 are valid. Base change appeared variously in ITS1 rather than in ITS2. As the result, Korean Carpesium were formed monophyletic group and C. abrotanoides situated as the most basal clade. The results show that C. macrocephalum is closely related with C. triste. C. rosulatum has the closest relationship with C. glossophyllum. C. cernuum is close to C. divaricatum. These results suggest that the ITS data used in this study could be useful for the phylogenetic analysis of Korean Carpesium.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.47-52
• /
• 2009

The transmitted signal from a source is transmitted to a destination through wireless channels. But if the mobile destination is out of the coverage of the source or exists in the shady side of the coverage, the destination can not receiver the signal from the source and they can not maintain communication. In order to overcome these problems, we adopt relays. A system employing relays is a multi-hop relay system. In the multi-hop relay system, coverages of each relay that is used for different systems can overlap each other in some place. When there is a destination in this place, interference occurs at the destination. In this paper, we study on the efficient co-channel interference (CCI) cancellation algorithm. In the proposed strategy, CCI is mitigated by zero forcing (ZF) or minimum mean square error (MMSE) receivers. Moreover, successive interference cancellation (SIC) with optimal ordering algorithm is applied for rejecting CCI efficiently. And we analyzed and simulated the proposed system performance in Rayleigh fading channel. In order to justify the benefit of the proposed strategy, the overall system performance is illustrated in terms of bit error probability.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.509-516
• /
• 2001

As results of many genome projects, genomic sequences of many organisms are revealed. Various methods such as global alignment, local alignment are used to analyze the sequences of the organisms, and k -mer analysis is one of the methods for analyzing the genomic sequences. The k -mer analysis explores the frequencies of all k-mers or the symmetry of them where the k -mer is the sequenced base with the length of k. However, existing on-memory algorithms are not applicable to the k -mer analysis because a whole genomic sequence is usually a large text. Therefore, efficient data structures and algorithms are needed. String B-tree is a good data structure that supports external memory and fits into pattern matching. In this paper, we improve the string B-tree in order to efficiently apply the data structure to k -mer analysis, and the results of k -mer analysis for C. elegans and other 30 genomic sequences are shown. We present a visualization system which enables users to investigate the distribution and symmetry of the frequencies of all k -mers using CGR (Chaotic Game Representation). We also describe the method to find the signature which is the part of the sequence that is similar to the whole genomic sequence.