• Title/Summary/Keyword: Time occupancy

Search Result 251, Processing Time 0.3 seconds

Unlicensed Band Traffic and Fairness Maximization Approach Based on Rate-Splitting Multiple Access (전송률 분할 다중 접속 기술을 활용한 비면허 대역의 트래픽과 공정성 최대화 기법)

  • Jeon Zang Woo;Kim Sung Wook
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.12 no.10
    • /
    • pp.299-308
    • /
    • 2023
  • As the spectrum shortage problem has accelerated by the emergence of various services, New Radio-Unlicensed (NR-U) has appeared, allowing users who communicated in licensed bands to communicate in unlicensed bands. However, NR-U network users reduce the performance of Wi-Fi network users who communicate in the same unlicensed band. In this paper, we aim to simultaneously maximize the fairness and throughput of the unlicensed band, where the NR-U network users and the WiFi network users coexist. First, we propose an optimal power allocation scheme based on Monte Carlo Policy Gradient of reinforcement learning to maximize the sum of rates of NR-U networks utilizing rate-splitting multiple access in unlicensed bands. Then, we propose a channel occupancy time division algorithm based on sequential Raiffa bargaining solution of game theory that can simultaneously maximize system throughput and fairness for the coexistence of NR-U and WiFi networks in the same unlicensed band. Simulation results show that the rate splitting multiple access shows better performance than the conventional multiple access technology by comparing the sum-rate when the result value is finally converged under the same transmission power. In addition, we compare the data transfer amount and fairness of NR-U network users, WiFi network users, and total system, and prove that the channel occupancy time division algorithm based on sequential Raiffa bargaining solution of this paper satisfies throughput and fairness at the same time than other algorithms.

Comparative analysis of the in vivo kinetic properties of various bone substitutes filled into a peri-implant canine defect model

  • Jingyang Kang;Masaki Shibasaki;Masahiko Terauchi;Narumi Oshibe;Katsuya Hyodo;Eriko Marukawa
    • Journal of Periodontal and Implant Science
    • /
    • v.54 no.2
    • /
    • pp.96-107
    • /
    • 2024
  • Purpose: Deproteinized bovine bone or synthetic hydroxyapatite are 2 prevalent bone grafting materials used in the clinical treatment of peri-implant bone defects. However, the differences in bone formation among these materials remain unclear. This study evaluated osteogenesis kinetics in peri-implant defects using 2 types of deproteinized bovine bone (Bio-Oss® and Bio-Oss/Collagen®) and 2 types of synthetic hydroxyapatite (Apaceram-AX® and Refit®). We considered factors including newly generated bone volume; bone, osteoid, and material occupancy; and bone-to-implant contact. Methods: A beagle model with a mandibular defect was created by extracting the bilateral mandibular third and fourth premolars. Simultaneously, an implant was inserted into the defect, and the space between the implant and the surrounding bone walls was filled with Bio-Oss, Bio-Oss/Collagen, Apaceram-AX, Refit, or autologous bone. Micro-computed tomography and histological analyses were conducted at 3 and 6 months postoperatively (Refit and autologous bone were not included at the 6-month time point due to their rapid absorption). Results: All materials demonstrated excellent biocompatibility and osteoconductivity. At 3 months, Bio-Oss and Apaceram-AX exhibited significantly greater volumes of formation than the other materials, with Bio-Oss having a marginally higher amount. However, this outcome was reversed at 6 months, with no significant difference between the 2 materials at either time point. Apaceram-AX displayed notably slower bioresorption and the largest quantity of residual material at both time points. In contrast, Refit had significantly greater bioresorption, with complete resorption and rapid maturation involving cortical bone formation at the crest at 3 months, Refit demonstrated the highest mineralized tissue and osteoid occupancy after 3 months, albeit without statistical significance. Conclusions: Overall, the materials demonstrated varying post-implantation behaviors in vivo. Thus, in a clinical setting, both the properties of these materials and the specific conditions of the defects needing reinforcement should be considered to identify the most suitable material.

Real-time Bandwidth Allocation Based on Buffer Occupancy Ratio for Guaranteeing QoS of Multimedia Traffic (멀티미디어 트래픽의 QoS 보장을 위한 버퍼 점유율에 기반한 실시간 대역폭 할당)

  • 백남균;정수환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.5A
    • /
    • pp.730-737
    • /
    • 2001
  • 광대역 멀티미디어 서비스 제공을 위한 트래픽 관리 중 자원 할당과 호 수락 제어는 사용자의 다양한 서비스 품질을 보장하기 위한 사항 중 가장 중요한 문제이며 할당 방법과 제어 방법에 따라 망의 운용 효율이 크게 달라진다. 본 논문에서는 기존의 최악의 경우 모델에 의한 고정된 유효 대역폭 할당에 따른 자원의 낭비를 제거하고자 버퍼 점유율에 기반 한 실시간 동적 대역폭 할당 방법에 제안한다. 자원의 효율적인 사용을 위해 입력 트래픽의 증감에 따라 서로 다른 동적 대역폭을 할당하였으며 서비스 품질을 만족시키기 위한 버퍼 큐 크기의 입계값 범위를 도출하여 그에 따른 동적 셀률을 유도 할당하였다. 또한, 시뮬레이션을 통해 제안된 방법의 성능 향상을 소요 대역폭과 호 수락 제어 측면에서 비교 분석하였다.

  • PDF

