• 제목/요약/키워드: optimal admission policy

검색결과 8건 처리시간 0.025초

Optimal SMDP-Based Connection Admission Control Mechanism in Cognitive Radio Sensor Networks

  • Hosseini, Elahe;Berangi, Reza
    • ETRI Journal
    • /
    • 제39권3호
    • /
    • pp.345-352
    • /
    • 2017
  • Traffic management is a highly beneficial mechanism for satisfying quality-of-service requirements and overcoming the resource scarcity problems in networks. This paper introduces an optimal connection admission control mechanism to decrease the packet loss ratio and end-to-end delay in cognitive radio sensor networks (CRSNs). This mechanism admits data flows based on the value of information sent by the sensor nodes, the network state, and the estimated required resources of the data flows. The number of required channels of each data flow is estimated using a proposed formula that is inspired by a graph coloring approach. The proposed admission control mechanism is formulated as a semi-Markov decision process and a linear programming problem is derived to obtain the optimal admission control policy for obtaining the maximum reward. Simulation results demonstrate that the proposed mechanism outperforms a recently proposed admission control mechanism in CRSNs.

Optimal Admission Control and State Space Reduction in Two-Class Preemptive Loss Systems

  • Kim, Bara;Ko, Sung-Seok
    • ETRI Journal
    • /
    • 제37권5호
    • /
    • pp.917-921
    • /
    • 2015
  • We consider a multiserver system with two classes of customers with preemption, which is a widely used system in the analysis of cognitive radio networks. It is known that the optimal admission control for this system is of threshold type. We express the expected total discounted profit using the total number of customers, thus reducing the stochastic optimization problem with a two-dimensional state space to a problem with a one-dimensional birth-and-death structure. An efficient algorithm is proposed for the calculation of the expected total discounted profit.

수의과대학 입학전형별 합격자의 학업성취도, 졸업역량, 학업지속비율 비교 연구 (Comparison of academic achievement, graduation competency and academic sustainability of veterinary students based on college admission processes)

  • 남상섭;김유진;양성관
    • 대한수의학회지
    • /
    • 제64권3호
    • /
    • pp.24.1-24.8
    • /
    • 2024
  • A university's admission policy is established to select applicants who can successfully complete the curriculum. Thus, it is important to develop optimal admissions processes for applicant selection. This study was conducted to infer the most suitable admission processes for veterinary school applicants by examining academic achievement, graduation competency and academic sustainability. It was conducted on students admitted from 2009 to 2018 at one of the veterinary colleges in Korea. The admission methods were divided into, first the regular admission (RA) process, primarily reflecting the results of the College Scholastic Ability Test, and second, the rolling admission processes. The rolling processes were further divided into admission officer-based (AO), high school grade point average-based (GA), essay test-based (ET), admission for the underprivileged (UP) and admission for overseas Koreans and foreigners (OKF). The final grade point average was observed to be higher in the order of the GA, AO and RA groups. The survey on the veterinary graduation competency did not reveal any difference between the regular and rolling admission processes. However, among the latter, AO-based admission showed a higher ratio of outstanding competency levels. In terms of academic sustainability, OKF admission demonstrated a higher rate of failure while RA showed a higher rate of expulsion and dropout. Summarizing the above results, the most successful veterinary applicants were selected through AO-based admission. These results are meaningful in providing the basic information required to establish admission policies for veterinary colleges in Korea.

계획생산과 주문생산 시설들로 이루어진 두 단계 공급망에서 재고 할당과 고객주문 수용 통제의 통합적 관리 (Integrated Inventory Allocation and Customer Order Admission Control in a Two-stage Supply Chain with Make-to-stock and Make-to-order Facilities)

  • 김은갑
    • 한국경영과학회지
    • /
    • 제35권1호
    • /
    • pp.83-95
    • /
    • 2010
  • This paper considers a firm that operates make-to-stock and make-to-order facilities in successive stages. The make-to-stock facility produces components which are consumed by the external market demand as well as the internal make-to-order operation. The make-to-order facility processes customer orders with the option of acceptance or rejection. In this paper, we address the problem of coordinating how to allocate the capacity of the make-to-stock facility to internal and external demands and how to control incoming customer orders at the make-to-order facility so as to maximize the firm's profit subject to the system costs. To deal with this issue, we formulate the problem as a Markov decision process and characterize the structure of the optimal inventory allocation and customer order control. In a numerical experiment, we compare the performance of the optimal policy to the heuristic with static inventory allocation and admission control under different operating conditions of the system.

Multi-agent Q-learning based Admission Control Mechanism in Heterogeneous Wireless Networks for Multiple Services

  • Chen, Jiamei;Xu, Yubin;Ma, Lin;Wang, Yao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권10호
    • /
    • pp.2376-2394
    • /
    • 2013
  • In order to ensure both of the whole system capacity and users QoS requirements in heterogeneous wireless networks, admission control mechanism should be well designed. In this paper, Multi-agent Q-learning based Admission Control Mechanism (MQACM) is proposed to handle new and handoff call access problems appropriately. MQACM obtains the optimal decision policy by using an improved form of single-agent Q-learning method, Multi-agent Q-learning (MQ) method. MQ method is creatively introduced to solve the admission control problem in heterogeneous wireless networks in this paper. In addition, different priorities are allocated to multiple services aiming to make MQACM perform even well in congested network scenarios. It can be observed from both analysis and simulation results that our proposed method not only outperforms existing schemes with enhanced call blocking probability and handoff dropping probability performance, but also has better network universality and stability than other schemes.

