• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.4
• /
• pp.430-438
• /
• 2007

In the current RFID (Radio Frequency IDentification) middleware systems based on the EPCglobal standard, the tag data received by multiple readers are processed sequentially in FIFO (First In First Out) order. Considering the priority of RFID reader makes the RFID system more flexible and improve the data transaction throughput in the service environment where important tag data with high priority for a specific reader. In this study, we propose a new RFID middleware system architecture supporting priority service with the Buffer Management Component. Our proposals are compliant with the EPCglobal ALE (Application Level Events) standard interface for middleware systems and their clients. To verify the efficiency of this proposed system, simulation is used for evaluation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.3
• /
• pp.1084-1090
• /
• 2012

The objectives of this study were to investigate needs and determine the priority of needs of women immigrants on life-long education. The subjects of the study were 121 women immigrants who participated in life-long education programs before. Borich priority determination formula and Locus for Focus Model were used for the determination of the priority of needs. The result indicated that the priority of needs were in order of education for employment, education for child rearing, and education for pregnancy, delivery and health life. The suggestions for program development of women immigrants are discussed.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.367-376
• /
• 2005

The smooth handoff supported by the route optimization extension to the mobile IP standard protocol should support a packet buffering mechanism at the base station (BS), in order to reduce the degradation in TCP performance caused by packet losses within mobile network environments. The purpose of packet buffering at the BS is to recover the packets dropped during intersubnetwork handoff by forwarding the packets buffered at the previous BS to the new BS. However, when the mobile host moves to a congested BS within a new foreign subnetwork, the buffered packets forwarded by the previous BS are likely to be dropped. This subsequently causes global synchronization to occur, resulting in the degradation of the wireless link in the congested BS, due to the increased congestion caused by the forwarded burst packets. Thus, in this paper, we propose an implicit priority forwarding (IPF) packet buffering scheme as a solution to this problem within mobile IP based networks. In the proposed IPF method, the previous BS implicitly marks the priority packets being used for inter-subnetwork handoff. Moreover, the proposed modified random early detection (M-RED) buffer at the new congested BS guarantees some degree of reliability to the priority packets. The simulation results show that the proposed IPF packet buffering scheme increases the wireless link utilization and, thus, it enhances the TCP throughput performance in the context of various intersubnetwork handoff cases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1324-1343
• /
• 2014

In recent years, the problem of spectrum mobility in Cognitive Radio (CR) Networks has been widely investigated. In order to utilize spectrum resources completely, many spectrum handoff techniques based on game theory have been proposed, but most studies only concern that users how to achieve better payoffs, without much attention to the diverse needs of users. In this paper, we propose a new channel-switching model based on game theory, using a prioritized approach to meet the diverse needs of users in two different modes (CQ and PS). At the same time, this paper proposes some acceleration techniques to reach the Nash equilibrium more efficiently. We evaluate the performance of the proposed schemes depending on priority using real channel availability measurements, and conclude that the channel quality function (CQ) mode provide better service for priority user but the plan-sorting (PS) mode can be more suitable in multiple priority users exist scene.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.4
• /
• pp.82-89
• /
• 2000

This study analyzes the cell loss probability of an ATM multiplexer with real time and non-real time bursty traffics. It is assumed that an ATM multiplexer with loss priority control for the analysis. The loss priority control uses the CLP Reld of cell header. For easy analysis and less computation. the multiplexed traffic of the ATM multiplexer was modeled by the MMDP. The ATM multiplexer is simulated by the MMDP/MMDP/l/K queueing system. From the above results, The connection admission of an ATM multiplexer with loss priority control is determined by the cell loss probability with low priority as well as the size of threshold buffer. Therefore, to increase the statistical multiplexing gain it will be good to utilize the loss priority control in order.

• Journal of the Korea Safety Management & Science
• /
• v.10 no.4
• /
• pp.1-9
• /
• 2008

It is very important to evaluate the priority of prevention factors and strategies in order to minimize industrial accident. It provides decisive information for accident prevention and safety management. Therefore, this paper proposes evaluation method of the priority through statistic testing with prevention factors and strategies by the cause analysis of cause and effect models. Especially, this paper uses priority matrix criterion to justify application of rank and objectivity. This paper is based on the results of a questionnaire of workers and managers who are engaged by real manufacturing and construction industries with less than 300 workers in the central region of Korea, where most of the fatal accidents have happened. Finally, the result provides one way to implement safety management for industrial accident prevention.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.15-17
• /
• 2022

In order to minimize surplus parts in ball bearing selective assembly systems, it is necessary to optimize the selection probability by grasping the dimensional distribution of each part. But the use of a complex system causes delays in the production process. In this paper, we propose cluster priority selection algorithm that can quickly and simply determine the selection priority in ball bearing selective assembly system. In addition, we assume the simulated situation with the data collected in the actual ball bearing selective assembly process, and evaluate the incidence of surplus part and runtime by simulating the cluster priority selection algorithm and the exiting algorithm. As a result of the simulation, the cluster priority selection algorithm generated 83.8% less surplus parts, and 39.7% less runtime than the existing algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.699-708
• /
• 1997

Production control is usually composed of due-dote assignment, production input control, and priority dispatching rule. A production input control(PIC) is mainly to control the WIP level on the shop floor. On the other hand, a priority dispatching rule(PDR) is mainly to control the tardiness/earliness of on order and number of tardy jobs. Therefore, if we select a particular PIC which can control only a particular performance measure(i.e., tardiness), it may cause worsening other performance measure(i.e., WIP level, shopfloor time, etc.) This newly developed production input control, DRD(Dual Release-Dates), is mainly designed to control the WIP level on the shop floor by employing two different release-dates of an order(earliest release. date and latest release-date and the release condition (relationship between the current WIP level and the pre-defined maximum WIP level) while trying to meet the due-date of the order.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1847-1850
• /
• 2003

In many image-coding applications such as web browsing, image databases, and telemedicine, it is needed that only a region of interest(ROI) is transmitted and then reconstructed first before the whole image is transmitted and reconstructed. The Maxshift method has been used as a standard one in this research about ROI coding in JPEG2000. However Maxshift method can process only one ROI, this paper suggests an improved Maxshift method which can process Multiple ROI haying the priority order. In this method, the ROI coefficient which has the high priority order can be moved to upward two bit plane in order to process multiple ROI.

• KIISE Transactions on Computing Practices
• /
• v.23 no.8
• /
• pp.510-515
• /
• 2017

It is important to speed up the loading time of web applications. Parsing is a loading process that contributes to an increased loading time. To address this issue, the optimization called Concurrent Parsing has been proposed which handles the parsing process in parallel by using additional threads. However, Concurrent Parsing has a limitation that it does not consider the priority order of parsing. In this paper, we propose heuristics that exploit priorities of parsing to improve the Concurrent Parsing. For parsing priority, we empirically investigate the sequence of function calls, classify functions into 3 categories, and extract function call probabilities. If a function has high call probability, we give a high priority and if a function has low probability, we give a low priority. We evaluate this priority heuristics on real web applications and get the 2.6% decrease of loading time on average.