• The KIPS Transactions:PartB
• /
• v.10B no.2
• /
• pp.143-150
• /
• 2003

Error concealment plays an important role in combating transmission errors. Methods of error concealment which produce better quality are generally of higher complexity, thus making some of the more sophisticated algorithms is not suitable for real-time applications. In this paper, we develop temporal and spatial error resilient video encoding and data hiding approach to facilitate the error concealment at the decoder. Block interleaving scheme is introduced to isolate erroneous blocks caused by packet losses for spatial area of error resilience. For temporal area of error resilience, data hiding is applied to the transmission of parity bits to protect motion vectors. To do error concealment quickly, a set of edge features extracted from a block is embedded imperceptibly using data hiding into the host media and transmitted to decoder. If some part of the media data is damaged during transmission, the embedded features are used for concealment of lost data at decoder. This method decreases a complexity of error concealment by reducing the estimation process of lost data from neighbor blocks. The proposed data hiding method of parity bits and block features is not influence much to the complexity of standard encoder. Experimental results show that proposed method conceals properly and effectively burst errors occurred on transmission channel like Internet.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1166-1176
• /
• 1999

연속 매체, 특히 비디오 데이타에 대한 일반 사용자 연산에는 재생뿐만 아니라 임의 속도 탐색 연산, 정지 연산, 그리고 그 외 다양한 연산이 있다. 이 연산 중에서 원하는 화면을 빨리 찾는 데에 유용한 고속 전진(FF: fast-forward)과 고속 후진(FB: fast-backward)은 재생 연산과는 달리 비순차적인 디스크 접근을 요구한다. 이러한 경우에 디스크 부하가 균등하지 않으면 일부 디스크에 접근이 편중되어 서비스 품질이 떨어진다. 본 논문에서는 디스크 배열을 이용한 저장 시스템에서 디스크 접근을 고르게 분산시키기 위하여 '소수 라운드 로빈(PRR: Prime Round Robin)' 방식으로 연속 매체를 디스크에 배치하는 기법에서 문제가 됐던 낭비된 디스크 저장 공간을 신뢰도 향상을 위해서 사용하는 '그룹화된 패리티를 갖는 소수 라운드 로빈(PRRgp: PRR with Grouped Parities)' 방식을 제안한다. 이 기법은 PRR 기법처럼 임의 속도 검색 연산에 있어서 디스크 배열을 구성하는 모든 디스크의 부하를 균등하게 할뿐만 아니라 낭비됐던 디스크 저장 공간에 신뢰도를 높이기 위한 패리티 정보를 저장함으로서 신뢰도를 향상시킬 수 있다. 신뢰도 모델링 방법으로 조합 모델과 마르코프 모델을 이용해서 결함발생율과 결함복구율을 고려한 신뢰도를 산출하고 비교.분석한다. PRR 기법으로 연속 매체를 저장하고 낭비되는 공간에 패리티 정보를 저장할 경우에 동시에 두 개 이상의 결함 발생 시에 그 결함으로부터 복구가 불가능하지만 PRRgp 기법에서는 약 30% 이상의경우에 대해서 동시에 두 개의 결함 발생 시에 저장한 패리티 정보를 이용한 복구가 가능할 뿐만 아니라 패리티 그룹의 수가 두 개 이상인 경우에는 두 개 이상의 결함에 대해서도 복구가 가능하다.Abstract End-user operations on continuous media (say video data) consist of arbitrary-rate search, pause, and others as well as normal-rate play. FF(fast-forward) / FB(fast-backward) among those operations are desirable to find out the scene of interest but they require non-sequential access of disks. When accesses are clustered to several disks without considering load balance, high quality services in playback may not be available. In this paper, we propose a new disk placement scheme, called PRRgp(Prime Round Robin with Grouped Parities), with enhanced reliability by using the wasted disk storage space in an old one(PRR: Prime Round Robin), in which continuous media are placed on a disk array based storage systems to distribute disk accesses uniformly. The PRRgp can not only achieve load balance of disks consisting of a disk array under arbitrary-rate search like PRR, but also improve reliability by storing parity information on the wasted disk space appropriately. We use combinatorial and Markov models to evaluate the reliability for a disk array and to analyze the results. When continuous media like PRR are placed and parity information on the wasted disk space is stored, we cannot tolerate more than two simultaneous faults. But they can be recovered by using stored parity information for about 30 percent as a whole in case of PRRgp presented in this paper. In addition, more than two faults can be tolerated in case there are more than two parity groups.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.708-713
• /
• 2003

