• Title/Summary/Keyword: 코드화

Search Result 1,701, Processing Time 0.029 seconds

The development of encoded porous silicon nanoparticles and application to forensic purpose (코드화 다공성 실리콘 나노입자의 개발 및 법과학적 응용)

  • Shin, Yeo-Ool;Kang, Sanghyuk;Lee, Joonbae;Paeng, Ki-Jung
    • Analytical Science and Technology
    • /
    • v.22 no.3
    • /
    • pp.247-253
    • /
    • 2009
  • Porous silicon films are electrochemically etched from crystalline silicon wafers in an aqueous solution of hydrofluoric acid(HF). Careful control of etching conditions (current density, etch time, HF concentration) provides films with precise, reproducible physical parameters (morphology, porosity and thickness). The etched pattern could be varied due to (1) current density controls pore size (2) etching time determines depth and (3) complex layered structures can be made using different current profiles (square wave, triangle, sinusoidal etc.). The optical interference spectrum from Fabry-Perot layer has been used for forensic applications, where changes in the optical reflectivity spectrum confirm the identity. We will explore a method of identifying the specific pattern code and can be used for identities of individual code with porous silicon based encoded nanosized smart particles.

A Very Low Complexity Loop Filter to Simultaneously Reduce Blocking and Ringing Artifacts of H.26L Video Coder (H.26L의 블록화 및 링 현상을 동시에 제거하기 위한 저 계산량의 Loop 필터 방식)

  • 이민구;차형태;한헌수;홍민철
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.645-648
    • /
    • 2001
  • 본 논문에서는 H.26L 동영상 압축 표준화 방식에서 블록화 및 링 현상을 동시에 제거하는 계산량이 감소된 일차원 loop filter를 제안한다. 새로운 일차원 정규화 완화 함수가 정의되고 두 개의 인접 방향에서 완화의 정도를 조절하는 정규화 매개변수는 부호화와 복호화 부에서 이용 가능한 코드화 블록 패턴과 양자화 스텝크기로 정의된다. 그러므로, 정규화 매개변수를 정의하고 압축된 동영상으로부터 복원된 영상을 얻기 위한 기타 정보는 필요하지 않다. 실험결과로부터 제안된 알고리즘의 성능은 확인할 수 있었다.

  • PDF

Deobfuscation Processing and Deep Learning-Based Detection Method for PowerShell-Based Malware (파워쉘 기반 악성코드에 대한 역난독화 처리와 딥러닝 기반 탐지 방법)

  • Jung, Ho-jin;Ryu, Hyo-gon;Jo, Kyu-whan;Lee, Sangkyun
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.32 no.3
    • /
    • pp.501-511
    • /
    • 2022
  • In 2021, ransomware attacks became popular, and the number is rapidly increasing every year. Since PowerShell is used as the primary ransomware technique, the need for PowerShell-based malware detection is ever increasing. However, the existing detection techniques have limits in that they cannot detect obfuscated scripts or require a long processing time for deobfuscation. This paper proposes a simple and fast deobfuscation method and a deep learning-based classification model that can detect PowerShell-based malware. Our technique is composed of Word2Vec and a convolutional neural network to learn the meaning of a script extracting important features. We tested the proposed model using 1400 malicious codes and 8600 normal scripts provided by the AI-based PowerShell malicious script detection track of the 2021 Cybersecurity AI/Big Data Utilization Contest. Our method achieved 5.04 times faster deobfuscation than the existing methods with a perfect success rate and high detection performance with FPR of 0.01 and TPR of 0.965.

Low Complexity Video Encoding Using Turbo Decoding Error Concealments for Sensor Network Application (센서네트워크상의 응용을 위한 터보 복호화 오류정정 기법을 이용한 경량화 비디오 부호화 방법)

  • Ko, Bong-Hyuck;Shim, Hyuk-Jae;Jeon, Byeung-Woo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.1
    • /
    • pp.11-21
    • /
    • 2008
  • In conventional video coding, the complexity of encoder is much higher than that of decoder. However, as more needs arises for extremely simple encoder in environments having constrained energy such as sensor network, much investigation has been carried out for eliminating motion prediction/compensation claiming most complexity and energy in encoder. The Wyner-Ziv coding, one of the representative schemes for the problem, reconstructs video at decoder by correcting noise on side information using channel coding technique such as turbo code. Since the encoder generates only parity bits without performing any type of processes extracting correlation information between frames, it has an extremely simple structure. However, turbo decoding errors occur in noisy side information. When there are high-motion or occlusion between frames, more turbo decoding errors appear in reconstructed frame and look like Salt & Pepper noise. This severely deteriorates subjective video quality even though such noise rarely occurs. In this paper, we propose a computationally extremely light encoder based on symbol-level Wyner-Ziv coding technique and a new corresponding decoder which, based on a decision whether a pixel has error or not, applies median filter selectively in order to minimize loss of texture detail from filtering. The proposed method claims extremely low encoder complexity and shows improvements both in subjective quality and PSNR. Our experiments have verified average PSNR gain of up to 0.8dB.