A Parallel Processors Scheduling Problems with a Common Due Date (공통납기를 고려한 병렬기계 일정계획)

  • Lee, Jeong-Hwan;No, In-Gyu
    • Journal of Korean Society for Quality Management
    • /
    • v.18 no.2
    • /
    • pp.81-92
    • /
    • 1990
  • This paper considers a scheduling of a set of jobs on single and multiple processors, when all jobs have a common due date and earliness and lateness are penalized at different cost rates. The objective is to determine the optimal value of a common due date and an optimal scheduling to minimize a total penalty function. It is also shown that a schedule having minimum weighted completion time variances must be V-shaped. For identical processors, a polynomial scheduling algorithm with the secondary objectives of minimizing makespan and machine occupancy is developed and a numerical example is presented.

  • PDF

New Dynamic Adaptive Threshold Destage Algorithms for Cached RAID 5 (RAID 5의 성능향상을 위한 쓰기 캐쉬의 동적 적응 반출기법)

  • Yie, Hyeok;Choi, Sang-Bang
    • Proceedings of the IEEK Conference
    • /
    • 2000.06c
    • /
    • pp.47-50
    • /
    • 2000
  • In this paper, we propose a new destage algorithms, called the Dynamic Adaptive Threshold which determines turn-on and turn-off thresholds dynamically depending on the current write cache occupancy level and the differential rate of the host write requests. For performance evaluation, the proposed algorithm is compared with the wellknown High-Low Water Mark (HLWM) algorithm. Performance tests are fulfilled with our cached RAID 5 simulator. The simulation results show that the proposed algorithm outperforms the HLWM algorithm in terms of response time of host reads and write cache hit ratio under various workloads.

  • PDF

A Real-time Obstacle Avoidance of Mobile Robots using Limit-cycle and Vector Field Method (Limit-cycle과 벡터장법을 이용한 이동로봇의 실시간 장애물 회피)

  • Yun, Jae-Ho;Jie, Min-Seok;Lee, Kang-Woong
    • Proceedings of the KIEE Conference
    • /
    • 2003.11b
    • /
    • pp.243-246
    • /
    • 2003
  • In this paper, we propose a novel navigation method combined limit-cycle method and the vector field method for avoidance of unexpected obstacles in the dynamic environment. The limit-cycle method is used to obstacle avoidance in front of the robot and the vector field method is used to obstacle avoidance in the side of robot. The proposed method is tested on pioneer 2-DX mobile robot. The simulations and experiments demonstrate in the effectiveness of the proposed method for navigation of a mobile robot in the complicated and dynamic environments.

  • PDF

A Study on User's Behaviors and Environmental Analysis of University Dining facilities - Focused on K University Dining Facilities by the Post Occupancy Evaluation - (대학 학생식당의 이용실태 및 환경분석에 관한 연구 - K대학 학생식당의 거주후 평가를 중심으로 -)

  • 김성기
    • Korean Institute of Interior Design Journal
    • /
    • no.38
    • /
    • pp.164-172
    • /
    • 2003
  • The purpose of this study is to analyze user's behaviors and environmental image to show how to plan dining facilities by checking what factors make user's satisfaction and how inferior factors effect dining people. The spaces in this study are dining facilities in a University. Dining places are campus welfare facilities, students don't have other choice. Dining facilities are determined according to user's desire to convenience and time saying. And this facilities will be compliment to resting places in campus. As we know, functional planing facilities are central element in University Master Plan and must consider interior decoration, surrounding places and some other instruments. Scale of dining facilities must accommodate with many students, therefore dining facilities can served as spare place and resting space.

The Study on the exit taxiway of an airpark used in LSA (경량항공기 이착륙장의 탈출유도로에 대한 연구)

  • Shin, Dai-Won;Shin, Hong-Chul
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.18 no.3
    • /
    • pp.70-76
    • /
    • 2010
  • In this study, we surveyed the operating status of the Light Sport Aircraft(LSA) in Korea, and reviewed the minimum requirements of the airpark for LSA. We are discuss about increased aerodrome traffic density and safety improvement, through the installation of the exit taxiway. The shape of the exit taxiway of an airpark used in LSA is a rectangle for usable two way direction of runway. The array types of exit taxiway influence paved and unpaved runway occupancy time of LSA.

An implementation of the dynamic rate leaky bucket algorithm combined with a neural network based prediction (신경회로망 예측기법을 결합한 Dynamic Rate Leaky Bucket 알고리즘의 구현)

  • 이두헌;신요안;김영한
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.2
    • /
    • pp.259-267
    • /
    • 1997
  • The advent of B-ISDN using ATM(asynchronous transfer mode) made possible a variety of new multimedia services, however it also created a problem of congestion control due to bursty nature of various traffic sources. To tackle this problem, UPC/NPC(user parameter control/network parameter control) have been actively studied and DRLB(dynamic rate leaky bucket) algorithm, in which the token generation rate is changed according to states of data source andbuffer occupancy, is a good example of the UPC/NPC. However, the DRLB algorithm has drawbacks of low efficiency and difficult real-time implementation for bursty traffic sources because the determination of token generation rate in the algorithm is based on the present state of network. In this paper, we propose a more plastic and effective congestion control algorithm by combining the DRLB algorithm and neural network based prediction to remedy the drawbacks of the DRLB algorithm, and verify the efficacy of the proposed method by computer simulations.

  • PDF

AN ANALYSIS OF THE MEMORY RELATED COMMUNICATION SYSTEM

  • Lim, Jong-Seul;Park, Chin-Hong
    • Journal of applied mathematics & informatics
    • /
    • v.16 no.1_2
    • /
    • pp.539-550
    • /
    • 2004
  • We consider communication or computer systems that have the average memory occupancy and congestion. A certain system may be reduced further if new processes are admitted only when the number of processes queued at the processor is below a certain threshold, run queue cutoff(RQ). We show that response time of a process is invariant with respect to RQ when processes do not communicate each other. The invariance property is considered with the evolution of the queue lengths as point processes and demonstrate it numerically using matrix-geometric methods. We illustrate the RQ invariance property.