• Title/Summary/Keyword: False

Search Result 3,120, Processing Time 0.031 seconds

Multi-Sensor Multi-Target Passive Locating and Tracking

  • Liu, Mei;Xu, Nuo;Li, Haihao
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.2
    • /
    • pp.200-207
    • /
    • 2007
  • The passive direction finding cross localization method is widely adopted in passive tracking, therefore there will exist masses of false intersection points. Eliminating these false intersection points correctly and quickly is a key technique in passive localization. A new method is proposed for passive locating and tracking multi-jammer target in this paper. It not only solves the difficulty of determining the number of targets when masses of false intersection points existing, but also solves the initialization problem of elastic network. Thus this method solves the problem of multi-jammer target correlation and the elimination of static false intersection points. The method which dynamically establishes multiple hypothesis trajectory trees solves the problem of eliminating the remaining false intersection points. Simulation results show that computational burden of the method is lower, the elastic network can more quickly find all or most of the targets and have a more probability of locking the real targets. This method can eliminate more false intersection points.

A Look-Up Table Based Error Diffusion Algorithm for Dynamic False Contour Reduction of Plasma Display Panels

  • Lee, Ho-Seop;Kim, Choon-Woo
    • Journal of Information Display
    • /
    • v.2 no.2
    • /
    • pp.32-38
    • /
    • 2001
  • PDP(plasma display panel) represents the gray levels by the pulse number modulation technique that results in undesirable dynamic false contours on moving images. This paper proposes a LUT(Look-up table) based error diffusion algorithm for reduction of the dynamic false contours. A quantitative measure of the dynamic false contours is defined first. The measure of the dynamic false contours is calculated through simulation of every gray level combination of two consecutive frames. Based on the calculated measures, a modified gray level for a pair of gray levels of two consecutive frames is chosen to reduce the dynamic false contours. The chosen gray levels serve as contents of a gray level conversion LUT. Given a pair of gray levels of two consecutive frames, the gray level of current frame is modified based on the gray level conversion LUT. The new gray level is displayed on PDP. An error diffusion algorithm is, then, applied to compensate for the differences in the gray levels.

  • PDF

A Study on the Prohibition of False Hair and a Primary Factor in Lee Dynasty (조선조 가체 논의와 그 요인)

  • 최경순
    • The Research Journal of the Costume Culture
    • /
    • v.4 no.1
    • /
    • pp.15-28
    • /
    • 1996
  • This study is concerned with the prohibition of False Hair(加笙) and a primary factor in Lee Dynasty. Assuming that the trend of simplification in false hair is closely related to the idea of practical science to be the social and ideal background of those times, we researched. The results are as follows: Constant discussions and prohibitions against false hair were designed to differentiate between classes but to discard a variety. Goge(高笙) came to be a big problem during the reign of king Sung-Jong(成宗) and after on arguemt for the usage of false hair was in vogue king Young-Jo(英祖) and Jung-Jo(正祖). Finally, the wearing of Hooge(後笙) came to be a national regulation in manners and customs, and also brought the realization of prohibition against the usage of false hair. It is believed that the performance and the effect of the prohibition against the usage of false hair have a close relation with the idea of practical science.

  • PDF

Probability Adjustment Scheme for the Dynamic Filtering in Wireless Sensor Networks Using Fuzzy Logic (무선 센서 네트워크에서 동적 여과를 위한 퍼지 기반 확률 조절 기법)

  • Han, Man-Ho;Lee, Hae-Young;Cho, Tae-Ho
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.159-162
    • /
    • 2008
  • Generally, sensor nodes can be easily compromised and seized by an adversary because sensor nodes are hostile environments after dissemination. An adversary may be various security attacks into the networks using compromised node. False data injection attack using compromised node, it may not only cause false alarms, but also the depletion of the severe amount of energy waste. Dynamic en-route scheme for Filtering False Data Injection (DEF) can detect and drop such forged report during the forwarding process. In this scheme, each forwarding nodes verify reports using a regular probability. In this paper, we propose verification probability adjustment scheme of forwarding nodes though a fuzzy rule-base system for the Dynamic en-route filtering scheme for Filtering False Data Injection in sensor networks. Verification probability determination of forwarding nodes use false traffic rate and distance form source to base station.

  • PDF

