• Title/Summary/Keyword: Korean Code

Search Result 11,506, Processing Time 0.041 seconds

Lightweight Loop Invariant Code Motion for Java Just-In-Time Compiler on Itanium (Itanium상의 자바 적시 컴파일러를 위한 가벼운 루프 불변 코드 이동)

  • Yu Jun-Min;Choi Hyung-Kyu;Moon Soo-Mook
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.3
    • /
    • pp.215-226
    • /
    • 2005
  • Loop invariant code motion (LICM) optimization includes relatively heavy code analyses, thus being not readily applicable to Java Just-In-Time (JIT) compilation where the JIT compilation time is part of the whole running time. 'Classical' LICM optimization first analyzes the code and constructs both the def-use chains and the use-def chains. which are then used for performing code motions. This paper proposes a light-weight LICM algorithm, which requires only the def-use chains of loop invariant code (without use-def chains) by exploiting the fact that the Java virtual machine is based on a stack machine, hence generating code with simpler patterns. We also propose two techniques that allow more code motions than classical LICM techniques. First, unlike previous JIT techniques that uses LICM only in single-path loops for simplicity, we apply LICM to multi-path loops (natural loops) safely for partially redundant code. Secondly, we move loop-invariant, partially-redundant null pointer check code via predication support in Itanium. The proposed techniques were implemented in a JIT compiler for Itanium processor on ORP (Open Runtime Platform) Java virtual machine of Intel. On SPECjvrn98 benchmarks, the proposed technique increases the JIT compilation overhead by the geometric mean of 1.3%, yet it improves the total running time by the geometric mean of 2.2%.

A Program Similarity Check by Flow Graphs of Functional Programs (흐름 그래프 형태를 이용한 함수형 프로그램 유사성 비고)

  • Seo Sunae;Han Taisook
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.4
    • /
    • pp.290-299
    • /
    • 2005
  • Stealing the source code of a program is a serious problem not only in a moral sense but also in a legal sense. However, it is not clear whether the code of a program is copied from another or not. There was a program similarity checker detecting code-copy by comparing the syntax trees of programs. However this method has a limitation that it cannot detect the code-copy attacks when the attacker modifies the syntax of the program on purpose. We propose a program similarity check by program control graph, which reveals not only syntax information but also control dependancy. Our method can detect the code-copy attacks that do not change control dependancy Moreover, we define what code-copy means and establish the connection between code-copy and similarity of program control graph: we prove that two programs are related by copy congruence if and only if the program control graphs of these programs are equivalent. We implemented our method on a functional programming language, nML. The experimental results show us that the suggested method can detect code similarity that is not detected by the existing method.

Expanding Code Caches for Embedded Java Systems using Client Ahead-Of-Time Compilation (내장형 자바 시스템을 위한 클라이언트 선행 컴파일 기법을 이용한 코드 캐시 확장)

  • Hong, Sung-Hyun;Kim, Jin-Chul;Shin, Jin-Woo;Kwon, Jin-Woo;Lee, Joo-Hwan;Moon, Soo-Mook
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.8
    • /
    • pp.868-872
    • /
    • 2010
  • Many embedded Java systems are equipped with limited memory, which can constrain the code cache size provided for Java just-in-time compilation, affecting the Java performance. This paper proposes expanding the limited code cache when it is full, by saving the machine code for some methods in the code cache into the file system of the permanent storage and reloading it to the code cache when they are re-invoked later. This is applying the client ahead-of-time compilation during the execution time for the purpose of enlarging the code cache. Our experimental results indicate that the proposed execution method can improve the performance by as much as 1.6 times compared to the conventional method, when the code cache size is reduced by half.

A study on the developments of STCW training of seafarers on ships applying in the IGF Code

  • Han, Se-Hyun;Lee, Young-Chan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.39 no.10
    • /
    • pp.1054-1061
    • /
    • 2015
  • The International Maritime Organization (IMO) has been regulating emissions by making mandatory the compliance with institutions aimed at protecting air quality such as the Energy Efficiency Design Index (EEDI), Ship Energy Efficiency Management Plan (SEEMP) and Tier III. Under the circumstances, one of the response measures considered to be the most feasible is the replacement of existing marine fuel with Liquefied Natural Gas (LNG). The industry has been preemptively building infrastructure and developing and spreading engine technology to enable the use of LNG-fueled ships. The IMO, in turn, recently adopted the International Code of Safety for Ships Using Gases or Other Low-Flash-Point Fuels (IGF Code) as an institutional measure. Thus, it is required to comply with regulations on safety-related design and systems focused on response against potential risk for LNG-fueled ships, in which low-flash-point fuel is handled in the engine room. Especially, the Standards of Training, Certification and Watchkeeping (STCW) Convention was amended accordingly. It has adopted the qualification and training requirements for seafarers who are to provide service aboard ships subject to the IGF Code exemplified by LNG-fueled ships. The expansion in the use of LNG-fueled ships and relevant facilities in fact is expected to increase demand for talents. Thus, the time is ripe to develop methods to set up appropriate STCW training courses for seafarers who board ships subject to the IGF Code. In this study, the STCW Convention and existing STCW training courses applied to seafarers offering service aboard ships subject to the IGF Code are reviewed. The results were reflected to propose ways to design new STCW training courses needed for ships subject to the IGF Code and to identify and improve insufficiencies of the STCW Convention in relation to the IGF Code.

