In this study, we analyze a finite-buffer M/G/1 queueing model with randomized pushout space priority and nonpreemptive time priority. Space and time priority queueing models have been extensively studied to analyze the performance of communication systems serving different types of traffic simultaneously: one type is sensitive to packet delay, and the other is sensitive to packet loss. However, these models have limitations. Some models assume that packet transmission times follow exponential distributions, which is not always realistic. Other models use general distributions for packet transmission times, but their space priority rules are too rigid, making it difficult to fine-tune service performance for different types of traffic. Our proposed model addresses these limitations and is more suitable for analyzing communication systems that handle different types of traffic with general packet length distributions. For the proposed queueing model, we first derive the distribution of the number of packets in the system when the transmission of each packet is completed, and we then obtain packet loss probabilities and the expected number of packets for each type of traffic. We also present a numerical example to explore the effect of a system parameter, the pushout probability, on system performance for different packet transmission time distributions.

In a group-testing method, instead of testing a sample, for example, blood individually, a batch of samples are pooled and tested simultaneously. If the pooled test is positive (or defective), each sample is tested individually. However, if negative (or good), the test is terminated at one pooled test because all samples in the batch are negative. This paper considers a queueing system with a two-stage group-testing policy. Samples arrive at the system according to a Poisson process. The system has a single server which starts a two-stage group test in a batch whenever the number of samples in the system reaches exactly a predetermined size. In the first stage, samples are pooled and tested simultaneously. If the pooled test is negative, the test is terminated. However, if positive, the samples are divided into two equally sized subgroups and each subgroup is applied to a group test in the second stage, respectively. The server performs pooled tests and individual tests sequentially. The testing time of a sample and a batch follow general distributions, respectively. In this paper, we derive the steady-state probability generating function of the system size at an arbitrary time, applying a bulk queuing model. In addition, we present queuing performance metrics such as the offered load, output rate, allowable input rate, and mean waiting time. In numerical examples with various prevalence rates, we show that the second-stage group-testing system can be more efficient than a one-stage group-testing system or an individual-testing system in terms of the allowable input rates and the waiting time. The two-stage group-testing system considered in this paper is very simple, so it is expected to be applicable in the field of COVID-19.

본 논문에서는 유지보수를 위한 구조물 인상 시 위험도 분석을 수행하여 안전사고를 방지할 수 있는 스마트 자동 인상 시스템을 개 발하였다. 쌍대비교행렬 분석 기법을 활용하여 위험도를 분석할 수 있는 정량적 위험도 분석 프로그램을 개발하였고, 이를 자동 인상 시스템과 연계하여 구조물 인상과 동시에 실시간으로 위험도 분석을 하였다. 자동 인상 시스템의 구성요소 중 거리측정센서로 구조 물 인상 시의 변위를 측정하고, 측정된 변위는 정량적 위험도 분석 프로그램에 입력되어 위험도를 분석한다. 개발한 스마트 자동 인상 시스템의 성능을 확인하기 위해 실제 교량을 대상으로 실험을 수행하였으며, 구조물 인상과 동시에 위험도 분석이 가능한지를 확인 하였다. 스마트 자동 인상 시스템의 성능을 평가하기 위해 인상실험 시 검증된 LVDT(linear variable differential transformer)를 함께 설치하였으며 거리측정센서와 LVDT로 측정되는 변위로 최대 인상량과 구역별 단차를 분석하였다. 인상장치의 동시 작동에 대한 성 능을 통계적 분석방법인 분산분석(analysis of variance) 방법을 이용하여 성능을 검증하였다.

COVID-19 has been spreading all around the world, and threatening global health. In this situation, identifying and isolating infected individuals rapidly has been one of the most important measures to contain the epidemic. However, the standard diagnosis procedure with RT-PCR (Reverse Transcriptase Polymerase Chain Reaction) is costly and time-consuming. For this reason, pooled testing for COVID-19 has been proposed from the early stage of the COVID-19 pandemic to reduce the cost and time of identifying the COVID-19 infection. For pooled testing, how many samples are tested in group is the most significant factor to the performance of the test system. When the arrivals of test requirements and the test time are stochastic, batch-service queueing models have been utilized for the analysis of pooled-testing systems. However, most of them do not consider the false-negative test results of pooled testing in their performance analysis. For the COVID-19 RT-PCR test, there is a small but certain possibility of false-negative test results, and the group-test size affects not only the time and cost of pooled testing, but also the false-negative rate of pooled testing, which is a significant concern to public health authorities. In this study, we analyze the performance of COVID-19 pooled-testing systems with false-negative test results. To do this, we first formulate the COVID-19 pooled-testing systems with false negatives as a batch-service queuing model, and then obtain the performance measures such as the expected number of test requirements in the system, the expected number of RP-PCR tests for a test sample, the false-negative group-test rate, and the total cost per unit time, using the queueing analysis. We also present a numerical example to demonstrate the applicability of our analysis, and draw a couple of implications for COVID-19 pooled testing.

