• Title/Summary/Keyword: Coverage algorithm

Search Result 369, Processing Time 0.028 seconds

Seismic Traveltime Tomography in Inhomogeneous Tilted Transversely Isotropic Media (불균질 횡등방성 매질에서의 탄성파 주시토모그래피)

  • Jeong, Chang-Ho;Suh, Jung-Hee
    • Geophysics and Geophysical Exploration
    • /
    • v.10 no.4
    • /
    • pp.229-240
    • /
    • 2007
  • In this study, seismic anisotropic tomography algorithm was developed for imaging the seismic velocity anisotropy of the subsurface. This algorithm includes several inversion schemes in order to make the inversion process stable and robust. First of all, the set of the inversion parameters is limited to one slowness, two ratios of slowness and one direction of the anisotropy symmetric axis. The ranges of the inversion parameters are localized by the pseudobeta transform to obtain the reasonable inversion results and the inversion constraints are controlled efficiently by ACB(Active Constraint Balancing) method. Especially, the inversion using the Fresnel volume is applied to the anisotropic tomography and it can make the anisotropic tomography more stable than ray tomography as it widens the propagation angle coverage. The algorithm of anisotropic tomography is verified through the numerical experiments. And, it is applied to the real field data measured at limestone region and the results are discussed with the drill log and geological survey data. The anisotropic tomography algorithm will be able to provide the useful tool to evaluate and understand the geological structure of the subsurface more reasonably with the anisotropic characteristics.

A Centralized Deployment Protocol with Sufficient Coverage and Connectivity Guarantee for WSNs (무선 센서 네트워크에서 유효 커버리지 및 접속성 보장을 위한 중앙 집중형 배치 프로토콜)

  • Kim, Hyun-Tae;Zhang, Gui-Ping;Kim, Hyoung-Jin;Joo, Young-Hoon;Ra, In-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.6
    • /
    • pp.683-690
    • /
    • 2006
  • Reducing power consumption to extend network lifetime is one of the most important challenges in designing wireless sensor networks. One promising approach to conserving system energy is to keep only a minimal number of sensors active and put others into low-powered sleep mode, while the active sensors can maintain a connected covet set for the target area. The problem of computing such minimum working sensor set is NP-hard. In this paper, a centralized Voronoi tessellation (CVT) based approximate algorithm is proposed to construct the near optimal cover set. When sensor's communication radius is at least twice of its sensing radius, the covet set is connected at the same time; In case of sensor's communication radius is smaller than twice of its sensing radius, a connection scheme is proposed to calculate the assistant nodes needed for constructing the connectivity of the cover set. Finally, the performance of the proposed algorithm is evaluated through theoretical analysis and extensive numerical experiments. Experimental results show that the proposed algorithm outperforms the greedy algorithm in terms of the runtime and the size of the constructed connected cover set.

Motor Control IP Design and Quality Evaluation from the Viewpoint of Reuse (ICCAS 2004)

  • Lee, Sang-Deok;Han, Sung-Ho;Kim, Min-Soo;Park, Young-Jun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.981-985
    • /
    • 2004
  • In this paper we designed the motor control IP Core and evaluate its quality from the viewpoint of IP reuse. The most attractive merit of this methodology, so called IP-based hardware design, is hardware reuse. Although various vendors designed hardware with the same specification and got the same functional results, all that IPs is not the same quality in the reuse aspect. As tremendous calls for SoC have been increased, associated research about IP quality standard, VSIA(Virtual Socket Interface Alliance) and STARC(Semiconductor Technology Academic Research Center), has been doing best to make the IP quality evaluation system. And they made what conforms to objective IP design standard. We suggest the methodology to evaluate our own designed motor control IP quality with this standard. To attain our goal, we designed motor control IP that could control the motor velocity and position with feedback compensation algorithm. This controller has some IP blocks : digital filter, quadrature decoder, position counter, motion compensator, and PWM generator. Each block's functionality was verified by simulator ModelSim and then its quality was evaluated. To evaluate the core, We use Vnavigator for lint test and ModelSim for coverage check. During lint process, We adapted the OpenMORE's rule based on RMM (Reuse Methodology Manual) and it could tell us our IP's quality in a manner of the scored value form. If it is high, its quality is also high, and vice versa. During coverage check ModelSim-SE is used for verifying how our test circuits cover designs. This objective methods using well-defined commercial coverage metrics could perform a quantitative analysis of simulation completeness. In this manner, We evaluated the designed motor control IP's quality from the viewpoint of reuse. This methodology will save the time and cost in designing SoC that should integrate various IPs. In addition to this, It can be the guide for comparing the equally specified IP's quality. After all, we are continuously looking forward to enhancing our motor control IP in the aspect of not only functional perfection but also IP reuse to prepare for the SoC-Compliant motor control IP design.

  • PDF

