• Title/Summary/Keyword: Generic algorithms

Search Result 61, Processing Time 0.036 seconds

Hybridized Decision Tree methods for Detecting Generic Attack on Ciphertext

  • Alsariera, Yazan Ahmad
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.7
    • /
    • pp.56-62
    • /
    • 2021
  • The surge in generic attacks execution against cipher text on the computer network has led to the continuous advancement of the mechanisms to protect information integrity and confidentiality. The implementation of explicit decision tree machine learning algorithm is reported to accurately classifier generic attacks better than some multi-classification algorithms as the multi-classification method suffers from detection oversight. However, there is a need to improve the accuracy and reduce the false alarm rate. Therefore, this study aims to improve generic attack classification by implementing two hybridized decision tree algorithms namely Naïve Bayes Decision tree (NBTree) and Logistic Model tree (LMT). The proposed hybridized methods were developed using the 10-fold cross-validation technique to avoid overfitting. The generic attack detector produced a 99.8% accuracy, an FPR score of 0.002 and an MCC score of 0.995. The performances of the proposed methods were better than the existing decision tree method. Similarly, the proposed method outperformed multi-classification methods for detecting generic attacks. Hence, it is recommended to implement hybridized decision tree method for detecting generic attacks on a computer network.

Review of Data-Driven Multivariate and Multiscale Methods

  • Park, Cheolsoo
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.2
    • /
    • pp.89-96
    • /
    • 2015
  • In this paper, time-frequency analysis algorithms, empirical mode decomposition and local mean decomposition, are reviewed and their applications to nonlinear and nonstationary real-world data are discussed. In addition, their generic extensions to complex domain are addressed for the analysis of multichannel data. Simulations of these algorithms on synthetic data illustrate the fundamental structure of the algorithms and how they are designed for the analysis of nonlinear and nonstationary data. Applications of the complex version of the algorithms to the synthetic data also demonstrate the benefit of the algorithms for the accurate frequency decomposition of multichannel data.

A study of generic programming method for source code reuse in image processing algorithm implementation (영상처리 알고리즘 구현에서 소스코드 재사용을 위한 제너릭 프로그래밍 방법에 관한 연구)

  • Lee Jeong-Heon;Lee June-Hyung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.3 s.35
    • /
    • pp.19-34
    • /
    • 2005
  • The difficulties in implementing of image processing algorithms are a major reason for the lack of research into algorithm comparison. This fact makes an image processing research with difficult. We conclude that it is important to represent algorithms in form of reusable code. Since current image processing systems do not fulfill all requirements we must pose on reusable implementations, we propose to solve the reuse problem by applying generic programming. We define two dimensional iterators, which mediate between image processing algorithms and their underlying data structures, so that the same algorithm implementation can be applied to any number of different image formats. The elegance and efficiency of this approach is illustrated by a number of useful examples and demonstrated by porting in existing image processing algorithm IDE(Integrated Development Environment).

  • PDF

APPLICATION OF A FUZZY EXPERT MODEL FOR POWER SYSTEM PROTECTION

  • Kim, C.J.;B.Don-Russell
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1074-1077
    • /
    • 1993
  • The objective of this paper is to develop a fuzzy logic based decision-making system to detect low current faults using multiple detection algorithms. This fuzzy system utilizes a fuzzy expert model which executes an operation without complicated mathematical models. This fuzzy system decides the performance weights of the detection algorithms. The weights and the turnouts of the detection algorithms discriminate faults from normal events. This system can also be a generic group decision-making tool for other areas of power system protection.

  • PDF

A Study on the Optimal Design of Laminated Composites using Genetic Algorithm (유전자 알고리즘을 이용한 적층복합재료의 최적설계에 관한 연구)

  • 조석수;주원식;장득열
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.04a
    • /
    • pp.729-737
    • /
    • 1996
  • Laminated composite plates have been applied to aircraft structures because their properties are superior to the conventional materials and the laminates have anisortropic elastic properties. However, it tis diffcult to determine stacking structures using actual design variables for the lack of searching capability of existing optimization technique. GA(generic algorithms) are robust search algorithms based on the mechanics of natural selection and natural genetics. Therefore, this study presents an application of IGA to stiffness and weight optimization design and gives the various stacking structures suitable to constraint conditions.

  • PDF

