• 제목/요약/키워드: Two Priority

검색결과 895건 처리시간 0.026초

Dirichlet 확률모형을 이용한 AHP 중요도 결합방법 (Using Dirichlet Probability Model to Combine AHP Priorities)

  • 김성철
    • 대한산업공학회지
    • /
    • 제26권3호
    • /
    • pp.213-219
    • /
    • 2000
  • Combination of AHP priorities is essential in combining opinions of multiple experts. There are two ways to get combined priorities: one is to combine the pairwise matrices and obtain the priority from it and another is to combine the individual priorities. In this paper, we use a Dirichlet probability model to combine the priorities from multiple experts. The resulting combined priority is an expected value of the model, which is a function of some measure of the homogeneity and credibility of the group of experts. We give some interpretations of this measure and illustrate them by numerical example.

  • PDF

입출력 큐를 갖는 ATM 스위치에서의 우선순위에 관한 성능 분석 (Performance study of the priority scheme in an ATM switch with input and output queues)

  • 이장원;최진식
    • 전자공학회논문지S
    • /
    • 제35S권2호
    • /
    • pp.1-9
    • /
    • 1998
  • ATM was adopted as the switching and multiplexing technique for BISDN which aims at transmitting traffics with various characteristics in a unified network. To construct these ATM networks, the most important aspect is the design of the switching system with high performance and different service capabilities. In this paepr, we analyze the performance of an input and output queueing switch with preemptive priority which is considered to be most suitable for ATM networks. For the analysis of an input queue, we model each input queue as two separate virtual input queues for each priority class and we approximage them asindependent Geom/Geom/1 queues. And we model a virtual HOL queue which consists of HOL cells of all virtual input queues which have the same output address to obtain the mean service time at each virtual input queue. For the analysis of an output quque, we obtain approximately the arrival process into the output queue from the state of the virtual HOL queue. We use a Markov chain method to analyze these two models and obtain the maximum throughput of the switch and the mean queueing delay of cells. and analysis results are compared with simulation to verify that out model yields accurate results.

  • PDF

이미지 시퀀스 데이터베이스에서 우선순위 큐와 접미어 트리를 이용한 효율적인 유사 서브시퀀스 검색의 설계 (A Design for Efficient Similar Subsequence Search with a Priority Queue and Suffix Tree in Image Sequence Databases)

  • 김인범
    • 한국컴퓨터산업학회논문지
    • /
    • 제4권4호
    • /
    • pp.613-624
    • /
    • 2003
  • 본 논문은 우선순위 큐와 접미어 트리로 색인 구조를 생성한 후. 이미지 시퀀스 데이터베이스에서 다차원 타임 워핑 거리 함수를 이용하여 유사한 이미지 서브시퀀스를 신속하고 정확하게 검색할 수 있는 방법을 제안한다. 본 논문에서 제안된 방법은 사전에 정의된 중요도에 따라 선별된 이미지 시퀀스로 구성된 우선순위 큐 색인의 이미지 서브시퀀스에 대한 유사성 거리 계산을 첫 단계로 시행하여 유사한 서브시퀀스집합을 얻고 만족할 결과를 얻지 못했을 경우에는 두 번째 단계로 나머지 유사 서브시퀀스에 대해 디스크 기반의 접미어 트리를 색인 구조체로 하여 유사한 서브시퀀스를 검색하는 것이다. 하한 거리 함수를 활용하여 질의 이미지 시퀀스와 유사한 이미지 서브시퀀스를 검색하는 과정에서 생성 가능한 오류를 방지 하면서 동시에 비 유사 이미지 서브시퀀스를 제거하도록 한다.

  • PDF

Performance Analysis of an ATM MUX with a New Space Priority Mechanism under ON-OFF Arrival Processes

  • Bang, Jongho;Ansari, Nirwan;Tekinay, Sirin
    • Journal of Communications and Networks
    • /
    • 제4권2호
    • /
    • pp.128-135
    • /
    • 2002
  • We propose a new space priority mechanism, and analyze its performance in a single Constant Bit Rate (CBR) server. The arrival process is derived from the superposition of two types of traffics, each in turn results from the superposition of homogeneous ON-OFF sources that can be approximated by means of a two-state Markov Modulated Poisson Process (MMPP). The buffer mechanism enables the Asynchronous Transfer Mode (ATM) layer to adapt the quality of the cell transfer to the Quality of Service (QoS) requirements and to improve the utilization of network resources. This is achieved by "Selective-Delaying and Pushing-ln"(SDPI) cells according to the class they belong to. The scheme is applicable to schedule delay-tolerant non-real time traffic and delay-sensitive real time traffic. Analytical expressions for various performance parameters and numerical results are obtained. Simulation results in term of cell loss probability conform with our numerical analysis.

오스카(Astronotus ocellatus)에서의 아가미흡충증 치료 (Treatment of Dactylogyrosis in Oscar (Astronotus ocellatus))

  • 임경택;김지형;박재학;신남식;허강준;박세창
    • 한국임상수의학회지
    • /
    • 제22권2호
    • /
    • pp.160-162
    • /
    • 2005
  • Dead oscars (Astronotus ocellatus) were presented for necropsy in January, 2005. Oscars, which had been reared densely, were dead in large quantities. At necropsy, they were severely infected by Dactylogyrus spp. We requested for the oscar samples which had been raised in the same water tank. Two of them were sacrificed and necropsied. At the microscopic examination, we verified dactylogyrosis of oscars. The other oscars were treated by praziquantel. Treatment was started with a dosage of 2.5 mg/L. From a second day, we treated 5.0 mg/L every two days during 4 days. At sixth day, No Dactylogyrus flukes were found but only larvae were existed. After 2 weeks without additional medication, both Dactylogyrus flukes and larvae were eliminated.

