• Title/Summary/Keyword: Target Existing Probability

Search Result 74, Processing Time 0.028 seconds

A Study of Automatic Multi-Target Detection and Tracking Algorithm using Highest Probability Data Association in a Cluttered Environment (클러터가 존재하는 환경에서의 HPDA를 이용한 다중 표적 자동 탐지 및 추적 알고리듬 연구)

  • Kim, Da-Soul;Song, Taek-Lyul
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.10
    • /
    • pp.1826-1835
    • /
    • 2007
  • In this paper, we present a new approach for automatic detection and tracking for multiple targets. We combine a highest probability data association(HPDA) algorithm for target detection with a particle filter for multiple target tracking. The proposed approach evaluates the probabilities of one-to-one assignments of measurement-to-track and the measurement with the highest probability is selected to be target- originated, and the measurement is used for probabilistic weight update of particle filtering. The performance of the proposed algorithm for target tracking in clutter is compared with the existing clustering algorithm and the sequential monte carlo method for probability hypothesis density(SMC PHD) algorithm for multi-target detection and tracking. Computer simulation studies demonstrate that the HPDA algorithm is robust in performing automatic detection and tracking for multiple targets even though the environment is hostile in terms of high clutter density and low target detection probability.

Queue Management Algorithm for Congestion Avoidance in Mixed-Traffic Network (혼합트래픽 네트워크에서 혼잡회피를 위한 큐 관리 알고리즘)

  • Kim, Chang Hee
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.2
    • /
    • pp.81-94
    • /
    • 2012
  • This paper suggests PARED algorithm, a modified RED algorithm, that actively reacts to dynamic changes in network to apply packet drop probability flexibly. The main idea of PARED algorithm is that it compares the target queue length to the average queue length which is the criterion of changes in packet drop probability and feeds the gap into packet drop probability. That is, when the difference between the average queue length and the target queue length is great, it reflects as much as the difference in packet drop probability, and reflects little when the difference is little. By doing so, packet drop probability could be actively controled and effectively dealt with in the network traffic situation. To evaluate the performance of the suggested algorithm, we conducted simulations by changing network traffic into a dynamic stat. At the experiments, the suggested algorithm was compared to the existing RED one and then to ARED one that provided the basic idea for this algorithm. The results proved that the suggested PARED algorithm is superior to the existing algorithms.

Target Probability of Failure of Quay Wall Foundation for Reliability-Based Design (안벽기초 구조물의 신뢰성설계를 위한 목표파괴확률 결정)

  • Yoon, Gil-Lim;Yoon, Yeo-Won;Kim, Hong-Yeon
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2010.03a
    • /
    • pp.379-389
    • /
    • 2010
  • It is very important to determine a target probability of failure in reliability based design such as an allowable factor of safety in working stress design because they are indices to judge the stability of structures. We have carried out reliability analyses of nationwide gravity type quay walls and found that sliding and foundation failures of quay walls were dominant failure modes for every case of loads. And a target probability of failure for bearing capacity of foundation of quay wall was also determined in this study. Of several approaches which have been suggested until now, a couple of reasonable approaches were used. Firstly, in order to consider the safety margin of structures which have been executed so far, the reliability levels of existing structures were assessed. And then a mean probability of failure for the quay walls was estimated. In addition, life cycle cost(LCC) analyses for representative structures were performed. Probabilities of failure for several quay walls were calculated with changing the width of each quay wall section. LCC of quay wall which is requiring case by case during the service life was evaluated, and also the optimum probability of failure of quay wall which minimizes LCC was found. Finally, reasonable target probabilities of failure were suggested by comparing with mean probability of failure of existing structures.

  • PDF