A design of framework for false alarm pattern analysis of intrusion detection system using incremental association rule mining (점진적 연관 규칙을 이용한 침입탐지 시스템의 오 경보 패턴 분석 프레임워크 설계)

  • 전원용;김은희;신문선;류근호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10a
    • /
    • pp.307-309
    • /
    • 2004
  • 침입탐지시스템에서 발생되는 오 경보는 false positive 와 false negative 로 구분된다. false positive는 실제적인 공격은 아니지만 공격이라고 오인하여 경보를 발생시켜 시스템의 효율성을 떨어뜨리기 때문에 false positive 패턴에 대한 분석이 필요하다. 오 경보 데이터는 시간이 지남에 따라 데이터의 양뿐만 아니라 데이터 패턴의 특성 또한 변하게 된다 따라서 새로운 데이터가 추가될 때마다 오 경보 데이터의 패턴을 분석할 수 있는 도구가 필요하다. 이 논문에서는 오 경보 데이터로부터 false positive 의 패턴을 분석할 수 있는 프레임워크에 대해서 기술한다. 우리의 프레임워크는 시간이 지남에 따라 변하는 데이터의 패턴 특성을 분석할 수 있도록 하기 위해 점진적 연관규칙 기법을 적용한다. 이 프레임워크를 통해서 false positive 패턴 특성의 변화를 효율적으로 관리 할 수 있다.

  • PDF

Performance Analysis of DoS/DDoS Attack Detection Algorithms using Different False Alarm Rates (False Alarm Rate 변화에 따른 DoS/DDoS 탐지 알고리즘의 성능 분석)

  • Jang, Beom-Soo;Lee, Joo-Young;Jung, Jae-Il
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.139-149
    • /
    • 2010
  • Internet was designed for network scalability and best-effort service which makes all hosts connected to Internet to be vulnerable against attack. Many papers have been proposed about attack detection algorithms against the attack using IP spoofing and DoS/DDoS attack. Purpose of DoS/DDoS attack is achieved in short period after the attack begins. Therefore, DoS/DDoS attack should be detected as soon as possible. Attack detection algorithms using false alarm rates consist of the false negative rate and the false positive rate. Moreover, they are important metrics to evaluate the attack detections. In this paper, we analyze the performance of the attack detection algorithms using the impact of false negative rate and false positive rate variation to the normal traffic and the attack traffic by simulations. As the result of this, we find that the number of passed attack packets is in the proportion to the false negative rate and the number of passed normal packets is in the inverse proportion to the false positive rate. We also analyze the limits of attack detection due to the relation between the false negative rate and the false positive rate. Finally, we propose a solution to minimize the limits of attack detection algorithms by defining the network state using the ratio between the number of packets classified as attack packets and the number of packets classified as normal packets. We find the performance of attack detection algorithm is improved by passing the packets classified as attacks.

Refinement for Loops in Buffer-Overrun Abstract Interpretation (요약해석을 이용한 버퍼오버런 분석에서 루프 분석결과의 정교화)

  • Oh, Hak-Joo;Yi, Kwang-Keun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.1
    • /
    • pp.111-115
    • /
    • 2008
  • We present a simple and effective method to reduce loop-related false alarms raised by buffer-overrun static program analyzer. Interval domain buffer-overrun analyzer raise many false alarms in analyzing programs that frequently use loops and arrays. Firstly, we classified patterns of loop-related false alarms for loop-intensive programs, such as embedded programs or mathematical libraries. After that we designed a simple and effective false alarm refiner, specialized for the loop-related false alarms we classified. After the normal analysis of program in which alarms considered as false. We implemented this method on our buffer-overrun analyzer with the result that our refinement method decreased the number of false alarms by 32% of total amount the analyzer reported.

