• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1387-1390
• /
• 2002

자바가상머신은 플랫폼에 독립적인 실행을 위해서 바이트코드라고 하는 스택(stack) 기반의 가상 기계어를 사용하므로 실행 속도가 느리다는 단점이 있다. 특히 루프문을 포함하는 자바프로그램을 자바가상머신에서 수행 시키면 루프에 관련된 몇 개의 동일한 바이트코드가 루프의 실행 횟수만큼 반복적으로 인터프리트해서 수행하므로 상당한 성능 저하를 유발한다. 본 논문에서는 이런 비효율적인 성능상의 문제점을 개선하기 위해 루프를 수행하는 새로운 바이트코드를 정의 및 구현하고, 이를 실제 클래스 파일에 적용하기 위한 코드 변경 절차와 방법을 제시한다. 제안된 바이트코드를 사용해서 루프의 처리 속도를 개선할 경우, 클래스 파일의 크기를 줄일 수 있을 뿐만 아니라 간단한 성능 평가를 통해서 자바가상머신의 성능 개선 효과를 확인할 수 있다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.10
• /
• pp.998-1004
• /
• 2002

This paper reports a design of feedforward linear power amplifier using pilot tone for IMT-2000 band repeaters accepting multi-carrier. As this time pilot tone is applied to the circuit differently from the existing method. Only one pilot tone is used in both 1-st loop(IMD abstraction loop) and 2-nd loop(IMD cancellation loop) to cancell IMD signals automatically according to variation of frequency or power level of input signals. As an experiment, in range of 2110 MHz - 2170 MHz at LPA output power of $20 W_{avg}$, IMD characteristics of over 20 dB was improved maintaining below -60 dBc considering respective 20 MHz. Therefore the supposed feedforward linear power amplifier can be used for linear power amplifier in IMT-2000 band repeaters.

• Korean Journal of Heritage: History & Science
• /
• v.51 no.4
• /
• pp.84-107
• /
• 2018

Cheommojik is a pile cloth, a type of textile whose surface is covered with short piles. The term chaedam was used during the late Joseon dynasty to refer to pile cloth rugs, while the terms yoongjeon, dantong and yangtanja were used in the early twentieth century. Various documents, newspaper articles and photographs confirm that pile cloth rugs were used by the general public as well as the royal family from the late Joseon dynasty onward, and that there were domestic manufacturers of such rugs at that time. This study investigated six pile cloth rugs that were produced after the late Joseon dynasty, five of which feature Persian knots made of cut pile, the other being made with the loop pile method. The cut pile rugs are rectangular in shape and measure between 72-98cm by 150-156cm; and they are decorated in the middle with patterns of butterfly, deer, and tiger or the ten longevity symbols, and along the edges with patterns composed of 卍 symbols. The ground warp of all six rugs are made from cotton yarn, while the ground weft is made of cotton yarn on three pieces, wool on one piece and cotton and viscose rayon. The ground weft yarn from four pieces are Z-twist yarn made with two or more S-twist cotton yarn. Four to six colors were used for the pile weft, all being natural colors except for red. Two or more S- or Z-twist yarn were twisted together in the opposite twist for the pile weft, with the thickness determining the number of threads used. Six or more weft threads were used to make the start and end points of the rug; and the ground warp ends were arranged by tying every four of them together. For the left and right edges, three or more threads were wrapped together into a round stick-like form, and the second and third inner ground warps from the edges were stitched on to the wrapped edge. For the loop pile, loops were made in the direction of the warp; the ground warp and the ground weft may have been made with cotton, the pile warp with wool yarn. An analysis of the components of three rugs was conducted to determine which types of animal hair were used for the pile weft. Despite some inconclusive results, it was revealed that goat hair and fat-tailed sheep hair were used, raising the possibility that various kinds of animal fur were used in the production of pile cloth rugs. The six rugs examined in this study are estimated to have been made between the late 1800s and the early 1900s. Although the manufacturer of the rugs cannot be confirmed, we concluded that the rugs were produced in Korea after referring to the documentation of the domestic production of pile cloth rugs during the aforementioned period and the form and placements of the patterns on the rugs.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.8
• /
• pp.981-988
• /
• 2002

In this paper, a simple parallel compiler of a sequential loop is presented. This is a procedure for the automatic conversion of a sequential loop into a nested parallel DOALL loops at compile time. For this. the source program of Parafrase II parallel compiler is analyzed and a new general method the extracting parallelism in order to parallel processing effectively in nested loop is implemented.

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.6
• /
• pp.919-925
• /
• 2023