For many years clustered heterogeneous web server architecture has been formed on the internet because the explosive internet services and the various quality of requests. The critical point in cluster environment is the mapping schemes of request to server. and recently this is the main issue of internet architecture. The topic of previous mapping methods is to assign equal loads to servers in cluster using the number of requests. But recent growth of various services makes it hard to depend on simple load balancing to satisfy appropriate latency. So mapping based on requested content to decrease response time and to increase cache hit rates on entire servers - so called “content-based” mapping is highly valuated on the internet recently. This paper proposes Prioritized Highest Random Weight mapping(PHRW mapping) that improves content-based mapping to properly fit in the heterogeneous environment. This mapping scheme that assigns requests to the servers with priority, is very effective on heterogeneous web server cluster, especially effective on decreasing latency of reactive data service which has limit on latency. This paper have proved through algorithm and simulation that proposed PHRW mapping show higher-performance by decrease in latency.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1311-1319
• /
• 1998

The methods of providing available bandwidth adaptively using feedback to maximize the utilization of network as well as the quality of service have been the focus of recent research activities for ATM(Asynchronous Transfer Mode). This study has been extended from the point-to-point connection to a point-to-multipoint environment as the number of applications requiring multicast service increases. It is known that the effectiveness of feedback based congestion control scheme diminishes as propagation delay increases. Especially for a multicast connection consisting of various paths and destinations with different performance and congestion status, the problem of unfairness due to different propagation delays may occur. The degree of such unfairness may change depending on various aspects of congestion control schemes. These has been, however, relatively little study on these problems. In this paper, we present how various aspects of control schemes-length of the interval between feedback generations, point of time to coalesce feedback cells from child paths, decreasing factor of source rate in case of congestion-affect the degree of unfairness. Simulation results show that degree of unfairness changes according to when the feedback coalescing happens. Expecially it is shown that the effect of feedback coalescing time to the degree of unfairness is more significant for the smaller feedback interval. It is also found that as the source rate decreasing factor becomes larger the average ACR(Allowed Cell Rate) at the source gets lower and the degree of unfairness grow larger.

• Resources Recycling
• /
• v.23 no.5
• /
• pp.44-54
• /
• 2014

A standard plastic garbage bag which was discarded from Incheon Metropolitan City was composed of 4.5% recyclable resources (aluminum cans 0.2%, steel cans 2.5%, glass 1.8%), 92.5% resources with recoverable energy (papers 23.0%, plastics 15.5%, combustible etc. 54.0%) and 3.0% non-combustible etc. Recycling is more effective than landfilling for aluminum cans, steel cans, and glass. The energy recovery process using solid refuse fuel (SRF) is more effective than incineration for papers and plastics. Incineration is more effective than recycling for combustible etc. 2,068,948 Million Btu of total energy savings and 21,008 $MTCO_2E$ of total GHG reductions were obtained by the application of the proposed scheme. The total energy savings were equivalent to an economic benefit of 422 billion won per year. The total GHG reductions were equivalent to a GHG benefit of 4,119 passenger cars not running per year. The lower calorific value of the combustible materials was obtained to be 1,936 kcal/kg of papers, 5,079 kcal/kg of plastics and 2,462 kcal/kg of combustible other resources, respectively. If papers and plastics are properly mixed, the mixture can be used as SRF. The lower calorific value of combustible other resources does not meet the quality criteria for refuse derived fuel, therefore its components are inappropriate to used as solid refuse fuel.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.7
• /
• pp.219-230
• /
• 2014

In the cloud computing environment, cloud service users purchase and use the virtualized resources from cloud resource providers on a pay as you go manner. Typically, there are two billing plans for computing resource allocation adopted by large cloud resource providers such as Amazon, Gogrid, and Microsoft, on-demand and reserved plans. Reserved Virtual Machine(VM) instance is provided to users based on the lengthy allocation with the cheaper price than the one of on-demand VM instance which is based on shortly allocation. With the proper mixture allocation of reserved and on-demand VM corresponding to users' requests, cloud service providers are able to reduce the resource allocation cost. To do this, prior researches about VM allocation scheme have been focused on the optimization approach with the users' request prediction techniques. However, it is difficult to predict the expected demands exactly because there are various cloud service users and the their request patterns are heavily fluctuated in reality. Moreover, the previous optimization processing techniques might require unacceptable huge time so it is hard to apply them to the current cloud computing system. In this paper, we propose the cloud brokering system with the adaptive VM allocation schemes called A3R(Adaptive 3 Resource allocation schemes) that do not need any optimization processes and kinds of prediction techniques. By using A3R, the VM instances are allocated to users in response to their service demands adaptively. We demonstrate that our proposed schemes are able to reduce the resource use cost significantly while maintaining the acceptable Quality of Service(QoS) of cloud service users through the evaluation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.246-253
• /
• 2010

