• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.12
• /
• pp.1564-1574
• /
• 1999

In order to improve the efficiency of optimizing compilers, integration of register allocation and instruction scheduling has been extensively studied. One of the promising integration techniques is register allocation based on register-reuse chains. However, the generation of register-reuse chains in the previous approach was not completely systematic and consequently it creates unnecessarily dependencies that restrict instruction scheduling. This paper proposes a new register allocation technique based on a systematic generation of register-reuse chains. The first phase of the proposed technique is to generate register-reuse chains that are optimal in the sense that no additional dependencies are created. Thus, register allocation can be done without restricting instruction scheduling. For the case when the optimal register-reuse chains require more than available registers, the second phase reduces the number of required registers by merging the register-reuse chains. Chain merging always generates additional dependencies and consequently enforces the execution order of instructions. A heuristic is developed for the second phase in order to reduce additional dependencies created by merging chains. For matrix multiplication program, the number of registers resulting from the first phase is small enough to fit into available registers for most basic blocks. In addition, it is shown that the restriction to instruction scheduling is reduced by the proposed merging heuristic of the second phase.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.10
• /
• pp.129-139
• /
• 2013

Java bytecodes are executed not on target machine but on the Java virtual machines. Since this bytecodes use a higher level representation than binary code, it is possible to decompile most bytecodes back to Java source. Obfuscation is the technique of obscuring code and it makes program difficult to understand. However, most of the obfuscation techniques make the code size and the performance of obfuscated program bigger and slower than original program. In this paper, we proposed an effective Java obfuscation techniques using assignment statements merging that make the source program difficult to understand. The basic approach is to merge assignments statements to append side effects of statement. An additional benefit is that the size of the bytecode is reduced.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.78-81
• /
• 2003

This paper proposes a fuzzy classifier system (FCS) using hyper-cone membership functions (HCMFs) and rule reduction techniques. The FCS can generate excellent rules which have the best number of rules and the best location and shape of membership functions. The HCMF is expressed by a kind of radial basis function, and its fuzzy rule can be flexibly located in input and output spaces. The rule reduction technique adopts a decreasing method by merging the two appropriate rules. We applay the FCS to a tubby rule generation for the inverted pendulum control.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.72-75
• /
• 2008

Image segmentation techniques becoming increasingly important in the field of remote sensing image analysis in areas such as object oriented image classification. This paper presents a new method for image segmentation in High Resolution Remote Sensing Image based on Seeded Region Growing (SRG) and Edge Information. Firstly, multi-spectral edge detection was done using an entropy operator in pan-sharpened QuickBird imagery. Then, the initial seeds were automatically selected from the obtained edge map. After automatic selection of significant seeds, an initial segmentation was achieved by applying SRG. Finally the region merging process, using region adjacency graph (RAG), was carried out to get the final segmentation result. Experimental results demonstrated that the proposed method has good potential for application in the segmentation of high resolution satellite images.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.819-822
• /
• 2000

The merit of the stroke extraction algorithm is the ease of the feature abstraction from the skeleton of a character, But, extracting strokes from Korean characters has two major problems that must be dealt with. One is extracting primitive strokes and the other is merging or splitting the strokes using dynamic information of the strokes. In this paper, a method is proposed to extract strokes from an off-line handwritten Korean character. We have developed some stroke segmentation rules based on splitting, merging and directional analysis. Using these techniques, we can extract and trace the strokes in an off-line handwritten Korean character accurately and efficiently.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.2
• /
• pp.186-191
• /
• 2020

In this paper, we proposed an optimization technique for efficiently placing vehicles on decks in a vehicle-carrying ship to efficiently handle loading and unloading. For this purpose, we utilized the transformation method of the XML data representing the ship's spatial information, merging and branching algorithm and genetic algorithm, and implemented the function to visualize the optimized vehicle placement results. The techniques of selection, crossover, mutation, and elite preservation, which are used in the conventional genetic algorithms, are used. In particular, the vehicle placement optimization method is proposed by merging and branching the ship space for the vehicle loading. The experimental results show that the proposed merging and branching method is effective for the optimization process that is difficult to optimize with the existing genetic algorithm alone. In addition, visualization results show vehicle layout results in the form of drawings so that experts can easily determine the efficiency of the layout results.

• Journal of Korean Society of Transportation
• /
• v.25 no.2 s.95
• /
• pp.73-81
• /
• 2007

The purpose of this paper is to perform a basic study on the interaction between lanes, which can be achieved through analyzing traffic breakdown at the microscopic level. Using aerial photographic data for the microscopic analysis, this study analyzed the characteristics of traffic flow at a merging area. This research produced aggregated traffic data such as flows, speeds, and densities in 30 second intervals by lane for the macroscopic analysis and individual headway data by lane for the microscopic analysis. The paper contains an analysis of lane characteristics through flows, speeds, densities, and headway variations and also investigates the influence of ramp flows on mainline flows with space-time diagrams. Firstly, the merging area in this study is divided into three sections: before-merging, during-merging, and after-merging. The transition process was analyzed at each lane. Secondly, the breakdown was observed in detail with data divided in 50-foot units. The breakdown was checked through the relationships between ramp and freeway mainline flows, various techniques were proposed to analyze the breakdown, and the formation of breakdown was introduced as three stages in this study. In the near future, the findings of this study could contribute to determining the dynamic capacity on freeways by easily understanding changeable traffic breakdown patterns over time and space.

• International Journal of Computer Science & Network Security
• /
• v.23 no.4
• /
• pp.39-47
• /
• 2023

This study compares various transformation techniques for multifocus image fusion. Multi-focus image fusion is a procedure of merging multiple images captured at unalike focus distances to produce a single composite image with improved sharpness and clarity. In this research, the purpose is to compare different popular frequency domain approaches for multi-focus image fusion, such as Discrete Wavelet Transforms (DWT), Stationary Wavelet Transforms (SWT), DCT-based Laplacian Pyramid (DCT-LP), Discrete Cosine Harmonic Wavelet Transform (DC-HWT), and Dual-Tree Complex Wavelet Transform (DT-CWT). The objective is to increase the understanding of these transformation techniques and how they can be utilized in conjunction with one another. The analysis will evaluate the 10 most crucial parameters and highlight the unique features of each method. The results will help determine which transformation technique is the best for multi-focus image fusion applications. Based on the visual and statistical analysis, it is suggested that the DCT-LP is the most appropriate technique, but the results also provide valuable insights into choosing the right approach.

• International Journal of Computer Science & Network Security
• /
• v.21 no.7
• /
• pp.359-364
• /
• 2021

In recent years Hadoop usage has been increasing day by day. The need of development of the technology and its specified outcomes are eagerly waiting across globe to adopt speedy access of data. Need of computers and its dependency is increasing day by day. Big data is exponentially growing as the entire world is working in online mode. Large amount of data has been produced which is very difficult to handle and process within a short time. In present situation industries are widely using the Hadoop framework to store, process and produce at the specified time with huge amount of data that has been put on the server. Processing of this huge amount of data having small files & its storage optimization is a big problem. HDFS, Sequence files, HAR, NHAR various techniques have been already proposed. In this paper we have discussed about various existing techniques which are developed for accessing and storing small files efficiently. Out of the various techniques we have specifically tried to implement the HDFS- HAR, NHAR techniques.

• 한국데이터정보과학회:학술대회논문집
• /
• 2004.10a
• /
• pp.63-75
• /
• 2004

The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. We analyze Gyeongnam social indicator survey data using decision tree techniques for environmental information. We can use these decision tree outputs for environmental preservation and improvement.