Modern drones are equipped with miniaturized mission equipment capable of performing various tasks such as surveillance and reconnaissance. Consequently, these mission equipment are exposed to disturbances like wind loads and motor rotations, which can lead to instability in the operation of the Electro-Optical Targeting System (EOTS). Specifically, simple step inputs for changing the line of sight in EOTS can cause abrupt changes in speed, inducing overshoot and potentially creating instability along with other disturbances. To address this, a velocity profile was designed so that the angular velocity moves in a trapezoidal shape when changing the EOTS line of sight. A Double-loop controller was designed to apply this profile as an input to the external loop receiving position feedback. The system's stability was then compared, and the velocity profile was optimized within a stable range by varying maximum speed and acceleration.

• 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％.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.8
• /
• pp.421-431
• /
• 2004

This paper presents adaptive execution techniques that determine whether parallelized loops are executed in parallel or sequentially in order to maximize performance. The adaptation and performance estimation algorithms are implemented in a compiler preprocessor. The preprocessor inserts code that automatically determines at compile-time or at run-time the way the parallelized loops are executed. Using a set of standard numerical applications written in Fortran77 and running them with our techniques on a distributed shared memory multiprocessor machine (SGI Origin2000), we obtain the performance of our techniques, on average, 26%, 20%, 16%, and 10% faster than the original parallel program on 32, 16, 8, and 4 processors, respectively. One of the applications runs even more than twice faster than its original parallel version on 32 processors.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.2
• /
• pp.365-372
• /
• 2005

Generally, In a application program the core part for parallel processing is a loop. therefore exist data dependencies between the array index variables of a loop. The data dependence relations between statements which from variable or constant dependence distance are specially complex. Therefore extracting parallelism for those statements at compile time is very difficult. in this paper, among the proposed methods of extracting parallelism, analysis the unimodular method and non-unimodular method and grasping the merits and demerits of them. hereafter, this method will go far toward solving the effectively extracting parallelism of the loop.

• Journal of Industrial Technology
• /
• v.28 no.B
• /
• pp.209-214
• /
• 2008

Set-valued attributes appear in many applications to model complex objects occurring in the real world. One of the most important operations on set-valued attributes is the set join, because it provides a various method to express complex queries. Currently proposed set join algorithms are based on block nested loop join in which inverted files are partitioned horizontally into blocks. Evaluating these joins are expensive because they generate intermediate partial results severely and finally obtain the final results after merging partial results. In this paper, we present an efficient processing of set join algorithm. We propose a new set join algorithm that vertically partitions inverted files into blocks, where each block fits in memory, and performs block nested loop join without producing intermediate results. Our experiments show that the vertical bitmap nested set join algorithm outperforms previously proposed set join algorithms.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.20 no.3
• /
• pp.543-560
• /
• 2018

With the increased development in downtown underground space facilities that vertically cross under a railway at a shallow depth, the demand for non-open cut method is increasing. However, most construction sites still adopt the pipe roof method, where medium and large diameter steel pipes are pressed in to form a roof, enabling excavation of the inside space. Among the many factors that influence the loosening region and loads that occur while pressing in steel pipes, the size of the pipe has the largest impact, and this factor may correspond to the magnitude of load applied to the underground structure inside the steel pipe roof. The super equilibrium method (SEM) has been developed to minimize ground disturbance and loosening load, and uses small diameter pipes of approximately 114 mm instead of conventional medium and large diameter pipes. This small diameter steel pipe is called an SEM pile. After SEM piles are pressed in and the grouting reinforcement is constructed, a crossing structure is pressed in by using a hydraulic jack without ground subsidence or heaving. The SEM pile, which plays the role of timbering, is a fore-poling pile of approximately 5 m length that prevents ground collapse and supports surface load during excavation of toe part. The loosening region should be adequately calculated to estimate the spacing and construction length of the piles and stiffness of members. In this paper, we conducted a comparative analysis of calculations of loosening load that occurs during the press-in of SEM pile to obtain an optimal design of SEM. We analyzed the influence of factors in main theoretical and empirical formulas applied for calculating loosening regions, and carried out FEM analysis to see an appropriate loosening load to the SEM pile. In order to estimate the soil loosening caused by actual SEM-pile indentation and excavation, a steel pipe indentation reduction model test was conducted. Soil subsidence and soil loosening were investigated quantitatively according to soil/steel pipe (H/D).