본 연구에서는 게임 동영상의 고화질 변환이 가능한 초해상화 알고리즘을 제시한다. 본 알고리즘은 오픈 소 스 형태의 GPU에서 제공하는 MMU에서 구현될 수 있도록 희소 행렬 연산을 이용해서 설게된다. 이를 위해 서 일반적인 영상 해상도 향상 방법인 이중 일차 및 이중 삼차 보간 법과 심층 학습에 기반한 초해상화 모 델에서 사용하는 컨볼루션 연산을 희소 행렬 연산으로 변환하는 방법을 제시한다. 이는 각 픽셀에 적용되는 필터를 행렬 곱 형태로 표현하고, 이 행렬을 희소 행렬로 표현함으로써 수행되는데, 이러한 과정을 통해서 연산의 효율성을 추구함으로써 안정적인 초해상화 알고리즘을 제공한다. 이러한 희소행렬 연산 형태로 표현 되는 초해상화 알고리즘은 기존의 라이브러리를 이용해서 구현된 초해상화 알고리즘과 유사한 PSNR과 FPS 를 보인다.

Recently, M/G/1 priority queues with a finite buffer for high-priority customers and an infinite buffer for low-priority customers have applied to the analysis of communication systems with two heterogeneous traffics : delay-sensitive traffic and loss-sensitive traffic. However, these studies are limited to M/G/1 priority queues with finite and infinite buffers under a work-conserving priority discipline such as the nonpreemptive or preemptive resume priority discipline. In many situations, if a service is preempted, then the preempted service should be completely repeated when the server is available for it. This study extends the previous studies to M/G/1 priority queues with finite and infinite buffers under the preemptive repeat-different and preemptive repeat-identical priority disciplines. We derive the loss probability of high-priority customers and the waiting time distributions of high- and low-priority customers. In order to do this, we utilize the delay cycle analysis of finite-buffer M/G/1/K queues, which has been recently developed for the analysis of M/G/1 priority queues with finite and infinite buffers, and combine it with the analysis of the service time structure of a low-priority customer for the preemptive-repeat and preemptive-identical priority disciplines. We also present numerical examples to explore the impact of the size of the finite buffer and the arrival rates and service distributions of both classes on the system performance for various preemptive priority disciplines.

Discrete-time Queueing models are frequently utilized to analyze the performance of computing and communication systems. The length of busy period is one of important performance measures for such systems. In this paper, we consider the busy period of the Geo/Geo/1/K queue with a single vacation. We derive the moments of the length of the busy (idle) period, the number of customers who arrive and enter the system during the busy (idle) period and the number of customers who arrive but are lost due to no vacancies in the system for both early arrival system (EAS) and late arrival system (LAS). In order to do this, recursive equations for the joint probability generating function of the busy period of the Geo/Geo/1/K queue starting with n, 1≤n≤K, customers, the number of customers who arrive and enter the system, and arrive but are lost during that busy period are constructed. Using the result of the busy period analysis, we also numerically study differences of various performance measures between EAS and LAS. This numerical study shows that the performance gap between EAS and LAS increases as the system capacity K decrease, and the arrival rate (probability) approaches the service rate (probability). This performance gap also decreases as the vacation rate (probability) decrease, but it does not shrink to zero.

한문과와 같이 학습자에 따라 또는 한문 교과 이수 정도에 따라 학업 성취 수준이 크게 차이가 나는 특수한 경우에는 학생 개개인의 특성 및 차이, 숙달 및 미숙 등에 따라 개별적으로 평가 결과 를 분석하거나 보고(reporting)한다면, 이러한 자료들을 통해서 학생들은 더 나은 학습을 수행 (performance)할 수 있고 교사들은 더욱 효율적인 교수 ‒ 학습을 진행할 수 있다. 이러한 관점 하에 서 최근 교육 평가 분야에서 새롭게 주목하고 있는 인지진단모형(cognitive diagnostic model)을 소 개하고 한문과 평가에 적용해 볼 필요가 있을 것으로 판단하였다. 따라서 이번 연구에서는 최근에 새롭게 주목받고 있는 인지진단모형을 한문과 평가 연구자들에게 간단히 소개하고, 한문과 수능 문 항과 문항의 특정 속성과의 관계를 규명하여 Q행렬을 구성해봄으로써 인지진단모형의 한문과 적용 에 대한 적절성과 적용 가능성을 탐색해보고자 한다.

Priority disciplines are an important scheme for service systems to differentiate their services for different classes of customers. (N, n)-preemptive priority disciplines enable system engineers to fine-tune the performances of different classes of customers arriving to the system. Due to this virtue of controllability, (N, n)-preemptive priority queueing models can be applied to various types of systems in which the service performances of different classes of customers need to be adjusted for a complex objective. In this paper, we extend the existing (N, n)-preemptive resume and (N, n)-preemptive repeat-identical priority queueing models to the (N, n)-preemptive repeat-different priority queueing model. We derive the queue-length distributions in the M/G/1 queueing model with two classes of customers, under the (N, n)-preemptive repeat-different priority discipline. In order to derive the queue-length distributions, we employ an analysis of the effective service time of a low-priority customer, a delay cycle analysis, and a joint transformation method. We then derive the first and second moments of the queue lengths of high- and low-priority customers. We also present a numerical example for the first and second moments of the queue length of high- and low-priority customers. Through doing this, we show that, under the (N, n)-preemptive repeat-different priority discipline, the first and second moments of customers with high priority are bounded by some upper bounds, regardless of the service characteristics of customers with low priority. This property may help system engineers design such service systems that guarantee the mean and variance of delay for primary users under a certain bounds, when preempted services have to be restarted with another service time resampled from the same service time distribution.

