• 제목/요약/키워드: Service Time

검색결과 10,863건 처리시간 0.036초

장기요양시설 노인의 기능상태에 따른 간호서비스 필요도 예측 (Predictors of Nursing Service Need for Nursing Homes Residents)

  • 이태화;조순영;장윤경
    • 대한간호학회지
    • /
    • 제39권1호
    • /
    • pp.95-106
    • /
    • 2009
  • Purpose: The purposes of this study were to explore the functional status of elderly residents and to analyze time use, and finally identify factors to predict nursing care needs in relation to functional status and health related variables. Methods: In this study a descriptive-correlational design was used. Functional status of participants was obtained through interviews, and nursing care time was examined using a 1 min time-motion study with a standardized instrument developed by Korea Long-Term Care Planning Committee (2005). Results: The mean total functional score was 65 (range 28-125) and mean total nursing care time was 144.15 min per day. There were significant positive relationships between total nursing care time, marital status, back pain, dementia, and vision impairment. Multiple regression analyses showed that a liner combination of number of illnesses, types of primary disease, ADL, IADL, cognitive function, nursing demand, and rehabilitation demand explained 42.8% of variance of total nursing time. ADL (${\beta}$=-.533) was the most significant predictor of nursing service need. Conclusion: Identifying factors that result in variations of service need has implications for adequate nursing service, estimation of optimum nurse to patient ratio, quality of care and patient safety.

오프라인 검색기능을 가진 주문형 비디오 서비스 시스템 설계 및 구현 (A Design and Implementation of VOD Service System with Off-line Search Function)

  • 이혜정;박두순
    • 한국멀티미디어학회논문지
    • /
    • 제4권3호
    • /
    • pp.205-214
    • /
    • 2001
  • As the real time multimedia data service has become available due to the rapid progress of computer and Internet technology, the users can enjoy the newly developed service, which is called Video On-Dem-and(VOD). However, most of service providers have not paid their attention much on the software for various service modes on VOD, but they are only concentrating un the hardware to provide with the high resolution video display. Therefore, the service providers are recently to pay more attention on the software to cope with the various demands of users than hardware. So this paper has designed and implemented the VOD service system for those demands. Since the VOD service system suggested by this paper enable off-line search functions through E-mail, the users can possibly get the necessary information from off-line Search without connecting to the server while the current VOD service can prominently help users to save the time and effort to sea고 and select the Video contents by using periodical current awareness service supported by PUSH technology and user oriented information booking and feedback service supported by SDI service.

  • PDF

분산 실시간 서비스를 위한 TMO 객체그룹 모델의 구축 (A Construction of TMO Object Group Model for Distributed Real-Time Services)

  • 신창선;김명희;주수종
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제30권5_6호
    • /
    • pp.307-318
    • /
    • 2003
  • 본 논문에서는 분산 객체 컴퓨팅 환경에서 보장된 실시간 서비스를 지원하는 TMO 객체그룹(TMO Object Group) 모델을 설계ㆍ구축하고, 우리 모델의 정확한 분산 실시간 서비스 수행능력을 검증 한다. 우리가 제안한 TMO 객체그룹은 TINA(Telecommunications Information Networking Architecture) 의 객체그룹 개념을 기반으로, 실시간 특성을 가지는 TMO(Time-triggered Message-triggered Object) 객체들과 객체그룹 내의 객체 관리 서비스(Object Management Service), 실시간 스케줄링 서비스(Real-Time Scheduling Service)를 지원하는 컴포넌트들로 구성된다. 또한, TMO 객체는 분산 시스템에 비중복 또는 중복으로 존재할 수 있다. 본 모델은 특정 ORB나 운영체제들의 제약 없이 COTS(Commercial Off-The-Shelf) 미들웨어 상에서 보장된 분산 실시간 서비스를 수행한다. TMO 객체그룹을 구축하기 위해 TMO 객체의 개념과 TMO 객체그룹의 구조를 정의하였고, 객체그룹 내의 컴포넌트들의 기능과 그들간의 상호작용을 설계 구현하였다. TMO 객체그룹은 객체 관리 서비스와 실시간 스케줄링 서비스 지원을 위해 동적바인더객체(Dynamic Binder Object)와 스케줄러객체(Scheduler Object)를 각각 가진다. 동적바인더객체는 클라이언트들의 요청에 대해 중복 TMO 객체 중 적정 객체를 선정하는 동적 바인딩 서비스를 지원하고, 스케쥴러객체는 클라이언트들의 서비스 요청에 대해 TMO 객체가 수행해야 할 작업들의 우선순위를 정하는 실시간 스케줄링 서비스를 지원한다. TMO 객체그룹의 수행 검증을 위해 이미 연구된 알고리즘을 확장한 동적 바인딩 서비스를 위한 바인딩 우선순위(Binding Priority) 알고리즘과 실시간 스케줄링 서비스를 위한 EDF(Earliest Deadline First) 알고리즘을 적용하여 동적바인더객체와 스케쥴러객체를 구현했다. 마지막으로 수치 분석을 통해 TMO 객체그룹이 비중복/중복 TMO 객체의 동적 바인딩 서비스와 클라이언트들의 요청을 받는 임의의 TMO 객체에서 실시간 스케줄링 서비스를 지원하는지 검증했다.

