• Title/Summary/Keyword: PRIORITY

Search Result 6,451, Processing Time 0.033 seconds

A New Image Completion Method Using Hierarchical Priority Belief Propagation Algorithm (계층적 우선순위 BP 알고리즘을 이용한 새로운 영상 완성 기법)

  • Kim, Moo-Sung;Kang, Hang-Bong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.5
    • /
    • pp.54-63
    • /
    • 2007
  • The purpose of this study is to present a new energy minimization method for image completion with hierarchical approach. The goal of image completion is to fill in missing part in a possibly large region of an image so that a visually plausible outcome is obtained. An exemplar-based Markov Random Field Modeling(MRF) is proposed in this paper. This model can deal with following problems; detection of global features, flexibility on environmental changes, reduction of computational cost, and generic extension to other related domains such as image inpainting. We use the Priority Belief Propagation(Priority-BP) which is a kind of Belief propagation(BP) algorithms for the optimization of MRF. We propose the hierarchical Priority-BP that reduces the number of nodes in MRF and to apply hierarchical propagation of messages for image completion. We show that our approach which uses hierarchical Priority-BP algorithm in image completion works well on a number of examples.

Study of Optimum Parameters for Improving QoS in Wireless LAN (무선랜 QoS의 성능향상을 위한 최적 파라미터에 관한 연구)

  • Jin, Hyunjoon
    • Journal of IKEEE
    • /
    • v.17 no.2
    • /
    • pp.96-103
    • /
    • 2013
  • Since multimedia data takes large part of realtime transmission in wireless communication environments such as IEEE 802.11, QoS issues became one of the important problems with network performance. 802.11e MAC provides differentiated services based on priority schemes to solve existing 802.11 MAC problems. The TXOP is an important factor with the priority to improve network performance and QoS because it defines the time duration in which multiple frames can be transferred at one time for each station. In this paper, therefore frame sizes, TXOP Limit, and Priority values in accordance with the number of stations are experimented and derived for best network performance and QoS. Using 802.11e standard parameters, simulation results show the best throughput when the number of stations is 5 and TXOP Limit value is 6.016ms. For fairness, the best result is achieved at 3.008ms of TXOP Limit value and 15-31 of CW(Contention Window) that is lower priority than CW 7-15.

ANALYSIS OF QUEUEING MODEL WITH PRIORITY SCHEDULING BY SUPPLEMENTARY VARIABLE METHOD

  • Choi, Doo Il
    • Journal of applied mathematics & informatics
    • /
    • v.31 no.1_2
    • /
    • pp.147-154
    • /
    • 2013
  • We analyze queueing model with priority scheduling by supplementary variable method. Customers are classified into two types (type-1 and type-2 ) according to their characteristics. Customers of each type arrive by independent Poisson processes, and all customers regardless of type have same general service time. The service order of each type is determined by the queue length of type-1 buffer. If the queue length of type-1 customer exceeds a threshold L, the service priority is given to the type-1 customer. Otherwise, the service priority is given to type-2 customer. Method of supplementary variable by remaining service time gives us information for queue length of two buffers. That is, we derive the differential difference equations for our queueing system. We obtain joint probability generating function for two queue lengths and the remaining service time. Also, the mean queue length of each buffer is derived.

Non-preemptive Queueing Model of Spectrum Handoff Scheme Based on Prioritized Data Traffic in Cognitive Wireless Networks

  • Bayrakdar, Muhammed Enes;Calhan, Ali
    • ETRI Journal
    • /
    • v.39 no.4
    • /
    • pp.558-569
    • /
    • 2017
  • In this study, a non-preemptive M/G/1 queueing model of a spectrum handoff scheme for cognitive wireless networks is proposed. Because spectrum handoff gives secondary users an opportunity to carry on their transmissions, it is crucially important to determine the actions of primary users. In our queueing model, prioritized data traffic is utilized to meet the requirements of the secondary users. These users' packets are categorized into three different priority classes: urgent, real-time, and non-real time. Urgent data packets have the highest priority, while non-real time data packets have the lowest priority. Riverbed (OPNET) Modeler simulation software was used to simulate both reactive and proactive decision spectrum handoff schemes. The simulation results were consistent with the analytical results obtained under different load and traffic conditions. This study also revealed that the cumulative number of handoffs can be drastically decreased by exploiting priority classes and utilizing a decent spectrum handoff strategy, such as a reactive or proactive decision-based strategy.

THE ${M_1},{M_/2}/G/l/K$ RETRIAL QUEUEING SYSTEMS WITH PRIORITY

  • Choi, Bong-Dae;Zhu, Dong-Bi
    • Journal of the Korean Mathematical Society
    • /
    • v.35 no.3
    • /
    • pp.691-712
    • /
    • 1998
  • We consider an M$_1$, M$_2$/G/1/ K retrial queueing system with a finite priority queue for type I calls and infinite retrial group for type II calls where blocked type I calls may join the retrial group. These models, for example, can be applied to cellular mobile communication system where handoff calls have higher priority than originating calls. In this paper we apply the supplementary variable method where supplementary variable is the elapsed service time of the call in service. We find the joint generating function of the numbers of calls in the priority queue and the retrial group in closed form and give some performance measures of the system.

  • PDF

