• Title/Summary/Keyword: Coverage Algorithm

Search Result 369, Processing Time 0.031 seconds

3D Seismic Travel-time Tomography using Fresnel Volume (프레넬 볼륨을 이용한 3차원 탄성파 주시 토모그래피)

  • Ko, Kwang-Beom;Lee, Doo-Sung
    • Geophysics and Geophysical Exploration
    • /
    • v.6 no.2
    • /
    • pp.101-107
    • /
    • 2003
  • 3D seismic travel-time tomography algorithm baled on Fresnel volume was developed and its feasibility was investigated by the numerical experiments. To testify the field applicability of the developed algorithm, frequency characteristics and way coverage of the crossholel seismic raw data were investigated and 3D velocity tomogram cube with about 8m spatial resolution was obtained. When compared this 3D velocity cube with the conventional 2D ray tomogram, two results were matched well. We concluded that 3D seismic tomography algorithm developed in this study has enough potential to the field application.

Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.7
    • /
    • pp.33-40
    • /
    • 2015
  • The time slot assignment problem (TSAP) or Satellite Communications scheduling problem (SCSP) for a satellite performs $n{\times}n$ ground station data traffic switching has been known NP-hard problem. This paper suggests $O(n^2)$ time complexity algorithm for TSAP of a satellite that performs $n^2{\times}n^2$ ground station data traffic switching. This problem is more difficult than $n{\times}n$ TSAP as NP-hard problem. Firstly, we compute the average traffic for n-transponder's basic coverage zone and applies ground station exchange method that swap the ground stations until all of the transponders have a average value as possible. Nextly, we transform the D matrix to $D_{LB}$ traffic matrix that sum of rows and columns all of transponders have LB. Finally, we select the maximum traffic of row and column in $D_{LB}$, then decide the duration of kth switch mode to minimum traffic from selected values. The proposed algorithm can be get the optimal solution for experimental data.

Fixed Indoor-BS Selection Based Self-Healing in Indoor Wireless Communication System (인도어 무선통신시스템에서 고정적 인도어기지국 선택을 통한 자가치유 알고리즘)

  • Lee, Howon;Lee, Kisong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.7
    • /
    • pp.1540-1546
    • /
    • 2014
  • In order to resolve coverage hole problems caused by indoor-BS (IBS) faults, we propose a new frame structure and practical algorithm based on optimization technique. Our main contributions can be described as follows: 1) a frame structure with healing channels for solving abnormal IBS faults; and 2) an efficient heuristic resource allocation algorithm with fixed IBS selection to reduce the complexity for the optimization problem. Through intensive simulations, we evaluate the performance excellency of our proposed algorithm with respect to average cell capacity and user fairness compared with conventional algorithms.

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.

Handoff Algorithm based on One-way Trip Time for Wireless Mesh Network (Wireless Mesh Network을 위한 OTT 기반 핸드오프 알고리즘)

  • Park, Cha-Hee;Yoo, Myung-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.5
    • /
    • pp.16-24
    • /
    • 2007
  • Wireless mesh network extends the limited coverage of conventional wireless service from one-hop access point to wider area. It is recognized as an important issue to provide seamless handoff in the wide coverage of wireless mesh network. A long handoff delay may cause high packet loss and disconnection of service, degrading the network performance. The handoff delay is mainly introduced from the channel scanning process obtaining information to make handoff decision and the unnecessary handoffs due to inaccurate handoff decision. In this paper, we propose the handoff algorithm based on one-way trip time (OTT) to expedite the handoff procedure. As compared to the handoff algorithm based on the receiving signal power, the proposed algorithm takes advantage of OTT to obtain the necessary handoff information in a relatively shorter time and reduce the unnecessary handoffs. The performance of proposed algorithm is evaluated through the simulations. It is verified that the proposed handoff algorithm can effectively enhance the handoff accuracy, and therefore reduce the handoff delay and unnecessary handoffs.

