• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.5
• /
• pp.223-230
• /
• 2008

Dynamic update of kernel can change kernel functionality and fix bugs in runtime. Dynamic update is important because it leverages availability, reliability and flexibility of kernel. An instruction-granularity update technique has been used for dynamic update. However, it is difficult to apply update technique for a commodity operating system kernel because development and maintenance of update code must be performed with assembly language. To overcome this difficulty, we design the function-granularity dynamic update system which uses high-level language such as C language. The proposed update system makes the development and execution of update convenient by providing the development environment for update code which is same for kernel development. We implement this system for Linux and demonstrate an example of update for EXT3 file system. The update was successfully executed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.51-59
• /
• 2004

This paper proposes an improved six-color separation reducing the graininess in a middle tone region based on the standard deviation of the lightness and chrominance in S-CIELAB space. Graininess is regarded as visual perception for the fluctuation of the lightness of the light cyan and cyan or light magenta and magenta. In the conventional methods, the granularity is extremely heuristic and inaccurate due to the use of the visual examination score. Accordingly, this paper proposes a method to calculate the objective granularity for six color separation. First, we use the lightness, redness-greenness, and yellowness-blueness of the S-CIELAB space reflecting the spatial-color sensitivity of the human and normalize the sum of the three standard deviations. Finally, we apply the proposed granularity to the six color separation after assigning the granularity to the lookup table and obtain the result reducing the graininess in a middle tone region.

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.435-447
• /
• 2017

Associative and bidirectional associative memories are examples of associative structures studied intensively in the literature. The underlying idea is to realize associative mapping so that the recall processes (one-directional and bidirectional ones) are realized with minimal recall errors. Associative and fuzzy associative memories have been studied in numerous areas yielding efficient applications for image recall and enhancements and fuzzy controllers, which can be regarded as one-directional associative memories. In this study, we revisit and augment the concept of associative memories by offering some new design insights where the corresponding mappings are realized on the basis of a related collection of landmarks (prototypes) over which an associative mapping becomes spanned. In light of the bidirectional character of mappings, we have developed an augmentation of the existing fuzzy clustering (fuzzy c-means, FCM) in the form of a so-called collaborative fuzzy clustering. Here, an interaction in the formation of prototypes is optimized so that the bidirectional recall errors can be minimized. Furthermore, we generalized the mapping into its granular version in which numeric prototypes that are formed through the clustering process are made granular so that the quality of the recall can be quantified. We propose several scenarios in which the allocation of information granularity is aimed at the optimization of the characteristics of recalled results (information granules) that are quantified in terms of coverage and specificity. We also introduce various architectural augmentations of the associative structures.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06a
• /
• pp.244-245
• /
• 2007

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.1-9
• /
• 2003

In this paper, we propose a new method dispersing spatially C(Cyan), M(Magenta), Y(Yellow) instead of K(black) in the bright region. The overlapping of black dots decreases brightness in the dark region, and black dots are very sensitive to human visual system in the bright region. Therefore, to avoid this problem, bright and dark gray region in the color image is considered in the proposed approach. A new method which uses CMY simultaneously in single mask is proposed, and CMY dots are used dispersing spatially for the bright region instead of black dot by this method. And tone curve connection is used to consider the gray level of dark region. In previous method, BNM (Blue Noise Mask) has high granularity and a narrow dynamic range. But the proposed method has the low granularity, wide dynamic range, and high contrast properties. Because the proposed method uses three times dots spatially in the different position than a conventional BNM, it can express more spatial information and a similar gray level compared with BNM.

• ETRI Journal
• /
• v.26 no.4
• /
• pp.332-343
• /
• 2004

One of the recent and most significant technical properties can be expressed as "digital convergence," which is helping lead the technical paradigm into a ubiquitous environment. As an initial trial of realizing a ubiquitous environment, the convergence between broadcasting and telecommunication fields is now on the way, where it is required to develop a scalable video coding scheme for one-source and multi-use media. Traditional scalable video coding schemes have, however, limitations for higher stable picture quality especially on the region of interest. Therefore, this paper introduces an adaptive scanning method especially designed for a higher regional-stable picture quality under a ubiquitous video coding environment, which can improve the subjective quality of the decoded video by most-preferentially encoding, transmitting, and decoding the top-priority image information of the region of interest. Thus, the video can be more clearly visible to users. From various simulation results, the proposed scanning method in this paper can achieve an improved subjective picture quality far better than the widely used raster scan order in conventional video coding schemes, especially on the region of interest, and without a significant loss of quality in the left-over region.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11c
• /
• pp.1915-1918
• /
• 2002

Managing semistructured data needs fine granularity such as markup elements. XML has major effect in managing web content, it enables content reusability, enriches information with metadata, ensures valid document links, etc. We introduce our content model as an integrated work which handles content objects as controllable units. The paper concerns on modeling news site and how the content is classified due to the site structure, aggregated content and reusability. The model stores instance XML document into relation database using fragmentation strategy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.7
• /
• pp.553-564
• /
• 1990

The co-efficient matrix of linear second-order partial differential equations in the general form is partitioned with (n-1)x(n-1) submartices and is transformed into the block tridiagonal system. Then the cyclic odd-even reduction technique is applied to this system with the large-grain data granularity and the block cyclic reduction algorithm to solve unknown vectors of this system is created. But this block cyclic reduction technique is not suitable for the parallel processing system because of its parallelism chanigng at every computing stages. So a new algorithm for solving linear second-order partical differential equations is presentes by the block cyclic reduction technique which is modified in order to keep its parallelism constant, and to reduce gteatly its execution time. Both of these algoriths are compared and studied.

• Journal of KIISE:Software and Applications
• /
• v.29 no.7
• /
• pp.510-520
• /
• 2002

This paper proposes a transformation-based approach to design constraint-based analyses for Java at a coarser granularity. In this approach, we design a less or equally precise but more efficient version of an original analysis by transforming the original construction rules into new ones. As applications of this rule transformation, we provide two instances of analysis design by rule-transformation. The first one designs a sparse version of class analysis for Java and the second one deals with a sparse exception analysis for Java. Both are designed based on method-level, and the sparse exception analysis is shown to give the same information for every method as the original analysis.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.2
• /
• pp.1-7
• /
• 2023

In this paper, we propose a base address candidate selection method using the $gp register and page granularity as a way to build a static analysis environment for firmware based on MIPS architecture. As a way to shorten the base address search time, which is a disadvantage of the base address candidate selection method through inductive reasoning in existing studies, this study proposes a method to perform page-level search based on the $gp register in the existing base address candidate selection method as a reference point for search. Then, based on the proposed method, a base address search tool is implemented and a static analysis environment is constructed to prove the validity of the target tool. The results show that the proposed method is faster than the existing candidate selection method through inductive reasoning.