RawPEACH: Multiband CSMA/CA-Based Cognitive Radio Networks

  • Chong, Jo-Woon;Sung, Young-Chul;Sung, Dan-Keun
    • Journal of Communications and Networks
    • /
    • 제11권2호
    • /
    • pp.175-186
    • /
    • 2009
  • A new medium access control (MAC) scheme embedding physical channels into multiband carrier sense multiple access/collision avoidance (CSMA/CA) networks is proposed to provide strict quality of service (QoS) guarantee to high priority users. In the proposed scheme, two priority classes of users, primary and secondary users, are supported. For primary users physical channels are provided to ensure strict QoS, whereas secondary users are provided with best-effort service using CSMA/CA modified for multiband operation. The performance of the proposed MAC scheme is investigated using a new multiband CSMA/CA Markov chain model capturing the primary user activity and the operation of secondary users in multiple bands. The throughput of secondary users is obtained as a function of the primary user activity and other CSMA/CA parameters. It is shown that the new MAC scheme yields larger throughput than the conventional single-band CSMA/CA when both schemes use the same bandwidth.

OSF/1 기반 SRT 스케쥴러의 성능 향상 (Performance Improvement of Soft Real-Time Scheduler in OSF/1)

  • 이승호;허신
    • 한국정보처리학회논문지
    • /
    • 제4권1호
    • /
    • pp.246-254
    • /
    • 1997
  • 본 논문은 SRT 시스템에서 고정 우선순위 정책을 사용하는 쓰레드가 기존보다 더 빠른 응답시간과 반환시간을 갖도록 하기 위한 개선된 스케쥴링 모델과 알고리즘을 제시하였다. 보조 실행 큐를 첨가하여 고정 우선순위 정책을 사용하는 쓰레드의 빠른 실행 및 에이징(aging)에 사용하였다. 시뮬레이션을 통하여 기존의 방식과 비교하였 으며 그 결과, 새로 제안된 모델의 경우, 고정 우선순위 쓰레드의 반응시간과 반환시 간이 기존보다 향상되었다.

  • PDF

입출력 단에 버퍼를 가지는 ATM 교환기의 손실우선순위 제어의 성능 분석 (Performance analysis of a loss priority control scheme in an input and output queueing ATM switch)

  • 이재용
    • 한국통신학회논문지
    • /
    • 제22권6호
    • /
    • pp.1148-1159
    • /
    • 1997
  • In the broadband integrated service digital networks (B-ISDN), ATM switches hould be abld to accommodate diverse types of applications ith different traffic characteristics and quality ddo services (QOS). Thus, in order to increase the utilization of switches and satisfy the QOS's of each traffic type, some types of priority control schemes are needed in ATM switches. In this paper, a nonblocking input and output queueing ATm switch with capacity C is considered in which two classes of traffics with different loss probability constraints are admitted. 'Partial push-out' algorithm is suggested as a loss priority control schemes, and the performance of this algorithm is analyzed when this is adopted in input buffers of the switch. The quque length distribution of input buffers and loss probabilities of each traffic are obtained using a matrix-geometric solution method. Numerical analysis and simulation indicate that the utilization of the switch with partial push-out algorithm satisfying the QOS's of each traffic is much higher than that of the switch without control. Also, the required buffer size is reduced while satisfying the same QOS's.

  • PDF

손실 우선과 시간 우선이 공존하는 ATM에서의 최적 버퍼 제어를 위한 대기 행렬 모형 (A Queueing Model with Loss and Time Priority for Optimal Buffer Control in ATM)

  • 이호우;김은영
    • 대한산업공학회지
    • /
    • 제25권1호
    • /
    • pp.130-140
    • /
    • 1999
  • This paper deals with a priority queueing model in an ATM system. Two types of customers are considered. Type-1 customers have push-put priority over type-2 customers. Type-1 customers can enter the service only when the number of type-2 customers is less than a threshold T. We derive the joint probability of the number of customers in the buffer, the mean waiting time, and the loss probabilities of each type. We also propose an optimal control policy that satisfies a given quality of service.

  • PDF

Multi-Item Inventory Problems Revisited Using Genetic Algorithm

  • Das, Prasun
    • Management Science and Financial Engineering
    • /
    • 제13권2호
    • /
    • pp.29-46
    • /
    • 2007
  • This paper makes an attempt to compare the two important methods for finding solutions of multi-item inventory problem with more than one conflicting objectives. Panda et al.[9] discusses a distance-based method to find the best possible compromise solution with variation of priority under the given weight structure. In this paper, the problem in [9] is revisited through the Pareto-optimal front of genetic algorithm with the help of a situation of retail stocking of FMCG business. The advantages of using the solutions from the perspective of the decision maker obtained through multi-objective optimization are highlighted in terms of population search, weighted goals and priority structure, cost, set of compromise solutions along with prevention of stock-out situation.