Optimizing Similarity Threshold and Coverage of CBR (사례기반추론의 유사 임계치 및 커버리지 최적화)

  • Ahn, Hyunchul
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.8
    • /
    • pp.535-542
    • /
    • 2013
  • Since case-based reasoning(CBR) has many advantages, it has been used for supporting decision making in various areas including medical checkup, production planning, customer classification, and so on. However, there are several factors to be set by heuristics when designing effective CBR systems. Among these factors, this study addresses the issue of selecting appropriate neighbors in case retrieval step. As the criterion for selecting appropriate neighbors, conventional studies have used the preset number of neighbors to combine(i.e. k of k-nearest neighbor), or the relative portion of the maximum similarity. However, this study proposes to use the absolute similarity threshold varying from 0 to 1, as the criterion for selecting appropriate neighbors to combine. In this case, too small similarity threshold value may make the model rarely produce the solution. To avoid this, we propose to adopt the coverage, which implies the ratio of the cases in which solutions are produced over the total number of the training cases, and to set it as the constraint when optimizing the similarity threshold. To validate the usefulness of the proposed model, we applied it to a real-world target marketing case of an online shopping mall in Korea. As a result, we found that the proposed model might significantly improve the performance of CBR.

Comparison of Dose Distributions Calculated by Anisotropic Analytical Algorithm and Pencil Beam Convolution Algorithm at Tumors Located in Liver Dome Site (간원개에 위치한 종양에 대한 Anisotropic Analyticalal Algorithm과 Pencil Beam Convolution 알고리즘에 따른 전달선량 비교)

  • Park, Byung-Do;Jung, Sang-Hoon;Park, Sung-Ho;Kwak, Jeong-Won;Kim, Jong-Hoon;Yoon, Sang-Min;Ahn, Seung-Do
    • Progress in Medical Physics
    • /
    • v.23 no.2
    • /
    • pp.106-113
    • /
    • 2012
  • The purpose of this study is to evaluate the variation of radiation dose distribution for liver tumor located in liver dome and for the interest organs(normal liver, kidney, stomach) with the pencil beam convolution (PBC) algorithm versus anisotropic Analyticalal algorithm (AAA) of the Varian Eclipse treatment planning system, The target volumes from 20 liver cancer patients were used to create treatment plans. Treatment plans for 10 patients were performed in Stereotactic Body Radiation Therapy (SBRT) plan and others were performed in 3 Dimensional Conformal Radiation Therapy (3DCRT) plan. dose calculation was recalculated by AAA algorithm after dose calculation was performed by PBC algorithm for 20 patients. Plans were optimized to 100% of the PTV by the Prescription Isodose in Dose Calculation with the PBC algorithm. Plans were recalculated with the AAA, retaining identical beam arrangements, monitor units, field weighting and collimator condition. In this study, Total PTV was to be statistically significant (SRS: p=0.018, 3DCRT: p=0.006) between PBC and AAA algorithm. and in the case of PTV, ITV in liver dome, plans for 3DCRT were to be statistically significant respectively (p=0.013, p=0.024). normal liver and kidney were to be statistically significant (p=0.009, p=0.037). For the predictive index of dose variation, CVF ratio was to be statistically significant for PTV in the liver dome versus PTV (SRS r=0.684, 3DCRT r=0.732, p<0.01) and CVF ratio for Tumor size was to be statistically significant (SRS r=-0.193, p=0.017, 3DCRT r=0.237, p=0.023).

Development of Land Surface Temperature Retrieval Algorithm from the MTSAT-2 Data

  • Kim, Ji-Hyun;Suh, Myoung-Seok
    • Korean Journal of Remote Sensing
    • /
    • v.27 no.6
    • /
    • pp.653-662
    • /
    • 2011
  • Land surface temperature (LST) is a one of the key variables of land surface which can be estimated from geostationary meteorological satellite. In this study, we have developed the three sets of LST retrieval algorithm from MTSAT-2 data through the radiative transfer simulations under various atmospheric profiles (TIGR data), satellite zenith angle, spectral emissivity, and surface lapse rate conditions using MODTRAN 4. The three LST algorithms are daytime, nighttime and total LST algorithms. The weighting method based on the solar zenith angle is developed for the consistent retrieval of LST at the early morning and evening time. The spectral emissivity of two thermal infrared channels is estimated by using vegetation coverage method with land cover map and 15-day normalized vegetation index data. In general, the three LST algorithms well estimated the LST without regard to the satellite zenith angle, water vapour amount, and surface lapse rate. However, the daytime LST algorithm shows a large bias especially for the warm LST (> 300 K) at day time conditions. The night LST algorithm shows a relatively large error for the LST (260 ~ 280K) at the night time conditions. The sensitivity analysis showed that the performance of weighting method is clearly improved regardless of the impacting conditions although the improvements of the weighted LST compared to the total LST are quite different according to the atmospheric and surface lapse rate conditions. The validation results of daytime (nighttime) LST with MODIS LST showed that the correlation coefficients, bias and RMSE are about 0.62~0.93 (0.44~0.83), -1.47~1.53 (-1.80~0.17), and 2.25~4.77 (2.15~4.27), respectively. However, the performance of daytime/nighttime LST algorithms is slightly degraded compared to that of the total LST algorithm.

