• Title/Summary/Keyword: Binary code

Search Result 509, Processing Time 0.023 seconds

Design and Implementation of a Pre-processing Method for Image-based Deep Learning of Malware (악성코드의 이미지 기반 딥러닝을 위한 전처리 방법 설계 및 개발)

  • Park, Jihyeon;Kim, Taeok;Shin, Yulim;Kim, Jiyeon;Choi, Eunjung
    • Journal of Korea Multimedia Society
    • /
    • v.23 no.5
    • /
    • pp.650-657
    • /
    • 2020
  • The rapid growth of internet users and faster network speed are driving the new ICT services. ICT Technology has improved our way of thinking and style of life, but it has created security problems such as malware, ransomware, and so on. Therefore, we should research against the increase of malware and the emergence of malicious code. For this, it is necessary to accurately and quickly detect and classify malware family. In this paper, we analyzed and classified visualization technology, which is a preprocessing technology used for deep learning-based malware classification. The first method is to convert each byte into one pixel of the image to produce a grayscale image. The second method is to convert 2bytes of the binary to create a pair of coordinates. The third method is the method using LSH. We proposed improving the technique of using the entire existing malicious code file for visualization, extracting only the areas where important information is expected to exist and then visualizing it. As a result of experimenting in the method we proposed, it shows that selecting and visualizing important information and then classifying it, rather than containing all the information in malicious code, can produce better learning results.

Calculation of Dose Distribution for SBRT Patient Using Geant4 Simulation Code (Geant4 전산모사 코드를 이용한 SBRT 환자의 선량분포 계산)

  • Kang, Jeongku;Lee, Jeongok;Lee, Dong Joon
    • Progress in Medical Physics
    • /
    • v.26 no.1
    • /
    • pp.36-41
    • /
    • 2015
  • The Monte Carlo based dose calculation program for stereotactic body radiotherapy was developed in this study. The Geant4 toolkit widely used in the radiotherapy was used for this study. The photon energy spectrum of the medical linac studied in the previous research was applied for the patient dose calculations. The geometry of the radiation fields defined by multi-leaf collimators were taken into account in the PrimaryGeneratorAction class of the Geant4 code. The total of 8 fields were demonstrated in the patient dose calculations, where rotation matrix as a function of gantry angle was used for the determination of the source positions. The DicomHandler class converted the binary file format of the DICOM data containing the matrix number, pixel size, endian type, HU number, bit size, padding value and high bits order to the ASCII file format. The patient phantom was constructed using the converted ASCII file. The EGSnrc code was used to compare the calculation efficiency of the material data.

An automated memory error detection technique using source code analysis in C programs (C언어 기반 프로그램의 소스코드 분석을 이용한 메모리 접근오류 자동검출 기법)

  • Cho, Dae-Wan;Oh, Seung-Uk;Kim, Hyeon-Soo
    • The KIPS Transactions:PartD
    • /
    • v.14D no.6
    • /
    • pp.675-688
    • /
    • 2007
  • Memory access errors are frequently occurred in C programs. A number of tools and research works have been trying to detect the errors automatically. However, they have one or more of the following problems: inability to detect all memory errors, changing the memory allocation mechanism, incompatibility with libraries, and excessive performance overhead. In this paper, we suggest a new method to solve these problems, and then present a result of comparison to the previous research works through the experiments. Our approach consists of two phases. First is to transform source code at compile time through inserting instrumentation into the source code. And second is to detect memory errors at run time with a bitmap that maintains information about memory allocation. Our approach has improved the error detection abilities against the binary code analysis based ones by using the source code analysis technique, and enhanced performance in terms of both space and time, too. In addition, our approach has no problem with respect to compatibility with shared libraries as well as does not need to modify memory allocation mechanism.

