• 제목/요약/키워드: elapsed service time

검색결과 31건 처리시간 0.022초

블루투스 기반 이동 Home Network의 성능 분석 (Performance Analysis of Mobile Home Network Based on Bluetooth)

  • 박홍성;정명순
    • 정보통신설비학회논문지
    • /
    • 제1권1호
    • /
    • pp.51-64
    • /
    • 2002
  • This paper analyzes performance measures of a Bluetooth_based mobile home network system. The home network system consists of terminals with Bluetooth interfaces, access points (AP), a home PC, and a gateway A mobile host in wireless terminals uses Mobile IP for supporting the mobility This paper considers four types of data traffic, which are new connection traffic, handoff traffic, Internet data traffic, and control data traffic and suggests a queueing system model of the home network system, where the AP and the home PC are modeled as M/G/1 with four priority queues and the gateway is modeled as M/G/1 with a single queue The generation rate and service time of individual traffic influence their performance measures. Based ell the suggested model, we propose the elapsed time of data traffic in terms of the number of cells, the number of Home PCs, arrival rates of four types of traffic and the service rates of AP/Home PCs/Gateway To analyze influences on the elapsed time with respect to arrival rate of four types of traffic, some examples are given.

  • PDF

보다 정확한 동적 상황인식 추천을 위해 정확 및 오류 패턴을 활용하여 순차적 매칭 성능이 개선된 상황 예측 방법 (Context Prediction Using Right and Wrong Patterns to Improve Sequential Matching Performance for More Accurate Dynamic Context-Aware Recommendation)

  • 권오병
    • Asia pacific journal of information systems
    • /
    • 제19권3호
    • /
    • pp.51-67
    • /
    • 2009
  • Developing an agile recommender system for nomadic users has been regarded as a promising application in mobile and ubiquitous settings. To increase the quality of personalized recommendation in terms of accuracy and elapsed time, estimating future context of the user in a correct way is highly crucial. Traditionally, time series analysis and Makovian process have been adopted for such forecasting. However, these methods are not adequate in predicting context data, only because most of context data are represented as nominal scale. To resolve these limitations, the alignment-prediction algorithm has been suggested for context prediction, especially for future context from the low-level context. Recently, an ontological approach has been proposed for guided context prediction without context history. However, due to variety of context information, acquiring sufficient context prediction knowledge a priori is not easy in most of service domains. Hence, the purpose of this paper is to propose a novel context prediction methodology, which does not require a priori knowledge, and to increase accuracy and decrease elapsed time for service response. To do so, we have newly developed pattern-based context prediction approach. First of ail, a set of individual rules is derived from each context attribute using context history. Then a pattern consisted of results from reasoning individual rules, is developed for pattern learning. If at least one context property matches, say R, then regard the pattern as right. If the pattern is new, add right pattern, set the value of mismatched properties = 0, freq = 1 and w(R, 1). Otherwise, increase the frequency of the matched right pattern by 1 and then set w(R,freq). After finishing training, if the frequency is greater than a threshold value, then save the right pattern in knowledge base. On the other hand, if at least one context property matches, say W, then regard the pattern as wrong. If the pattern is new, modify the result into wrong answer, add right pattern, and set frequency to 1 and w(W, 1). Or, increase the matched wrong pattern's frequency by 1 and then set w(W, freq). After finishing training, if the frequency value is greater than a threshold level, then save the wrong pattern on the knowledge basis. Then, context prediction is performed with combinatorial rules as follows: first, identify current context. Second, find matched patterns from right patterns. If there is no pattern matched, then find a matching pattern from wrong patterns. If a matching pattern is not found, then choose one context property whose predictability is higher than that of any other properties. To show the feasibility of the methodology proposed in this paper, we collected actual context history from the travelers who had visited the largest amusement park in Korea. As a result, 400 context records were collected in 2009. Then we randomly selected 70% of the records as training data. The rest were selected as testing data. To examine the performance of the methodology, prediction accuracy and elapsed time were chosen as measures. We compared the performance with case-based reasoning and voting methods. Through a simulation test, we conclude that our methodology is clearly better than CBR and voting methods in terms of accuracy and elapsed time. This shows that the methodology is relatively valid and scalable. As a second round of the experiment, we compared a full model to a partial model. A full model indicates that right and wrong patterns are used for reasoning the future context. On the other hand, a partial model means that the reasoning is performed only with right patterns, which is generally adopted in the legacy alignment-prediction method. It turned out that a full model is better than a partial model in terms of the accuracy while partial model is better when considering elapsed time. As a last experiment, we took into our consideration potential privacy problems that might arise among the users. To mediate such concern, we excluded such context properties as date of tour and user profiles such as gender and age. The outcome shows that preserving privacy is endurable. Contributions of this paper are as follows: First, academically, we have improved sequential matching methods to predict accuracy and service time by considering individual rules of each context property and learning from wrong patterns. Second, the proposed method is found to be quite effective for privacy preserving applications, which are frequently required by B2C context-aware services; the privacy preserving system applying the proposed method successfully can also decrease elapsed time. Hence, the method is very practical in establishing privacy preserving context-aware services. Our future research issues taking into account some limitations in this paper can be summarized as follows. First, user acceptance or usability will be tested with actual users in order to prove the value of the prototype system. Second, we will apply the proposed method to more general application domains as this paper focused on tourism in amusement park.