Design of Structural Models for Constructing a Goal Alternatives Disposition System in Large-Scale R&D Projectsr (대규모 R&D 프로젝트에 있어서 목표대체안 처리시스템의 구축을 위한 구조모형의 설계)

  • Kwon, Cheol-Shin;Cho, Keun-Tae
    • IE interfaces
    • /
    • v.15 no.4
    • /
    • pp.460-473
    • /
    • 2002
  • The objective of this paper is to design a Goal Alternatives Disposition System having three main subsystems for setting, evaluating and selecting goal alternatives. For setting of goal alternatives, System Alternatives Tree(SAT) structure will be developed, which has a computation algorithm for setting decision alternatives by the concept of System Priority Number(SPN). For evaluating and selecting of goal alternatives; First, Normative and Exploratory Priority Indices which consider technical performance to the goal, cost and feasibility are developed respectively. Second, Integrated Priority Index is built up to determine the total priority of the Goal Alternatives Disposition(GAD) system. For the design and verification of the GAD system, technological forecasting structure theory, systems engineering methodology will be used.

A Traffic Control Algorithm in Home Networks through Priority Reassignment (홈 네트웍에서의 Priority 재배정을 통한 트래픽 제어 알고리즘)

  • 임승옥;정광모
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10e
    • /
    • pp.622-624
    • /
    • 2002
  • 네트웍 기술이 급속도로 발달함에 따라, 다수의 PC를 보유하고 인터넷 서비스를 사용하는 가정이 늘어나고 있다. 이렇게 가정에서의 네트웍 환경이 변함에 따라, 가정 내에서의 원활한 네트웍 서비스의 제공과 가전기기들 간의 통신을 연결하는 기술이 홈 네트워킹에서 주된 관심사가 되고 있다. 이렇게 홈 네트웍이 확장됨에 따라 홈 네트웍 내에서의 트래픽 증가가 예상되는데, 증가된 트래픽을 어떻게 관리하고 서비스를 제공할 것인가가 홈 네트웍 발전에 큰 영향을 미칠 것이라고 예견된다. 홈 네트웍에서 존재할 수 있는 트래픽은 크게 3가지 정도로 나누어 볼 수 있는데, 제어 트래픽, 인터넷이나 non-real-time 트래픽, 그리고 real-time multimedia 트래픽이다. 이러한 복합적인 홈 네트웍에서의 트래픽을 처리하기 위해, 사용자가 많이 사용한 트래픽에 대해 우선권을 부여하는 방식과 각 트래픽의 고유한 성질을 보존하는 priority-based 트래픽 제어 구조를 설계하였다. 시뮬레이션 결과로는 사용자가 빈번히 사용한 트래픽 class에 대해서는 priority가 높게 할당되며, 각 트래픽의 특성이 감안된 priority 변화를 보여주고 있다.

  • PDF

Asymptotic Analysis on Service Differentiation with Customer Arrival Information (고객 도착 정보를 이용한 서비스 차별화에 관한 점근적 분석)

  • Choi, Ki-Seok
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.2
    • /
    • pp.115-135
    • /
    • 2008
  • An interesting problem in capacitated supply chains is how to guarantee customer service levels with limited resources. One of the common approaches to solve the problem is differentiating service depending on customer classes. High-priority customers receive a better service at the cost of low-priority customers' service level. One of common criteria to determine a customer's priority in practice is whether he has made a reservation before arrival or not. Customers with a reservation usually receive service based on the time the reservation was made. We examine the effect this advance information of customer arrival has on customer service levels. We show the trade-offs between the leadtime and other system characteristics such as the proportion of high-priority customers. when the service level is high. We also suggest how to differentiate service using the asymptotic ratio of the service levels for both types of customers.

Aggregation of Multiple Evaluator's Weights in Applying the AHP to Evaluate Technology Alternatives (기술대안의 전략적 평가를 위한 AHP적용에 있어서 평가자 신뢰성을 고려한 가중치 통합)

  • 조근태
    • Korean Management Science Review
    • /
    • v.19 no.2
    • /
    • pp.139-153
    • /
    • 2002
  • The Analytic Hierarchy Process (AHP) is known as a very useful decision-making model developed for obtaining the relative weights of alternatives through pairwise comparison in the context of hierarchical structure. In this paper, we propose a method to reflect the reliability of evaluators in the process of pairwise comparison. This method is applied to the evaluation of aerospace technology alternatives. We have conducted a questionnaire survey for S company that is one of the representative aerospace companies in Korea. A questionnaire was designed for obtaining both the priority with considering the reliability of evaluators' importance weights (the modified AHP priority) and the priority with assuming equally reliable evaluators' importance weights (the AHP priority) in order to compare the priority derived by each of two methods. The result shows that there exists the difference hard to neglect between the final priorities gained by two methods.

Picture Quality Control by Priority Among Multiple Video Sources

  • KWON SOON-KAK;KWON OH-JUN
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.6
    • /
    • pp.744-752
    • /
    • 2005
  • When the multiple video sources are transmitted together through the channel of fixed bandwidth, an efficient picture quality control is necessary. This paper presents a joint picture quality control method to satisfy the user requirement by priority among the video sources. The better picture quality is assigned to the source of higher priority compared to lower priority. We obtain the bitrate for each source to have a required distortion level among the sources by using an approximate distortion-bitrate model for simple implementation. It is shown by simulation that the proposed bandwidth allocation method can keep almost the user-required picture quality among the sources in comparison to an independent bandwidth allocation method.

  • PDF