• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.72-78
• /
• 2002

The distance join is a spatial join which finds data pairs in the order of distance between two spatial data sets using R-trees. The distance join stores node pairs in a priority queue, which are retrieved while traversing R-trees in a top-town manner, in the order of distance. This paper first shows that a priority strategy for the tied pairs in the priority queue during distance join processing has much effect on its performance, and then proposes an optimized secondary priority method. The experiments show that the proposed method is always better than the other methods in the performance perspectives.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.901-907
• /
• 2010

This paper proposes a standard method for linking data between the U-City Integrated Urban Management Platform and u-service systems through systemization of event identification and standardization of event priority. By applying the proposed method, the incoming events to the Management Platform are listed and processed according to their priority of urgency. The application of the systemized event ID and standardized event priority enables prompt counter-measures against urban emergencies and disasters, which improves the efficiency of business processes by reducing the time and cost to complete required actions.

• Proceedings of the KIEE Conference
• /
• 2003.11a
• /
• pp.463-465
• /
• 2003

This paper adopts the methods of dynamic programming based on priority and the objective function is to maximize the amount of priority. The Purpose of this work is to schedule the direct load control with approciate constrints. To demonstrate the effectiveness of the study, sample data is used about 54 load. And the results of sample are described in this.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.48
• /
• pp.291-297
• /
• 1998

This paper considers the determination of the priority of investment on R&D planning on nuclear power technology using AHP. Due to the complexity of problem, the hierarchy was divided into two parts; main hierarchy and sub-hierarchies. The result shows that the priority of technology options of evolutionary reactor and safety evaluation was higher than that of others.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.15 no.26
• /
• pp.159-163
• /
• 1992

The assumption of reinvestment rate leads to the results conflicting with the priority order of investments determined by net present worth. It has been revealed through various studies that the priority order of projects determined by the criteria based on internal rate of return is different from that determined by present worth. This study is to find out how to define reinvestment rate of return influencing the decision-making of the priority order through examining the meanings of reinvestment rate of capital and true rate of return, and to present some examples with a simple mathematical model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.812-822
• /
• 1997

In this paper, we propose an architecture of the asynchronous shared-bus type switch with priority and fairness schemes. The switch architecture is an input and output queueing system, and the priority scheme is implemented in both input and output queues. We analyze packet delay of both input and output queues. In the analysis, we consider to stations with asymmetric arrival rates. Although we make some approximations in the analysis, the numerical results show good agreements with the simulation results.

• ETRI Journal
• /
• v.34 no.6
• /
• pp.816-826
• /
• 2012

Self-healing Ethernet rings show promise for realizing the SONET/SDH-grade resilience in Carrier Ethernet infrastructures. However, when a ring is faulty, high-priority protection messages are processed in less time than low-priority data frames are processed. In this situation, any delayed data frames either being queued or traveling through long ring spans will cause the ring nodes to generate incorrect forwarding information. As a result, the data frames spread in the wrong direction, causing the ring to become unstable. To solve this problem, we propose four schemes, that is, dual flush, flush delay timer setting, purge triggering, and priority setting, and evaluate their protection performance under various traffic conditions on a ring based on the Ethernet ring protection (ERP) method. In addition, we develop an absorbing Markov chain model of the ERP protocol to observe how traffic congestion can impact the protection performance of the proposed priority setting scheme. Based on our observations, we propose a more reliable priority setting scheme, which guarantees faultless protection, even in a congested ring.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.803-816
• /
• 1996

It is possible to prevent deadlock if the priority which is conventionally given to transactions is endowed to data items and the transactions with the highest priority among transactions accessing the data item is allowed to proceed. Based on this observation, we proposed a Data-Priority Based Locking Protocol(DPLP) and evaluated its performance against known locking protocols in Real Time Database Management System(RTDBMS). Transaction inter-arrival time(IAT) was varied to determine success ratio, average-lateness, confict ratio and restart ratio, In these simulations we verified that the proposed DPLP performs better than the other protocols.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.3
• /
• pp.69-74
• /
• 2009

We propose the novel Hybrid bus arbitration policy that prevents starvation phenomenon presented in fixed priority and effectively assigns a priority to each master by mixing fixed priority and round-robin arbitration policies. The proposed arbitration policy and the others were implemented through Verilog and mapped the design into Hynix 0.18um technology and compared about gate count and design overhead. In the results of performance analysis, we confirm that our proposed policy outperforms the others in the aspect of design complexity, timing margin, bus utilization, starvation prevention, request cycle and so on.

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