Metrics for Code Quality Check in SEED_mode.c

Jin-Kuen Hong The Institute of Internet 2024 International Journal of Internet, Broadcasting an Vol.16 No.3

The focus of this paper is secure code development and maintenance. When it comes to safe code, it is most important to consider code readability and maintainability. This is because complex code has a code smell, that is, a structural problem that complicates code understanding and modification. In this paper, the goal is to improve code quality by detecting and removing smells existing in code. We target the encryption and decryption code SEED.c and evaluate the quality level of the code using several metrics such as lines of code (LOC), number of methods (NOM), number of attributes (NOA), cyclo, and maximum nesting level. We improved the quality of SEED.c through systematic detection and refactoring of code smells. Studies have shown that refactoring processes such as splitting long methods, modularizing large classes, reducing redundant code, and simplifying long parameter lists improve code quality. Through this study, we found that encryption code requires refactoring measures to maintain code security.

OQMCAR: An enhanced network coding-aware routing algorithm based on queue state and local topology

( Cunbo Lu ),( Song Xiao ),( Yinbin Miao ) 한국인터넷정보학회 2015 KSII Transactions on Internet and Information Syst Vol.9 No.8

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn`t consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

Spectral-Amplitude-Coding Optical CDMA를 위한 Extended Hadamard Code

지윤규(Yoon Kyoo Jhee) 大韓電子工學會 2010 電子工學會論文誌-SD (Semiconductor and devices) Vol.47 No.5

Hadamard code를 이용한 spectral-amplitude-coding optical code-division multiple-access(OCDMA)는 효율적인 시스템을 구성할 수 있으나 2ⁿ개의 code length만을 갖는 특성을 지닌다. 이의 한계성을 극복할 수 있는 extended Hadamard codes를 제안하고 주된 잡음인 phase-induced intensity noise(PIIN)를 분석하여 향상된 시스템의 특성을 보인다. Good performance of spectral-amplitude-coding optical CDMA can be obtained using codes based upon Hadamard matrices, but Hadamard codes have very restrictive code lengths of 2ⁿ. In this paper a new code family, namely extended Hadamard code, is proposed to relax the code length restriction and the number of simultaneous users. The improved performance of the proposed system is analysed with the consideration of phase-induced intensity noise(PIIN).

Design of Learning Process with Code Reconstruction Principle for Non-computer Majors

Hye-Wuk Jung 국제문화기술진흥원 2022 International Journal of Advanced Culture Technolo Vol.10 No.4

To develop computational thinking skills, university students are learning how to solve problems with algorithms, program commands and grammar, and program writing. Because non-computer majors have difficulty with computer programming-related content, they need a learning method to acquire coding knowledge from the process of understanding, interpreting, changing, and improving source codes by themselves. This study explored clone coding, refactoring coding, and coding methods using reconstruction tools, which are practical and effective learning methods for improving coding skills for students who are accustomed to coding. A coding learning process with the code reconstruction principle was designed to help non-computer majors use it to understand coding technology and develop their problem-solving ability and applied the coding technology learning method used in programmer education.

Spectral-Amplitude-Coding Optical CDMA를 위한 Modified Hadamard Code

지윤규(Yoon Kyoo Jhee) 大韓電子工學會 2011 電子工學會論文誌-SD (Semiconductor and devices) Vol.48 No.8

Hadamard code를 이용한 spectral-amplitude-coding optical code-division multiple-access(OCDMA) 시스템은 2<SUP>n</SUP>개의 code length만을 갖는 특성을 지니어 최대 사용자 수의 조절이 어렵고 phase-induced intensity noise(PIIN)가 커서 효율적인 시스템 구성이 어렵다. 이의 한계성을 극복할 수 있는 modified Hadamard codes를 제안하고 잡음 분석을 통하여 향상된 시스템 특성을 보인다. Spectral-amplitude-coding optical CDMA systems using codes based upon Hadamard matrices have very restrictive code lengths of 2<SUP>n</SUP> and high phase-induced intensity noise(PIIN). In this paper a new code family, namely modified Hadamard code, is proposed to relax the code length restriction and the number of simultaneous users. The improved performance of the proposed system is analysed with the consideration of noise.

Code-switching and cognitive models of the process of simultaneous interpreting

Won, Jong-Hwa 한국통역번역학회 2007 통역과 번역 Vol.9 No.2

Won, Jong-Hwa. (2007). Code-switching and cognitive models of the process of simultaneous interpreting. Conference Interpretation and Translation, 9(2), 89-112. Bilingual code-switching has long been recognized as an important linguistic phenomenon worthy of serious investigation. Code-switching is a special skill possessed by bilinguals which allows them to switch from one language to another in the course of a communicative exchange without slowing down speech delivery. The process involves the integration of the morphological, phonological, and syntactic structures of the two codes or languages in real time. Code-switching is a particularly vital aspect of the behavior of the simultaneous interpreters. Indeed, one of the major defining characteristics of simultaneous interpreting is that it inevitably involves code-switching in which switches occur moment by moment not only by the speakers but by the interpreters themselves. Code-switching can also be said to occur when interpreters listen in one language and delivers in another. Few interpreting models formulated so far, however, have incorporated the code-switching process, with the result that simultaneous interpreting is presented as a strict, linear, one-way process. This paper asks the question “To what extent should the theory of code-switching be drawn upon in describing and explaining the process of simultaneous interpreting?” and a tentative answer is offered by integrating the switching process into Setton’s (1999) simultaneous interpreting model. Keywords: Code-switching, mental lexicon, parsing, executive, frame

관심기반 채택모형(CBAM)에 기반한 초등교사의 코딩교육 관심도 분석

이철현 한국실과교육학회 2018 한국실과교육학회지 Vol.31 No.1

Coding education occupies an important position in elementary school software education. It is important to find what kind of concerns the elementary school teachers in charge of software education at elementary school have on the coding education. In this study, we analyzed 419 elementary school teachers’ stage of concerns about coding education based on Concerns-Based Adoption Model(CBAM). In the research, the stage of concerns in coding education of elementary school teachers showed characteristics most similar to nonuser profiles. Male teachers were more interested in coding education than female teachers, showed more concerns in exploring alternative aspects of coding education and the interests of teacher groups. Teachers with experiences of training have higher concerns in coding education than teachers without experiences of training, and they were interested in the influences on students and the cooperation with coworker teachers. The lower the coding ability and coding preference, the less concerned in coding education, the uncertainty, and the less concerns in the influences of coding education. Therefore, in order to eliminate the uncertainty of the coding education that elementary school teachers possess, the educational authorities have to guide what they should prepare, and have to clarify what they can offer to teachers. Research on the effectiveness of coding education should been expanded and it is necessary to be widely known to teachers. and coding education training curriculum must be made that includes sufficient methods and informations for coding education management. Training course for improving teachers’ coding ability should be expanded, and it is necessary to make effective use of teachers love and be good at coding. 코딩교육은 초등학교 소프트웨어교육에서 중요한 위치를 차지하고 있다. 초등학교에서 소프트웨어교육을 담당할 초등교사가 코딩교육에 대해 어떤 관심도를 갖고 있는지 파악하는 일은 중요하다. 이 연구는 CBAM에 기반하여 초등교사 419명을 대상으로 코딩교육 관심도를 분석하였다. 연구 결과, 초등교사의 코딩교육 관심도는 비사용자의 프로파일과 가장 유사한 특성을 보였다. 남자 교사가 여자교사보다 코딩교육의 관심도가 더 높았고, 코딩교육의 대안적 측면과 교사집단의 이익을 모색하는데 더 많은 관심을 보였다. 연수경험이 있는 교사가 없는 교사보다 코딩교육 관심도가 높았고, 학생들에게 미치는 영향과 동료 교사와의 협력에 더 관심이 많았다. 코딩역량과 코딩선호도가 낮을수록 코딩교육에 무관심하고, 불확실해 하며, 코딩교육이 미치는 영향에 대한 관심이 낮았다. 따라서 초등교사들이 갖고 있는 코딩교육의 불확실성을 해소하기 위하여 무엇을 준비해야 하는지 안내해야 하고, 교육당국이 무엇을 제공할 수 있는지 명확하게 해야 한다. 코딩교육의 효과에 대한 연구가 확대되어 널리 알려질 필요가 있고, 코딩교육 운영 방법과 정보가 충분히 포함된 코딩교육 연수교육과정이 만들어져야 한다. 코딩역량 향상을 위한 연수가 확대되어야 하고, 코딩을 좋아하고 잘하는 교사를 유용하게 활용하는 방안이 필요하다.

Code authorship identification using convolutional neural networks

Abuhamad, Mohammed,Rhim, Ji-su,AbuHmed, Tamer,Ullah, Sana,Kang, Sanggil,Nyang, DaeHun Elsevier 2019 Future generation computer systems Vol.95 No.-

<P><B>Abstract</B></P> <P>Although source code authorship identification creates a privacy threat for many open source contributors, it is an important topic for the forensics field and enables many successful forensic applications, including ghostwriting detection, copyright dispute settlements, and other code analysis applications. This work proposes a convolutional neural network (CNN) based code authorship identification system. Our proposed system exploits term frequency-inverse document frequency, word embedding modeling, and feature learning techniques for code representation. This representation is then fed into a CNN-based code authorship identification model to identify the code’s author. Evaluation results from using our approach on data from Google Code Jam demonstrate an identification accuracy of up to 99.4% with 150 candidate programmers, and 96.2% with 1,600 programmers. The evaluation of our approach also shows high accuracy for programmers identification over real-world code samples from 1987 public repositories on GitHub with 95% accuracy for 745 C programmers and 97% for the C++ programmers. These results indicate that the proposed approaches are not language-specific techniques and can identify programmers of different programming languages.</P> <P><B>Highlights</B></P> <P> <UL> <LI> We proposed three CNN-based code authorship identification systems. </LI> <LI> We explained various source code representations and our feature learning technique. </LI> <LI> We then fed the code representations into a CNN-based code authorship model. </LI> <LI> Large-scale code authorship process of different programming languages is conducted. </LI> <LI> Our technique identified a large number of programmers (1,600) with 99.5% accuracy. </LI> </UL> </P>

t-CIS codes over GF(p) and orthogonal arrays

Kim, H.J.,Lee, Y. North Holland ; Elsevier Science Ltd 2017 Discrete applied mathematics Vol.217 No.3

<P>We first show that orthogonal arrays over GF(p) can be explicitly constructed from t-CIS codes over GF(p), where t-CIS codes are CIS codes of order t >= 2. With this motivation, we are interested in developing methods of constructing t-CIS codes over GF(p). We present two types of constructions; the first one is a 't-extension method' which is finding t-CIS codes over GF(p) of length tn from given (t - 1)-CIS codes over GF(p) of length (t - 1)n for t > 2, and the second one is a 'building-up type construction' which is finding t-CIS codes over GF(p) of length t (n + 1) from given t-CIS codes over GF(p) of length tn. Furthermore, we find a criterion for checking equivalence of t-CIS codes over GF(p). We find inequivalent t-CIS codes over GF(p) of length n for t = 3, 4, n = 9, 12, 16, and p = 3, 5, 7 using our construction and criterion, and corresponding orthogonal arrays are found. We point out that 171t-CIS codes we found are optimal codes. (C) 2016 Elsevier B.V. All rights reserved.</P>

Linear Unequal Error Protection Codes based on Terminated Convolutional Codes

Oliver Bredtmann,Andreas Czylwik 한국통신학회 2015 Journal of communications and networks Vol.17 No.1

Convolutional codes which are terminated by direct truncation (DT) and zero tail termination provide unequal error protection. When DT terminated convolutional codes are used to encode short messages, they have interesting error protection properties. Such codes match the significance of the output bits of common quantizers and therefore lead to a low mean square error (MSE) when they are used to encode quantizer outputs which are transmitted via a noisy digital communication system. A code construction method that allows adapting the code to the channel is introduced, which is based on time-varying convolutional codes. We can show by simulations that DT terminated convolutional codes lead to a lower MSE than standard block codes for all channel conditions. Furthermore, we develop an MSE approximation which is based on an upper bound on the error probability per information bit. By means of this MSE approximation, we compare the convolutional codes to linear unequal error protection code construction methods from the literature for code dimensions which are relevant in analog to digital conversion systems. In numerous situations, the DT terminated convolutional codes have the lowest MSE among all codes.