• Journal of Digital Convergence
• /
• v.20 no.4
• /
• pp.459-468
• /
• 2022

In medical area, very high resolution images, which is loss sensitive data, are used. Therefore, the use of optical internet with high bandwidth and the transmission of high realiability is required. However, according to the nature of the Internet, various data use the same bandwidth and a new scheme is needed to differentiate effectively these data. In order to achieve the differentiation, optical delay line buffers are used. However, these buffers is constructed based on some optimal values such as the average offered load, measured data burst length, and basic delay unit. Once the buffers are installed, they are impossible to reinstall new buffers. So, the scheme changing burst length dynamically was considered. However, this method is highly unstable. Therefore, in this article, in order to guarantee the stable operation of the scheme, the analysis of operation conditions is performed. With the analysis together with the scheme, high resolution medical data with the higher class can transmit stably without loss.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.267-284
• /
• 2008

Consider a supply chain where products are produced at a manufacturing system, shipped to a distribution center, and then supplied to customers. The distribution center controls inventory based on a base-stock policy, and whenever a unit of product is demanded by a customer, an order is released to the production system. Unsatisfied demand is backordered, and the inventory and backordered units are a function of the base-stock level. The manufacturing system is modeled as an M/M/s/c queueing system, and orders exceeding the limited buffer capacity are blocked and lost. The throughput of the manufacturing system and the steady state distribution of the outstanding orders are functions of number of servers and buffers of the manufacturing system. There is a profit obtained from throughput and costs due to servers and buffers of the manufacturing system, and also costs due to inventory positions of the distribution center, and we want to maximize the total production profit minus the total cost of the supply chain by simultaneously determining the optimal number of servers and buffers of the manufacturing system and the optimal base-stock level of the distribution center. We develope two algorithms, one analytical but without guarantee of the optimal solution and one optimal but without complete analytical proofs. The problem integrates strategic problem of the manufacturing system with tactical problem of the distribution center in a supply chain.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.314-314
• /
• 1996

We investigate the scheduling problem for periodic job shops with blocking. We develop Petri net models for periodic job shops with finite buffers. A buffer control method would allow the jobs to enter the input buffer of the next machine in the order for which they are completed. We discuss difficulties in using such a random order buffer control method and random access buffers. We thus propose an alternative buffer control policy that restricts the jobs to enter the input buffer of the next machine in a predetermined order. The buffer control method simplifies job flows and control systems. Further, it requires only a cost-effective simple sequential buffer. We show that the periodic scheduling model with finite buffers using the buffer control policy can be transformed into an equivalent periodic scheduling model with no buffer, which is modeled as a timed marked graph. We characterize the structural properties for deadlock detection. Finally, we develop a mixed integer programming model for the no buffer problem that finds a deadlock-free optimal sequence that minimizes the cycle time.

• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.249-257
• /
• 2005

This paper aims at reducing aliasing in pixel-based rendering for 3D implicit surfaces by shifted multi Z-buffers. The voxelized implicit surfaces with high resolution take so much time in generating high Quality image without aliasing. So in rendering a voxelized implicit surfaces, a new antialiasing method which can generate a high quality image at a lower resolution is required. Therefore, this paper suggests that a method which get various sampling values by shifting several z-buffers in each voxel and average them, The advantages are effective memory, simple calculation and easy convergence with various filters. But, the increase of number of z-buffer also increase the consuming time rapidly. Therefore, the research for representing the relation the degree of image quality with the consumption of time as a number is required.

• Journal of Digital Contents Society
• /
• v.8 no.1
• /
• pp.85-91
• /
• 2007

This paper proposes a new hybrid anti-aliasing method for reducing aliasing appearing on an implicit surface using the point sampling. The hybrid anti-aliasing method is a method that finds differences in the values of pixel shown in Z-buffers for an implicit surface and thereby uses each of three types of Z-buffer. After determining the level of differences, it expresses a 3 dimensional object by using a multi Z-buffer if the level is severe, a double Z-buffer for a middle level, and only the original Z-buffer for a negligible difference. In comparison with the existing method in which multi Z-buffers have been entirely used for enhancing the anti-aliasing effect, the hybrid anti-aliasing method is an efficient method demonstrating an effect similar to the one using a multi Z-buffer while reducing the number of Z-buffers to be used.