ANALYSIS OF AN MMPP/G/1/K FINITE QUEUE WITH TWO-LEVEL THRESHOLD OVERLOAD CONTROL

  • Lee, Eye-Min;Jeon, Jong-Woo
    • 대한수학회논문집
    • /
    • 제14권4호
    • /
    • pp.805-814
    • /
    • 1999
  • We consider an MMPP/G/1/K finite queue with two-level threshold overload control. This model has frequently arisen in the design of the integrated communication systems which support a wide range applications having various Quality of Service(QoS) requirements. Through the supplementary variable method, se derive the queue length distribution.

  • PDF

시간 경과에 따른 1인 심폐소생술의 질과 피로도의 변화 (The variation of elapsed time on fatigue and quality of single rescuer cardiopulmonary resuscitation)

  • 장문순;탁양주
    • 한국응급구조학회지
    • /
    • 제17권1호
    • /
    • pp.9-19
    • /
    • 2013
  • Purpose : The purpose of this study was to investigate the variation of elapsed time in the cardiopulmonary resuscitation (CPR) quality and the fatigue in continuous CPR by single rescuer. This study will provide basic data about the time for the alternation of the CPR providers. Methods : The volunteer students having healthcare provider certification were recruited from the department of emergency medical service. The students performed 30:2 CPR for 20 minutes, and the data were recorded and analyzed. Metrics were based on the 2010 American Heart Association (AHA) Guidelines, and the CPR continued without any feedback. Results : Among the indicators of CPR, the accuracy and the depth of chest compressions decreased after about 5.3 minutes, and the rate increased approximately after 6.8 minutes. Changes in clinical indicators appeared, and fatigue increased after about 3 minutes. According to the increase in fatigue level, the changes in the CPR indicators and clinical indicators showed up, and these results proved to be statistically significant. However, there were no associations among the time, fatigue, and gender. Conclusion : Even though the times of changes in the indicators appeared differently, the times of changes in fatigue and CPR quality were able to be confirmed.

디젤 주기관의 시운전 결과 및 성능 변화 추이에 관한 연구 (A Study on the Trial Results and Performance Trend of Diesel Main Engine)

  • 조권회;이동훈;손민수
    • 한국마린엔지니어링학회:학술대회논문집
    • /
    • 한국마린엔지니어링학회 2005년도 후기학술대회논문집
    • /
    • pp.73-74
    • /
    • 2005
  • Shipping company and operators have to manage well to keep shipping schedules without problems in main engine. Specially operators have to operate main engine within the limit of operation point, and adjust related parameters to be operated safely and continuously. Also operators have ability to analyze fouling condition of hull through comparing data gotten from P-V curve and performance results of new building ships in trial with service ships. In this study, not only compared main engine performance results in shop trial and sea trial, but also investigated performance trend in accordance with the time elapsed for the service ship's diesel engine. They were confirmed as follows. First, shop trial load is higher than sea trial load but ship's speed is satisfied with owner's contract speed. Second as time goes by, load of service ship increases steadily and other parameters related with main engine shows variable change depend on main engine load increasing.

  • PDF

주의분산, 기다림의 이유, 시간 단서가 기다림 시간 추정에 미치는 영향 (Effects of attentional dispersion, reason for waiting, and cue of time flow on the estimation of waiting time)

  • 이고은;신현정
    • 인지과학
    • /
    • 제23권1호
    • /
    • pp.73-95
    • /
    • 2012
  • 주의분산, 기다려야 하는 이유의 제공 여부, 그리고 시간 단서가 주관적 시간 판단에 미치는 영향을 검증해보기 위한 두 실험을 실시하였다. Maister(1985)[1]가 제안하는 기다림 경험의 특징에 근거하여 실험 1에서는 주의분산과 기다리는 이유의 제공 여부의 효과를 전망적 추정법과 회고적 추정법으로 확인해보았다. 전반적으로 객관적 시간에 비해 주관적 시간을 과대추정하는 것으로 나타났으나, 주의분산 정도와 이유 제공 여부가 모두 유의한 차이를 초래하였다. 즉, 주의분산이 적어 시간에 주의를 많이 기울일수록 그리고 이유를 제공하지 않을 때 주관적 시간을 더 길게 추정하였다. 그러나 두 변인 간의 상호작용은 없었으며, 추정법에 따른 차이도 없었다. 실험 2에서는 기다리는 시간의 단서가 주어졌을 때 변인들의 효과를 검증하였다. 그 결과 실험 1과 마찬가지로 주의분산 정도와 이유 제공 여부가 유의한 차이를 보였고, 시간 추정법 간에도 유의한 차이가 나타났다. 특히 세 변인 간의 삼원 상호작용이 유의하게 나타났다. 종합적으로 두 실험의 결과는 기다려야 하는 이유가 명확할수록, 비시간적 정보에 주의를 많이 분산할수록, 추정하는 주관적 시간이 줄어드는 경향을 나타냈다. 그리고 시간흐름의 단서가 존재할 때 두 요인의 효과가 더 커지며 특히 회고적 추정에서 그러하였다. 마지막으로 기다림이라는 부정적 경험을 감소시킬 수 있는 방안과 추후 연구의 필요성을 논의하였다.

  • PDF

