• Title/Summary/Keyword: elapsed service time

Search Result 31, Processing Time 0.027 seconds

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

  • Park Hong-Seong;Jeong Myoung-Soon
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.1 no.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 (보다 정확한 동적 상황인식 추천을 위해 정확 및 오류 패턴을 활용하여 순차적 매칭 성능이 개선된 상황 예측 방법)

  • Kwon, Oh-Byung
    • Asia pacific journal of information systems
    • /
    • v.19 no.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
    • Communications of the Korean Mathematical Society
    • /
    • v.14 no.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

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

  • Jang, Mun-Sun;Tak, Yang-Ju
    • The Korean Journal of Emergency Medical Services
    • /
    • v.17 no.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 (디젤 주기관의 시운전 결과 및 성능 변화 추이에 관한 연구)

  • Cho, Kwon-Hae;Lee, Dong-Hoon;Son, Min-Su
    • Proceedings of the Korean Society of Marine Engineers Conference
    • /
    • 2005.11a
    • /
    • 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 (주의분산, 기다림의 이유, 시간 단서가 기다림 시간 추정에 미치는 영향)

  • Lee, Go-Eun;Shin, Hyun-Jung
    • Korean Journal of Cognitive Science
    • /
    • v.23 no.1
    • /
    • pp.73-95
    • /
    • 2012
  • Two experiments were conducted to verify how the factors of attentional dispersion, reason for waiting, and cue of time flow affect the perceived waiting time. In experiment 1, based on the characteristics of waiting experience that Maister(1985) suggested, levels of attentional dispersion and whether or not offering a reason for waiting were manipulated. Participants estimated elapsed time(the objective time was 10 minutes) using either prospective or retrospective estimation method. Overall results were that they overestimated the elapsed time regardless of the experimental conditions. However, both main effects of the attentional dispersion and the reason for waiting were statistically significant. That is, when attention was more dispersed and when the reason was given, overestimation of elapsed time was reduced. No difference was found between the two estimation methods, and none of the interaction was significant. Experiment 2 was a replication of Experiment 1 except that a cue of time flow was added by using scroll bar on a computer screen. Because it has been suggested that the cue can help us to manage the waiting time and result in differences between the two time estimation methods. The results showed that main effects of the attentional dispersion and the reason for waiting were significant as those in Experiment 1. In addition, main effect of time estimation method and the three-way interaction were also significant. None of two-way interaction was significant. That is, the perceived waiting time is much shorter in the retrospective method, and the effects of the attentional dispersion and the reason of waiting were dependent upon the estimation methods. Both experiments showed that offering a clear reason for waiting is more important than the attentional dispersion in reducing the perceived waiting time. Some implications of these results for the service industry and the future direction of research were discussed in the final section.

  • 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
    • /
    • v.28 no.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
    • /
    • v.2 no.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.

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

  • Choo, Young-Yeol;Choi, Su-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.10
    • /
    • pp.2203-2208
    • /
    • 2011
  • In this paper, we describe application service development for secure land and marine transport based on CSD (Conveyance Security Device) systems. Based on CSD systems, we present application service and security service according to relevant standards as well as test procedure of developed services. Exploiting temperature, moisture, impact sensors, state monitoring function of container freight was developed to prevent disaster during transportation in addition to security function with CSD. For confidentiality of messages exchanged among application service entity and CSD systems, Encryption and decryption functions going by RC5 and AES-128 algorithms were implemented at desktop PC and 8 bit CPU environments, respectively. Measuring the elapsed time during encryption and decryption shows that two algorithms are allowable for the application service.

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

  • Choi, Bong-Dae;Zhu, Dong-Bi
    • Journal of the Korean Mathematical Society
    • /
    • v.35 no.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