• Title/Summary/Keyword: D-클래스

Search Result 181, Processing Time 0.029 seconds

Traffic Anomaly Identification Using Multi-Class Support Vector Machine (다중 클래스 SVM을 이용한 트래픽의 이상패턴 검출)

  • Park, Young-Jae;Kim, Gye-Young;Jang, Seok-Woo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.4
    • /
    • pp.1942-1950
    • /
    • 2013
  • This paper suggests a new method of detecting attacks of network traffic by visualizing original traffic data and applying multi-class SVM (support vector machine). The proposed method first generates 2D images from IP and ports of transmitters and receivers, and extracts linear patterns and high intensity values from the images, representing traffic attacks. It then obtains variance of ports of transmitters and receivers and extracts the number of clusters and entropy features using ISODATA algorithm. Finally, it determines through multi-class SVM if the traffic data contain DDoS, DoS, Internet worm, or port scans. Experimental results show that the suggested multi-class SVM-based algorithm can more effectively detect network traffic attacks.

Taming Vertex Data

  • Iain Cantlay
    • Digital Contents
    • /
    • no.11 s.126
    • /
    • pp.144-151
    • /
    • 2003
  • 문제점: 하위 수준 D3D 지원_ 버텍스 버퍼를 만들기 위해 코어 Direct3D(D3D)는 하위 수준의 메모리 관리만 지원한다. 버텍스 버퍼 데이터는 void* 포인터를 사용해 액세스 된다. 코어 D3D에서 하위 수준의 지원은 매우 적절하다. D3DX는 전체 메시 클래스로서 포함한 상위 수준도 지원한다. 이 상위 수준과 하위 수준 사이에는 아무 것도 없다. 하위 수준의 버텍스 버퍼(VB)를 사용하기 위해서는 먼저 버텍스데이터 구조를 만들고 크기에 맞는 VB를 만든 후 이를 데이터로 채우고(void* 포인터 배치) 마지막으로 필요한 버텍스 선언을 한다. 애플리케이션 코드는 D3D 없이도 스스로 일관성을 가져야 하며 몇몇 하위 수준 에러가 발생할 수도 있다. 기껏해야 에러는 실행하면서 D3D의 디버그 버전으로 잡아낼 수 있다. 최악의 경우, 애플리케이션 문제를 발생시킬 수 있는데 이럴 경우 종종 디버그가 어려울 수도 있다.

  • PDF

Radar Signal Pattern Recognition Using PRI Status Matrix and Statistics (PRI 상태행렬과 통계값을 이용한 레이더 PRI 신호패턴 인식)

  • Lee, Chang-ho;Sung, Tae-kyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.775-778
    • /
    • 2016
  • In this paper, we propose a new method to automatically recognize PRI modulation type of radar signal at ES(Electronic Support) in electronic singal environment. The propose method stores pattern of PRI(Pulse Repetition Interval) of radar signal and uses statistic data, which firstly classifies into 2 classes. Then the proposed method recognizes each PRI signal using statistic characteristic of PRI. We apply various 5 kinds of PRI signal such as constant PRI, jitter PRI, D&S(dwell & switch) PRI, stagger PRI, sliding PRI, etc. The result shows the proposed method correctly identifies various PRI signals.

  • PDF

Design and Implementation of Clustering Web-Server Monitoring System (클러스터링 웹 서버 모니터링 시스템의 설계 및 구현)

  • Lee, Eun;Han, In
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10d
    • /
    • pp.85-87
    • /
    • 2002
  • 본 논문은 씬 서버들을 클러스터로 구성한 서비스 서버들의 모니터링 항목 값을 인터넷으로 연결된 모니터링 서버에서 수집할 수 있는 모니터링 시스템을 구성한다. 본 시스템은 MS .NET 플랫폼에서 제공하는 성능 모니터 클래스를 사용하여 구현하였으며, 일반적인 모니터링 시스템과 달리 토픽기반 메시지 처리기를 사용하여 다양한 클라이언트의 요구에 적절히 대응할 수 있고, 지역 네트워크뿐만 아니라 인터넷으로 연결된 원격 네트워크의 클라이언트로 수집된 모니터링 항목 값을 전송할 수 있다.

  • PDF

A study on the Enhanced System Dependence Graph for slicing of object-oriented Program (객체지향 프로그램 슬라이싱을 위한 개선된 시스템 종속성 그래프에 대한 연구)

  • 류희열;김은정
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10d
    • /
    • pp.115-117
    • /
    • 2002
  • 객체지향 프로그램 슬라이싱을 위한 Loren D Larsen and Marry Jean Harrold가 제안하는 방법은 절차적 프로그램 슬라이싱을 위한 시스템 종속성 그래프 표현방법에 객체지향 패러다임을 표현할 수 있도록 확장하며 2단계 마킹 알고리즘을 적용하여 슬라이스를 계산한다. 시스템 종속성 그래프를 이용한 슬라이싱 방법은 클래스 멤버 변수와 전역변수 및 인스턴스 변수에 대하여 각 메소드 호출 및 진입정점에 actual_in, actual_out, formal_in, formal_out 정점들이 추가되어 복잡도가 증가한다. 본 논문에서는 이들 변수를 클래스 정점의 멤버간선으로 연결하여 각 메소드의 문장에서 사용하면 진출간선 정의하면 진입간선으로 연결하여 정점과 간선들의 개수를 최소화할 수 있도록 시스템 종속성 그래프를 개선하였다. 제안하는 시스템 종속성 그래프는 그래프 복잡도의 최소화와 2단계 알고리즘에 의한 정확한 슬라이스 계산이 장점이다. C++ 예제 프로그램을 적용하여 그래프 복잡도의 감소와 정확한 슬라이스 계산을 기존의 방법과 비교하여 개선됨을 확인하였다.

  • PDF

