• 제목/요약/키워드: mean waiting time

검색결과 128건 처리시간 0.028초

대형할인매장 이용자의 충동구매에 관한 연구 (A Study on the Impulse Buying of Large Discount Store Consumers)

  • 김수영;유두련
    • 가정과삶의질연구
    • /
    • 제19권1호
    • /
    • pp.95-110
    • /
    • 2001
  • Recently a number of large discount store and those of its users was increasing. The purpose of this study is to investigate the tendency of impulse buying and analyzes factors which influence impulse buying. The data had been collected from questionaries with 474 consumers who visit large discount store. The major statistical methods used for data analysis are frequency, percentile, mean, t-test, multiple regression analysis, one-way ANOVA, and Duncans multiple range test utilizing SPSS Win pc+program. The results of this study are as follows : 1. The four different kind of impulse buying is measured. The overall level of impulse buying is 2.76. Suggestion impulse buying(M=3.19) is the highest, and the lowest is pure impulse buying(M=2.66). 2. In the area of demographic variables is significantly different in the age of twenties and thirties(p<.05). A visit frequency and membership. In the area of in-store variables is significantly different by all factors at impulse buying except waiting time. Especially, point-of-purchase(POP) advertisement and discount sale are very important variables. A visit frequency and membership are significantly different in the area of consumer-related variables. 3. Waiting time, a visit frequency, a POP advertisement, and a discount sale have the positive effects on overall impulse buying. Pure impulse buying is influenced by shopping list, POP advertisement and a stores atmospher. Buying companion, membership, kind of store and waiting time have the effect on reminder impulse buying. Suggestion impulse buying is influenced by school career, shopping list and POP advertisement. Planned impulse buying is influenced by sex, POP advertisement, buying companion and discount sale.

  • PDF

Comprehensive Investigations on QUEST: a Novel QoS-Enhanced Stochastic Packet Scheduler for Intelligent LTE Routers

  • Paul, Suman;Pandit, Malay Kumar
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권2호
    • /
    • pp.579-603
    • /
    • 2018
  • In this paper we propose a QoS-enhanced intelligent stochastic optimal fair real-time packet scheduler, QUEST, for 4G LTE traffic in routers. The objective of this research is to maximize the system QoS subject to the constraint that the processor utilization is kept nearly at 100 percent. The QUEST has following unique advantages. First, it solves the challenging problem of starvation for low priority process - buffered streaming video and TCP based; second, it solves the major bottleneck of the scheduler Earliest Deadline First's failure at heavy loads. Finally, QUEST offers the benefit of arbitrarily pre-programming the process utilization ratio.Three classes of multimedia 4G LTE QCI traffic, conversational voice, live streaming video, buffered streaming video and TCP based applications have been considered. We analyse two most important QoS metrics, packet loss rate (PLR) and mean waiting time. All claims are supported by discrete event and Monte Carlo simulations. The simulation results show that the QUEST scheduler outperforms current state-of-the-art benchmark schedulers. The proposed scheduler offers 37 percent improvement in PLR and 23 percent improvement in mean waiting time over the best competing current scheduler Accuracy-aware EDF.

대기오염으로 인한 건강효과의 경제적 비용 -급성 호흡기 질환 외래환자를 중심으로- (Estimating the Cost of Air Pollution on Morbidity: Focusing on Hospital Visit for Acute Respiratory Diseases)

  • 신영철
    • 자원ㆍ환경경제연구
    • /
    • 제11권4호
    • /
    • pp.659-687
    • /
    • 2002
  • This study used a discrete choice model to investigate an association between air pollution and hospital visits for acute respiratory symptoms with the national health interview survey conducted in 1998 in South Korea. The results showed that $NO_2$ and TSP were significantly related to hospital visits in a single-pollutant model, but when they were simultaneously considered, only $NO_2$ remained significant. It was estimated as $NO_2$ level increased by 10%(0.0027ppm) from 0.027ppm (the mean $NO_2$ level), hospital visits increase by 0.176%. This study also measured respondent's out-of-pocket expense and the time cost for commuting and waiting for the visit. We found that on the average, out-of-pocket expense is 5,600 won per hospital visit, but the total cost per hospital visit is measured at 33,440 won with time cost of commuting and waiting at 27,840 won. Time cost was over 63.6~83.3% of the total cost per hospital visit.

  • PDF

