• Journal of Information Technology Applications and Management
• /
• v.11 no.2
• /
• pp.179-190
• /
• 2004

This paper describes the design of hacking prevention systems using a smart card. It consists of two parts, i.e., PC authentication and Keyboard-buffer hacking prevention. PC authentication function is a procedure to handle the access control to the target PC. The card's serial number is used for PIN(Personal Identification Number) and is converted into hash-code by SHA-1 hash-function to verify the valid users. The Keyboard-buffer hacking prevention function converts the scan codes into the encoded forms using RSA algorithm on the Java Card, and puts them into the keyboard-buffer to protect from illegal hacking. The encoded information in the buffer is again decoded by the RSA algorithm and displayed on the screen. in this paper, we use RSA_PKCS#1 algorithm for encoding and decoding. The reason using RSA technique instead of DES or Triple-DES is for the expansion to multi-functions in the future on PKI. Moreover, in the ubiquitous computing environment, this smart card security system can be used to protect the private information from the illegal attack in any computing device anywhere. Therefore, our security system can protect PC user's information more efficiently and guarantee a legal PC access authority against any illegal attack in a very convenient way.

• Journal of Power System Engineering
• /
• v.11 no.1
• /
• pp.76-81
• /
• 2007

The objective of this study is to find the optimum design of a snubber using CFD analysis. Several dimensions such as snubber height(H), snubber diameter(D), buffer width and buffer angle are considered in this study. The present study shows that the CFD can be applied to study the pressure characteristics inside the snubber. The objective of the snubber design optimization are to minimize a pressure loss and the pulsation ratio. Numerical results such as particle track, pressure distribution and turbulent kinetic energy are used to analyze the critical area and pressure behavior inside the snubber. As a result, snubber model with H/D ratio of 3.23 and buffer angle of $40^{\circ}$ has a minimum pressure loss. On the other hand, snubber model with H/D ratio 4.41 and buffer angle $10^{\circ}$ has a minimum pulsation ratio.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.21 no.2
• /
• pp.225-234
• /
• 2023

In the design of HLW repositories, it is important to confirm the performance and safety of buffer materials at high temperatures. Most existing models for predicting hydraulic conductivity of bentonite buffer materials have been derived using the results of tests conducted below 100℃. However, they cannot be applied to temperatures above 100℃. This study suggests a prediction model for the hydraulic conductivity of bentonite buffer materials, valid at temperatures between 100℃ and 125℃, based on different test results and values reported in literature. Among several factors, dry density and temperature were the most relevant to hydraulic conductivity and were used as important independent variables for the prediction model. The effect of temperature, which positively correlates with hydraulic conductivity, was greater than that of dry density, which negatively correlates with hydraulic conductivity. Finally, to enhance the prediction accuracy, a new parameter reflecting the effect of dry density and temperature was proposed and included in the final prediction model. Compared to the existing model, the predicted result of the final suggested model was closer to the measured values.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.2
• /
• pp.131-142
• /
• 2005

This paper proposes queueing models for a Web server system which is composed of an infinite-buffer main server and finite-buffer auxiliary server(s). The system is modeled by the level-dependent quasi-birth- death (QBD) process. Utilizing the special structure of the QBD, we convert the infinite level-dependent QBD into a finite level-independent QBD and compute the state probabilities. We then explore the operational characteristics of the proposed web-server models and draw some useful conclusions.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.677-684
• /
• 2003

Most policies of VOD services are mainly studied about server system, and make no touch on clients buffer stabilization which is the basis of guaranteeing playback quality and playing without cut off. In this paper, we proposed a skipping frame transfer policy that can sending dynamic buffer control signal to server in accordance with clients buffer state of starvation or overrun, and server transfers a skipped frame to client after receive the control signal. And through a simulation, we show the suggested policy is more efficiency on playback quality by buffer stabilization which is by preventing loss and miss for receiving frame due to grow worse client buffer state.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3856-3872
• /
• 2018