Serialized Multitasking Code Generation from Dataflow Specification (데이타 플로우 명세로부터 직렬화된 멀티태스킹 코드 생성)

  • Kwon, Seong-Nam;Ha, Soon-Hoi
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.9_10
    • /
    • pp.429-440
    • /
    • 2008
  • As embedded system becomes more complex, software development becomes more important in the entire design process. Most embedded applications consist of multi -tasks, that are executed in parallel. So, dataflow model that expresses concurrency naturally is preferred than sequential programming language to develop multitask software. For the execution of multitasking codes, operating system is essential to schedule multi-tasks and to deal with the communication between tasks. But, it is needed to execute multitasking code without as when the target hardware platform cannot execute as or target platforms are candidates of design space exploration, because it is very costly to port as for all candidate platforms of DSE. For this reason, we propose the serialized multitasking code generation technique from dataflow specification. In the proposed technique, a task is specified with dataflow model, and generated as a C code. Code generation consists of two steps: First, a block in a task is generated as a separate function. Second, generated functions are scheduled by a multitasking scheduler that is also generated automatically. To make it easy to write customized scheduler manually, the data structure and information of each task are defined. With the preliminary experiment of DivX player, it is confirmed that the generated code from the proposed framework is efficiently and correctly executed on the target system.

An SVG Code Generator for Algorithm Visualization (알고리즘 시각화를 위한 SVG 코드 생성 시스템)

  • Lee, Hyang-Sug;Lee, Su-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.3
    • /
    • pp.359-368
    • /
    • 2010
  • Algorithm visualization is useful for program testing, debugging and evaluating, as well as visual aids in education. When teaching algorithms and data structures, showing exact behaviors by graphics or animation is more suitable than just explaining them. Current systems for algorithm animation are limited to a couple of specific applications and need a special environment. In the proposed system, programmer writes source program in C and animator embeds visualization scripts in the appropriate location of the program. Then user can get an animation code in form of SVG and see a graphical representation on the web browser. Generated SVG animation code is platform independent and can also interact with other XML applications or HTML.

Code Visualization Approach for Low level Power Improvement via Identifying Performance Dissipation (성능 저하 식별을 통한 저전력 개선용 코드 가시화 방법)

  • An, Hyun Sik;Park, Bokyung;Kim, R.Young Chul;Kim, Ki Du
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.10
    • /
    • pp.213-220
    • /
    • 2020
  • The power consumption and performance of hardware-based mobile and IoT embedded systems that require high specifications are one of the important issues of these systems. In particular, the problem of excessive power consumption is because it causes a problem of increasing heat generation and shortening the life of the device. In addition, in the same environment, software also needs to perform stable operation in limited power and memory, thereby increasing power consumption of the device. In order to solve these issues, we propose a Low level power improvement via identifying performance dissipation. The proposed method identifies complex modules (especially Cyclomatic complexity, Coupling & Cohesion) through code visualization, and helps to simplify low power code patterning and performance code. Therefore, through this method, it is possible to optimize the quality of the code by reducing power consumption and improving performance.

Efficient Exploring Multiple Execution Path for Dynamic Malware Analysis (악성코드 동적 분석을 위한 효율적인 다중실행경로 탐색방법)

  • Hwang, Ho;Moon, Daesung;Kim, Ikkun
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.2
    • /
    • pp.377-386
    • /
    • 2016
  • As the number of malware has been increased, it is necessary to analyze malware rapidly against cyber attack. Additionally, Dynamic malware analysis has been widely studied to overcome the limitation of static analysis such as packing and obfuscation, but still has a problem of exploring multiple execution path. Previous works for exploring multiple execution path have several problems that it requires much time to analyze and resource for preparing analysis environment. In this paper, we proposed efficient exploring approach for multiple execution path in a single analysis environment by pipelining processes and showed the improvement of speed by 29% in 2-core and 70% in 4-core through experiment.

All-Optical Gray Code to Binary Coded Decimal Converter (전광 그레이코드 이진코드 변환기)

  • Jung, Young-Jin;Park, Nam-Kyoo;Jhon, Young-Min;Woo, Deok-Ha;Lee, Seok
    • Korean Journal of Optics and Photonics
    • /
    • v.19 no.1
    • /
    • pp.60-67
    • /
    • 2008
  • An all-optical 4-bit Gray code to binary coded decimal (BCD) converter by means of commercially available numerical analysis tool (VPI) was demonstrated, for the first time to our knowledge. Circuit design approach was modified appropriately in order to fit the electrical method on an all-optical logic circuit based on a cross gain modulation (XGM) process so that signal degradation due to the non-ideal optical logic gates can be minimized. Without regenerations, Q-factor of around 4 was obtained for the most severely degraded output bit (least significant bit-LSB) with 2.5 Gbps clean input signals having 20 dB extinction ratio. While modifying the two-level simplification method and Karnaugh map method to design a Gray code to BCD converter, a general design concept was also founded (one-level simplification) in this research, not only for the Gray code to BCD converter but also for any general applications.

Estimation of HMM parameters Using a Codeword Dependent Distance Normalization and a Distance Based codeword Weighting by Fuzzy Contribution (코드워드 의존 거리 정규화와 거리에 기반한 코드워드 가중을 이용한 은닉마르코프모델의 파라미터 추정)

  • Choi, Hwan-Jin;Oh, Yung-Hwan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.15 no.4
    • /
    • pp.36-42
    • /
    • 1996
  • In this paper, we have proposed the robust estimation of HMM parameters which is based on CDDN(codeword dependent distance normalization)and codeword weighting by distance. The proposed method has used a distance normalization based on the characteristics of a codeword dependent distribution and have computed fuzzy contributions of codeword to a input vector with a fuzzy objective function. From experimental results, we have shown the effectiveness of the proposed method in that the correction rate of the proposed method is improved 4.5% over the conventional FVQ based method. Especially, the application of distance weighting to smoothing of output probability is improved the performance of 2.5% compared to distance based codeword weighting.

  • PDF