• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.631-636
• /
• 2006

최근 많은 사용자들이 인터넷 상에서 비디오나 오디오 같은 규모가 큰 미디어 콘텐츠(Media contents)의 정보 전달을 효율적으로 제공 받기를 원하고 있다. 미디어 콘텐츠를 스트리밍 하는 것은 인터넷 트래픽의 아주 큰 부분을 차지하기 때문에, 우리는 클러스터형 협업 프록시를 기반으로 한 다중 디스크립션 비디오 스트리밍 구조를 제안하여 네트워크와 서버의 부하를 클러스터된 일반 프록시들에게 균등하게 분산 시킨다. MDC(Multiple Description Coding)[1]를 적용하여 캐싱 공간(Caching space)을 효율적으로 사용하며 다중 세션을 통해 디스크립션을 서비스함으로써 스트리밍 서비스 중인 프록시 또는 전체 데이터를 저장하고 하는 서버에 문제가 생기더라도 끊어지지 않는 계속적인 서비스가 가능하다. 또한 일반 프록시들의 정보를 관리하는 디스패처가 사용자의 환경에 따라 적응적인 서비스를 가능하게 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.491-508
• /
• 2010

In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable clients to watch videos from beginning to end. As long as clients are able to buffer the initial part of the video they are watching, on-demand service can provide access to the video to the next clients who request to watch it. Therefore, the key challenge is how to keep the initial part of a video in a peer's buffer for as long as possible, and thus maximize the availability of a video for stream relay. In addition, to address the issues of delivering data on lossy network and providing scalable quality of services for clients, the adoption of multiple description coding (MDC) has been proven as a feasible resolution by much research work. In this paper, we propose a novel caching scheme for P2P on-demand streaming, called Dynamic Buffering. The proposed Dynamic Buffering relies on the feature of MDC to gradually reduce the number of cached descriptions held in a client's buffers, once the buffer is full. Preserving as many initial parts of descriptions in the buffer as possible, instead of losing them all at one time, effectively extends peers’ service time. In addition, this study proposes a description distribution balancing scheme to further improve the use of resources. Simulation experiments show that Dynamic Buffering can make efficient use of cache space, reduce server bandwidth consumption, and increase the number of peers being served.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2001.11b
• /
• pp.589-592
• /
• 2001

In this paper, Electronic ballast for multiple fluorescent lamps based on the use of ferrite beads are presented. The use of this system in place of the conventional electromagnetic ballast results in lower power consumption and reduced maintenance cost, because the electronic system has higher efficiency and longer lamp lifetime than the electromagnetic ballast. In comparison with the conventional electronic ballast. The proposed system presents a significant reduction of cost. This reduction becomes were meaningful with the growing of the lamp number. The description of the lighting system, We show that the proposed model can be applied to multiple lamps electronic ballast by simulation processes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2166-2180
• /
• 2016

We investigate the opposite of artificial noise (AN)-assisted communication in multiple-input-multiple-output (MIMO) wiretap channels for the multiuser case by taking the side of the eavesdropper. We first define a framework for an AN-assisted multiuser multiple-input-multiple-output (MU-MIMO) system, for which eavesdropping methods are proposed with and without knowledge of legitimate users' channel state information (CSI). The proposed method without CSI is based on a modified joint approximate diagonalization of eigen-matrices algorithm, which eliminates permutation indetermination and phase ambiguity, as well as the minimum description length algorithm, which blindly estimates the number of secret data sources. Simulation results show that both proposed methods can intercept information effectively. In addition, the proposed method without legitimate users' CSI performs well in terms of robustness and computational complexity.

• The Journal of Advanced Prosthodontics
• /
• v.2 no.1
• /
• pp.1-3
• /
• 2010