Development of an X3D Python Language Binding Viewer Providing a 3D Data Interface (3D 데이터 인터페이스를 제공하는 X3D Python 언어 바인딩 뷰어 개발)

  • Kim, Ha Seong;Lee, Myeong Won
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.10 no.6
    • /
    • pp.243-250
    • /
    • 2021
  • With the increased development of 3D VR applications augmented by recent VR/AR/MR technologies and by the advance of 3D devices, interchangeability and portability of 3D data have become essential. 3D files should be processed in a standard data format for common usage between applications. Providing standardized libraries and data structures along with the standard file format means that a more efficient system organization is possible and unnecessary processing due to the usage of different file formats and data structures depending on the applications can be omitted. In order to provide the function of using a common data file and data structure, this research is intended to provide a programming binding tool for generating and storing standardized data so that various services can be developed by accessing the common 3D files. To achieve this, this paper defines a common data structure including classes and functions to access X3D files with a standardized scheme using the Python programming language. It describes the implementation of a Python language binding viewer, which is an X3D VR viewer for rendering standard X3D data files based on the language binding interface. The VR viewer includes Python based 3D scene libraries and a data structure for creation, modification, exchange, and transfer of X3D objects. In addition, the viewer displays X3D objects and processes events using the libraries and data structure.

A Study on the Implementation of a D-Class Computation Package based on Java (Java 기반의 D-클래스 계산 패키지 구현에 대한 연구)

  • Lim, Bum-Jun;Han, Jae-Il
    • Journal of Information Technology Services
    • /
    • v.3 no.2
    • /
    • pp.99-104
    • /
    • 2004
  • Conventional and public-key cryptography has been widely accepted as a base technology for the design of computer security systems. D-classes have the potential for application to conventional and public-key cryptography. However, there are very few results on D-classes because the computational complexity of D-class computation is NP-complete. This paper discusses the design of algorithms for the efficient computation of D-classes and the Java implementation of them. In addition, the paper implements the same D-class computation algorithms in C and shows the performance of C and Java programming languages for the computation-intensive applications by comparing their execution results.

Algorithm for Efficient D-Class Computation (효율적인 D-클래스 계산을 위한 알고리즘)

  • Han, Jae-Il
    • Journal of Information Technology Services
    • /
    • v.6 no.1
    • /
    • pp.151-158
    • /
    • 2007
  • D-class computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices and search for equivalent $n{\times}n$ Boolean matrices according to a specific equivalence relation. It is easy to see that even multiplying all $n{\times}n$ Boolean matrices with themselves shows exponential time complexity and D-Class computation was left an unsolved problem due to its computational complexity. The vector-based multiplication theory shows that the multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices can be done much more efficiently. However, D-Class computation requires computation of equivalent classes in addition to the efficient multiplication. The paper discusses a theory and an algorithm for efficient D-class computation, and shows execution results of the algorithm.

Performance Improvement Using the Adaptive Selection of H.263+ Negotiable Option Modes (H.263+ 협상모드들의 적응적 선택에 의한 성능개선)

  • 김강욱;황찬식;김남철;고종석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.10B
    • /
    • pp.1963-1970
    • /
    • 1999
  • Researches in draft recommendation H.263 have been made in ITU-T LBC group to broaden its range of useful application and to improve its compression performance. The form of added and revised draft text of H.263 is informally known as “H.263+”. In this paper, we analyzed the characteristics of H.263+ negotiable option modes for four image classes. Based on the analysis results, we proposed the adaptive selection scheme of H.263+ option modes by using a scene change detector for a mixed image class. In case of using the proposed scheme, we obtained the 1.6dB improvement in PSNR compared to the basic mode of H.263, and the 0.4~1.0 dB improvement in PSNR compared to the fixed usage scheme of H.263+ negotiable option modes. In respect to used bits per frame, fewer bits are produced than the basic mode H.263 and the foxed usage scheme of H.263+ option modes.

  • PDF

New trend of dental education: flipped learning for dental classes using Google classroom platform (치의학 교육의 새로운 트렌드 : 구글 클래스룸을 이용한 플립드 러닝(Flipped learning)의 적용 및 평가)

  • Kong, Jun-Hyeong;Moon, Ho-Jin;Park, Jung-Chul
    • Journal of Digital Contents Society
    • /
    • v.17 no.5
    • /
    • pp.317-327
    • /
    • 2016
  • Flipped learning is a new learning technique which can maximize the learning effect by mixing two or more different learning environments including online & offline, and recently introduced system: 'Google classroom' is the optimized internet platform for flipped learning. This study tried to apply flipped learning to regular course 2nd grade dental students(n=70) and evaluated the satisfaction of students. The subjects of periodontology and operative dentistry were chosen to evaluate flipped learning model for regular course 2nd grade dental students(n=70). Each class consisted of six classes, and three times of them were performed in conventional classes and the other three times were in flipped learning method by using Google classroom. Evaluation of satisfaction progressed at the end of class. In this study, application of flipped learning in the dental college classes showed high efficiency in terms of degree of understanding, self-directed learning and motivation. Collectively, it was shown that flipped learning using Google classroom can be a reliable platform in dental classes.