• Korean Management Science Review
• /
• v.10 no.1
• /
• pp.139-156
• /
• 1993

Various ATM switches have been proposed since Asynchronous Transfer Mode (ATM) was recognized as appropriate for implementing broadband integrated services digital network (BISDN). An ATM switching network may be evaluated on two sides : traffic performances (maximum throughput, delay, and packet loss probability, etc.) and structural features (complexity, i.e. the number of switch elements necessary to construct the same size switching network, maintenance, modularity, and fault tolerance, etc.). ATM switching networks proposed to date tend to show the contrary characteristics between structural features and traffic performance. The Knockout Switch, which is well known as one of ATM switches, shows a good traffic performance but it needs so many switch elements and buffers. In this paper, we propose an input and output buffered Knockout Switch for the purpose of reducing the number of switch elements and buffers of the existing Knockout Switch. We analyze the traffic performance and the structural features of the proposed switching architecture through a discrete time Markov chain and compare with those of the existing Knockout Switch. It was found that the proposed architecture could reduce more than 40 percent of switch elements and more than 30 percent of buffers under a given requirement of cell loss probability of the switch.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.3
• /
• pp.151-160
• /
• 2018

NAND flash memories have the advantages of fast access speed, high density and low power consumption, thus they have increasing demand in embedded system and mobile environment. Despite the low power and fast speed gains of NAND flash memory, DRAM disk buffers were used because of the performance load and limited durability of NAND flash cell. However, DRAM disk buffers are not suitable for limited energy environments due to their high static energy consumption. In this paper, we propose WAP-LRU (Write pattern Analysis based Placement by LRU) hybrid disk buffer management policy. Our policy designates the buffer location in the hybrid memory by analyzing write pattern of the workloads to check the continuity of the page operations. In our simulation, WAP-LRU increased the lifetime of NAND flash memory by reducing the number of garbage collections by 63.1% on average. In addition, energy consumption is reduced by an average of 53.4% compared to DRAM disk buffers.

• The Korean Journal of Zoology
• /
• v.25 no.3
• /
• pp.115-122
• /
• 1982

Plasma albumin was purified from the fresh bovine blood using a minor modification of the polyethyleneglycol and ethanol procedure. The resulting protein solution was tested for its purity by both electrophoretic and immunochemical methods and found to contain only the albumin molecules. Each of the four thiol reagents, maleate, iodoacetate, iodoacetamide and glutathione, was incubated with the purified plasma albumin. The electrophoresis on cellulose acetate of those complexes in various buffers with different component and pH demonstrated that the albumin-glutathione complex was separated into two zones in all buffers used except the barbital and sodium acetate buffers, that the complexes of albumin-iodoacetate and albumin-iosoacetamide also into two zones only in pH 4.8 citrate buffer and in pH 4.8 succinate buffer and that the new zone had more positive net charge compared to the native protein in any case. These results might suggest a possibility that the electrophoretic albumin fraction is composed of at least two molecular species with different conformation.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.11
• /
• pp.73-82
• /
• 2003

In this paper, a simultaneous buffer insertion and routing method is proposed under the constraints of wire and buffer locations by macro or IP blocks. A new grid graph is proposed to describe the regions in which buffers(or both wires and buffers) are not available. Under this grid we describe a method of constructing a buffeted tree that minimize the maximum source to sink delay. The method is based on the dynamic programming with pruning unnecessary partial solutions. The proposed method improved the slack time of the delay by 19% on the average while using less buffers and similar wire length.

• KSBB Journal
• /
• v.15 no.5
• /
• pp.452-457
• /
• 2000

Due to the advantage of RP-HPLC with a variety of compositions of mobile phases, experiments on water-soluble charged species were examined. The samples were mononucleotides (5-CMP, 5-UMP, 5-GMP, 5-IMP, 5-AMP), and the buffers used were sodium phosphate monobasic and acetic acid. The concentrations of buffers ranged from 0.01 to 10 mM, while that of the methanol, an additive to the mobile phase was 5 to 20 vol.%. To predict the retention factor of a sample in terms of its methanol composition (M, vol.%) and buffer(C(sub)B, mM), the following nonlinear equation is suggested, k= $\frac{a+b C_B}{(1+c C_B) M^d}($ where a, b, c, and d were experimentally determined constants. The regression coefficients were above 0.96, and the agreement between experimental and calculated retention factors were relatively good.