• 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.

• Speech Sciences
• /
• v.11 no.2
• /
• pp.151-164
• /
• 2004

This study examined the use of intonation in children with single word sentences and investigated the communicative functions of pitch range and pitch direction. Two children aged 13months were observed in interaction with their mothers for 10 months. The vocalizations were coded separately for communicative function and for prosodic feature. Results show that level tones are used most frequently, and pitch range is higher for request than declaration or answer and lower for answer than request or declaration. And trends in prosodic contours were observed in request, declaration, and answer respectively. For one child, rising tones were frequently associated with request whereas rising-falling tone with declaration. For the other child, rising-level tones were more frequently associated with request whereas falling-level appeared more often in conjunction with declaration. These trends appeared more distinct in proportion as they grow in months. This result indicate that the way to express communicative functions transfer gradually from differentiating pitch range to diversify pitch direction.

• Journal of Internet of Things and Convergence
• /
• v.8 no.5
• /
• pp.77-83
• /
• 2022

Nand flash memory requires an Erase-Before-Write operation structurally. In order to solve this problem, it can be solved by classifying a page (hot data page) where data update operation occurs frequently and storing it in a separate block. The MHF (Multi Hash Function Framework) technique records the frequency of data update requests in the system memory, and when the recorded value exceeds a certain standard, the data update request is judged as hot data. However, the method of simply counting only the frequency of the data update request has a limit in judging it as accurate hot data. In addition, in the case of a technique that determines the persistence of a data update request, the fact of the update request is recorded sequentially based on a time interval and then judged as hot data. In the case of such a persistence-based method, its implementation and operation are complicated, and there is a problem of inaccurate judgment if frequency is not considered in the update request. This paper proposes a lightweight hot data determination technique that considers both frequency and persistence in data update requests.

• 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 Korea Multimedia Society
• /
• v.6 no.5
• /
• pp.831-841
• /
• 2003

In wireless ATM network, Mobile terminals must offer function and QoS such as terminal of wire ATM network. The fast notification of BS (Base Station) scheduler about ATM cells arriving in mobile terminals is a critical item of the ATM-based centrally controlled MAC protocol. But, Collision is arisen at process that several mobile terminals require data transmission by contention method through uplink and because of re-transmission by collision, throughput of decrease and transmission delay increases. In this paper, We propose the MAC protocol that decide optimized request mini-slot's number considering number of request terminal predicted as statistical and its posterior throughput. According to simulation result, could know that proposed protocol shows high performance delay and throughput.

• KIISE Transactions on Computing Practices
• /
• v.21 no.4
• /
• pp.320-326
• /
• 2015

With the growing concern over frequent occurrences of criminal events, help-requesting mobile applications have drawn attention. However, existing applications solely focus on providing help-requesting services. Therefore, in this paper, we design and implement a help request and response process which allows users to request help by sending messages and locating their friends, acquaintances and even near-by application users, and to allow help be reached by forwarding messages. This application is composed of three parts: help-requesting, help-responding, and checking-status. This application is developed on the Android platform where we exchange users' longitude and latitude through web server communication. We conducted test to verify the effectiveness of the forwarding function, and it has been confirmed that 93.33% of subjects used the forwarding function to help users at risk.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.9
• /
• pp.113-120
• /
• 2022

In this paper, we analyze the feasibility of the IP spoofing attack exploiting null security algorithms in 5G networks based on 3GPP standard specifications. According to 3GPP standard specifications, the initial Registration Request message is not protected by encryption and integrity. The IP spoofing attack exploits the vulnerability that allows a malicious gNB (next generation Node B) to modify the contents of the initial Registration Request message of a victim UE (User Equipment) before forwarding it to AMF (Access and Mobility Management Function). If the attack succeeds, the victim UE is disconnected from the 5G network and a malicious UE gets Internet services, while the 5G operator will charge the victim UE. In this paper, we analyze the feasibility of the IP spoofing attack by analyzing whether each signaling message composing the attack conforms to the 3GPP Rel-17 standard specifications. As a result of the analysis, it is determined that the IP spoofing attack is not feasible in the 5G system implemented according to the 3GPP Rel-17 standard specifications.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2421-2433
• /
• 1997

In this paper, based on the relative logical storage cost of each movie by the difference of service request probability, we propose and implement the SDU(Separate Data Use) method and the EDU(Existing Data Use) method to provide FF(Fast Forward) and FR(Fast Reverse) function in efficiently through analysing MPEG bit stream and frame characteristics. By selecting and applying the FF/FR function providing method based on the service request probability of movie, the proposed method can reduce the cost of FF/FR functions for total serviced movies.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.57-60
• /
• 2003

IEEE 802.16 Wireless MAN standard specifies the air interface of fixed point-to-multipoint broadband wireless access systems providing multiple service. Among the service classes supported by the wireless MAN, the BE class is ranked on the lowest position in priority and is usually deployed by multicast and broadcast polling MAC scheme. In provisioning such BE service, the delay performance is influenced by a number of components including restrictions on resource request per SS, the number of request opportunities in upward frame, scheduling requests at BS, and contention resolution method. As candidate components of MAC function for BE service, we propose single and multiple request schemes (for controling the number of requests per SS), exhaustive and limited request schemes (for regulating the amount of grant per request) and FCFS, H-SMF, pure SMF, SS-wise Round Robin, and pure Round Robin (for scheduling requests at BS). Then, we construct MAC schemes by combining the above components and evaluate the delay performance exhibited by each MAC scheme using a simulation method. From numerical results, we investigate the effect of MAC components on average delay and delay variation and observe the dissonance on collision reduction in a resource - limited environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4640-4661
• /
• 2018

To cope with the explosive growth of Internet services, Service Function Chaining (SFC) based on Software-defined Networking (SDN) is an emerging and promising technology that has been suggested to meet this challenge. Determining the placement of Virtual Network Functions (VNFs) and routing paths that optimize the network utilization and resource consumption is a challenging problem, particularly without violating service level agreements (SLAs). This problem is called the optimal SFC placement problem and an Integer Linear Programming (ILP) formulation is provided. A greedy heuristic solution is also provided based on an improved two-step mapping algorithm. The obtained experimental results show that the proposed algorithm can automatically place VNFs at the optimal locations and find the optimal routing paths for each online request. This algorithm can increase the average request acceptance rate by about 17.6% and provide more than 20-fold reduction of the computational complexity compared to the Greedy algorithm. The feasibility of this approach is demonstrated via NetFPGA-10G prototype implementation.