TRAUMATIC FALSE ANEURYSM OF THE LINGUAL ARTERY - A CASE REPORT- (설동맥에 발생한 외상성 위동맥류)

  • Min, Gyung-In;Lee, Ju-Hyun;Seo, Kyung-Suk;Kim, Chul-Hwan
    • Journal of the Korean Association of Oral and Maxillofacial Surgeons
    • /
    • v.27 no.6
    • /
    • pp.551-555
    • /
    • 2001
  • False aneurysms(Pseudoaneurysms) and arteriovenous fistulas have only rarely been reported in the facial region. In this region the false aneurysm arises most frequently in the superficial temporal and facial artery, but other branches of the external carotid are sometimes involved, including the maxillary and lingual artery. False aneurysms can be occurred by blunt trauma that either laceration or rupture the full thickness of the arterial wall. The diagnosis of a false arterial aneurysm can be often made solely on the basis of physical examination. Angiography is helpful for conformation, for delineating the lesion and its vascular supply, and for ruling out the presence of associated vascular lesions such as arteriovenous fistulas. Ultrasonography may also be useful in delineating lesions that are not easily accessible for physical examination. Treatment of false aneurysms is excision, ligation, and arterial embolization. This is a case of false aneurysm of the lingual artery after facial trauma caused by traffic accident. The lesion was successfully treated by embolization and ligation of the lingual and facial branches of the external carotid artery.

  • PDF

The Design and Implementation of Anomaly Traffic Analysis System using Data Mining

  • Lee, Se-Yul;Cho, Sang-Yeop;Kim, Yong-Soo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.8 no.4
    • /
    • pp.316-321
    • /
    • 2008
  • Advanced computer network technology enables computers to be connected in an open network environment. Despite the growing numbers of security threats to networks, most intrusion detection identifies security attacks mainly by detecting misuse using a set of rules based on past hacking patterns. This pattern matching has a high rate of false positives and can not detect new hacking patterns, which makes it vulnerable to previously unidentified attack patterns and variations in attack and increases false negatives. Intrusion detection and analysis technologies are thus required. This paper investigates the asymmetric costs of false errors to enhance the performances the detection systems. The proposed method utilizes the network model to consider the cost ratio of false errors. By comparing false positive errors with false negative errors, this scheme achieved better performance on the view point of both security and system performance objectives. The results of our empirical experiment show that the network model provides high accuracy in detection. In addition, the simulation results show that effectiveness of anomaly traffic detection is enhanced by considering the costs of false errors.

On Reducing False Positives of a Bloom Filter in Trie-Based Algorithms

  • Mun, Ju Hyoung;Lim, Hyesook
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.3
    • /
    • pp.163-168
    • /
    • 2015
  • Many IP address lookup approaches employ Bloom filters to obtain a high-speed search performance. Especially, it has been recently studied that the search performance of trie-based algorithms can be significantly improved by adding Bloom filters. In such algorithms, the number of trie accesses can be greatly reduced because Bloom filters can determine whether a node exists in a trie without actually accessing the trie. Bloom filters do not have false negatives but have false positives. False positives can lead to unnecessary trie accesses. The false positive rate must thus be reduced to enhance the performance of lookup algorithms applying Bloom filters. One important characteristic of trie-based algorithms is that all the ancestors of a node are also stored. The proposed algorithm utilizes this characteristic in reducing the false positive rate of a Bloom filter without increasing the size of the memory for the Bloom filter. When a Bloom filter produces a positive result for a node of a trie, we propose to check whether the ancestors of the node are also positives. Because Bloom filters have no false negatives, the negatives of any of the ancestors mean that the positive of the node is false. In other words, we propose to use more Bloom filter queries to reduce the false positive rate of a Bloom filter in trie-based algorithms. Simulation results show that querying one ancestor of a node can reduce the false positive rate by up to 67% with exactly the same architecture and the same memory requirement. The proposed approach can be applied to other trie-based algorithms employing Bloom filters.