ANALYSIS OF THE DISCRETE-TIME GI/G/1/K USING THE REMAINING TIME APPROACH

  • Liu, Qiaohua;Alfa, Attahiru Sule;Xue, Jungong
    • Journal of applied mathematics & informatics
    • /
    • 제28권1_2호
    • /
    • pp.153-162
    • /
    • 2010
  • The finite buffer GI/G/1/K system is set up by using an unconventional arrangement of the state space, in which the remaining interarrival time or service time is chosen as the level. The stationary distributions of resulting Markov chain can be explicitly determined, and the chain is positive recurrent without any restriction. This is an advantage of this method, compared with that using the elapsed time approach [2].

IEEE 802.15.4 MAC-based Location-ID Exchange Protocol for Realizing Micro-Cell Connectionless Location- Awareness Services

  • Kim, Baek-Gyu;Kang, Soon-Ju
    • Journal of Computing Science and Engineering
    • /
    • 제2권4호
    • /
    • pp.412-427
    • /
    • 2008
  • We propose ID-exchange protocol for Connectionless Location-Awareness Service (CLAS) to locate mobile nodes in indoor sensor network. When adapting location-awareness service to sensor network, the target system must be designed in accordance with various metrics which reflect the system requirement. We especially consider sustainability of the existing service which has been provided for its original purpose, such as environmental monitoring. The detailed meaning of sustainability here is that, even if location-awareness service is newly added to the existing service, the system must be assured to retain a stable network condition, and to deal with newly caused traffic properly. The CLAS ID-exchange protocol is especially designed for fixture and mobile nodes communication to achieve these properties. The protocol operates on 802.15.4 MAC layer to make mobile node work independently of the procedure to build routing table of fixture node, so a stable routing condition can be achieved even if there are many mobile nodes. Moreover, the dedicated frequency channel is assigned only for this protocol, so that traffic caused by location-awareness service can be distributed to another channel. A real system adapting the protocol was implemented to monitor fire and authorities' positions. We verified the overhead and elapsed time for location-awareness. The result shows the proposed protocol has a high performance in detecting speed, traffic distribution, and stability of overall network.

CSD 기반의 컨테이너 안전운송 응용 서비스 개발 (Development of Application Service for Secure Container Transport Based on CSD)

  • 추영열;최수영
    • 한국정보통신학회논문지
    • /
    • 제15권10호
    • /
    • pp.2203-2208
    • /
    • 2011
  • 본 논문에서는 컨테이너의 육상, 해상 수송간 안전운송을 위해 CSD 시스템에 기반한 응용 서비스 개발에 대해 기술한다. CSD 시스템에 기반하여 표준에 따른 응용 서비스 및 보안 서비스의 개발과 개발결과의 테스트 과정에 대해 기술하였다. CSD에 의한 보안기능 외에 운송중의 재난 예방을 위해 온도, 습도 및 충격센서를 이용한 컨테이너 화물 상태감시 기능도 개발되었다. 응용 서비스와 CSD 시스템간에 교환되는 메시지 기밀성을 위해 데스크탑 PC 이상의 시스템 환경과 8 bit CPU 환경에서 각각 RC5, AES-128 알고리즘에 따른 암/복호화 기능을 구현하였다. 암/복호화 시간에 대한 측정 결과, 두 알고리즘 모두 사용 가능함을 확인하였다.

THE ${M_1},{M_/2}/G/l/K$ RETRIAL QUEUEING SYSTEMS WITH PRIORITY

  • Choi, Bong-Dae;Zhu, Dong-Bi
    • 대한수학회지
    • /
    • 제35권3호
    • /
    • pp.691-712
    • /
    • 1998
  • We consider an M$_1$, M$_2$/G/1/ K retrial queueing system with a finite priority queue for type I calls and infinite retrial group for type II calls where blocked type I calls may join the retrial group. These models, for example, can be applied to cellular mobile communication system where handoff calls have higher priority than originating calls. In this paper we apply the supplementary variable method where supplementary variable is the elapsed service time of the call in service. We find the joint generating function of the numbers of calls in the priority queue and the retrial group in closed form and give some performance measures of the system.

  • PDF