검색결과

검색조건
좁혀보기
검색필터
결과 내 재검색

간행물

    분야

      발행연도

      -

        검색결과 12

        1.
        2023.06 KCI 등재 구독 인증기관 무료, 개인회원 유료
        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.
        4,800원
        2.
        2021.12 KCI 등재 구독 인증기관 무료, 개인회원 유료
        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.
        4,800원
        3.
        2020.12 KCI 등재 구독 인증기관 무료, 개인회원 유료
        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.
        4,600원
        4.
        2019.12 KCI 등재 구독 인증기관 무료, 개인회원 유료
        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.
        4,800원
        5.
        2017.09 KCI 등재 구독 인증기관 무료, 개인회원 유료
        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.
        4,000원
        6.
        2017.06 KCI 등재 구독 인증기관 무료, 개인회원 유료
        In order to implement the smart home environment, we need an intelligence service platform that learns the user’s life style and behavioral patterns, and recommends appropriate services to the user. The intelligence service platform should embed a couple of effective and efficient data mining algorithms for learning from the data that is gathered from the smart home environment. In this study, we evaluate the suitability of data mining algorithms for smart home intelligent service platforms. In order to do this, we first develop an intelligent service scenario for smart home environment, which is utilized to derive functional and technical requirements for data mining algorithms that is equipped in the smart home intelligent service platform. We then evaluate the suitability of several data mining algorithms by employing the analytic hierarchy process technique. Applying the analytical hierarchy process technique, we first score the importance of functional and technical requirements through a hierarchical structure of pairwise comparisons made by experts, and then assess the suitability of data mining algorithms for each functional and technical requirements. There are several studies for smart home service and platforms, but most of the study have focused on a certain smart home service or a certain service platform implementation. In this study, we focus on the general requirements and suitability of data mining algorithms themselves that are equipped in smart home intelligent service platform. As a result, we provide a general guideline to choose appropriate data mining techniques when building a smart home intelligent service platform.
        4,000원
        8.
        2012.12 KCI 등재 구독 인증기관 무료, 개인회원 유료
        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.
        4,000원
        9.
        2011.12 KCI 등재 구독 인증기관 무료, 개인회원 유료
        This thesis introduced a model of diagnosing a company's quality management, and a process of achieving quality innovation based on the model. As for study methods, books and theses related to quality and process innovation were collected for investigation, a survey on internal employees to investigate major issues of quality and standard consciousness was conducted, and 5DP was discussed for balanced process analysis.
        4,000원
        10.
        2008.04 KCI 등재 구독 인증기관 무료, 개인회원 유료
        본 연구에서는 전단벽-모멘트골조 시스템으로서 전단벽이 주로 횡력을 부담하는 철근콘크리트 건물을 대상으로 다양한 설치형식과 마찰력의 총량 및 분포를 갖는 마찰형 감쇠기의 제진보강 효과를 수치해석을 통해 비교 분석하였다. 감쇠기의 설치형식으로서 전단벽에 인접한 대각가새형, 벽체가 없는 골조를 보강하는 대각가새형 및 벽체 단부를 보강하는 수직경계요소형을 고려하였다. 하중기준 강화로 설계용보다 크게 증가한 지진하중에 대해 건물의 재료비선형성을 고려한 비선형시간이력해석을 수행하여 에너지소산, 횡하중 및 부재손상도 측면에서 마찰형 감쇠기의 제진성능을 비교 분석하였다. 기준마찰력의 30% 수준의 총마찰력을 갖는 벽체보강 대각가새형 설치형식이 전반적으로 가장 우수한 제진성능을 보이며,이 경우에 마찰력 배분방식은 중요하지 않았다. 또한 일부층에 집중설치함으로써 전층설치에 약간 못미치는 제진성능을 얻을 수 있었다.
        4,800원
        11.
        2002.04 KCI 등재 구독 인증기관 무료, 개인회원 유료
        본 연구는 철근콘크리트 연성 모멘트골조의 선형.비선형 정적해석을 통한 반응수정계수와 비선형 변위량을 평가하여 합리적인 내진설계의 기초자료를 제공하는 것을 목적으로 한다. 먼저 국내 내진설계 규준에 따라 각 모델을 설계한 후, 철근콘크리트 연성 모멘트골조의 반응수정계수와 비선형 변위량을 평가하였으며, 해석에 사용된 모델은 층수(10, 20, 30), 평면비(1:1, 1:2), 해석방법(2D, 3D)을 변수로 한 27개의 모델이다. 반응수정계수와 비선형 변위량의 평가는 각 모델별 선형.비선형 정적해석을 수행하여 그 결과를 비교 분석하여 산정하였다. 반응수정계수는 강도계수, 연성계수, 잉여도계수, 감쇠계수의 곱으로 산정하였고, 그 결과 해석방향의 저항골조의 수에 따라 2 스팬인 경우 3.5, 3 스팬인 경우 4.3, 4 스팬 이상인 경우에는 평면비나 층수와 상관없이 5.0에 근접한 결과를 나타내었다. 비선형 변위량은 층간변위각비(비선형 변위각/선형 변위각)에 의해 평가되었으며, 층간변위각비는 5.85에서 9.34로 나타났다.
        4,000원
        12.
        1994.09 KCI 등재 구독 인증기관 무료, 개인회원 유료
        식품가공공장은 제품의 특성에 따라 필요로 되는 여러 가지의 단위공정이 조합되어 가동되고 있다. 식품제조 공정중 분리, 분획 및 농축은 매우 중요한 처리로 이를 위해서 증류, 증발, 원심분리, 여과 등의 조작이 절대적으로 필요하고, 최종 제품이 액상일 경우 유통중 변질 발생을 방지하기 위해 살균 공정을 반드시 거치도록 되어 있다. 또한 제품의 생산과정 중 사용되는 폐수에 의한 환경오염을 막기 위해서 폐수정화시설이 필수적으로 되어 있다. 이러한 대부분의 조작과정 중에는 열처리가 반드시 수반됨에 다라 가공원료 중에 함유된 각종 영양 성분이 부분적으로 열에 의해 파괴되고 냄새나 색 등이 변함에 따라 제품의 품질이 열화됨은 물론, 에너지 비용, 관련시설의 설치에 소요되는 부지, 시설비 및 운영비 등이 많이 필요로 된다.
        5,500원