HTTP-based adaptive streaming (HAS) has recently been widely deployed on the Internet. In the HAS system, a video content is encoded at multiple bitrates and the encoded video content is segmented into small parts of fixed durations. The HAS client requests a video segment and stores it in the playout buffer. The rate adaptation algorithm employed in HAS clients dynamically determines the video bitrate depending on the time-varying bandwidth. Many studies have shown that an efficient rate adaptation algorithm is critical to ensuring quality-of-experience in HAS systems. However, existing algorithms have problems estimating the network bandwidth because bandwidth estimation is performed on the client-side application stack. Without the help of transport layer protocols, it is difficult to achieve accurate bandwidth estimation due to the inherent segment-based transmission of the HAS. In this paper, we propose an alternative approach that utilizes the playout buffer occupancy rather than using bandwidth estimates obtained from the application layer. We start with a queueing analysis of the playout buffer. Then, we present a buffer-aware rate adaptation algorithm that is solely based on the mean buffer occupancy. Our simulation results show that compared to conventional algorithms, the proposed algorithm achieves very smooth video quality while delivering a similar average video bitrate.

• KSBB Journal
• /
• v.15 no.6
• /
• pp.605-608
• /
• 2000

Oligodeoxynucleotides (ODNs) were separated by high-performance membrane chromatography (HPMC), a combined system of chromatography and membrane. The separation mechanism involved anion-exchange, and the stationary phase was cation CIM (Convective Interaction Media) DEAE disk (16${\times}$3 mm). Two types of mobile phase were used, buffer A (20mM Tris-HCl, pH 7.4) and buffer B (buffer A + 1M NaCl). As the amount of NaCl dissolved in buffer linearly increased, the retention time shortened, which enabled a gradient elution mode. Based on the number of theoretical plates and resolution observed, the optimum mobile phase and operating condition (Buffer A/Buffer B=50/50 - 20/80 vol%, gradient time 2 min) were experimentally determined. In this experimental condition, ODNs were separated within 2 min at a mobile phase flow rate of 6 ml/min.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.47-56
• /
• 2002

Previous buffer cache schemes for multimedia storage systems only exploited the sequential references of multimedia files 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 new buffer replacement scheme, called HBM(Hybrid Buffer Management), for multimedia storage systems that have both sequential and looping references. Proposed scheme assumes that application layer informs reference pattern of files to file system. Then HBM applies an appropriate replacement policy to each file. Our simulation experiments show that HBM outperforms previous buffer cache schemes such as DISTANCE and LRU.

• The KIPS Transactions:PartB
• /
• v.17B no.6
• /
• pp.413-420
• /
• 2010

In this paper, we propose a scheme for dynamic allocating network bandwidth based on the playback buffer levels of the clients in a distributed mobile multimedia system. In this scheme, the amount of bandwidth allocated to serve a video request depends on the buffer level of the requesting client. If the buffer level of a client is low or high temporarily, more or less bandwidth will be allocated to serve it with an objective to make it more adaptive to the playback situation of this client. By employing the playback buffer level based bandwidth allocation policy, fair services can also be provided to the clients. In order to support high quality video playbacks, video frames must be transported to the client prior to their playback times. The main objectives in this bandwidth allocation scheme are to enhance the quality of service and performance of individual video playback such as to minimize the number of dropped video frames and at the same time to provide fair services to all the concurrent video requests. The performance of the proposed scheme is compared with that of other static bandwidth allocation scheme through extensive simulation experiments, resulting in the 4-9% lower ratio of frames dropped according to the buffer level.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.3
• /
• pp.329-340
• /
• 2001

Video server which stores video streams should serve more users with the requested streams rapidly, satisfying their time constraints. For this objective, the storage system of the video server needs large disk bandwidth and buffer capacity. But, because given disk bandwidth and buffer capacity are limited, technologies that utilize effectively the given disk bandwidth and buffer capacity without waste might be needed. In this paper, we propose the policies that not only reduce the startup latency but also, support more users by utilizing the disk bandwidth and buffer efficiently, which also considering time constraint characteristics of video stream. In order to reduce the startup latency of the service requests, it inducts the effect of random access of disk head by moving asynchronously disk heads in multiple disk environments. Also, there are two technologies to support more users. First, the proposed policy reduces the seek latency by moving the disk head sequentially so that it saves the disk bandwidth. Second, it determines the segment size through considering both given buffer capacity and given disk bandwidth by heuristic approach in order to overcome the constraints of the number of streams supported due to limitation of buffer capacity. The segment size makes it utilize given buffer optimally with given disk bandwidth. The correctness of the proposed policies is not only analyzed theoretically but also evaluated through simulations.