Seismic Collapse Risk for Non-Ductile Reinforced Concrete Buildings According to Seismic Design Categories (비연성 철근콘크리트 건물의 내진설계범주에 따른 붕괴 위험성 평가)

  • Kim, Minji;Han, Sang Whan;Kim, Taeo
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.25 no.4
    • /
    • pp.161-168
    • /
    • 2021
  • Existing old reinforced concrete buildings could be vulnerable to earthquakes because they were constructed without satisfying seismic design and detail requirements. In current seismic design standards, the target collapse probability for a given Maximum Considered Earthquake (MCE) ground-shaking hazard is defined as 10% for ordinary buildings. This study aims to estimate the collapse probabilities of a three-story, old, reinforced concrete building designed by only considering gravity loads. Four different seismic design categories (SDC), A, B, C, and D, are considered. This study reveals that the RC building located in the SDC A region satisfies the target collapse probability. However, buildings located in SDC B, C, and D regions do not meet the target collapse probability. Since the degree of exceedance of the target probability increases with an increase in the SDC level, it is imminent to retrofit non-ductile RC buildings similar to the model building. It can be confirmed that repair and reinforcement of old reinforced concrete buildings are required.

Adaptive Call Admission Control Based on Resource Prediction by Neural Network in Mobile Wireless Environments (모바일 무선환경에서 신경망 자원예측에 의한 적응 호 수락제어)

  • Lee, Jin-Yi
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.2
    • /
    • pp.208-213
    • /
    • 2009
  • This paper presents an adaptive call admission control(CAC) algorithm based on a target handoff call dropping probability in mobile wireless environments. This method uses a neural network for predicting and reserving the bandwidth demands for handoff calls and new calls. The amount of bandwidth to be reserved is adaptively adjusted by a target value of handoff call dropping probability(CDP). That is, if the handoff CDP exceeds the a target CDP value, the bandwidth to be reserved should be increased to reduce the handoff dropping probability below a target value. The proposed method is intended to prevent from increasing handoff call dropping probability when bandwidth to be reserved is not enough for handoff calls due to an uncertain prediction. Our simulations compare the handoff CDP in proposed CAC with that of an existing CAC. Results show that the proposed method sustains handoff call dropping probability below our target value.

  • PDF

A Faster Algorithm for Target Search (근사적 확률을 이용한 표적 탐색)

  • Jeong, Seong-Jin;Hong, Seong-Pil;Jo, Seong-Jin;Park, Myeong-Ju
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.57-59
    • /
    • 2006
  • The purpose of search problem is to maximize the probability of target detection as limited search capability. Especially, as elapsing of time at a point of time of initial information received the target detection rate for searching an expected location due to a moving target such that wrecked ship or submarine decrease in these problems. The algorithm of search problem to a moving target having similar property of above targets should solve the search route as quickly as possible. In existing studies, they have a limit of applying in practice due to increasing computation time required by problem size (i.e., number of search area, search time). In this study, we provide that it takes more reasonable computation time than preceding studies even though extending a problem size practically using an approximate computation of probability.

  • PDF

Estimation of Disaster Prevention Target Rainfall according to Urban Disaster Prevention Performance (도시방재성능에 따른 방재성능목표 강우량 산정 연구)

  • Jeong, Min-Su;Oak, Young-Suk;Lee, Young-Kune;Lee, Young-Sub;Park, Mi-Ri;Lee, Chul-Hee
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.4
    • /
    • pp.101-110
    • /
    • 2017
  • The National Emergency Management Agency (NEMA) presented the disaster prevention performance target rainfall (DPPTR) for disaster prevention. The estimation criteria for DPPTR is a 10 year cycle. On the other hand, the target rainfall recalculated every 10 years is difficult to reflect the current change in rainfall on climate change. In this study, the probability of precipitation using the recent rainfall data was prepared and the weights according to socio-economic criteria reflecting the urban characteristics and adjusted probability rainfall criteria were applied to the results. The difference between the existing target rainfall and recalculated result was compared. The input data for the estimated probability rainfall was selected from 6 points located in the rainfall observing station of Chungcheongnam-do, Daejeon region. As a result of the estimation, in the case of upward probability precipitation weight, some similar areas were observed. On the other hand, there were a few cases of upward or downward changes within 10 mm. Considering the rainfall variability and uncertainty due to climate change, the existing target rainfall does not present the condition properly. Therefore, hydrological designers need to calculate the target rainfall, reflecting the present condition.

