• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권7호
• /
• pp.2815-2839
• /
• 2020

In a cloud computing paradigm, allocation of various virtualized ICT resources is a complex problem due to the presence of heterogeneous application (MapReduce, content delivery and networks web applications) workloads having contentious allocation requirements in terms of ICT resource capacities (resource utilization, execution time, response time, etc.). This task of resource allocation becomes more challenging due to finite available resources and increasing consumer demands. Therefore, many unique models and techniques have been proposed to allocate resources efficiently. However, there is no published research available in this domain that clearly address this research problem and provides research taxonomy for classification of resource allocation techniques including strategic, target resources, optimization, scheduling and power. Hence, the main aim of this paper is to identify open challenges faced by the cloud service provider related to allocation of resource such as servers, storage and networks in cloud computing. More than 70 articles, between year 2007 and 2020, related to resource allocation in cloud computing have been shortlisted through a structured mechanism and are reviewed under clearly defined objectives. Lastly, the evolution of research in resource allocation techniques has also been discussed along with salient future directions in this area.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2010년 춘계학술발표회 논문집
• /
• pp.389-393
• /
• 2010

The Objective of this study was to develop a system for visualizing inundation area by using 1-D numerical model analyzing damage information such as inundation area, facilities, land usages, population, building, loads. In this study, we have reviewed hydraulic models to select a flood model for simulation of discharges, water depths and velocities. The study area is Namhan River from Youngwol to Paldang Dam which had a flood damage on upper and below regions of Chungju Dam by a storm event in 2006. At the first, we developed the DB system base on GIS thematic map, ortho images, cadastral maps to analyze flood damages and support decisions making. Changing the boundary conditions such as discharge at the gauging stations, flood simulations were performed and then damages were extracted from the databases information support system based on 1-D numerical hydraulic model, it is expected to be able to analyze flood damages and support a decision making for reduce flood relate damages. In the future, the system developed in this study could be applied for flood forecasting system of small scaled streams.

• 한국재난정보학회 논문집
• /
• 제11권2호
• /
• pp.269-278
• /
• 2015

소방취약지 분석 관리를 위한 공간정보 분석기법을 자동화하고 소방주제도를 갱신 구축하여 온라인으로 탑재하는 서비스 플랫폼 기술을 개발하였다. 그 결과, 플랫폼을 통하여 화재진압 활동에 필요한 사전 정보가 제공되는 기반이 마련되었다. 이 결과에 향후 소방취약지 활용서비스 연구가 뒷바침되면 화재진압 현장의 골든타임을 감소시킬 수 있다. 소방분야에 적합한 공간분석과 자동화, 손쉬운 서비스 탑재 운영으로 전문적 관리와 서비스 확대 개선에 만족할 만한 기술적 가능성을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권4호
• /
• pp.1611-1629
• /
• 2016

Recently, deploying WiFi access points (APs) for facilitating indoor localization has attracted increasing attention. However, most existing mechanisms in this aspect are typically simulation based and further they did not consider how to jointly utilize pre-existing APs in target environment and newly deployed APs for achieving high localization performance. In this paper, we propose a measurement-based AP deployment mechanism (MAPD) for placing APs in target indoor environment for assisting fingerprint based indoor localization. In the mechanism design, MAPD takes full consideration of pre-existing APs to assist the selection of good candidate positions for deploying new APs. For this purpose, we first choose a number of candidate positions with low location accuracy on a radio map calibrated using the pre-existing APs and then use over-deployment and on-site measurement to determine the actual positions for AP deployment. MAPD uses minimal mean location error and progressive greedy search for actual AP position selection. Experimental results demonstrate that MAPD can largely reduce the localization error as compared with existing work.

• 인터넷정보학회논문지
• /
• 제21권5호
• /
• pp.31-37
• /
• 2020

Last year's Goseong-Sokcho forest fires have highlighted the limitations of extinguishing work for night-time forest fire and the importance of quick identification for information on the spread of forest fire. However, it is not easy to find services that take into account the characteristics of forest fires, as most existing disaster-related mobile applications and research assume various disaster situations rather than just forest fire situations. Therefore, a system that can provide information quickly is needed, taking into account the characteristics of forest fires and the limitations of extinguishing work. In this paper, we propose evacuation route guidance services that bypass areas where fire has already spread, supplement existing methods of extinguishing work, and provide general information on forest fire situations in real time, by putting drones into forest fire situations. It has been implemented to automate image analysis using the Rekognition service of Amazon Web Service (AWS), and the results of fire detection and the T Map API guide the evacuation path. It is expected that the results of this paper will allow efficient and rapid rescue and extinguishing work to be carried out, and further reduce the damage of human life caused by forest fires.

• 한국통신학회논문지
• /
• 제21권3호
• /
• pp.553-563
• /
• 1996

Detecting edges is one of issues with essentialimprotance in the area of image analysis. An edge in an image is a boundary or contour at which a significant change occurs in image intensity. Edge detection has been studied in many addlications such as imagesegmentation, robot vision, and image compression. In this paper, we propose an automatic threshold selection scheme for edge detection and show its application to noise elimination. The scheme suggested here applied statistical properties of the noise estimated from a noisy image to threshold selection. Since a selected threshold value in the scheme depends on not the characgreistic of an orginal image but the statistical feature of added noise, we can remove ad-hoc manners used for selecting the threshold value as well as decide the value theoretically. Furthermore, that shceme can reduce the number of edge pixels either generated or lost by noise. an application of the scheme to noise elimination is shown here. Noise in the input image can be eliminated with considering the direction of each edge pixedl on the edge map obtained by applying the threshold selection scheme proposed in this paper. Achieving significantly improved results in terms of SNR as well as subjective quality, we can claim that the suggested method works well.

