• Title/Summary/Keyword: 커버리지 알고리즘

Search Result 80, Processing Time 0.154 seconds

표적 마케팅을 위한 CBR 시스템의 유사 임계치 및 커버리지의 동시 최적화 모형

  • An, Hyeon-Cheol
    • 한국경영정보학회:학술대회논문집
    • /
    • 2007.11a
    • /
    • pp.605-610
    • /
    • 2007
  • 사례기반추론(CBR)은 많은 장점으로 인해, 생산, 재무, 마케팅 등의 분야의 다양한 경영의사결정문제 해결에 적용되어 왔다. 그러나, 효과적인 CBR 시스템을 설계, 구축하기 위해서는 연구자가 직관적으로 설정해야 할 많은 변수들이 존재한다. 본 연구에서는 이러한 CBR의 여러 설계요소들 중, '결합할 유사사례의 선택' 과 관련해, CBR이 보다 개선된 형태로 경영문제 해결에 응용될 수 있는 모형을 제시하고 있다. 본 연구의 제안모형은 결합할 유사사례를 선택하는 기준으로 특정 사례수(k-NN)나 유사도의 상대적 비율을 사용하는 기존의 CBR과 달리 0에서 1사이의 값을 갖는 절대적 유사 임계치를 적용하고 있다. 다만, 절대적 유사 임계치를 사용할 때, 그 값이 작아질 경우 예측결과의 생성이 과도하게 이루어지지 않을 수 있는 문제를 해결하기 위해, 커버리지를 모형에 함께 반영하여 사용자가 원하는 수준의 커버리지는 유지한 상태에서 가장 효과적인 유사 사례를 찾아, 추론을 수행할 수 있도록 설계하였다. 제안모형을 검증하기 위해, 본 연구에서는 이 모형을 실제 인터넷 쇼핑몰의 고객 발굴 사례에 적용해 보았다. 이를 통해, 제안모형의 적용가능성을 확인하고, 향후 추가연구가 요구되는 개선방향을 고찰해 보았다.

  • PDF

An Energy-Efficient Algorithm for Solving Coverage Problem and Sensing Big Data in Sparse MANET Environments (희소 모바일 애드 혹 네트워크 환경에서 빅데이터 센싱을 위한 에너지 효율적인 센서 커버리지 알고리즘)

  • Gil, Joon-Min
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.11
    • /
    • pp.463-468
    • /
    • 2017
  • To sense a wide area with mobile nodes, the uniformity of node deployment is a very important issue. In this paper, we consider the coverage problem to sense big data in sparse mobile ad hoc networks. In most existing works on the coverage problem, it has been assumed that the number of nodes is large enough to cover the area in the network. However, the coverage problem in sparse mobile ad hoc networks differs in the sense that a long-distance between nodes should be formed to avoid the overlapping coverage areas. We formulate the sensor coverage problem in sparse mobile ad hoc networks and provide the solution to the problem by a self-organized approach without a central authority. The experimental results show that our approach is more efficient than the existing ones, subject to both of coverage areas and energy consumption.

Multicast Coverage Prediction in OFDM-Based SFN (OFDM 기반의 SFN 환경에서의 멀티캐스트 커버리지 예측)

  • Jung, Kyung-Goo;Park, Seung-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.3A
    • /
    • pp.205-214
    • /
    • 2011
  • In 3rd generation project partnership long term evolution, wireless multicast techniques which send the same data to multiple users under single frequency networks have attracted much attention. In the multicast system, the transmission mode needs to be selected for efficient data transfer while satisfying the multicast coverage requirement. To achieve this, users' channel state information (CSI) should be available at the transmitter. However, it requires too much uplink feedback resource if all the users are allowed to transmit their CSI at all the time. To solve this problem, in this paper, the multicast coverage prediction is suggested. In the proposed algorithm, each user measures its transition probabilities between the success and the fail state of the decoding. Then, it periodically transmits its CSI to the basestation. Using these feedbacks, the basestation can predict the multicast coverage. From the simulation results, we demonstrate that the proposed scheme can predict the multicast system coverage.