In this paper, a method of removing the space skew and cross-talk cancellation is proposed where the self-generated signals from the subject are used to obtain the subject's location. In the proposed method, the good spatial sound image is maintained even when the listener moves from the sweet spot. Two major parts of the proposed method are as follows: listener position tracking using the stimuli from the subject and removal of the space skew and cross-talk signals. Listener position tracking is achieved by estimation of the time difference of arrival (TDoA). The position of the listener is then computed using the Talyer-series estimation method. The head-related transfer functions (HRTF) are used to remove the space skew and cross-talk signals, where the direction of the HRTF is given by the one estimated from the listener position tracking. The performance evaluation is carried out on the signals from the 100 subjects that are composed of the 50 female and 50 male subjects. The positioning accuracy is achieved by 70%~90%, under the condition that the mean squared positioning error is less than $0.07m^2$. The subjective listening test is also conducted where the 27 out of the 30 subjects are participated. According to the results, 70% of the subjects indicates that the overall quality of the reproduced sound from the proposed method are improved, regardless of the subject's position.

• Proceedings of the KOSOMBE Conference
• /
• v.1998 no.11
• /
• pp.55-56
• /
• 1998

The 3-D Fast Gradient Echo (Turbo FLASH, Turbo Fast Low Angle Shot) sequence is optimized to achieve a good T1 contrast using variable excitation flip angles. In Turbo FLASH sequence, depending on the contrast preparation scheme, various types of image contrast can be established. While proton density contrast is obtained when using a short repetition time with a short echo time and small flip angles, T1 or T2 weighting can be obtained with proper contrast preparation sequences applied before the above proton density Turbo FLASH sequence. To maximize the contrast to noise ratio while retaining a sharp impulse response (smooth frequency domain response), the excitation flip-angle pattern is optimized through simulation and experiments. The TI (the delay after the preparation sequence which is a 180 degree inversion RF pulse in the IR T1 weighted imaging case), TD (the delay time between the Turbo FLASH sequence and the next preparation), and TR are also optimized fur the best image quality. The proposed 3-D Turbo FLASH provides $1mm\times1mm\times1.5mm$ high resolution images within a reasonable 5-8 minutes of imaging time. The proposed imaging sequence has been implemented in a Medison's Magnum 1.0T system and verified through simulations as well as human volunteer imaging. The experimental results show the utility of the proposed method.

• International Journal of Highway Engineering
• /
• v.8 no.2 s.28
• /
• pp.1-12
• /
• 2006

An existing Steel pipe, Cast iron pipe and Concrete pipe is can not escaped from aging, specially Metal tube is causing many problems that the quality of water worse is concerned about many rust and mike efficient use of preservation of water. The use of Glassfiber Reinforced Plastic Pipe(GRP PIPE) should be one of the possible scheme to get over these problems. The GRP PIPE has an excellent resistance power and the life is lasting from 50 to 100 years roughly. It's to be useful as a result of high durability and a good construction work also it is a light weight therefore can be expected to short the time of construction and man power. In this research, to executed the small-scaled model test, in-situ model test using CLSM of in-situ soil and to evaluated the stress - strain of the pipe also try to estimated how useful is. From the model test in laboratory, the vertical and horizontal deformation of the GRP PIPE measured in six instance using 200mm and 300mm in diameters. The value of experimentation, theory, analysis got the same results of the test, but the vertical and horizontal deformation gauged in small and the earth pressure was almost zero using CLSM of in-situ soil..

• Journal of Hospice and Palliative Care
• /
• v.20 no.1
• /
• pp.8-17
• /
• 2017

Globally, efforts are being made to develop and strengthen a palliative care policy to support a comprehensive healthcare system. Korea has implemented a hospice and palliative care (HPC) policy as part of a cancer policy under the 10 year plan to conquer cancer and a comprehensive measure for national cancer management. A legal ground for the HPC policy was laid by the Cancer Control Act passed in 2003. Currently in the process is legislation of a law on the decision for life-sustaining treatment for HPC and terminally-ill patients. The relevant law has expanded the policy-affected disease group from terminal cancer to cancer, human immunodeficiency virus/acquired immune deficiency syndrome, chronic obstructive pulmonary disease and chronic liver disease/liver cirrhosis. Since 2015, the National Health Insurance (NHI) scheme reimburses for HPC with a combination of the daily fixed sum and the fee for service systems. By the provision type, the HPC is classified into hospitalization, consultation, and home-based treatment. Also in place is the system that designates, evaluates and supports facilities specializing in HPC, and such facilities are funded by the NHI fund and government subsidy. Also needed along with the legal system are consensus reached by people affected by the policy and more realistic fee levels for HPC. The public and private domains should also cooperate to set HPC standards, train professional caregivers, control quality and establish an evaluation system. A stable funding system should be prepared by utilizing the long-term care insurance fund and hospice care fund.