BACKGROUND. Even though excellent impression materials are now available for making accurate replication for hard and soft tissue, the numerous dentists have faced lots of obstacles in making simultaneous impressions of multiple abutments. CASE DESCRIPTION. This article describes a modified method of tray fabrication using auto-polymerizing acrylic resin and impression technique for multiple prepared teeth in cases with limitations and difficulties in taking dental impressions. CLINICAL IMPLICATION. This segmental tray technique has several advantages, including higher impression quality, fewer impressions, and being more comfortable for the patient and less stressful for the clinician.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1274-1276
• /
• 1993

We have designed a multiple-valued fuzzy Approximate Analogical-Reseaning system (AARS). The system uses a similarity measure of fuzzy sets and a threshold of similarity ST to determine whether a rule should be fired, with a Modification Function inferred from the Similarity Measure to deduce a consequent. Multiple-valued basic fuzzy blocks are used to construct the system. A description of the system is presented to illustrate the operation of the schema. The results of simulations show that the system can perform about 3.5 x 106 inferences per second. Finally, we compare the system with Yamakawa's chip which is based on the Compositional Rule of Inference (CRI) with Mamdani's implication.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2001.11a
• /
• pp.589-592
• /
• 2001

In this paper, Electronic ballast for multiple fluorescent lamps based on the use of ferrite beads are presented. The use of this system in place of the conventional electromagnetic ballast results in lower power consumption and reduced maintenance cost, because the electronic system has higher efficiency and longer lamp lifetime than the electromagnetic ballast. In comparison with the conventional electronic ballast. The proposed system presents a significant reduction of cost. This reduction becomes were meaningful with the growing of the lamp number. The description of the lighting system, We show that the proposed model can be applied to multiple lamps electronic ballast by simulation processes.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.5
• /
• pp.901-908
• /
• 2010

A geometrical description method is proposed to represent the process of the forward selection and backward elimination methods among many variable selection methods for multiple regression models. This graphical method shows the process of the forward selection and backward elimination on the first and second quadrants, respectively, of half circle with a unit radius. At each step, the SSR is represented by the norm of vector and the extra SSR or partial determinant coefficient is represented by the angle between two vectors. Some lines are dotted when the partial F test results are statistically significant, so that statistical analysis could be explored. This geometrical description can be obtained the final regression models based on the forward selection and backward elimination methods. And the goodness-of-fit for the model could be explored.

• Journal of Information Processing Systems
• /
• v.16 no.5
• /
• pp.1083-1094
• /
• 2020

Recognizing plant species based on leaf images is challenging because of the large inter-class variation and inter-class similarities among different plant species. The effective extraction of leaf descriptors constitutes the most important problem in plant leaf recognition. In this paper, a multi-scale angular description method is proposed for fast and accurate leaf recognition and retrieval tasks. The proposed method uses a novel scale-generation rule to develop an angular description of leaf contours. It is parameter-free and can capture leaf features from coarse to fine at multiple scales. A fast Fourier transform is used to make the descriptor compact and is effective in matching samples. Both support vector machine and k-nearest neighbors are used to classify leaves. Leaf recognition and retrieval experiments were conducted on three challenging datasets, namely Swedish leaf, Flavia leaf, and ImageCLEF2012 leaf. The results are evaluated with the widely used standard metrics and compared with several state-of-the-art methods. The results and comparisons show that the proposed method not only requires a low computational time, but also achieves good recognition and retrieval accuracies on challenging datasets.

• ETRI Journal
• /
• v.42 no.4
• /
• pp.527-533
• /
• 2020

High-level synthesis (HLS), which automatically synthesizes a register-transfer level (RTL) circuit from a behavioral description written in a high-level programming language such as C/C++, is becoming a more popular technique for improving design productivity. In general, HLS tools often generate a circuit with a larger area than those of hand-designed ones. One reason for this issue is that HLS tools often generate multiple instances of the same module from a function. To eliminate such a redundancy in circuit area in HLS, HLS tools are capable of sharing modules. Function-level module sharing at a behavioral description written in a high-level programming language may promote function reuse to increase effectiveness and reduce circuit area. In this paper, we present two HLS techniques for module sharing at the function level.