Autonomous Unmanned Vehicle based Self-locomotion Network for Tracking Targets in Group Mobility (그룹이동타겟 추적을 위한 무인차량기반의 자가이동 네트워크)

  • Tham, Nguyen Thi;Yoon, Seok-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7C
    • /
    • pp.527-537
    • /
    • 2012
  • In this paper, we propose unmanned vehicle based tracking network (UVTN) architecture and algorithms which employ multiple autonomous unmanned ground vehicles (AUGV) to efficiently follow targets in a group. The goal of UVTN is to maximize the service coverage while tracking target nodes for monitoring or providing the network access. In order to achieve this goal, UVTN performs periodic expansion and contraction which results in optimized redistribution of AUGV's in the network. Also, enhanced algorithms such as fast contraction and longest first are also discussed to improve the performance of UVTN in terms of the average coverage ratio and traveled distance. Simulation results show that the proposed UVTN and enhanced algorithms can effectively track the moving target and provide the consistent coverage.

A Field Application of 3D Seismic Traveltime Tomography (I) - Constitution of 3D Seismic Traveltime Tomography Algorithm - (3차원 탄성파 토모그래피의 현장 적용 (1) - 3차원 토모그래피 알고리즘의 구성 -)

  • Moon, Yoon-Sup;Ha, Hee-Sang;Ko, Kwang-Buem;Kim, Ji-Soo
    • Tunnel and Underground Space
    • /
    • v.18 no.3
    • /
    • pp.202-213
    • /
    • 2008
  • In this study, theoretical approach of 3D seismic traveltime tomography was investigated. To guarantee the successful field application of 3D tomography, appropriate control of problem associated with blind zone is pre-requisite. To overcome the velocity distortion of the reconstructed tomogram due to insufficient source-receiver array coverage, the algorithm of 3D seismic traveltime tomography based on the Fresnel volume was developed as a technique of ray-path broadening. For the successful reconstruction of velocity cube, 3D traveltime algorithm was explored and employed on the basis of 2nd order Fast Marching Method(FMM), resulting in improvement of precision and accuracy. To prove the validity and field application of this algorithm, two numerical experiments were performed for globular and layered models. The algorithm was also found to be successfully applicable to field data.

A Scheduling Scheme under Probabilistic Coverage Model (확률 커버리지 모델 기반의 스케줄링 기법)

  • Kim, Chan-Myung;Kang, In-Seok;Han, Youn-Hee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.556-559
    • /
    • 2011
  • CTC(Connected Target Coverage)문제는 주어진 전체 타겟을 관측하고 관측한 데이터를 싱크노드까지 전송하는데 관여하는 센서집합의 개수를 최대화하여 네트워크 수명을 최대화하는 문제이다. 본 논문은 센서가 타겟을 관측할 확률이 타겟과의 거리에 영향을 받는다고 가정하는 확률 커버리지 모델을 기반으로 CTC문제에 접근한다. CTC문제를 해결하기 위해 휴리스틱 알고리즘인 CWGC-PM 알고리즘을 제안하고 시뮬레이션을 통해 알고리즘이 CTC문제를 해결하기에 적합함을 보인다.

Parallel CNV detection algorithm based on Cloud Computing (클라우드 컴퓨팅 기반의 병렬 CNV 검출 알고리즘)

  • Hong, Sang-Kyoon;Lee, Jee-Hee;Lee, Un-Joo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.1264-1267
    • /
    • 2011
  • 시퀀싱 기술의 발달로 최근에는 비교적 저렴한 비용으로 개인의 유전체 시퀀싱 데이터를 산출할 수 있게 되었다. 하지만 이를 기반으로 하는 기존의 분석 방법은 매우 고가의 컴퓨팅 환경을 요구하기 때문에 분석을 위한 비용이 매우 높은 문제가 있다. 본 논문에서 클라우드 컴퓨팅 환경의 병렬 CNV 검출알고리즘을 제안한다. 제안하는 방법은 모양 기반의 CNV 검출 알고리즘인 CNV_shape을 MapReduce 기법으로 개발한 것으로 시퀀싱 데이터를 레퍼런스 서열에 매핑한 결과로부터 리드 커버리지 (read coverage)를 계산하여 커버리지가 감소하거나 증가하는 일정 길이 이상의 영역을 검출하는 방법이다. 클라우드 컴퓨팅 환경에 적용하고 노드의 밸런싱 유지를 위한 방법으로 파티셔닝 기법을 사용하였다. 또한 실 데이터를 이용한 실험을 통해 제안하는 방법의 효율적 데이터 처리를 보인다.