Application of Multi-satellite Sensors to Estimate the Green-tide Area (황해 부유 녹조 면적 산출을 위한 멀티 위성센서 활용)

  • Kim, Keunyong;Shin, Jisun;Ryu, Joo-Hyung
    • Korean Journal of Remote Sensing
    • /
    • v.34 no.2_2
    • /
    • pp.339-349
    • /
    • 2018
  • The massive green tide occurred every summer in the Yellow Sea since 2008, and many studies are being actively conducted to estimate the coverage of green tide through analysis of satellite imagery. However, there is no satellite images selection criterion for accurate coverage calculation of green tide. Therefore, this study aimed to find a suitable satellite image from for the comparison of the green tide coverage according to the spatial resolution of satellite image. In this study, Landsat ETM+, MODIS and GOCI images were used to coverage estimation and its spatial resolution is 30, 250 and 500 m, respectively. Green tide pixels were classified based on the NDVI algorithm, the difference of the green tide coverage was compared with threshold value. In addition, we estimate the proportion of the green tide in one pixel through the Linear Spectral Unmixing (LSU) method, and the effect of the difference of green tide ratio on the coverage calculation were evaluated. The result of green tide coverage from the calculation of the NDVI value, coverage of green tide usually overestimate with decreasing spatial resolution, maximum difference shows 1.5 times. In addition, most of the pixels were included in the group with less than 0.1 (10%) LSU value, and above 0.5 (50%) LSU value accounted for about 2% in all of three images. Even though classified as green tide from the NDVI result, it is considered to be overestimated because it is regarded as the same coverage even if green tide is not 100% filled in one pixel. Mixed-pixel problem seems to be more severe with spatial resolution decreases.

Algorithms for Detecting Coupling Faults in Semiconductor RAM's (반도체 RAM의 결합고장을 검출하는 알고리듬)

  • 여정모;조상복
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.30A no.1
    • /
    • pp.51-63
    • /
    • 1993
  • "Algorithm DA" is proposed to test linked 2-CFs(2-Coupling Faults) with order 2 or 3 which are not perfectly detected in conventional algorithms. "Test 1*", "Test 2*" and "Algorithm RA" are proposed restricted 3-CFS. The time complexity of "Test 1*" is reduced in view of the detection of 3-CFS. "Test 2*" and "Algorithm RA" have not only the reduces time complexity but also the improved fault coverage in comparison with conventional algorithms. And "Algorithm RA" can be applied step by step according to the degree of the fault coverage. If "Algorithm RA" is applied to the memory with parallel test. its time complexity is reduced considerably. It is proved that the MT(March Test) with nonlinear address sequences can not detect perfectly the CFs more complex than linked 2-CFs with order 3.ss sequences can not detect perfectly the CFs more complex than linked 2-CFs with order 3.

  • PDF

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.

Optimizing SVM Ensembles Using Genetic Algorithms in Bankruptcy Prediction

  • Kim, Myoung-Jong;Kim, Hong-Bae;Kang, Dae-Ki
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.4
    • /
    • pp.370-376
    • /
    • 2010
  • Ensemble learning is a method for improving the performance of classification and prediction algorithms. However, its performance can be degraded due to multicollinearity problem where multiple classifiers of an ensemble are highly correlated with. This paper proposes genetic algorithm-based optimization techniques of SVM ensemble to solve multicollinearity problem. Empirical results with bankruptcy prediction on Korea firms indicate that the proposed optimization techniques can improve the performance of SVM ensemble.

Performance Evaluation of Channel Shortening Time Domain Equalizer in Wireless LAN Environment (무선랜 환경에서 채널 단축 시간영역 등화기의 성능평가)

  • Yoon Seok-Hyun;Yu Hee-Jung;Lee Il-Gu;Jeon Tae-Hyun;Lee Sok-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3A
    • /
    • pp.240-248
    • /
    • 2006
  • In this paper, we consider an OFDM receiver algorithm design for IEEE 802.11a/p system, which targeting large coverage area while keeping the transmission format unchanged. Particularly, taking into account the inter-symbol interference(ISI) and inter-carrier interference(ICI) that can be induced with large RMS delay spread, we employ channel shortening time-domain equalizer(TEQ) and evaluate the receiver performance in terms of SINR and packet error rate(PER). The preamble defined in IEEE802.11a/p is used to estimated the initial equalizer tap coefficients. Primary purpose of the paper is to give an answer to the question, though partially, whether or not 16-QAM constellation can be used in none line of sight environment at the boundary of a large coverage area. To this end, we first analyze the required TEQ parameters for the target channel environment and then perform simulation for PER performance evaluation in a generic frequency selective fading channel with exponential power-delay profile.