• 한국태양에너지학회:학술대회논문집
• /
• 2012.03a
• /
• pp.400-403
• /
• 2012

$Cu_2ZnSnSe_4$(CZTSe) is emerged as a promising material for thin-film solar cells because of non-toxic, inexpensive and earth abundant more than $Cu(In,Ga)Se_2$ materials. For fabricating compound semiconductor thin-film solar cells, CdS is widely used for a buffer layer which fabricated by a chemical bath deposition method (CBD). Through the experiment, we controlled deposition temperature and mol ratio of solution conditions to find the proper grain 크기 and exact composition. The optimum CdS layers were characterized in terms of surface morphology by using a scanning electron microscope (SEM) and atomic force microscope (AFM). The optimized CdS layer process was applied on CZTSe thin-films. The thickness of buffer layer related with device performance of solar cells which controlled by deposition time. Local surface potential of CdS/CZTSe thin-films was investigated by Kelvin probe force microscopy (KPFM). From these results, we can deduce local electric properties with different thickness of buffer layer on CZTSe thin-films. Therefore, we investigated the effect of CdS buffer layer thickness on the CZTSe thin-films for decreasing device losses. From this study, we can suggest buffer layer thickness which contributes to efficiencies and device performance of CZTSe thin-film solar cells.

• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.1-12
• /
• 2000

Many object oriented database systems manage object buffers to provide fast access to objects. Traditional buffer replacement algorithms based on fixed length pages simply assume that the cost incurred by operating a buffer is propertional to the number of buffer faults. However, this assumption no longer holds in an objects buffer where objects are of variable length and the cost of replacing an object varies for each object. In this paper, we propose a cost based replacement algorithm for object buffers. The proposed algorithm replaces the have minimum costs per unit time and unit space. The cost model extends the previous page based one to include the replacement costs and the sizes of objects. The performance tests show that proposed algorithm is almost always superior to the LRU-2 algorithm and in some cases is more than twice as fast. The idea of cost based replacement can be applied to any buffer management architectures that adopt earlier algorithms. It is especially useful in object oriented database systems where there is significant variation in replacement costs.

• Analytical Science and Technology
• /
• v.30 no.1
• /
• pp.39-48
• /
• 2017

Roxithromycin (RXT), which is an antibiotic used to treat respiratory tract and urinary infections, is official in Korean Pharmacopoeia (KP) and is marketed in various dosage forms including tablet, granule, suspension, and tablet for suspension in Korea. This study presents how a universal and reliable method to quantify RXT in bulk drug and formulations was developed. Effects of factors including column type, buffer concentration, type and concentration of organic solvent, buffer pH, and type and concentration of mobile phase additive, were examined, and some categorical or crucial factors including the types of column, organic solvent, mobile phase additive and the buffer pH were optimized by one-factor-at-a-time approach. Subsequently, concentrations of the buffer and additive and column temperature were optimized by response surface methodology using Box-Behnken design aiming to acquire the RXT peak of good shape. The optimized method employed a Phenomenex Gemini $5{\mu}$ C18 110A ($150{\times}4.60mm$, $5{\mu}m$) maintained at $30^{\circ}C$ with the mobile phase consisting of 25 mM phosphate buffer (pH 6.0) with 0.3 % tetrabutylammonium hydroxide and methanol at a ratio of 37:63 (v/v). Method validation results showed that the developed method was linear, precise, and accurate. Compared to the compendial methods in KP 10 that exhibited a significant tailing of the RXT peak despite using unfavorably high buffer concentrations and were not harmonized among bulk drug and formulations, this method could be universally applied to RXT bulk drug and marketed products in various dosage forms and thus was adopted in KP 11.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.535-540
• /
• 2005

This paper presents a scalable caching algorithm of proxy server with the finite storage size minimizing client's buffer size and constant-bit-rate channel bandwidth. Under the general video traffic condition, it is observed that the amount of decreased client's buffer size and channel bandwidth after caching a video frame depends on the relative frame position in the time axis as the frame size. Based on this fact, we propose an effective caching algorithm to select the cached frames by using the normalized buffer size. Finally, experimental results are provided to show the superior performance of the proposed alghrithm.