임의상환가능 상품 도입하의 예약 요청 승인 방법 비교 (A Comparison of Admission Controls of Reservation Requests with Callable Products)

  • 이행주
    • 디지털융복합연구
    • /
    • 제17권9호
    • /
    • pp.127-133
    • /
    • 2019
  • 임의상환가능 상품은 옵션을 이용하여 수요창출과 리스크를 줄이는 서비스 파생상품의 일종이다. 본 논문은 임의상환가능 상품이 도입된 후, 예약 요청의 온라인승인 방법과 일괄승인 방법 둘의 성능을 비교한다. 최적의 예약관리법을 계산하기 위하여, 역행 동적계획법(Backward Dynamic Programming)과 확률적 최적화(Stochastic Optimization) 방법을 이용한다. 직관적으로는 공급자는 수요정보를 이용하여 일괄승인 방법으로 더 높은 수익을 올릴 것으로 예상되지만, 본 논문은 두 예약 요청 승인 방법의 예약관리전략과 수익은 동일하다는 것을 증명함으로써, 현행 예약 요청 승인 방법의 변화 없이 임의상환가능 상품을 빠르게 도입할 수 있다는 실무적인 기여도가 있다. 본 논문은 세 종류의 서비스 요금 클래스가 있을 경우 최적의 해를 정확히 구하였다. 향후 연구는 다양한 요금 모델에서 최적의 해를 구하는 것이다.

환자 우선순위를 고려한 수술실 예약 : 이진검색을 활용한 수정 평가치반복법 (Operating Room Reservation Problem Considering Patient Priority : Modified Value Iteration Method with Binary Search)

  • 민대기
    • 산업공학
    • /
    • 제24권4호
    • /
    • pp.274-280
    • /
    • 2011
  • Delayed access to surgery may lead to deterioration in the patient condition, poor clinical outcomes, increase in the probability of emergency admission, or even death. The purpose of this work is to decide the number of patients selected from a waiting list and to schedule them in accordance with the operating room capacity in the next period. We formulate the problem as an infinite horizon Markov Decision Process (MDP), which attempts to strike a balance between the patient waiting times and overtime works. Structural properties of the proposed model are investigated to facilitate the solution procedure. The proposed procedure modifies the conventional value iteration method along with the binary search technique. An example of the optimal policy is provided, and computational results are given to show that the proposed procedure improves computational efficiency.

신생아 특발성 비용혈성 고빌리루빈혈증의 위험 요인에 따른 임상 양상 (The Clinical Characteristics According to the Risk Factors of Idiopathic Nonhemolytic Hyperbilirubinemia)

  • 박숙현;강지현;권순학;김행미;김용선
    • Neonatal Medicine
    • /
    • 제17권2호
    • /
    • pp.224-231
    • /
    • 2010
  • 목적: 최근 출생 후 조기 퇴원과 모유수유 증가로 인해 신생아 고빌리루빈혈증에 의한 재입원 비율이 증가하고 있다. 신생아 고빌리루빈혈증은 적절한 시기에 치료하지 않으면 빌리루빈 뇌증을 유발하여 치명적인 신경학적 후유증을 남길 수 있어 적절한 치료와 함께 조기 예방의 중요성이 부각되고 있다. 이에 저자는 우리나라 신생아의 특발성 비용혈성 고빌리루빈혈증의 임상 경과와 위험 인자, 뇌 MRI 결과를 조사함으로써 황달의 역학 조사와 치료 방침 설정의 기초 자료를 얻고자 본 연구를 시행하였다. 방법: 2006년 1월부터 2009년 9월까지 고빌리루빈혈증으로 진단받고 경북대학교병원 신생아 집중치료실에 입원한 환아 중 재태연령이 35주 이상, 총혈청 빌리루빈이 20 mg/dL 이상이면 서 용혈성 질환이 없으면서 감염, 대사 질환등 황달의 원인이 없는 79명의 환아를 대상으로 의무 기록을 후향적으로 조사하였다. 결과: 평균 재태주령은 $38^{+3}{\pm}1^{+4}$주였고 내원 당시 나이는 8.8$\pm$4.0일이었다. 내원 당시 체중은 3,105$\pm$479 g으로 출생 체중 3,174$\pm$406 g과 비교하여 평균 2.8$\pm$6.4% 감소하였다. 모유수유, 두혈종, 경막하출혈 및 ABO 부적합증과 같은 위험인자가 있는 환아와 위험인자가 없는 환아를 비교하였으며 최고 총혈청빌리루빈, 광선요법의 시행 기간 및 반응 정도에서 유의한 차이를 보이지 않았다. 출생 체중과 입원 당시 체중을 비교하여 체중이 증가한 군과 감소한 군의 비교에서는 재태주령, 내원 당시 연령과 최고 혈청 빌리루빈치가 유의한 차이를 보였다. 뇌 MRI를 시행한 39명의 환아 중 21명은 T1 강조 영상에서 창백핵의 음영이 피각 및 인접한 피질척수로의 음영과 비교하여 증가된 소견을 보였다. 43명의 환아가 ABR을 시행하였는데 5명의 환아에서 이상 소견이 보였다. 결론: 우리나라에서 발생하는 특발성 비용혈성 고빌리루빈혈증은 수유량 부족이 원인이 될 수 있으므로 수유방법에 대한 충분한 교육과 퇴원 후 정기적인 추적 관찰이 필요하다. 본 연구는 많은 대상군을 포함하지 않아 더 많은 대상군과 대조군의 비교분석이 필요하고 향후 장기적인 추적 관찰을 통해서 만성 빌리루빈 뇌증에 대한 연구도 필요할 것으로 생각된다.