Consideration of Roman Character in KS × 1001 Code System for Information Interchange considered AMI/HDB-3 and HDLC FLAG (AMI/HDB-3 회선부호화 및 HDLC FLAG를 고려한 KS × 1001 정보 교환용 로마문자 부호체계고찰)

  • Hong, Wan-Pyo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.7
    • /
    • pp.1017-1023
    • /
    • 2013
  • Datacommunications transmit the source codes that are coded in information devices, such as computer to the transmission line by means of the line coded signal. AMI method is applied to the line coding method to transmit the signal for long distance. The disadvantage of the AMI method is to loss the bit synchronization when consecutive binary bit '0' over 4ea is coming into line coder. The scrambling technique is used to overcome the problem. The HDB-3 scrambling method is used in Korea standard which standard in ITU-T. When the HDB-3 technology is used. the method should convert the consecutive bit '0' over 4ea to certain bits format. As a result, when there are many such kind of '0' bit stream in source codes, data transmission efficiency will be decreased to treat in line coder, etc. This paper is directed to study the Roman character code system in $KS{\times}1001$, Korea standard for information exchange code in datacommunication systems. Based on the study result, this paper proposed the maximum optimized Roman character code system. In the study, Character coding rule for $4{\times}4$bits and the statistical data for roman character using frequency were considered to simulate. The paper shows the result that when the proposed new roman character coding system is applied to use, the data transmission efficiency could be increased to about 134% compared to existing code system.

PHOTOMETRIC SOLUTIONS AND SPOT MODEL OF THE CONTACT BINARY AB ANDROMEDAE (접촉쌍성 AB Andromedae의 측광해와 흑점모델)

  • Lee, Jae-Woo;Kim, Chun-Hwey;Han, Won-yong;Jin, Ho;Oh, Kyu-Dong
    • Journal of Astronomy and Space Sciences
    • /
    • v.20 no.2
    • /
    • pp.123-132
    • /
    • 2003
  • We performed CCD photometric observations of the W-type contact binary AB And for 10 nights from November 1995 to December 1999 using the 61-cm reflector and BVR filters at Sobaeksan Optical Astronomy Observatory. From our observations, the seasonal light curves of AB And for 1995, 1996 and 1999 were completed and 8 new times of minimum light were determined. Newly obtained light curves show that strong light variations occurred in AB And during the past five years. We adopted the 1996 light curves as reference ones and obtained the photometric solutions of them with contact mode in the Wilson-Devinney binary code. Assuming such light variations were produced by the existence of a star spot (or star spots) in the analysis, we derived the system parameters and analyzed the 1995 and 1999 light curves by adjusting only the spot parameters. As the results, we interpreted that those light variations are produced by the simultaneous existence of a hot spot and a cool spot on the secondary. We could infer that the hot spot on the secondary is produced due to mass exchange between the components suggested by Lee (1999).

DETERMINATIONS OF ITS ABSOLUTE DIMENSIONS AND DISTANCE BY THE ANALYSES OF LIGHT AND RADIAL-VELOCITY CURVES OF THE CONTACT BINARY - I. V417 Aquilae (접촉쌍성의 광도와 시선속도곡선의 분석에 의한 절대 물리량과 거리의 결정 -1. V417 Aquilae)

  • 이재우;김천휘;이충욱;오규동
    • Journal of Astronomy and Space Sciences
    • /
    • v.21 no.2
    • /
    • pp.73-82
    • /
    • 2004
  • New photometric and spectroscopic solutions of W-type overcontact binary V 417 Aql were obtained by solving the UBV light curves of Samec et al. (1997) and radial-velocity ones of Lu & Rucinski (1999) with the 2003 version of the Wilson-Devinney binary code. In the light curve synthesis the light of a third-body, which Qian (2003) proposed, was considered and obtained about 2.7%, 2.2%, and 0.4% for U, B, and V bandpasses, respectively. The model with third-light is better fitted to eclipse parts than that with no third-light. Absolute dimensions of V417 Aql are determined from our solution as $M_1$= 0.53 $M_{*}$, $M_2$= 1.45 $M_{*}$, $R_1$= 0.84 $R_{*}$, and $R_2$= 1.31 $M_{*}$, and the distance to it is deduced as about 216pc. Our distance is well consistent with that (204pc) derived from Rucinski & Duerbeck's (1997) relation, $M_{v}$ = $M_{v}$(log P, B-V), but is more distant than that (131$\pm$40pc) determined by the Hipparcos trigonometric parallax. The difference may result from the relatively large error of Hipparcos parallax for V 417 Aql.l.

