• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.5
• /
• pp.801-804
• /
• 2006

[ $GdAlO_3(GAO)$ ] buffer layer for $YBa_2Cu_3O_{7-{\delta}}(YBCO)$ coated superconductor wire was fabricated by sol-gel processing. Precursor solution was prepared by dissolving 1:1 stoichiometric quantaties of gadolinium nitrate hexahydrate and aluminum nitrate nonahydrate in methanol. The solution was spin-coated on $SrTiO_3(STO)$(100) single crystal substrates and heated at $1000^{\circ}C$ for 2h in wet $N_2-5%\; H_2$, atmosphere. A SEM(scanning electron microscopy) observation of the surface morphology of the GAO layer has shown that it has a faceted morphology indicating epitaxy. It was shown from x-ray diffraction(XRB) that GAO buffer layer was highly c-axis oriented epitaxial thin film with both good out-of-plane($FWHM=0.29^{\circ}$ for the (002) reflection) and in-plane ($FWHM=1.10^{\circ}$ for the {112} reflection) alignment.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.9
• /
• pp.259-269
• /
• 2017

As emerging the '4th Industrial Revolution' by increasing the necessity of the intelligent system recently, 'Autonomic Control System' also has been the important issue. It is necessary to develop the system collecting data of machines and sensors for the autonomic control system to monitor the target system. But it is difficult to collect data because data formats of machines and sensors of the existing factories differ between each manufacturer. Therefore, this paper presents and implements data collecting and processing system that comprise 3 steps including 'ParseBuffer', 'ProcessData' and 'AddToBuffer' by using 'MTConnect' that is standard manufacturing facility data collecting middleware. Through the suggested system, we can get data in a common format usable in an autonomous control system. As a case study, we experimented with the generation and collection of AGV (Automated Guided Vehicle) data, which is an unattended transportation system in the factory. To accomplish this, we defined the data type in accordance with the MTConnect standard and confirmed the data collected through the proposed system.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.2
• /
• pp.115-123
• /
• 2010

We present an efficient algorithm for computing the Hausdorff distance between two planar curves. The algorithm is based on an efficient trimming technique that eliminates the curve domains that make no contribution to the final Hausdorff distance. The input curves are first approximated with biarcs within a given error bound in a pre-processing step. Using the biarc approximation, the distance map of an input curve is then approximated and stored into the graphics hardware depth-buffer by rendering the distance maps (represented as circular cones) of the biarcs. We repeat the same procedure for the other input curve. By sampling points on each input curve and reading the distance from the other curve (stored in the hardware depth-buffer), we can easily estimate a lower bound of the Hausdorff distance. Based on the lower bound, the algorithm eliminates redundant curve segments where the exact Hausdorff distance can never be obtained. Finally, we employ a multivariate equation solver to compute the Hausdorff distance efficiently using the remaining curve segments only.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.12
• /
• pp.520-528
• /
• 2002

The ATM Forum recently introduced the Guaranteed Frame Rate(GFR) service category GFR service has been designed to support classical best effort traffic such as TCP/IP based traffic. The GFR service not only guarantees a minimum throughput, but also supports fair distribution of available bandwidth to completing VCs. In this paper, we proposed a new buffer management algorithm based on leaky bucket to provide minimum cell rate guarantee and improve fairness. The proposed algorithm reduces complexity and processing overhead of leaky-bucket algorithm to implement easily.

• The Transactions of the Korean Institute of Electrical Engineers C
• /
• v.52 no.9
• /
• pp.400-406
• /
• 2003

Efficient electrodes are devised for organic luminescent device(OLED). ITO electrode is treated with $O_2$ plasma. In order to inject hole efficiently, there is proposed the shape of anode that inserted plasma polymerized films as buffer layer between anode and organic layer using thiophene monomer. In the case of device inserted the buffer layer by using the plasma polymerization after $O_2$ plasma processing for ITO transparent electrode, since it forms the stable interface and reduce the moving speed of hole, the recombination of hole and electronic are made in the emitting layer. Therefore it realized the device capability of two times in the aspect of luminous efficiency than the device which do not be inserted the buffer layer. Experiments are limited to the device that has the structure of TPD/$AIq_3$, however, the aforementioned electrodes can similarly applied to the organic luminous device and the Polymer luminous device.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.229-234
• /
• 2005

We propose a fuzzy logic-based buffer management algorithm to improve internet traffic over ATM-GFR service. The proposed algorithm employs the strategies of early congestion detection and selective packet discard to achieve its design goals. A key feature of proposed algorithm is its ability to accept or drop a new incoming packet dynamically based on buffer condition and load rate of VCs. This is achieved by using fuzzy logic controller for the production of a drop factor. Simulation results show that proposed scheme significantly has improved fairness and TCP throughput compared with previous schemes.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.669-680
• /
• 2011

R-trees are widely used in various areas such as geographical information systems, CAD systems and spatial databases in order to efficiently index multi-dimensional data. As data sets used in these areas grow in size and complexity, however, range query operations on R-tree are needed to be further faster to meet the area-specific constraints. To address this problem, there have been various research efforts to develop strategies for acceleration query processing on R-tree by using the buffer mechanism or parallelizing the query processing on R-tree through multiple disks and processors. As a part of the strategies, approaches which parallelize query processing on R-tree through Graphics Processor Units(GPUs) have been explored. The use of GPUs may guarantee improved performances resulting from faster calculations and reduced disk accesses but may cause additional overhead costs caused by high memory access latencies and low data exchange rate between GPUs and the CPU. In this paper, to address the overhead problems and to adapt GPUs efficiently, we propose a novel approach which uses a GPU as a buffer to parallelize query processing on R-tree. The use of buffer algorithm can give improved performance by reducing the number of disk access and maximizing coalesced memory access resulting in minimizing GPU memory access latencies. Through the extensive performance studies, we observed that the proposed approach achieved up to 5 times higher query performance than the original CPU-based R-trees.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.163-170
• /
• 2002

Previous buffer cache schemes for continuous media file system only exploited the sequentiality of continuous media accesses and didn't consider looping references. However, in some video applications like foreign language learning, users mark the scene as loop area and then application automatically playbacks the scene several times. In this paper, we propose a novel buffer cache scheme for continuous media file system that sequential and looping references exist together. Proposed scheme increases the cache hit ratio by detecting reference pattern of files and appling an appropriate replacement policy to each file.

• Journal of Korea Multimedia Society
• /
• v.9 no.1
• /
• pp.41-50
• /
• 2006

This paper aims to improve the efficiency of a 3D-graphic software engine in a PDA platform and the performance of a rasterizer. There are many problems in implementing a software engine in a mobile platform, due to its relatively weak processing power. Taking the advantages and complementing weaknesses of the depth-sort algorithm and the Z-buffer algorithm, we implemented an adaptive Z-buffer algorithm and proved its performance on several PDA platforms. Our algorithm was evaluated to have midway speed compared with two conventional algorithms. It also removed reversal errors in comparison with the depth-sort algorithm.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.7
• /
• pp.153-158
• /
• 2016

Delay Tolerant Network (DTN) is a network that employed method of store-carry-forward in intermittently connected networks. In DTNs, routing and buffer management scheme are important to improve successful message delivery. This paper proposes an improve spray and wait routing protocol based on delivery probability to a destination. Also, a buffer management scheme is proposed to drop the queued messages according to the number of copies (L value). Simulation results show that the proposed method provides a better delivery ratio and lower communication overhead when compared to existing schemes such as Epidemic, PRoPHET and spray and wait.