Emotion Image Retrieval through Query Emotion Descriptor and Relevance Feedback (질의 감성 표시자와 유사도 피드백을 이용한 감성 영상 검색)

  • Yoo Hun-Woo
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.3
    • /
    • pp.141-152
    • /
    • 2005
  • A new emotion-based image retrieval method is proposed in this paper. Query emotion descriptors called query color code and query gray code are designed based on the human evaluation on 13 emotions('like', 'beautiful', 'natural', 'dynamic', 'warm', 'gay', 'cheerful', 'unstable', 'light' 'strong', 'gaudy' 'hard', 'heavy') when 30 random patterns with different color, intensity, and dot sizes are presented. For emotion image retrieval, once a query emotion is selected, associated query color code and query gray code are selected. Next, DB color code and DB gray code that capture color and, intensify and dot size are extracted in each database image and a matching process between two color codes and between two gray codes are peformed to retrieve relevant emotion images. Also, a new relevance feedback method is proposed. The method incorporates human intention in the retrieval process by dynamically updating weights of the query and DB color codes and weights of an intra query color code. For the experiments over 450 images, the number of positive images was higher than that of negative images at the initial query and increased according to the relevance feedback.

Application of TULIP/STREAM code in 2-D fast reactor core high-fidelity neutronic analysis

  • Du, Xianan;Choe, Jiwon;Choi, Sooyoung;Lee, Woonghee;Cherezov, Alexey;Lim, Jaeyong;Lee, Minjae;Lee, Deokjung
    • Nuclear Engineering and Technology
    • /
    • v.51 no.8
    • /
    • pp.1871-1885
    • /
    • 2019
  • The deterministic MOC code STREAM of the Computational Reactor Physics and Experiment (CORE) laboratory of Ulsan National Institute of Science and Technology (UNIST), was initially designed for the calculation of pressurized water reactor two- and three-dimensional assemblies and cores. Since fast reactors play an important role in the generation-IV concept, it was decided that the code should be upgraded for the analysis of fast neutron spectrum reactors. This paper presents a coupled code - TULIP/STREAM, developed for the fast reactor assembly and core calculations. The TULIP code produces self-shielded multi-group cross-sections using a one-dimensional cylindrical model. The generated cross-section library is used in the STREAM code which solves eigenvalue problems for a two-dimensional assembly and a multi-assembly whole reactor core. Multiplication factors and steady-state power distributions were compared with the reference solutions obtained by the continuous energy Monte-Carlo code MCS. With the developed code, a sensitivity study of the number of energy groups, the order of anisotropic PN scattering, and the multi-group cross-section generation model was performed on the keff and power distribution. The 2D core simulation calculations show that the TULIP/STREAM code gives a keff error smaller than 200 pcm and the root mean square errors of the pin-wise power distributions within 2%.

Development of Web-based Off-site Consequence Analysis Program and its Application for ILRT Extension (격납건물종합누설률시험 주기연장을 위한 웹기반 소외결말분석 프로그램 개발 및 적용)

  • Na, Jang-Hwan;Hwang, Seok-Won;Oh, Ji-Yong
    • Journal of the Korean Society of Safety
    • /
    • v.27 no.5
    • /
    • pp.219-223
    • /
    • 2012
  • For an off-site consequence analysis at nuclear power plant, MELCOR Accident Consequence Code System(MACCS) II code is widely used as a software tool. In this study, the algorithm of web-based off-site consequence analysis program(OSCAP) using the MACCS II code was developed for an Integrated Leak Rate Test (ILRT) interval extension and Level 3 probabilistic safety assessment(PSA), and verification and validation(V&V) of the program was performed. The main input data for the MACCS II code are meteorological, population distribution and source term information. However, it requires lots of time and efforts to generate the main input data for an off-site consequence analysis using the MACCS II code. For example, the meteorological data are collected from each nuclear power site in real time, but the formats of the raw data collected are different from each site. To reduce the efforts and time for risk assessments, the web-based OSCAP has an automatic processing module which converts the format of the raw data collected from each site to the input data format of the MACCS II code. The program also provides an automatic function of converting the latest population data from Statistics Korea, the National Statistical Office, to the population distribution input data format of the MACCS II code. For the source term data, the program includes the release fraction of each source term category resulting from modular accident analysis program(MAAP) code analysis and the core inventory data from ORIGEN. These analysis results of each plant in Korea are stored in a database module of the web-based OSCAP, so the user can select the defaulted source term data of each plant without handling source term input data.

