• Journal of the Korean Society for information Management
• /
• v.21 no.1
• /
• pp.173-186
• /
• 2004

This study examines coverage and coverage overlap of the three major Korean web directories, Naver, Yahoo Korea, and Empas. This study also suggests a methodology for collecting and processing web sites provided by these web directories. A method for napping main categories was developed. Each directory provided registered web pages in a slightly different way. Reference links had a significant influence on the coverage of each web directory. The overlap of pages among three directories was quite low, It is expected that this study could contribute to the field of web research by providing insights to how directories provide web pages and suggesting a methodology for the analysis of directory coverage.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.437-439
• /
• 2021

SPL 방법론을 적용하여 개발한 제품군 시험은 모든 제품에서 사용되는 공통 부분과 일부 또는 단일 제품에서만 사용되는 가변 부분을 종합적으로 고려해야 하기 때문에 단일 소프트웨어 시험과는 상당히 다르다. 시험 커버리지는 작성된 시험에 대한 적절성을 측정하는 데에 사용되는 동시에 적절한 시험을 작성하기 위한 가이드로 사용되기 때문에 중요하다. SPL 시험에서 시험 커버리지 측정은 제품군을 구성하는 멤버제품 별로 측정될 수도 있지만, 이는 재사용을 기반으로 중복된 개발관련 활동의 최소화를 지향하는 SPL 의 원칙에 맞지 않다. 따라서 개별 제품이 아닌 SPL 수준에서 시험 커버리지 기준을 측정하고 시험의 적절성을 평가하기 위해서는 다른 방법이 필요하다. 이 논문에서는 구성가능한 소프트웨어 시스템(highly configurable software system)에 SPL 시험 방법을 적용하여 SPL 기반 제품군을 위한 시험 커버리지의 측정 방법을 제안하고 실험의 수행 결과를 기술하여 제안한 방법의 적절성을 검증한다.

• Journal of the Korean Geographical Society
• /
• v.43 no.2
• /
• pp.220-234
• /
• 2008

In many security monitoring contexts, the performance or efficiency of surveillance sensors/networks based on a single sensor type may be limited by environmental conditions, like illumination change. It is well known that different modes of sensors can be complementary, compensating for failures or limitations of individual sensor types. From a location analysis and modeling perspective, a challenge is how to locate different modes of sensors to support security monitoring. A coverage-based optimization model is proposed as a way to simultaneously site k different sensor types. This model considers common coverage among different sensor types as well as overlapping coverage for individual sensor types. The developed model is used to site sensors in an urban area. Computational results show that common and overlapping coverage can be modeled simultaneously, and a rich set of solutions exists reflecting the tradeoff between common and overlapping coverage.

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

인터넷을 통해 주위 사물과 연결된 차량은 사용자에게 편리성을 제공하기 위해 다양한 콘텐츠를 요구하는데 클라우드로부터 가져오는 시간이 비교적 오래 걸리기 때문에 차량과 물리적으로 가까운 위치에 캐싱하는 기법들이 등장하고 있다. 본 논문에서는 기반 시설이 밀집하게 설치된 도시 환경에서 maximum distance separable(MDS) 코딩을 사용해 road side unit(RSU)에 캐싱하는 방법에 대해 연구하였다. RSU의 중복된 서비스 커버리지 지역을 고려하여 차량의 콘텐츠 요구에 대한 RSU hit ratio를 높이기 위해 deep Q-learning(DQN)를 사용하였다. 실험 결과 비교 알고리즘보다 hit raito 측면에서 더 높은 성능을 보이는 것을 증명하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.453-461
• /
• 2010

A critical issue in wireless sensor networks is an energy-efficiency since the sensor batteries have limited energy power and, in most cases, are not rechargeable. The most practical manner relate to this issue is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy. Especially, CTC (Connected Target Coverage) problem has been considered as a representative energy-efficiency problem considering connectivity as well as target coverage. In this paper, we propose a new energy consumption model considering multiple-targets and create a new problem, CMTC (Connected Multiple-Target Coverage) problem, of which objective is to maximize the network lifetime based on the energy consumption model. Also, we present SPT (Shortest Path based on Targets)-Greedy algorithm to solve the problem. Our simulation results show that SPT-Greedy algorithm performs much better than previous algorithm in terms of the network lifetime.

• Electronics and Telecommunications Trends
• /
• v.21 no.3 s.99
• /
• pp.23-35
• /
• 2006

3GPP는 HSPA와 같은 라디오 액세스 기술의 개선을 바탕으로 다가오는 수 년 동안 높은 경쟁력을 가질 것으로 예측된다. 그러나 3GPP에서는 급속히 발전되는 정보통신서비스를 효율적으로 제공하기 위해, 3GPP R6 기술과 비교하여 사용자와 사업자의 비용을 줄이면서도 고품질의 다양한 서비스를 제공하는 새로운 이동통신기술의 필요성을 인식하고, 낮은 전송 지연(low latency), 높은 전송률(high data rate), 시스템 용량과 커버리지를 개선하는 3G long term evolution 표준기술 작성을 시작하였다. 이에 따라 지난 2004년 말부터 3GPP에 참여한 사업자, 벤더, 연구소 등은 2007년 6월 표준규격작성완료를 목표로 LTE와 SAE에 대한 연구를 진행해 오고 있다. 이들 연구는 상호 운용성을 제공하기 위한 기술적 솔루션을 최소로 하면서 불필요하게 중복되는 필수 특성들을 줄이고 다양한 액세스 네트워크 사이에서 모빌리티를 제공하는 것을 목적으로 하고 있다. 본 문서에서는 2006년 3월까지 진행된 3GPP의 표준화 및 기술 동향에 대해살펴본다.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.12 no.4
• /
• pp.158-168
• /
• 2009

As nation and society progresses, urban ground facilities and their management system get more complicated and the cost and effort to control the system efficiently grows exponentially. This study suggests to the deployment method of a sensor node by Wireless Sensor Network for controling the Urban Ground Facilities of National Facilities. First, we achieve the management facilities and method using the first analysis and then make the coverage of sensing and then set up the Sensor Node in Urban Ground Facilities. Second, we propose the solution way of repetition by the second analysis. And, we embody the GIS program by Digital Map and this method, we improve the reality by overlapping an aerial photo. Also we make an experience on the sensor node allocation using making program. we can remove the repetition sensor node about 50%, and we can confirm that the sensor nodes are evenly distributed on the road.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.2
• /
• pp.231-242
• /
• 2013

Recently, automated software testing methods such as fuzzing have been researched to find software vulnerabilities. The purpose of fuzzing is to disclose software vulnerabilities by providing a software with malformed data. In order to increase the probability of vulnerability discovery by fuzzing, we must solve the test suite reduction problem because the probability depends on the test case quality. In this paper, we propose a new method to solve the test suite reduction problem which is suitable for the long test case such as file. First, we suggested the length of test case as a measure in addition to old measures such as coverage and redundancy. Next we designed a test suite reduction algorithm using the new measure. In the experimental results, the proposed algorithm showed better performance in the size and length reduction ratio of the test suite than previous studies. Finally, results from an empirical study suggested the viability of our proposed measure and algorithm for file fuzzing.