• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.75-88
• /
• 2005

This paper proposes a method to ensure security attacks caused by insertion of malicious codes in a real-time control system that can be accessed through networks. The proposed technique is for dynamically upgradable real-time software through networks and based on a static program analysis technique to detect the malicious uses of memory access statements. Validation results are shown using a remotely upgradable real-time control system equipped with a modified compiler where the proposed security technique is applied.

• Earthquakes and Structures
• /
• v.21 no.6
• /
• pp.653-667
• /
• 2021

In this study, cyclic loading tests were conducted on the precast concrete (PC) wide beam (WB)-column joints. Two beam-column joint specimens were fabricated with the arrangement and anchorage details of the reinforcing bars penetrating the beam and column as variables. Through a cyclic loading test, the lateral load-story drift ratio responses, seismic performance characteristics (e.g., ductility, overstrength factor), energy dissipation, strength and stiffness degradations of each specimen were compared and analyzed based on the various indices and the current structural codes (ACI 318-19 and ACI 374.1-05 report). In addition, the shear lag effect was confirmed through the gauge values of the PC beam, and the differences in seismic performance between the specimens were identified on that basis.

• Structural Engineering and Mechanics
• /
• v.87 no.3
• /
• pp.243-254
• /
• 2023

Engineering structures usually suffer from cracks. The crack geometry has an influence on the structural mechanical properties and subsequent crack propagations. However, as an extensively utilized method in fracture analysis, the extended finite element method provided by Abaqus fails to output the specific location and dimensions of fractures. In this study, a technique to capture the crack geometry is proposed. The technique is based on the invariant level set method (I-LSM), which can avoid updating the level set function during crack development. The solution is achieved by an open-source plug-in programmed by Python. Three examples were performed to verify the effectiveness and robustness of the program. The result shows that the developed program can accurately output the crack geometry in both the 2D and 3D models. The open-source plug-in codes are included as supplementary material.

• The Journal of the Korea Contents Association
• /
• v.9 no.1
• /
• pp.81-88
• /
• 2009

In the previous work, we presented HDTS for locating logical errors in Java programs. The HDTS locates an erroneous method at an execution tree using an algorithmic program debugging technique and locates a statement with errors in the erroneous method using a step-wise program debugging. The technique can remove the unnecessary statements and nodes in debugging using a program slicing technique at the execution tree. So HDTS reduces the number of program debugging. In this paper, we design HDTS system for debugging java programs. We define small subset of Java language and design the translator that translates java source codes and the virtual machine that runs java programs. We design GUI(Graphical User Interface) for debugging.

• Journal of Engineering Education Research
• /
• v.10 no.3
• /
• pp.109-124
• /
• 2007

With the advance of the Internet and computing technologies, e-learning is now a hot issue worldwide for providing the effective learning on the cyber-space. However, most of existing e-learning contents have been developed mainly based on text, including simple multimedia elements such as images, animations, and voices. This paper suggests a method effective for the computer programming e-learning. The method is based on program visualization using flowcharts. It features the stepwise hierarchical program visualization on the level of statements, the flowchart based visualization for control constructs of languages, visualization over whole programs, visualization compared with source codes, and interaction with users. Finally, we implement a system to realize the suggested method, and execute it for an example program.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.892-899
• /
• 2014

Dynamic binary instrumentation is a code insertion technique for debugging a program without scattering its execution flow, while the program is running. Most dynamic instrumentations are implemented using dynamic binary translation techniques. Existing studies translated program codes dynamically by parsing the machine code stream to intermediate representation (IR) and then applying compilation techniques for IRs. However, they have high overhead during translation, which is a major cause of difficulty in applying the dynamic binary translation technique to the program which requires high responsiveness. In this paper, we introduce a light-weight dynamic binary instrumentation framework based on a novel dynamic binary translation technique which has low overhead while translating the program code. In order to reduce the translation overhead, our approach adopts a tabular-based address translation and exploits a translation bypassing scheme, which stores the translated address of a frequently called library function in advance. It then accesses the translated address and executes function codes without code translation when calling the function. Our experiment results demonstrated that the proposed approach outperforms the prior dynamic binary translation techniques from 2% up to 65%.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.8
• /
• pp.937-949
• /
• 1988

This paper proposes a code optimization algorithm for dealing with hazards which are occurred in pipelined architecture due to resource dependence between executed instructions. This algorithm solves timing hazard which results from resource conflict between concurrently executing instructions, and sequencing hazard due to the delay time for branch target decision by reconstructing of instruction sequence without pipeline interlock. The reconstructed codes can be generated efficiently by considering timing hazard and sequencing hazard simultaneously. And dynamic execution time of program is improved by considering structral hazard which can be existed when pipeline is controlled dynamically.

• Journal of Biomedical Engineering Research
• /
• v.5 no.1
• /
• pp.93-102
• /
• 1984

In this paper, the real-time compressed code generation method for the biological signal data, especially for the Electrocardiogram, is studied. For this purpose, variable length code is introduced. And from this code, we get a exactly the same reconstructed signal data as the original. Experimental results show that this program reduces the data rate by a factor of about 8, and codes the result in a form convenient for analysis.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1992.10a
• /
• pp.121-126
• /
• 1992

This Paper presents a development of a CAD system for interactive design of steel frames. The adopted building code for structural design is "Steel Building Codes" enacted by the Architectural Institute of Korea in 1973. The selected member sections, therefore, are domestic rolled sections - especially, H shapes. The authors aim at a development of an integrated computer programs repeating plane frame analysis and design of members until minimum weight design condition is satisfied. This program also provides various section change functions to improve the shortcomings of automatic design.ic design.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.962-970
• /
• 2000

Multithreading is attractive in that it can tolerate memory latency and synchronization by effectively overlapping communication with computation. While several compiler techniques have been developed to produce multithreaded codes from functional languages programs, there still remains a lot of works to implement loops effectively. Executing lops in a style of multithreading usually causes some overheads, which can reduce severely the effect of multirheading. This paper suggests several methods in terms of architectures or compilers which can optimize loop execution by multithreading. We then simulate and analyze them for the matrix multiplication program.