Interoperability Test Suite DErivation for the TCP (TCP 상호운용성 시험스위트의 도출)

  • Seol, Sun-Ok;Kim, Myeong-Cheol;Gang, Seong-Won;Jin, Byeong-Mun;Hyeon, Sun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.11
    • /
    • pp.1414-1428
    • /
    • 1999
  • ATM/B-ISDN 신호 프로토콜과 같은 통신 프로토콜의 상호운용성을 시험하기 위한 시험경우를 생성하는 알고리즘이 제안되었다 1]. 현재까지 상호운용성 시험경우 도출을 자동화하거나 이에 대한 커버리지를 분석한 경우는 없다. 본 논문은 1]에서 제안한 알고리즘을 프로그램으로 구현하여 TCP 연결설정 프로토콜에 적용하고 결과를 분석한다. 이 과정에서 (1) TCP 연결설정 프로토콜의 3방향 핸드 쉐이킹 부분을 다루지 못했던 기존의 알고리즘을 개선하고, (2) 개선된 알고리즘을 프로그램으로 구현하여 TCP 연결설정 프로토콜의 상호운용성 시험경우를 도출하고, (3) 생성된 상호운용성 시험경우를 트랜지션 커버리지 관점에서 분석하고, (4) 향상된 트랜지션 커버리지를 얻기 위하여 알고리즘 확장 방안을 제시한다.Abstract A test derivation method suitable for testing interoperability for the class of communication protocols like the ATM/B-ISDN signaling protocol was proposed 1]. Up to now, there is no work on automating derivation of the interoperability test suite and analyzing its coverage. In this paper, we implement the algorithm proposed by 1], apply it to the Transmission Control Protocol (TCP), and analyze its results. In this process, we (1) improve the algorithm that is not applicable to the TCPs three-way handshaking, (2) implement the improved algorithm as a program and derive an interoperability test suite automatically from a given pair of TCP FSMs, (3) analyze generated interoperability test suite in view of transition coverage, and (4) present a method in order to extend the algorithm for better transition coverage.

A Distributed Power Control Algorithm for Data Load Balancing with Coverage in Dynamic Femtocell Networks (다이나믹 펨토셀 네트워크에서 커버리지와 데이터 부하 균형을 고려한 기지국의 파워 조절 분산 알고리즘)

  • Shin, Donghoon;Choi, Sunghee
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.2
    • /
    • pp.101-106
    • /
    • 2016
  • A femtocell network has been attracting attention as a promising solution for providing high data rate transmission over the conventional cellular network in an indoor environment. In this paper, we propose a distributed power control algorithm considering both indoor coverage and data load balancing in the femtocell network. As data traffic varies by time and location according to user distribution, each femto base station suffers from an unbalanced data load, which may degrade network performance. To distribute the data load, the base stations are required to adjust their transmission power dynamically. Since there are a number of base stations in practice, we propose a distributed power control algorithm. In addition, we propose the simple algorithm to detect the faulty base station and to recover coverage. We also explain how to insert a new base station into a deployed network. We present the simulation results to evaluate the proposed algorithms.

A Method of Test Coverage Measurement Based on BitTorrent for Internet of Things Environment (사물 인터넷 환경을 위한 BitTorrent 알고리즘 기반의 테스트 커버리지 측정기법)

  • Ryu, Hodong;Lee, Woo Jin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.10
    • /
    • pp.365-370
    • /
    • 2014
  • Although Internet of Things already became a new paradigm on service on network, we should pay more effort for studying about its testing method, since humans, things and environments in IoT are connected to each other without any restrictions. Earlier researches based on emulators showed that such virtual devices on emulators had unavoidable gap between them and real things. Furthermore, growth of connection complexity between the devices and loosing of restrictions make the gap wider. Accordingly, in this paper, we suppose a method of test coverage measurement based on BitTorrent for IoT environment. It has cooperation features among homogeneous devices with avoiding the overlapping on each part of whole test process.