DSLA: Dynamic Sampling Localization Algorithm Based on Virtual Anchor Node

  • Chen, Yanru;Yan, Bingshu;Wei, Liangxiong;Guo, Min;Yin, Feng;Luo, Qian;Wang, Wei;Chen, Liangyin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.10
    • /
    • pp.4940-4957
    • /
    • 2019
  • Compared with the localization methods in the static sensor networks, node localization in dynamic sensor networks is more complicated due to the mobility of the nodes. Dynamic Sampling Localization Algorithm Based on Virtual Anchor (DSLA) is proposed in this paper to localize the unknown nodes in dynamic sensor networks. Firstly, DSLA algorithm predicts the speed and movement direction of nodes to determine a sector sampling area. Secondly, a method of calculating the sampling quantity with the size of the sampling area dynamically changing is proposed in this paper. Lastly, the virtual anchor node, i.e., the unknown node that got the preliminary possible area (PLA), assists the other unknown nodes to reduce their PLAs. The last PLA is regarded as a filtering condition to filter out the conflicting sample points quickly. In this way, the filtered sample is close to its real coordinates. The simulation results show that the DSLA algorithm can greatly improve the positioning performance when ensuring the execution time is shorter and the localization coverage rate is higher. The localization error of the DSLA algorithm can be dropped to about 20%.

AT-DMB Reception Method with Eigen-space Beamforming Algorithm (고유 공간 빔형성 알고리즘을 이용한 AT-DMB 수신 방법)

  • Lee, Jae-Hong;Choi, Seung-Won
    • Journal of Broadcast Engineering
    • /
    • v.15 no.1
    • /
    • pp.122-132
    • /
    • 2010
  • AT-DMB system has been developed to increase data rate up to double of conventional T-DMB in the same bandwidth while maintaining backward compatibility. The AT-DMB system adopted hierarchical modulation which adds BPSK or QPSK signal as enhancement layer to existing DQPSK signal. The enhancement layer signal should be small enough to maintain backward compatibility and to minimize the coverage loss of conventional T-DMB service coverage. But this causes the enhancement layer signal of AT-DMB susceptible to fading effect in transmission channel. A turbo code which has improved error correction capability than convolutional code, is applied to the enhancement layer signal of the AT-DMB system for compensating channel distortion. However there is a need for other solutions for better reception of AT-DMB signal in receiver side without increasing transmitting power. In this paper, we propose adaptive array antenna system with Eigen-space beamforming algorithm which benefits beamforming gain along with diversity gain. We analyzed the reception performances of AT-DMB system in indoor and mobile environments when this new smart antenna system and algorithm is introduced. The computer simulation results are presented along with analysis comments.

Real time orbit estimation using asynchronous multiple RADAR data fusion (비동기 다중 레이더 융합을 통한 실시간 궤도 추정 알고리즘)

  • Song, Ha-Ryong;Moon, Byoung-Jin;Cho, Dong-Hyun
    • Aerospace Engineering and Technology
    • /
    • v.13 no.2
    • /
    • pp.66-72
    • /
    • 2014
  • This paper introduces an asynchronous multiple radar fusion algorithm for space object tracking. To estimate orbital motion of space object, a multiple radar scenario which jointly measures single object with different sampling time indices is described. STK/ODTK is utilized to determine realization of orbital motion and joint coverage of multiple radars. Then, asynchronous fusion algorithm is adapted to enhance the estimation performance of orbital motion during which multiple radars measure the same time instances. Monte-Carlo simulation results demonstrate that the proposed asynchronous multi-sensor fusion scheme better than single linearized Kalman filter in an aspect of root mean square error.

Self-weighted Decentralized Cooperative Spectrum Sensing Based On Notification for Hidden Primary User Detection in SANET-CR Network

  • Huang, Yan;Hui, Bing;Su, Xin;Chang, KyungHi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2561-2576
    • /
    • 2013
  • The ship ad-hoc network (SANET) extends the coverage of the high data-rate terrestrial communications to the ships with the reduced cost in maritime communications. Cognitive radio (CR) has the ability of sensing the radio environment and dynamically reconfiguring the operating parameters, which can make SANET utilize the spectrum efficiently. However, due to the dynamic topology nature and no central entity for data fusion in SANET, the interference brought into the primary network caused by the hidden primary user requires to be carefully managed by a sort of decentralized cooperative spectrum sensing schemes. In this paper, we propose a self-weighted decentralized cooperative spectrum sensing (SWDCSS) scheme to solve such a problem. The analytical and simulation results show that the proposed SWDCSS scheme is reliable to detect the primary user in SANET. As a result, secondary network can efficiently utilize the spectrum band of primary network with little interference to primary network. Referring the complementary receiver operating characteristic (ROC) curves, we observe that with a given false alarm probability, our proposed algorithm reduces the missing probability by 27% than the traditional embedded spectrally agile radio protocol for evacuation (ESCAPE) algorithm in the best condition.