Object Tracking using Color Histogram and CNN Model (컬러 히스토그램과 CNN 모델을 이용한 객체 추적)

  • Park, Sung-Jun;Baek, Joong-Hwan
    • Journal of Advanced Navigation Technology
    • /
    • v.23 no.1
    • /
    • pp.77-83
    • /
    • 2019
  • In this paper, we propose an object tracking algorithm based on color histogram and convolutional neural network model. In order to increase the tracking accuracy, we synthesize generic object tracking using regression network algorithm which is one of the convolutional neural network model-based tracking algorithms and a mean-shift tracking algorithm which is a color histogram-based algorithm. Both algorithms are classified through support vector machine and designed to select an algorithm with higher tracking accuracy. The mean-shift tracking algorithm tends to move the bounding box to a large range when the object tracking fails, thus we improve the accuracy by limiting the movement distance of the bounding box. Also, we improve the performance by initializing the tracking start positions of the two algorithms based on the average brightness and the histogram similarity. As a result, the overall accuracy of the proposed algorithm is 1.6% better than the existing generic object tracking using regression network algorithm.

Improved Decision Tree Algorithms by Considering Variables Interaction (교호효과를 고려한 향상된 의사결정나무 알고리듬에 관한 연구)

  • Kwon, Keunseob;Choi, Gyunghyun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.30 no.4
    • /
    • pp.267-276
    • /
    • 2004
  • Much of previous attention on researches of the decision tree focuses on the splitting criteria and optimization of tree size. Nowadays the quantity of the data increase and relation of variables becomes very complex. And hence, this comes to have plenty number of unnecessary node and leaf. Consequently the confidence of the explanation and forecasting of the decision tree falls off. In this research report, we propose some decision tree algorithms considering the interaction of predictor variables. A generic algorithm, the k-1 Algorithm, dealing with the interaction with a combination of all predictor variable is presented. And then, the extended version k-k Algorithm which considers with the interaction every k-depth with a combination of some predictor variables. Also, we present an improved algorithm by introducing control parameter to the algorithms. The algorithms are tested by real field credit card data, census data, bank data, etc.

A Development of C-API Mechanism for Open Distributed Computing Systems (개방형 분산 컴퓨팅 시스템에서의 C-API 메타니즘 개발에 관한 연구)

  • 이상기;최용락
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.4
    • /
    • pp.110-119
    • /
    • 1998
  • This paper describes a C-API (Cryptographic-Application program Interface) mechanism that can serve cryptographic service to one or more application programmers in an open distributed computing system. Generic cryptographic service, provides application Programmers with cryptographic algorithms and interfaces which can be shared so that the programmers can program distributed applications containing security services even though they have no detailed knowledge of cryptographic algorithms. Therefore, in this paper, a generic C-API mechanism is designed that can be used independently from various application environments and basic system structures so that programmers can use it commonly. This mechanism has the advantage that allows application programmers be able to use some cryptographic services and key management services not considering of the application program and operating system.

  • PDF

FERET DATA SET에서의 PCA와 ICA의 비교

  • Kim, Sung-Soo;Moon, Hyeon-Joon;Kim, Jaihie
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2355-2358
    • /
    • 2003
  • The purpose of this paper is to investigate two major feature extraction techniques based on generic modular face recognition system. Detailed algorithms are described for principal component analysis (PCA) and independent component analysis (ICA). PCA and ICA ate statistical techniques for feature extraction and their incorporation into a face recognition system requires numerous design decisions. We explicitly state the design decisions by introducing a modular-based face recognition system since some of these decision are not documented in the literature. We explored different implementations of each module, and evaluate the statistical feature extraction algorithms based on the FERET performance evaluation protocol (the de facto standard method for evaluating face recognition algorithms). In this paper, we perform two experiments. In the first experiment, we report performance results on the FERET database based on PCA. In the second experiment, we examine performance variations based on ICA feature extraction algorithm. The experimental results are reported using four different categories of image sets including front, lighting, and duplicate images.

  • PDF