Arrhythmia Classification based on Binary Coding using QRS Feature Variability (QRS 특징점 변화에 따른 바이너리 코딩 기반의 부정맥 분류)

  • Cho, Ik-Sung;Kwon, Hyeog-Soong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.8
    • /
    • pp.1947-1954
    • /
    • 2013
  • Previous works for detecting arrhythmia have mostly used nonlinear method such as artificial neural network, fuzzy theory, support vector machine to increase classification accuracy. Most methods require accurate detection of P-QRS-T point, higher computational cost and larger processing time. But it is difficult to detect the P and T wave signal because of person's individual difference. Therefore it is necessary to design efficient algorithm that classifies different arrhythmia in realtime and decreases computational cost by extrating minimal feature. In this paper, we propose arrhythmia detection based on binary coding using QRS feature varibility. For this purpose, we detected R wave, RR interval, QRS width from noise-free ECG signal through the preprocessing method. Also, we classified arrhythmia in realtime by converting threshold variability of feature to binary code. PVC, PAC, Normal, BBB, Paced beat classification is evaluated by using 39 record of MIT-BIH arrhythmia database. The achieved scores indicate the average of 97.18%, 94.14%, 99.83%, 92.77%, 97.48% in PVC, PAC, Normal, BBB, Paced beat classification.

Fuzzy-ARTMAP based Multi-User Detection

  • Lee, Jung-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.3A
    • /
    • pp.172-178
    • /
    • 2012
  • This paper studies the application of a fuzzy-ARTMAP (FAM) neural network to multi-user detector (MUD) for direct sequence (DS)-code division multiple access (CDMA) system. This method shows new solution for solving the problems, such as complexity and long training, which is found when implementing the previously developed neural-basis MUDs. The proposed FAM based MUD is fast and easy to train and includes capabilities not found in other neural network approaches; a small number of parameters, no requirements for the choice of initial weights, automatic increase of hidden units, no risk of getting trapped in local minima, and the capabilities of adding new data without retraining previously trained data. In simulation studies, binary signals were generated at random in a linear channel with Gaussian noise. The performance of FAM based MUD is compared with other neural net based MUDs in terms of the bit error rate.

Performance evaluation of binary LDPCA code with degree-1 syndrome (차수-1 신드롬 전송 방식을 적용한 이진 LDPCA 부호의 성능분석)

  • Shin, Sang-Yun;Jang, Min;Kim, Sang-Hyo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2010.11a
    • /
    • pp.132-135
    • /
    • 2010
  • LDPCA 부호는 부호율-적응적인 특성과 함께 뛰어난 압축률을 가지고 있어 분산 소스 부호화 시스템에서 사용되는 오류정 정부호로서 많이 사용되고 있다. 하지만 소스와 보조정보 사이의 상관관계가 낮은 영역에서는 급격한 성능열화가 일어나게 된다. 본 논문에서는 기존 LDPCA 부호에 특정 압축률 이상의 단계에서 추가 누적 신드롬 대신 변수노드와 일대일로 연결되어 있는 차수-1 신드롬을 전송하는 방식을 적용하여 이 영역에서 급격하게 발생하는 성능열화를 줄였다. 또한 차수-1 신드롬과 연결할 변수노드 집합을 선택할 때 복호화기에서 사용하는 LDPCA 부호의 검사노드 차수 분포를 집중시키는 알고리즘을 제안하여 성능을 더욱 향상시켰다.

  • PDF

A Process Algebra-Based Detection Model for Multithreaded Programs in Communication System

  • Wang, Tao;Shen, Limin;Ma, Chuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.965-983
    • /
    • 2014
  • Concurrent behaviors of multithreaded programs cannot be described effectively by automata-based models. Thus, concurrent program intrusion attempts cannot be detected. To address this problem, we proposed the process algebra-based detection model for multithreaded programs (PADMP). We generate process expressions by static binary code analysis. We then add concurrency operators to process expressions and propose a model construction algorithm based on process algebra. We also present a definition of process equivalence and behavior detection rules. Experiments demonstrate that the proposed method can accurately detect errors in multithreaded programs and has linear space-time complexity. The proposed method provides effective support for concurrent behavior modeling and detection.