• 한국IT서비스학회지
• /
• 제6권3호
• /
• pp.209-224
• /
• 2007

Currently, the world has experienced a mass exodus of workforce from the manufacturing industry to service related industry. In addition, the changes of industry structure toward service industry have been gradually accelerated. We have felt that it is time to conduct researches about IT service systematizing and discovering the essence of service itself with scientific and synthetic ways based on Service Science. For Service Science researchers, service identification is regarded as a difficult activity when they contact it for the first time and they want to apply it real environment. In reality, there exist mismatches between business and IT service to identify service since service is identified from the business point of view in Service Science area and it is identified from the technical point of view in IT service area. In this paper, we have conducted researches about service identification placed on the first priority and regarded as difficult area in service-oriented business area. To lessen aforementioned difficulties, we propose procedures and methods for extracting and identifying service in the viewpoint of business process. We conducted case study and comparison with existing researches to verify the applicability and the excellence of our proposal.

• 제어로봇시스템학회논문지
• /
• 제17권1호
• /
• pp.38-46
• /
• 2011

The OPRoS (Open Platform for Robotic Service) framework provides uniform operating environment for service robots. As an OPRoS-based service robot has to support real-time as well as non-real-time applications, application of Windows NT kernel based operating system can be restrictive. On the other hand, various benefits such as rich library and device support and abundant developer pool can be enjoyed when service robots are built on Windows NT. The paper presents a user-mode component scheduler of OPRoS, which can provide near real-time scheduling service on Windows NT based on the restricted real-time features of Windows NT kernel. The component scheduler thread with the highest real-time priority in Windows NT system acquires CPU control. And then the component scheduler suspends and resumes each periodic component executors based on its priority and precedence dependency so that the component executors are scheduled in the preemptive manner. We show experiment analysis on the performance limitations of the proposed scheduling technique. The analysis and experimental results show that the proposed scheduler guarantees highly reliable timing down to the resolution of 10ms.

• 한국산업보건학회지
• /
• 제17권2호
• /
• pp.120-130
• /
• 2007

A oxygen generating closed-circuit SCBA for escape from fire will be newly developed and then a program for estimating service time for it should be required. A SCBA made on an experimental basis consisted of five components such as half facepiece (mask), $KO_2$ box, oxygen reservoir, $CO_2$ remover and hood. The half mask had a good fitting performance since fit factors for 10 subjects were all above 100. It was found that height of subjects should be the best variable to estimate service time. Measured service time was inversely correlated with height of subjects. Service life time could be estimated by interpolation and extrapolation using inverse relationship between height and measured service time, for example, 28 minutes for male and female of 170 cm during resting, 10 minutes at the walk of 4 km/h and 5 minutes at the walk of 6 km/h considering safety margin of 20%. The study implies that program for estimating service time for the SCBA should require subject's height, speed of walk (4 km/h and 6 km/h) and fit testing. Considering safety margin, selecting younger subjects would be better. The study on the number of subjects and selecting facial dimensions should be more needed for the final program.

• 한국IT서비스학회지
• /
• 제13권3호
• /
• pp.323-331
• /
• 2014

This research is based on real-time service model that uses lock screen of smart devices which is mostly exposed to device users. The potential for lock screen space is immense due to their exposing time for user. The effect can be maximized by offering useful information contents on lock screen. This service model offers real-time keyword with abridged sentence. They match real-time keyword with news by using text matching algorithm and extracts kernel sentence from news to provide short sentence to user. News from the lock screen to match real-time query sentence, and then only to the original core of the ability to move a user evaluation was conducted after adding. The report provided a key statement users feel the lack of original Not if you go to an average of 5.71%. Most algorithms allow only real-time zoom key sentence extracted keywords can accurately determine the reason for that was confirmed.

• 산업공학
• /
• 제22권4호
• /
• pp.359-367
• /
• 2009