In this paper, we present a new way to derive the mean cycle time of the G/G/m failure prone queue when the loading of the system approaches to zero. The loading is the relative ratio of the arrival rate to the service rate multiplied by the number of servers. The system with low loading means the busy fraction of the system is low. The queueing system with low loading can be found in the semiconductor manufacturing process. Cluster tools in semiconductor manufacturing need a setup whenever the types of two successive lots are different. To setup a cluster tool, all wafers of preceding lot should be removed. Then, the waiting time of the next lot is zero excluding the setup time. This kind of situation can be regarded as the system with low loading. By employing absorbing Markov chain model and renewal theory, we propose a new way to derive the exact mean cycle time. In addition, using the proposed method, we present the cycle times of other types of queueing systems. For a queueing model with phase type service time distribution, we can obtain a two dimensional Markov chain model, which leads us to calculate the exact cycle time. The results also can be applied to a queueing model with batch arrivals. Our results can be employed to test the accuracy of existing or newly developed approximation methods. Furthermore, we provide intuitive interpretations to the results regarding the expected waiting time. The intuitive interpretations can be used to understand logically the characteristics of systems with low loading.

목 적: 여러 개의 렌즈로 구성된 광학시스템에 대한 유용한 분석 도구로서 행렬전달식의 가능성을 확인 하고, 이를 이용하여 사람 눈을 포함한 복합 광학계를 분석하였다. 대상과 방법: 굴스트란드 모형안의 각막, 수정체, 전체 광학계 및 근시성 난시안에서 가우스 결상방정식 과 행렬전달식으로 각각의 굴절력을 계산하고 그 결과를 비교분석하였다. 결 과: 가우스 결상방정식과 행렬전달식의 결과로 굴스트란드 정식모형안에서 각막굴절력은 각각 43.05D, 43.10D였고, 수정체굴절력은 19.50D, 19.50D, 전체 광학계굴절력에서는 동일하게 59.05D으로 계 산되었다. 본 연구에서 적용한 근시성 난시안인 환자의 경우, 가우스 결상방정식의 수직정점초점거리와 수평 정점초점거리는 각각 24.85 mm, 25.15 mm이며 행렬전달식의 수직정점초점거리와 수평정점초점거리는 각 각 24.84 mm, 25.14 mm로 계산되었다. 결 론: 굴스트란드 모형안의 각막, 수정체, 전체 광학계, 실제 근시성 난시안에서 가우스 결상방정식과 행렬전달식에 의한 결과의 차이가 크지 않았으며, 행렬전달식은 난시안을 포함한 좀 더 복잡한 광학계를 분 석하기에 유용함을 확인하였다.

이 논문은 부분공간 시스템 확인기법을 이용하여 전단빌딩의 강성행렬과 부재의 강성을 추정하는 기법을 소개한다. 시스템 행렬은 입력-출력 데이터로 구성된 행켈행렬을 LQ 분해와 특이치 분해를 통해 추정한다. 추정된 시스템 행렬은 닮음 변환을 통해 실제 좌표축으로 변환하고, 변환된 시스템 행렬로부터 강성행렬을 계산한다. 추정된 강성행렬의 정확성과 안정성은 행켈행렬의 크기에 따라 변한다. 전단빌딩의 기저 유한요소 모델을 이용하여 행켈행렬의 크기에 따른 강성행렬의 추정오차 곡선을 구한다. 오차 곡선을 이용하여 목표 정확도 수준에 부합하는 행켈행렬의 크기들을 결정한다. 이렇게 선택된 행렬의 크기들 중에서 부분공간 시스템 확인의 계산비용을 고려하여 보다 적절한 행렬의 크기를 결정할 수 있다. 결정된 크기의 행켈행렬을 이용하여 강성행렬을 추정하고 추정된 강성행렬로부터 부재의 강성을 추정한다. 제안된 방법을 손상 전후의 5층 전단빌딩 수치 예제에 적용하여 타당성을 검증한다.

We propose a new priority discipline called the strict T-preemptive priority discipline, and derive the waiting time distributions of each class in the strict T-preemptive priority M/G/1 queue. Using this queueing analysis, we evaluate the performance of an opportunistic spectrum access in cognitive radio networks, where a communication channel is divided into time slots, a licensed primary user is assigned to one channel, and multiple unlicensed secondary users may opportunistically exploit time slots unused by the primary user. We also present a numerical example of the analysis of the opportunistic spectrum access where the arrival rates and service times distributions of each users are identical.