• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.24-28
• /
• 2017

In the Internet of Things (IoT), resource-limited smart devices communicate with each other while performing sensing and computation tasks. Thus, these devices can be exposed to various attacks being launched and spread through network. For instance, attacker can reuse the codes of IoT devices for malicious activity executions. In the sense that attacker can craft malicious codes by skillfully reusing codes stored in IoT devices, code-reuse attacks are generally considered to be dangerous. Although a variety of schemes have been proposed to defend against code-reuse attacks, code randomization is regarded as a representative defense technique against code-reuse attacks. Indeed, many research have been done on code randomization technique, however, there are little work on analysis of the interactions between code randomization defenses and code-reuse attacks although it is imperative problem to be explored. To provide the better understanding of these interactions in IoT, we analyze how code randomization defends against code-reuse attacks in IoT and perform simulation on it. Both analysis and simulation results show that the more frequently code randomizations occur, the less frequently code-reuse attacks succeed.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1092-1102
• /
• 2000

In this paper, we made software components reusable through syntax-analysis method, designed a Viewer for understanding component information, and retrieved similar components by using Enhanced SARM. Because SARM requires a lot of computation time, it was enhanced by reducing unnecessary activation value. Also GUI was designed for component-query relationship and Viewer represents hierarchy diagram of a retrieved component. This system supports facilities which can insert and delete components on diagram. For a component modification, this system supports a editor to rebuild class inheritance relationship. In this paper, SCRS (software components reuse system) is consisted of syntax-analysis method, component-query relationship interface, retrieval (Enhanced SARM), diagram viewer, reuse on diagram, and a editor.

• Journal of KIISE:Software and Applications
• /
• v.37 no.11
• /
• pp.845-850
• /
• 2010

Incremental parsing has been developed to reuse the parse result of the original string during the parsing of a new string. The previous incremental LL(1) parsing methods precomputed the reusable point information before parsing and used it during parsing. This paper proposes an efficient reusable point computation by factoring the common part of the computation. The common symbol storing method and the distance storing method were previously suggested to find the reusable point, and by combining the methods, this paper gives the storing method of the distance to common symbols. Based on it, an efficient incremental LL(1) parser is constructed.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.6
• /
• pp.568-574
• /
• 2020

In this paper, we propose a method to reduce the square root computation having high computation complexity in Canny edge detection algorithm using image processing. The proposed method is to reduce the number of operation calculating gradient magnitude using pixel's continuity using make a specific pattern instead of square root computation in gradient magnitude calculating operation. Using various test images and changing number of hole pixels, we can check for calculate match rate about 97% for one hole, and 94%, 90%, 88% when the number of hole is increased and measure decreasing computation time about 0.2ms for one hole, and 0.398ms, 0.6ms, 0.8ms when the number of hole is increased. Through this method, we expect to implement low power embedded vision system through high accuracy and a reduced operation number using two-hole pixels.

• Journal of IKEEE
• /
• v.20 no.3
• /
• pp.273-278
• /
• 2016

In HEVC variable block size motion estimation, same search window data are duplicatedly used in each block size. It increases memory bandwidth, and it is difficult to exploit early termination. In this paper, largest block size and its corresponding smaller block sizes with same positions are performed at the same time. It reduces memory bandwidth and computation by reusing search window data and computation results. In the early termination, image quality can be degraded when it determines early termination by observing largest block size only, since smaller block sizes cannot be equally terminated due to their relative positions. So, in this paper, processing order of early termination is changed to perform smaller block sizes in turns. The designed motion estimation engine was described in Verilog HDL and it was synthesized and verified in 0.18um process technology. Its gate count and maximum operating frequency are 36,101 gates and 263.15 MHz, respectively.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.707-710
• /
• 2005

In this paper, we propose a new communication network for on-chip communication. The network is based on a direct sequence code division multiple access (DS-CDMA) technique. The new communication network is suitable for a parallel processing system and also drastically reduces the I/O pin count. Our network architecture is mainly divided into a CDMA-based network interface (CNI), a communication channel, a synchronizer. The network includes a reverse communication channel for reducing latency. The network decouples computation task from communication task by the CNI. An extreme truncation is considered to simplify the communication link. For the scalability of the network, we use a PN-code reuse method and a hierarchical structure. The network elements have a modular architecture. The communication network is done using fully synthesizable Verilog HDL to enhance the portability between process technologies.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.124-133
• /
• 2014

To speed up data-intensive programs, two complementary techniques, namely nested loops parallelization and data locality optimization, should be considered. Effective parallelization techniques distribute the computation and necessary data across different processors, whereas data locality places data on the same processor. Therefore, locality and parallelization may demand different loop transformations. As such, an integrated approach that combines these two can generate much better results than each individual approach. This paper proposes a unified approach that integrates these two techniques to obtain an appropriate loop transformation. Applying this transformation results in coarse grain parallelism through exploiting the largest possible groups of outer permutable loops in addition to data locality through dependence satisfaction at inner loops. These groups can be further tiled to improve data locality through exploiting data reuse in multiple dimensions.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.3
• /
• pp.665-682
• /
• 2005

The sample reuse bootstrap technique has been successful to attract both applied and theoretical statisticians since its origination. In recent years a good deal of attention has been focused on the applications of bootstrap methods in regression analysis. It is easier but more accurate computation methods heavily depend on high-speed computers and warrant tough mathematical justification for their validity. It is now evident that the presence of multiple unusual observations could make a great deal of damage to the inferential procedure. We suspect that bootstrap methods may not be free from this problem. We at first present few examples in favour of our suspicion and propose a new method diagnostic-before-bootstrap method for regression purpose. The usefulness of our newly proposed method is investigated through few well-known examples and a Monte Carlo simulation under a variety of error and leverage structures.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.829-831
• /
• 1996

This paper is concerning on a study on the object-oriented programming and its application to maintenance scheduling. The concept of object-oriented programming enables us to modify and reuse software with much ease. By introducing object-oriented programming to maintenance scheduling, we can develop a hierarchical and reusable software in maintenance scheduling. The maintenance scheduling problem becoming more and more large and complex can be dealt with the concept of object-oriented technique and we hope this concept will give a reasonable solution. And evolutionary computation will be developed as a optimization technique.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.5
• /
• pp.494-503
• /
• 2002

A motion vector re-estimation algorithm for image downscaling in discrete consine transform domain is presented. Kernel functions are difined using SAD (Aum of Absolute Difference) and edge information of a macroblock. The proposed method uses these kernel functions to re-estimate a new motion vector of the downscaled image. The motion vectors from the incoming bitstream of transcoder are reused to reduce computation burden of the block-matching motion estimation, and we also reuse the given motion vectors. Several experiments in this paper show that the computation efficiency and the PSNR (Peak Signal to Noise Ratio) and better than the previous methods.