Group Manchester Code Scheme for Medical In-body WBAN Systems (의료용 in-body WBAN 시스템을 위한 Group Manchester code 변조 방식)

  • Choi, Il-Muk;Won, Kyung-Hoon;Choi, Hyung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.10C
    • /
    • pp.597-604
    • /
    • 2011
  • In this paper, we propose group Manchester code (GM) modulation scheme for medical in-body wireless body area network (WBAN) systems. In IEEE, the WBAN system is assigned as 802.15. Task Group 6 (TG 6), and the related standardization is being progressed, Recently, in this Group, group pulse position modulation (GPPM), which can obtain data rate increase by grouping pulse position modulation (PPM) symbols, is proposed as a new modulation scheme for low-power operation of WBAN system. However, the conventional method suffers from BER performance degradation due to the absence of gray coding and its demodulation characteristics. Therefore, in this paper, we propose a modified GM scheme which groups Manchester code instead of PPM. In the proposed GM scheme, a low-complexity maximum likelihood (ML) demodulation method is employed in order to maximize the BER performances, Also, log likelihood ratio (LLR) decision method is proposed to employ the Turbo code as forward error correction (FEC), Finally, we verified that the proposed method has a good performance and is an appropriate scheme for in-body WBAN system through extensive performance evaluation.

Costume Code Analysis Placed Mise-en-abyme in the Movie - Focused on the Lucien Dällenbach's theory and the film - (미장아빔으로 배치된 영화 속 의상코드 분석 -Lucien Dällenbach의 이론과 영화 를 중심으로-)

  • Kim, Hyangja
    • Journal of the Korean Society of Costume
    • /
    • v.67 no.1
    • /
    • pp.130-146
    • /
    • 2017
  • This study focuses on the Mise-en-abyme theories of Lucien $D{\ddot{a}}llenbach$, and presents research methodology to analyze the modern cinema costume in a new view. Inherent aesthetic values of the costume code shown in the film are as follows. First, esthetics value shown is the analogic code through the maximization of factual realism by directing target. Mise-en-abyme placed in this film plays the role of costume codes, and highlights the subject by presenting specifically targeted realistic icons to maximize the realism of the movie. Second, Mise-en-abyme is deployed to the explicit text through costumes code is placed as Displaced code arrangements. In other words, each of the characters is a signifier. Symbolizing a historical era is the device that represents a self-reflective signifier. Third, paradoxically reflected by the overlapped expansion of virtual reality and the self-referential characteristics and are subject to reflect the thinking of the author. Costumes code placed in Mise-en-abyme is expressed in costumes positioned to maximize the realism in the film as described above, and implies narratives and self-reflective mediating tools that symbolism can be seen that the paradoxical metaphor for the reality and the future. In addition, through the metaphor of visual narrative is allegorical representation Mise-en-abyme with ambiguity, and it is a concrete text that can be realized in a variety of creative storytelling methods and image delivery methods of modern fashion. This study confirmed that this costumes to take the point of view of emotional $Mise-en-sc{\grave{e}}ne$ in the process of completing the film's themes and cinematic devices by identifying the roles and aesthetic value of code costumes as the core subjects that make up the narrative of the film.

A Fast Cell Search Algorithm using Code Position Modulation within code block in Asynchronous W-CDMA System (비동기 W-CDMA 시스템을 위한 코드블럭 내의 코드위치변조를 이용한 고속 셀 탐색 알고리즘)

  • 최정현;김낙명
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.5A
    • /
    • pp.611-617
    • /
    • 2000
  • Asynchronous mode W-CDMA system is kmown to be quite appropriate to the next generation mobile communication system, especially in a non-homogenious cellular architecture. In this case, however, each base station needs to use different spreading code for identification, so it is a demeanding task for a mobile terminal to find the best cell site and get an accurate code synchronization at the beginning of a communication. Since slow acquisition of a base station could mean the failure of initiation, a fast algorithm to accelerate the cell search process is essential. In this paper, a new cell search algorithm based on the binary code position modulation within the code block is proposed. Different cell sites are identified by different hopping code sequences, andeach position modulation is performed by the hopping code. The proposed algorithm is proved to make the cell search time in most places in a cell much shorter than the previous algorithms, and to make the receiver implementation simpler.

  • PDF