The vehicle travel time between the demand points in downtown area is greatly influenced by complex road condition and traffic situation that change real time to various external environments. Most of research in the vehicle routing problems compose vehicle routes only considering travel distance and average vehicle speed between the demand points, however did not consider dynamic external environments such as traffic situation by service time zones. A realistic vehicle routing problem which considers traffic situation of smooth, delaying, and stagnating by three service time zones such as going to work, afternoon, and going home was suggested in this study. A mathematical programming model was suggested and it gives an optimal solution when using ILOG CPLEX. A hybrid genetic algorithm was also suggested to chooses a vehicle route considering traffic situation to minimize the total travel time. By comparing the result considering the traffic situation, the suggested algorithm gives better solution than existing algorithms.

• 한국국방경영분석학회지
• /
• 제12권2호
• /
• pp.68-81
• /
• 1986

This thesis studies the estimation from interarrival and service time data of the mean number of customers in service at time t for an $M/G/{\infty}$ queue. The assumption is that the parametric form of the service time distribution is unknown and the empirical distribution of twe service time is used in the estimate the mean number of customers in service. In the case in which the customer arrival rate is known the distribution of the estimate is derived and an approximate normal confidence interval procedure is suggested. The use of the nonparametric methods, which are the jackknife and the bootstrap, to estimate variability and construct confidence intervals for the estimate is also studied both analytically and by simulation.

• 한국품질경영학회:학술대회논문집
• /
• 한국품질경영학회 2006년도 춘계학술대회
• /
• pp.14-19
• /
• 2006

This study examined the effect of waiting in a service queue on the evaluation of service quality focused on its overall process, mediators and moderators The conceptual model of this paper integrates key variables derived from previous studies of consumer waiting behavior. Data obtained from actual customers in service queue at a hospital was used to test the theoretical framework. First, results from the path analysis confirm that negative affect and acceptability of the wait function as mediators in the process that the perceived duration of the wait affects customer's evaluation of overall service quality. Second, the analysis of the data, with the use of moderate regression shows that disconfirmation of wait time expectations, transaction importance, stability of wait time and wait environment work as moderate variables for the relationship between perceived duration of wait and negative affect. For the relationship between perceived wait time and acceptability of the wait, on the other hand, only transaction import ante shows a significant effect as a moderator.

• 대한산업공학회지
• /
• 제27권1호
• /
• pp.89-94
• /
• 2001

There are many queueing systems where customers wait for service up to a certain amount of time and leave the system if they are not served during that time. This paper considers a finite capacity multi-server queueing system with Poisson input and Erlang service time, where a customer becomes a lost customer when his service has not begun within an exponential patient time after his arrival. Performance measures such as average queue length, the average number of customers in service, and the proportion of lost customers can be obtained exactly through the proposed numerical solution procedure.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.501-515
• /
• 2006

The IEEE 802.11 protocol is the most mature technology for WLANs(Wireless Local Area Networks). However, as the number of stations increases, the delay and throughput performance of IEEE 802.11 MAC(Medium Access Control) degrades severely. In this paper, we present the comprehensive performance analysis of IEEE 802.11 MAC protocol by investigating the MAC layer packet service time when arrival packet sizes have a general probability distribution. We obtain the discrete probability distribution of the MAC layer service time. By using this, we analyze the system throughput and the MAC layer packet service time of IEEE 802.11 MAC protocol in wireless LAN environment. We take some numerical examples for the system throughput and the mean packet service time for several special distributions of arrival packet sizes.

• 산업경영시스템학회지
• /
• 제28권4호
• /
• pp.14-19
• /
• 2005

In general, cell transmission delay is more sensitive for real time video service rather than cell losses in a wireless ATM network. Existing handoff schemes, which are emphasizing the prevention of cell losses, have limitations in cell transmission delay to satisfy QoS. In this paper, we propose a scheme to minimize transmission delay generated during the handoff and to maintain the sequence of cells. Transmission delay can be reduced by transmitting ATM cells with low CLP(i.e., CLP=0) prior to others and by discarding cells with high CLP(i.e., CLP= 1). The simulation results show that the proposed scheme is suitable for delay sensitive real time VBR service as well as fast handoff by giving high CLP to less meaningful MPEG frames.