• Title/Summary/Keyword: C/A code

Search Result 1,648, Processing Time 0.033 seconds

Design and Implementation of a C Coding Style Checker (C 코딩 스타일 검증기의 설계 및 구현)

  • Hwang, Jun-Ha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.2
    • /
    • pp.31-40
    • /
    • 2008
  • Various coding styles for C language have been proposed so far but there has been a lack of synthetic review about them. In this paper, I propose a new C coding style by analyzing coding rules that are included in the representative C coding styles and by adding new coding rules besides them. In addition, I designed an automated C coding style checker named CStyler which was implemented using Lex and Yacc. It is designed to be able to verify unpreprocessed source code as well as preprocessed source code. And I improved its flexibility by being able to add a new coding rule by end user. I think that the new C coding style and coding style checker, CStyler, can be utilized for education and for future research to develop and extend a static analysis tool.

  • PDF

Two-Dimensional Non-isolated Pixel Modulation Code for Holographic Data Storage (홀로그래픽 저장 장치를 위한 2차원 고립 픽셀 제거 변조 부호)

  • Kim, Jin-Young;Lee, Jae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.2C
    • /
    • pp.163-168
    • /
    • 2009
  • In this paper, a two-dimensional (2D) modulation code is introduced. The proposed code does not have any isolated pixel that is the most unwanted problem for holographic data storage. The proposed 2D modulation code is simpler than conventional 6/8 code and removes all the isolated 2D ISI patterns. As a result, when the grade of blur is 1.4, the proposed modulation code has better performance overall than conventional 6/8 modulation code. The proposed code has the optimal performance when 4bit quantization is applied.

A Method for Efficient Malicious Code Detection based on the Conceptual Graphs (개념 그래프 기반의 효율적인 악성 코드 탐지 기법)

  • Kim Sung-Suk;Choi Jun-Ho;Bae Young-Geon;Kim Pan-Koo
    • The KIPS Transactions:PartC
    • /
    • v.13C no.1 s.104
    • /
    • pp.45-54
    • /
    • 2006
  • Nowadays, a lot of techniques have been applied for the detection of malicious behavior. However, the current techniques taken into practice are facing with the challenge of much variations of the original malicious behavior, and it is impossible to respond the new forms of behavior appropriately and timely. There are also some limitations can not be solved, such as the error affirmation (positive false) and mistaken obliquity (negative false). With the questions above, we suggest a new method here to improve the current situation. To detect the malicious code, we put forward dealing with the basic source code units through the conceptual graph. Basically, we use conceptual graph to define malicious behavior, and then we are able to compare the similarity relations of the malicious behavior by testing the formalized values which generated by the predefined graphs in the code. In this paper, we show how to make a conceptual graph and propose an efficient method for similarity measure to discern the malicious behavior. As a result of our experiment, we can get more efficient detection rate.

Verification of NC code for Nulti-Axis Drilling machines (다축 드릴 가공기의 NC 코드 검증)

  • 이희관
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 1999.10a
    • /
    • pp.263-268
    • /
    • 1999
  • The most important things to the tube the of the heat exchanger are the precision of t hole position and the quality of the drill face. Nowadays, 6 and 12 spindle multi-drilling machine controlled by CNC or used to drill holes of the tube sheet. The drilling of 12 axes can offer high speover three times as fast as the drilling of axis. However, the drilling of 12 axes h difficulty in controlling many motors to d spindles and assigning a corresponded numbe accurately to each axis. In the past, conventional method to inspect the code the drilling was machining holes on a thin plate previously which resulted in the productivity because it required a h production cost by machining and weldin time. In this thesis, there are two drilling codes different from CNC code. M code is used to control many motors and S code is used to assign a correspondent number for each axis. For increasing the productivity by removing process, this paper is intended to take simulation of the drill machining c including 6 and 12 axis on the persona computer.

  • PDF

Simplified Decoder of the Modulation Code for DVD System (DVD 시스템에서 사용되는 변조 코드에 대한 간소화된 디코더)

  • Kim Hyoung seok;Lee Joohyun;Lee Jaejin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4C
    • /
    • pp.247-252
    • /
    • 2005
  • Currently, the decoder receives a 16 bit channel input and restores an 8 bit data symbol in the DVD system. Such modulation code of DVD is the EFMplus code, and it is composed of a main table and a sub table. For reducing the size of the code table, this paper divided the code table into 3 groups and we implemented the decoder using this new code table. After all, this method enables us to reduce the size of ROM as reducing the total number of code from 1376 to 750.