스마트폰 사용이 고객의 대기경험 및 서비스 품질 평가에 미치는 영향에 대한 연구 (A Study on the Effects of Customers' Smartphone Use on their Waiting Experience and Service Quality Evaluation)

  • 정준형;이종오;이선로
    • Journal of Information Technology Applications and Management
    • /
    • 제21권4호
    • /
    • pp.15-33
    • /
    • 2014
  • Recently, the service providers are making various attempts to provide smartphone applications for waiting information in order for customers to perceive waiting time short. This research, therefore, investigates the impact of smartphone use on the waiting experience and provide service organizations with effective measures for managing customers' waiting. As a result of this study, utilization of smartphone during the waiting period shows the positive impact on perceived waiting time, acceptability, and emotional response. Among these, the largest impact appears on the acceptability of waiting that has the largest impact on the perceived service quality. In addition, results reveal that smartphone users shows more positive waiting experience than non-users who read newspapers or magazines, watch TV, or do nothing.

System Size and Service Size Distributions of a Batch Service Queue

  • Lee, Soon-Seok;Lee, Ho-Woo;Yoon, Seung-Hyun;Nadrajan, R.
    • 한국경영과학회지
    • /
    • 제18권3호
    • /
    • pp.179-186
    • /
    • 1993
  • We derive the arbitrary time point system size distribution of M/ $G^{B}$1 queue in which late arrivals are not allowed to join the on-going service. The distribution is given by P(z) = $P_{4}$(z) $S^{*}$ (.lambda.-.lambda.z) where $P_{4}$ (z) is the probability generating function of the queue size and $S^{*}$(.theta.) is the Laplace-Stieltjes transform of the service time distribution function. We also derive the distribution of the service siez at arbitrary point of time. time.

  • PDF

휴대 인터넷 시스템에서의 패킷 스케줄링 알고리즘 연구 (A Packet Scheduling Algorithm for High-speed Portable Internet System)

  • 최성훈
    • 산업경영시스템학회지
    • /
    • 제30권1호
    • /
    • pp.59-65
    • /
    • 2007
  • HPI (High-speed Portable Internet) system which provides high speed internet services is going to be commercialized soon. Since HPI provides simultaneously four different service types such as UGS (Unsolicited Grant Service), rtPS (real time Polling Service), nrtPS(non-real time Polling Service), and BE (Best Effort) under different QoS (Quality of Service) requirements and limited wireless channel resources, efficient packet scheduling mechanisms are necessary to increase the utilization of channels as well as to satisfy the various QoS requirements. This study regards the traffic data to be served as time series and proposes a new packet scheduling algorithm based on the nonparametric statistical test. The performance of the newly proposed algorithm is evaluated through the simulation analysis using a simulator that can evaluate the performance of packet scheduling mechanisms under various values of system parameters and measures such as packet delay time, data transmission rate, number of loss packets, and channel utilization.

Analyzing the Difference between the Stated Preference and the Revealed Preference before/after the High-speed Rail Service in Korea

  • Lee, Jang-Ho
    • International Journal of Railway
    • /
    • 제7권1호
    • /
    • pp.24-33
    • /
    • 2014
  • The Korean high-speed rail (HSR) began its commercial service in 2004. This service has been created significant changes in the system of intercity passenger travels of Korea. However, the actual ridership was approximately half of the estimated one in the planning stage. In this background, this paper presents the difference between the stated preference (SP) before the HSR service and the revealed preference (RP) after it using the intercity travel mode choice models. Several meaningful differences are found in terms of the factors affecting the travel mode choice, the estimation results of model, the monetary values of time, and elasticities. While the access/egress travel time of high-speed rail is less important than in-vehicle travel time in the SP sample, they have same weight in the RP sample. Also the RP models show that the probability of choosing HSR can be decreased by the increase of the number of vehicles in household contrary to the results from the SP models. The monetary values of travel time are relatively high and the direct and cross elasticities in response to changes in level-of-service of HSR are relatively low in the RP sample. This Korean case is expected to offer referable material for preparing high-speed rail services in other countries by showing the difference between the SP and RP before/after the actual service, identifying the importance of access/egress travel time and lower direct elasticities of HSR demand.

Establishment of Service Life of Educational Facilities - Focused on the rooftop waterproofing and floor finishing -

  • Lee, KangHee;Chae, ChangU
    • KIEAE Journal
    • /
    • 제14권5호
    • /
    • pp.5-12
    • /
    • 2014
  • Building has been deteriorated gradually owing to geographic, physical complex and other factors. School living condition has a key role to improve the learning ability, life attitude and qualifications to adopt to social life. Therefore, it is important for school environment to keep the living condition. Repair time and scope of school facilities are required to maintain the function and performance to plan the long term repair. But there are little information about the school maintenance such as repair time and function. In this paper, it aimed at providing the service life to suggest the repair time and scope in the roof-proofing and floor finishing which used the three estimation method in probabilistic approach. The service life has a key role to decide the repair time and to make the plan for the repair maintenance. Results of this study are as follows ; First, the 1st repair time were taken through three methods in probabilistic and deterministic functions to eliminate the estimation bias. Second, the service life is suggested 36 years of an elementary school, 34 years of a middle school and 41 years of a high school. Third, the service life of a floor finishing is 43 years of an elementary, 39 years of a middle school and 41 years of a high school. The above study could not include the detailed information about the materials and repair works. Therefore it needs a further study to reflect the detailed information and to make a repair strategy.

ON APPROXIMATIONS FOR GI/G/c RETRIAL QUEUES

  • Shin, Yang Woo;Moon, Dug Hee
    • Journal of applied mathematics & informatics
    • /
    • 제31권1_2호
    • /
    • pp.311-325
    • /
    • 2013
  • The effects of the moments of the interarrival time and service time on the system performance measures such as blocking probability, mean and standard deviation of the number of customers in service facility and orbit are numerically investigated. The results reveal the performance measures are more sensitive with respect to the interarrival time than the service time. Approximation for $GI/G/c$ retrial queues using $PH/PH/c$ retrial queue is presented.

무선토큰링 프로토콜을 사용한 무선 네트워크에서 QoS를 지원하는 분산 제어 알고리즘 (Distributed Control Algorithms for QoS in Wireless Networks Using Wireless Token Ring Protocol)

  • 김성철
    • 한국멀티미디어학회논문지
    • /
    • 제7권2호
    • /
    • pp.187-193
    • /
    • 2004
  • 오늘날 무선 네트워크는 통신에서 매우 중요한 역할을 하고 있다. 예를 들어, 오늘날의 무선 네트워크는 이메일, FTP와 같은 기본 서비스로부터 웹 서비스 같은 멀티미디어 응용 서비스를 제공하고 있다. 무선 네트워크에서의 이와 같은 다양한 응용들의 서비스 질에 대한 요구는 유선 네트워크에서와 마찬가지로 무선 네트워크에서도 계속 이어질 것이 확실하다. 최근에 인터넷에서 서비스의 차별화를 지원하려는 많은 연구가 이루어지고 있다. 그러나 무선 환경에서는 제한된 대역폭과 채널 상태의 변화로 인하여 이러한 차별화서비스 지원이 더욱 어렵다. 본 논문에서는 실시간 트래픽 서비스와 비실시간 트래픽 서비스가 공존하는 인터넷 환경에서 실시간 트래픽 서비스의 질을 지원하는 수정된 무선 토큰링 프로토콜을 제안하고 있다. 제안된 알고리즘에서는 실시간 트래픽 서비스 노드가 비실시간 트래픽 서비스 노드보다 토큰 수신에 있어서 우선권을 가진다. 따라서 제안된 알고리즘은 실시간 트래픽 서비스 노드의 빠른 전송을 지원하며, 또한 기존의 토큰 전송 방식에 약간의 수정만을 통하여 QoS를 지원하는 장점을 가진다. 또한 본 논문에서는 손실된 토큰 회복 메커니즘에 대한 고찰이 이루어진다.

  • PDF