• 한국CDE학회논문집
• /
• 제12권4호
• /
• pp.255-262
• /
• 2007

In the finite element analysis of forming process, objects are described with a finite number of elements and nodes and the approximated solutions can be obtained by the variational principle. One of the shortcomings of a finite element analysis is that the structure of mesh has become inefficient and unusable because discretization error increases as deformation proceeds due to severe distortion of elements. If the state of current mesh satisfies a certain remeshing criterion, analysis is stopped instantly and resumed with a reconstructed mesh. In the study, a new remeshing algorithm using tetrahedral elements has been developed, which is adapted to the desired mesh density. In order to reduce the discretization error, desired mesh sizes in each lesion of the workpiece are calculated using the Zinkiewicz and Zhu's a-posteriori error estimation scheme. The pre-constructed mesh is constructed based on the modified point insertion technique which is adapted to the density function. The object domain is divided into uniformly-sized sub-domains and the numbers of nodes in each sub-domain are redistributed, respectively. After finishing the redistribution process of nodes, a tetrahedral mesh is reconstructed with the redistributed nodes, which is adapted to the density map and resulting in good mesh quality. A goodness and adaptability of the constructed mesh is verified with a testing measure. The proposed remeshing technique is applied to the finite element analyses of forging processes.

• 한국정보처리학회논문지
• /
• 제5권1호
• /
• pp.24-32
• /
• 1998

버스기반 공유메모리-다중프로세서는 공유버스의 사용으로 인한 병목 현상이 시스템의 성능을 제한하며, 특히 분리형 트랜잭션 환경 하에서 각 프로세서들로부터 생성되는 메모리 접근에 대한 요청의 일부가 불필요하게 메모리 입력 버퍼에 대기함으로써 시스템의 성능을 저하시킨다. 이와 같은 불필요한 메모리 입력버퍼에서의 대기는 각 블록에 대한 상태정보를 이용함으로써 제거될 수 있지만, 메모리의 각 블록에 대하여 상태정보가 완전 사상된 비트맵테이블을 저장하기 위한 SRAM에 대한 부담이 발생되었다. 본 연구에서는 이와 같은 문제점을 해결하기 위하여 비공유부분의 배제와 참조 국부성의 원리를 적용하여 상태정보를 저장하기 위한 SRAM의 용량을 줄이기를 제안한다. 시뮬레이션 결과에 의하면 시스템의 성능에는 거의 영향을 미치지 않으면서 상태정보의 저장 용량을 줄일 수 있어 가격-대-성능의 향상을 도모할 수 있다.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2012년도 춘계 종합학술대회 논문집
• /
• pp.269-270
• /
• 2012

유전자 증폭을 위한 정확한 PCR Primer의 디자인은 핵심적인 기반 기술이다. 기존 연구를 통해 각 유전자별 특이적인 PCR Primer를 디자인할 수 있는 도구가 제안되었으나, 유전체 정보를 활용한 대단위의 디자인작업을 수행하기에는 적합하지 않았다. 본 논문에서는 클라우드 컴퓨팅 환경에서 대규모의 유전체를 대상으로 특이적인 PCR Primer를 디자인하고 검색할 수 있는 시스템을 설계하고 구현한다. 제안하는 시스템은 Hadoop 플랫폼에서의 MapReduce 프레임워크를 기반으로 설계 및 구현하여 유전자 서열검색을 대규모로 수행할 수 있도록 하였다. 5만개의 질의를 이용한 성능 평가 결과, 제안하는 기법은 기존 BLAST를 이용한 검색방법에 비해 약 3배의 성능 향상을 보였다.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2016년도 춘계 종합학술대회 논문집
• /
• pp.53-54
• /
• 2016

빅데이터란 대용량 데이터 활용 및 분석을 통해 가치 있는 정보를 추출하고, 이를 바탕으로 대응 방안 도출 또는 변화를 예측하는 기술을 의미한다. 그리고 빅데이터 분석에 활용되는 데이터인 페이스북과 같은 소셜 데이터, 유전자 발현과 같은 바이오 데이터, 항공망과 같은 지리정보 데이터들은 대용량 네트워크로 구성되어 있다. 네트워크 클러스터링은 서로 유사한 특성을 갖는 네트워크 내의 데이터들을 동일한 클러스터로 묶는 기법으로 네트워크 데이터를 분석하고 그 특성을 파악하는데 폭넓게 사용된다. 최근 빅데이터가 다양한 분야에서 활용되면서 방대한 양의 네트워크 데이터가 생성되고 있고, 이에 따라서 대용량 네트워크 데이터를 효율적으로 처리하는 클러스터링 기법의 중요성이 증가하고 있다. MCL(Markov Clustering) 알고리즘은 플로우 기반 무감독(unsupervised) 클러스터링 알고리즘으로 확장성이 우수해 다양한 분야에서 활용되고 있다. 하지만, MCL은 대용량 네트워크에 대해서는 많은 클러스터링 연산을 요구하며 너무 많은 클러스터를 생성하는 문제를 갖는다. 본 논문에서는 네트워크 압축을 기반으로 한 클러스터링 알고리즘을 제안함으로써 MCL보다 클러스터링 속도와 정확도를 향상시켰다. 또한, 희소행렬을 효율적으로 저장하는 CSC(Compressed Sparse Column) 자료구조와 MapReduce 기법을 제안한 클러스터링 알고리즘에 적용함으로써 대용량 네트워크에 대한 클러스터링 속도를 향상시켰다.