유한한 버퍼를 가지는 IEEE 802.4 토큰패싱시스템의 성능해석 (Performance analysis of the IeEE 802.4 token passing system with finite buffers)

  • 박정우;문상용;권욱현
    • 전자공학회논문지B
    • /
    • 제33B권7호
    • /
    • pp.11-20
    • /
    • 1996
  • In this paper, the performance of the IeEE 802.4 token-passing is analyzed under the assumption that all nodes have finite buffers and finite THT (token tolding time). The loads generated at nodes are assumed to be asymmetric. The priority mechanism is not considered. This paper derives an approximate matrix equation of the queue length distributin in terms of the number of nodes, frame arrival rate and mean service time of a frame in steady state. Based on the matrix equation, the mean token rotation time, the mean waiting time and the blocking probability are derived analytically. the analytic results are compared with simulation results in order to show that the deviations are small.

  • PDF

Bit-dropping에 의한 Overload Control 방식을 채용한 Packet Voice Multiplexer의 성능 분석에 관한 연구 (Performance Analysis of a Packet Voice Multiplexer Using the Overload Control Strategy by Bit Dropping)

  • 우준석;은종관
    • 한국통신학회논문지
    • /
    • 제18권1호
    • /
    • pp.110-122
    • /
    • 1993
  • 음성이 패킷망을 통해 전송될때 각각의 call들에 의해서 발생되는 패킷들은 statistical multiplexer에 의해 다중화 되는데 이때 overload control이 필요하다. Overload control 방식은 음성 traffic을 coding하는 방식과 밀접한 관계가 있으며 그동안 많은 연구가 진행되어 왔다. CCITT에서는 최근에 packetized voice protocol에 대한 권고안 초안인 G.764를 작성하였는데 여기에서 embedded coding을 사용하는 경우에 bit dropping 방식을 사용하면 매우 훌륭하게 overload control을 할 수 있다는 사실을 언급하였다. 이에 따라 본 논문에서는 음성을 embedded ADPCM으로 coding하여 CCITT권고안 G.764에 따라 전송하는 경우에, bit dropping 방식에 따른 overload control 방식을 사용하는 패킷 multiplexer의 성능을 분석하고자 한다. 성능 분석을 위해서는 먼저 multiplexer에 도착하는 중첩된 packet arrival process에서 패킷들의 interarrival time들 간에 존재하는 큰 correlation을 정확히 나타낼 수 있는 수학적인 model이 필요하다. 본 논문에서는 Poisson process나 birth-and-death process에 비해 이들 packet arrival process를 상대적으로 정확히 표현할 수 있는 Makov-modulated Poisson Process(MMPP)를 사용하여 모델링을 하였다.따라서 성능분석은 MMPP/G/1 queueing system에 대한 분석과 비슷하다. 다만 서비스 시간의 분포가 시스템의 상태에 따라 달라지는데 이러한 경우에 대해서는 기존의 논문에서 분석되지 않았다. 성능분석을 통하여 queue에서 서비스를 기다리는 패킷의 수에 대한 분포의 Z-transform을 구하고 이를 이용하여 임의의 시간에서의 queue length와 waiting time의 평균과 표준편차를 구하였다. 이를 통하여 bit dropping 방식에 의한 overload control이 음성의 질을 많이 저하시키지 않으면서도 overload control을 하지 않을 때에 비해 statistical multiplexer에서 훨씬 많은 수의 call을 수용할 수 있도록 하는 효과를 가진다는 사실을 확인 하였다. 또한 패킷이 queue에서 떠난 직후와 임의의 시간에서 구한 queue length와 waiting time의 평균과 표준편차가 매우 비슷하다는 사실을 알 수 있었다. 본 논문에서와 마찬가지로 임의의 시간에서의 분석은 매우 복잡한 경우가 대부분이므로 이러한 사실을 이용하면 매우 간단히 성능분석을 할 수 있을 것이다.

  • PDF

M/G/1 Queueing System wish Vacation and Limited-1 Service Policy

  • Lee, B-L.;W. Ryu;Kim, D-U.;Park, B.U.;J-W. Chung
    • Journal of the Korean Statistical Society
    • /
    • 제30권4호
    • /
    • pp.661-666
    • /
    • 2001
  • In this paper we consider an M/G/1 queue where the server of the system has a vacation time and the service policy is limited-1. In this system, upon termination of a vacation the server returns to the queue and serves at most one message in the queue before taking another vacation. We consider two models. In the first, if the sever finds the queue empty at the end of a cacation, then the sever immediately takes another vacation. In the second model, if no message have arrived during a vacation, the sever waits for the first arrival to serve. The analysis of this system is particularly useful for a priority class polling system. We derive Laplace-Stieltjes transforms of the waiting time for both models, and compare their mean waiting times.

  • PDF

