• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.195-204
• /
• 2007

The cyclic redundancy check(CRC) code used to decide retransmission request in hybrid automatic repeat request(HRAQ) system can also be used to stop iterative decoding of turbo code if it is used as an error correcting code(ECC) of HARQ system. Thus a scheme to use CRC code for both iteration stop and repeat request in the HARQ system with turbo code based on the standard of cdma 2000 system is proposed in this paper. At first, the optimum CRC code which has the minimum length without performance degradation due to undetected errors is found. And the most appropriate turbo encoder structure is also suggested. As results, it is shown that at least 32-bit CRC code should be used and a turbo code with 3 constituent encoders is considered to be the most appropriate one.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.449-450
• /
• 2015

This paper describes performance evaluation results of a new dynamic bandwidth allocation algorithm for an XG-PON (10-Gbps-capable passive optical network) system without using an explicit request. An ONU (optical network unit) does not send its request to an OLT (optical line termination). The OLT monitors the upstream bandwidth usage of the ONU to estimate the request of the ONU.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.93-97
• /
• 2007

In this paper, centralized access control and slot allocation algorithm is proposed for wireless networks. The proposed algorithm is characterized by the contention-based reservation. In order to reduce the collision probability of reservation request, the base station calculates and broadcasts the transmission probability of reservation requests, and the wireless terminal transmits its reservation request with the received transmission probability. The scheduler allocates the uplink data slots based on the successful reservation requests. Simulation results show that the proposed algorithms can provide high channel utilization, and furthermore, maintains constant delay performance in the heavy traffic environment.

• Journal of the military operations research society of Korea
• /
• v.11 no.1
• /
• pp.47-54
• /
• 1985

In this paper, for the systematic software evaluation and selection objective, we first discussed the systems software which is distinctly different from applications oriented software in source, concept and use. We suggested the systematic procedures for the effective software evaluation and selection by analyzing categories of commercially available proprietary software, sources of information for software selection, request for information, request for proposal, user surveys as an aid to evaluation and evaluation of responses to the RFP.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.190-192
• /
• 1998

이동에이전트를 위한 이동객체(mobile agent)와 이를 지원해주는 이동객체서버(mobile object system)를 설계하고 이러한 요소들을 제어하고 관리하는 이동객체 시스템(mobile object system)을 Java로 구현한다. 또, 시스템 내의 이동객체를 비롯한 모든 객체들간의 객체 요청(object request)을 유연하게 중계하고 이들간의 통신을 담당하는 ORB (Object Request Broker)를 TCP/IC상에서 Java 로 구현하고 이동 에이젼트 시스템을 쉽게 구측할수 있는 앱스트랙션(abstraction)과 API를 제공한다. 이 시스템은 네이밍 서비스(naning service)와 푸쉬형 이벤트 서비스(push-event service)등을 기본적으로 지원한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.286-288
• /
• 2002

SIP는 인터넷 텔레포니 신호(Internet Telephony Call)와 같은 멀티미디어 세션을 성립, 변경, 종료시킬 수 있는 응용계층의 호 제어 프로토콜이다. 또한, SIP 프록시 서버(Proxy Server)라는 네트일 호스트로 구축된 인프라를 통해 멀티미디어 통신을 원하는 네트윅상의 사용자를 찾아 멀티미디어 세션(Session)이 성립될 수 있도록 도와준다. SIP는 Request-Response 방식의 프로토콜이기 때문에 요청(Request)과 응답(Response)을 주고받는 일련의 트랜잭션(Transaction)으로 하나의 Task를 완성한다. 본 논문에서는 rfc2543을 기반으로 기본적인 SIP 트랜잭션을 위한 SIP 스택(Stack)의 설계 및 그 구현 방안을 제지한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.422-424
• /
• 2000

웹서버는 disk I/O 오버헤드를 줄이기 위해 웹 문서를 메모리 캐슁한다. 하지만 동시에 들어오는 connection들에 대해 처리 순서는 고려하지 않으므로 같은 문서를 요구하는 request들이 메모리 캐쉬의 working set내에 들어오지 않을 경우 disk I/O를 추가시킬 수 있다. 본 논문에서는 동시에 처리해야 할 같은 작업량을 요구하는 request는 연속적으로 처리함으로써 disk I/O 오버헤드를 줄이는 우선 순위 스케쥴링을 수행함으로써 정적 웹 환경서의 사용자 응답 시간을 줄였다.

• English Language & Literature Teaching
• /
• v.12 no.2
• /
• pp.215-235
• /
• 2006

This paper explores the effects of two different methods of instruction for 106 low-level Korean learners of English at a college in learning request expressions. Both of the methods contained the focus-on-form and function characteristics, while the degree of explicitness for input enhancement was differentiated. Abundant email samples written by English native speakers for the input were provided and email writing practice for the output was proceeded for both groups of the students in the treatment sessions. The numbers of target forms used in pretest and posttest results were compared quantitatively: The tests included email writing and open-ended Discourse Completion Test (DCT). The results indicated that the target pragmatic features were slightly better learned under the condition of relatively high degree of explicit instruction with metapragmatic information, even though the difference was statistically insignificant. In addition, the students' use of request strategies both in email and DCT was affected positively by the treatment with email input and output. That is, the students applied the request strategies they learned through email into their oral production (open-ended DCT) as well as their email writing. Further study on the output effect of target features in advancing pragmatic competence is suggested.

• Journal of Korean language education
• /
• v.25 no.1
• /
• pp.115-144
• /
• 2014

The purpose of this paper is to compare the two different instruction methods for Korean learners of academic purposes in learning request expression. Participants were divided into two groups, explicit and implicit group. Both groups viewed several scenes from the drama that involved native speakers interacting in different situations. The instructional treatment for the explicit group included metapragmatic information while the treatment for the implicit group did not. On the other hand, the treatment for the implicit group followed implicit techniques, which were repetition of the video presentation and a script reading activity. This study was made up of a pre-test, a post-test, and a delayed-test. The pre-test was conducted prior to the instructional treatment. The post-test was administered a day after the last instruction and the delayed-test was conducted five weeks after the treatments. Two types of tests, speaking and writing, were used in this study to examine subjects' knowledge of Korean request. The result of this research reveals that implicit treatment was more effective than explicit treatment in Korean learners' request acquisition. This results might have been due to the operationalization of the implicit condition in this study. Implicit instruction may help language learners make rules by themselves through tasks.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.15-26
• /
• 2002

Most work on multimedia storage systems has assumed that client will be serviced using a round-robin strategy. The server services the clients in rounds and each client is allocated a time slice within that round. Furthermore, most such algorithms are evaluated on the basis of a tightly coupled cost function. This is the basis of well-known algorithm such as FCFS, SCAN, SCAN-EDF, etc. In this paper, we describe a scheduling module called Request Unifier(RU) that takes as input, a set of client request, and a set of constraints on the desired performance such as client waiting time or maximum disk bandwidth, and a cost function. It produces as output a Unified Read Request(URR), telling the storage server which data items to read and when these data items to be delivered to the clients. Given a cost function, a URR is optimal if there is no other URR satisfying the constraints with a lower cost. We present three algorithms in this paper that can accomplish this kind of request merging and compare their performance through an experimental evaluation.