Nonlinear Product Codes and Their Low Complexity Iterative Decoding

  • Kim, Hae-Sik;Markarian, Garik;Da Rocha, Valdemar C. Jr.
    • ETRI Journal
    • /
    • v.32 no.4
    • /
    • pp.588-595
    • /
    • 2010
  • This paper proposes encoding and decoding for nonlinear product codes and investigates the performance of nonlinear product codes. The proposed nonlinear product codes are constructed as N-dimensional product codes where the constituent codes are nonlinear binary codes derived from the linear codes over higher order alphabets, for example, Preparata or Kerdock codes. The performance and the complexity of the proposed construction are evaluated using the well-known nonlinear Nordstrom-Robinson code, which is presented in the generalized array code format with a low complexity trellis. The proposed construction shows the additional coding gain, reduced error floor, and lower implementation complexity. The (64, 24, 12) nonlinear binary product code has an effective gain of about 2.5 dB and 1 dB gain at a BER of $10^{-6}$ when compared to the (64, 15, 16) linear product code and the (64, 24, 10) linear product code, respectively. The (256, 64, 36) nonlinear binary product code composed of two Nordstrom-Robinson codes has an effective gain of about 0.7 dB at a BER of $10^{-5}$ when compared to the (256, 64, 25) linear product code composed of two (16, 8, 5) quasi-cyclic codes.

A Numerical Study on Flow-Accelerated Corrosion in Two Adjacent Elbows

  • Yun, Hun;Hwang, Kyeongmo;Moon, Seung-Jae
    • Corrosion Science and Technology
    • /
    • v.15 no.1
    • /
    • pp.6-12
    • /
    • 2016
  • Flow-Accelerated Corrosion (FAC) is a well-known degradation mechanism that attacks the secondary piping in nuclear power plants. Since the Surry Unit 2 event in 1986, most nuclear power plants have implemented management programs to deal with damages in carbon and low-alloy steel piping. Despite the utmost efforts, damage induced by FAC still occurs in power plants around the world. In order to predict FAC wear, some computer programs were developed such as CHECWORKS, CICERO, and COMSY. Various data need to be input to these programs; the chemical composition of secondary piping, flow operating conditions and piping geometries. CHECWORKS, developed by the Electric Power Research Institute (EPRI), uses a geometry code to calculate geometry effects. Such a relatively simple geometry code is limited in acquiring the accuracy of FAC prediction. Recently, EPRI revisited the geometry code with the intention of updating it. In this study, numerical simulations were performed for two adjacent $90^{\circ}$ elbows and the results were analysed in terms of the proximity effect between the two adjacent elbows.

A modular function decomposition of multiple-valued logic functions using code assignment (코드할당에 의한 다치논리함수의 모듈러 함수분해에 관한 연구)

  • 최재석;박춘명;성형경;박승용;김형수
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.7
    • /
    • pp.78-91
    • /
    • 1998
  • This paper presents modular design techniques of multiple-valued logic functions about the function decomposition method and input variable management method. The function decomposition method takes avantage of the property of the column multiplicity in a single-column variable partitioning. Due to the increased number of identical modules, we can achieve a simpler circuit design by using a single T-gate, which can eliminate some of the control functions in the module libraty types. The input variable management method is to reduce the complexity of the input variables by proposing the look up table which assign input variables to a code. In this case as the number of sub-functions increase the code-length and the size of the code-assignment table grow. We identify some situations where shard input variables among sub-functions can be further reduced by a simplicication technique. According to the result of adapting this method to a function, we have demonstrated the superiority of the proposed methods which is bing decreased to about 12% of interconnection and about 16% of T-gate numbers compare with th eexisting for th enon-symmetric and irregular function realization.

  • PDF

Mobile Agent Protection Scheme through Execution Tracing of Agent Code and Status (에이전트 코드와 상태 추적을 통한 이동에이전트의 보호 기법)

  • 정창렬;고진광
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7C
    • /
    • pp.743-750
    • /
    • 2003
  • With the expansion of computer technology the mobility of a mobile agent code having the flexibility in the dispersive computer situation is used to set up the applications distributed on the Internet. As it also has the ability to transmit the mobile code of a mobile agent and to receive it from a far-off host, the executive circumstances of the host system in which an agent is executed have to access to an agent code and the executive state capable of executing an agent code. Therefore, it is difficult to prevent the forgery, the alteration and the wrong execution of an agent from a malicious host. This dissertation suggests the mechanism which can protect an agent from the malicious action through the executive pursuit of a code-named mobile agent. The security of this mechanism is verified through the protective process of a mobile agent in this mechanism.

THE ORPHAN STRUCTURE OF BCH(3, m) CODE

  • HWANG, GEUM-SUG
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.6 no.1
    • /
    • pp.109-119
    • /
    • 2002
  • If C is a code, an orphan is a coset without any parent. We investigate the structure of orphans of the code BCH(3, m). All weight 5 cosets and all weight 3 reduced cosets are orphans, and all weight 1,2 and 4 are not orphans. We conjecture that all weight 3 unreduced cosets are not orphans. We prove this conjecture for m = 4, 5.

  • PDF