FDDI 음성/데이타 집적 전송에서의 성능 분석에 관한 연구 (A Study on the Performance Evaluation for the Integrated Voice/Data Transmission with FDDI)

  • 홍성식;박호균;이재광;류황빈
    • 한국통신학회논문지
    • /
    • 제17권3호
    • /
    • pp.277-287
    • /
    • 1992
  • 본 논문에서는 음성 트래픽을 동기 모드로, 데이타 트래픽을 비동기 모드로 집적시켜 전송하는 FDDI 통신망에 대하여 수학적 분석과 시뮬레이션을 수행하여 성능을 분석 한다. 음성과 데이타의 평균 패킷 대기 시간을 구하기 위하여, 음성은 Marcov 모델에서 발음 부분과 묵음 부분이 교대로 나타나는 모델로 하며, 데이타는 TRT와 TTRT의 차이 시간동안 전송하는 모델로 하는 경우, 음성과 데이타의 패킷 대기 시간을 구하여 동기모드와 비동기 모드 사이의 전송관계에 대하여 연구하였다. 연구 결과 동기/ 비동기 집적 방식으로 음성과 데이타를 집적하여 전송하여도 음성 채널 용량의 제약없이 데이타를 집적 시킬 수 있었으며, 데이타 전송도 작은 대기 시간내에 신속하게 전송할 수가 있었다.

  • PDF

분산 공유메모리 환경의 다단계 버스망에서 트래픽에 적응하는 동적 라우팅 알고리즘 (A Dynamic Routing Algorithm Adaptive to Traffic for Multistage Bus Networks in Distributed Shared Memory Environment)

  • 홍강운;전창호
    • 정보처리학회논문지A
    • /
    • 제9A권4호
    • /
    • pp.547-554
    • /
    • 2002
  • 본 논문은 분산 공유메모리 환경의 다단계 버스망을 위한 동적 라우팅 방범을 제안한다. 제안된 라우팅 방법의 특징은 다단계 버스망이 제공하는 잉여경로를 활용하고 스위치 트래픽에 따라 적응적으로 경로를 결정하여 스위치의 트래픽을 분산시키는 것이다. 구체적으로는 잉여경로 상의 다음 단계 스위치의 트래픽 정도가 높고 낮음을 판단하여 트래픽 정도가 낮은 스위치로 패킷을 전달한다. 그 결과 평균 응답시간과 스위치상의 평균 대기패킷수를 줄이는 효과를 얻는다. 프로세서수와 스위치 크기를 변화시키면서 시뮬레이션을 하여 제안된 알고리즘이 잉여경로를 고려하지 않는 기존의 알고리즘에 비하여 평균 응답시간은 약 9%, 스위치 상의 평균 대기패킷수는 21.6% 정토 향상시킨다는 것을 보여준다

Analysis of the reasons why patients cancel shoulder surgery despite recommendation

  • Lee, Kyung Jae;Kim, Jangwoo;Kim, Yuna;Yang, Eunkyu;Yun, Kuk-ro;Kim, Sae Hoon
    • Clinics in Shoulder and Elbow
    • /
    • 제25권2호
    • /
    • pp.121-128
    • /
    • 2022
  • Background: To determine the reasons and factors that contribute to the cancellations of shoulder surgeries at a tertiary referral center and to analyze the characteristics of these patients. Methods: Patients scheduled for shoulder surgery from June 2017 to July 2019 were allocated to a surgery group (n=224) or a cancellation group (n=96). These groups were compared with respect to patient characteristics, types of surgery, distance from patient's home to the hospital, traveling time to the hospital, and waiting period before surgery. Reasons for cancellation and responses were acquired using a telephone interview and were subsequently analyzed. Results: The cancellation group was older, had a less frequent history of trauma, and had a lower proportion of patients undergoing arthroscopic rotator cuff repair than the surgery group (p=0.009, p=0.014, and p=0.017, respectively). In addition, mean distance from the patients' homes to the hospital and preoperative waiting time were both longer in the cancellation group (p=0.001 and p<0.01, respectively). The most common reason given for cancellation was another medical condition (28.1%). Conclusions: Older age, need for arthroscopic rotator cuff repair surgery, longer distance from the patient's home to the hospital, and longer waiting period significantly increased the chance of cancellation. The main reason for canceling surgery was a concurrent medical condition. Therefore, identification of other medical conditions in advance is an important consideration when surgeons recommend shoulder surgery to patients. Surgeons should also consider patient's age, type of surgery, distance from the hospital, and waiting time when assessing the possibility of surgery cancellation.

이단계 그룹검사를 갖는 대기행렬모형의 분석 (Analysis of a Queueing Model with a Two-stage Group-testing Policy)

  • 양원석
    • 산업경영시스템학회지
    • /
    • 제45권4호
    • /
    • pp.53-60
    • /
    • 2022
  • 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.