Search for Ground Moving Targets Using Dynamic Probability Maps (동적 확률지도를 이용한 지상 이동표적 탐색)

  • Kim, Eun-Kyu;Choi, Bong-Wan;Yim, Dong-Soon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.4
    • /
    • pp.11-21
    • /
    • 2015
  • In order to achieve success in ground operations, searching for moving targets is one of critical factors. Usually, the system of searching for adversary ground moving targets has complex properties which includes target's moving characteristics, camouflage level, terrain, weather, available search time window, distance between target and searcher, moving speed, target's tactics, etc. The purpose of this paper is to present a practical quantitative method for effectively searching for infiltrated moving targets considering aforementioned complex properties. Based upon search theories, this paper consists of two parts. One is infiltration route analysis, through terrain and mobility analysis. The other is building dynamic probability maps through Monte Carlo simulation to determine the prioritized searching area for moving targets. This study primarily considers ground moving targets' moving pattern. These move by foot and because terrain has a great effect on the target's movement, they generally travel along a constrained path. With the ideas based on the terrain's effect, this study deliberately performed terrain and mobility analysis and built a constrained path. In addition, dynamic probability maps taking terrain condition and a target's moving speed into consideration is proposed. This analysis is considerably distinct from other existing studies using supposed transition probability for searching moving targets. A case study is performed to validate the effectiveness and usefulness of our methodology. Also, this study suggests that the proposed approach can be used for searching for infiltrated ground moving target within critical time window. The proposed method could be used not only to assist a searcher's mission planning, but also to support the tactical commander's timely decision making ability and ensure the operations' success.

Stochastic Weapon Target Assignment Problem under Uncertainty in Targeting Accuracy (명중률의 불확실성을 고려한 추계학적 무장-표적 할당 문제)

  • Lee, Jinho;Shin, Myoungin
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.41 no.3
    • /
    • pp.23-36
    • /
    • 2016
  • We consider a model that minimizes the total cost incurred by assigning available weapons to existing targets in order to reduce enemy threats, which is called the weapon target assignment problem (WTAP). This study addresses the stochastic versions of WTAP, in which data, such as the probability of destroying a target, are given randomly (i.e., data are identified with certain probability distributions). For each type of random data or parameter, we provide a stochastic optimization model on the basis of the expected value or scenario enumeration. In particular, when the probabilities of destroying targets depending on weapons are stochastic, we present a stochastic programming formulation with a simple recourse. We show that the stochastic model can be transformed into a deterministic equivalent mixed integer programming model under a certain discrete probability distribution of randomness. We solve the stochastic model to obtain an optimal solution via the mixed integer programming model and compare this solution with that of the deterministic model.

Estimation of Partial Safety Factors and Target Failure Probability Based on Cost Optimization of Rubble Mound Breakwaters (경사식 방파제의 비용 최적화에 기초한 부분안전계수 및 목표파괴확률 산정)

  • Kim, Seung-Woo;Suh, Kyung-Duck;Burcharth, Hans F.
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.22 no.3
    • /
    • pp.191-201
    • /
    • 2010
  • The breakwaters are designed by considering the cost optimization because a human risk is seldom considered. Most breakwaters, however, were constructed without considering the cost optimization. In this study, the optimum return period, target failure probability and the partial safety factors were evaluated by applying the cost optimization to the rubble mound breakwaters in Korea. The applied method was developed by Hans F. Burcharth and John D. Sorensen in relation to the PIANC Working Group 47. The optimum return period was determined as 50 years in many cases and was found as 100 years in the case of high real interest rate. Target failure probability was suggested by using the probabilities of failure corresponding to the optimum return period and those of reliability analysis of existing structures. The final target failure probability is about 60% for the initial limit state of the national design standard and then the overall safety factor is calculated as 1.09. It is required that the nominal diameter and weight of armor are respectively 9% and 30% larger than those of the existing design method. Moreover, partial safety factors considering the cost optimization were compared with those calculated by Level 2 analysis and a fairly good agreement was found between the two methods especially the failure probability less than 40%.