• The KIPS Transactions:PartD
• /
• v.14D no.7
• /
• pp.719-726
• /
• 2007

Recently, NAND flash memory has been used for a storage device in various mobile computing devices such as MP3 players, mobile phones and laptops because of its shock-resistant, low-power consumption, and none-volatile properties. However, due to the very distinct characteristics of flash memory, disk based systems and applications may result in severe performance degradation when directly adopting them on flash memory storage systems. Especially, when a B-tree is constructed, intensive overwrite operations may be caused by record inserting, deleting, and its reorganizing, This could result in severe performance degradation on NAND flash memory. In this paper, we propose an efficient buffer management scheme, called IBSF, which eliminates redundant index units in the index buffer and then delays the time that the index buffer is filled up. Consequently, IBSF significantly reduces the number of write operations to a flash memory when constructing a B-tree. We also show that IBSF yields a better performance on a flash memory by comparing it to the related technique called BFTL through various experiments.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.5
• /
• pp.285-291
• /
• 2010

Flash memory has many good features such as small size, shock-resistance, and low power consumption, but the cost of flash memory is still high to substitute for hard disk entirely. Recently, some mobile devices, such as laptops, attempt to use both flash memory and hard disk together for taking advantages of merits of them. However, existing OSs (Operating Systems) are not optimized to use the heterogeneous storage media. This paper presents a new buffer cache management scheme. First, we allocate buffer cache space according to access patterns of block references and the characteristics of storage media. Second, we prefetch data blocks selectively according to the location of them and access patterns of them. Third, we moves destaged data from buffer cache to hard disk or flash memory considering the access patterns of block references. Trace-driven simulation shows that the proposed schemes enhance the buffer cache hit ratio by up to 29.9% and reduce the total I/O elapsed time by up to 49.5%.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.1-11
• /
• 2006

It is possible to track the moving vehicle as well as to develop the location based services actively according to the progress of wireless telecommunication and GPS, to the spread of network, and to the miniaturization of cellular phone. To provide these location based services, it is necessary for an index technique to store and search too much moving object data rapidly. However the existing indices require a lot of costs to insert the data because they store every position data into the index directly. To solve this problem in this paper, we propose a buffer node operation and design a GU-tree(Group Update tree). The proposed buffer node method reduces the input cost effectively since the operation stores the moving object location data in a group, the buffer node as the unit of a non-leaf node. hnd then we confirm the effect of the buffer node operation which reduces the insert cost and increase the search performance in a time slice query from the experiment to compare the operation with some existing indices. The proposed tufter node operation would be useful in the environment to update locations frequently such as a transportation vehicle management and a tour-guide system.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.11
• /
• pp.5512-5517
• /
• 2012

In this paper we suggest multimedia synchronization model that is based on the Petri-net and services desirable quality of service requirement. Proposed model applies variable buffer which can be allowed, and then it presents high quality of service and real time characteristics. This paper decreases the data loss resulted from variation of delay time and from loss time of media-data by means of applying delay jitter in order to deal with synchronization interval adjustment. Plus, the mechanism adaptively manages the waiting time of smoothing buffer, which leads to minimize the gap from the variation of delay time. The proposed paper is suitable to the system which requires the guarantee of high quality of service and mechanism improves quality of services such as decrease of loss rate, increase of playout rate.

• Journal of Broadcast Engineering
• /
• v.18 no.3
• /
• pp.491-494
• /
• 2013

This paper proposes a stochastic/dynamic routing protocol which aims the minimization of the summation of time average expected power expenditure with buffer stability in mobile ad-hoc 60 GHz wireless networks. By using 60 GHz RF, the wireless devices can transmit/receive 1080p HD video signals without compression. In addition, our algorithm works without centralized controller, so that the distributed operation is available. The novelty of the proposed algorithm was also verified by simulations.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1209-1218
• /
• 2003

To guarantee client buffer stabilization and visual quality, the VOD service that provides real time video titles on requirements of numerous users, needs a mechanism which transfers frames with dropping or skipping algorithm by network condition. In this paper, we show an algorithm that transfers withdrawed skipped MPEG frames(I, P, B frame) from disk to client dependent on network load. Moreover, we verify through a simulation that adaptive dealing on network load can reduce the network load and stabilize client receiving buffer.